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