YES
by ttt2 (version ttt2 1.15)
The rewrite relation of the following TRS is considered.
a(a(x0)) | → | x0 |
b(b(x0)) | → | c(c(c(x0))) |
b(c(x0)) | → | a(b(b(x0))) |
b#(c(x0)) | → | b#(x0) |
b#(c(x0)) | → | b#(b(x0)) |
b#(c(x0)) | → | a#(b(b(x0))) |
The dependency pairs are split into 1 component.
b#(c(x0)) | → | b#(b(x0)) |
b#(c(x0)) | → | b#(x0) |
[b#(x1)] | = |
|
||||||||||||||||||
[b(x1)] | = |
|
||||||||||||||||||
[a(x1)] | = |
|
||||||||||||||||||
[c(x1)] | = |
|
a(a(x0)) | → | x0 |
b(b(x0)) | → | c(c(c(x0))) |
b(c(x0)) | → | a(b(b(x0))) |
b#(c(x0)) | → | b#(x0) |
The dependency pairs are split into 0 components.