The rewrite relation of the following TRS is considered.
a(x1) | → | x1 | (1) |
a(a(x1)) | → | a(b(c(b(a(x1))))) | (2) |
b(c(x1)) | → | c(a(x1)) | (3) |
a#(a(x1)) | → | b#(a(x1)) | (4) |
a#(a(x1)) | → | b#(c(b(a(x1)))) | (5) |
a#(a(x1)) | → | a#(b(c(b(a(x1))))) | (6) |
b#(c(x1)) | → | a#(x1) | (7) |
The dependency pairs are split into 1 component.
b#(c(x1)) | → | a#(x1) | (7) |
a#(a(x1)) | → | b#(c(b(a(x1)))) | (5) |
a#(a(x1)) | → | b#(a(x1)) | (4) |
[b#(x1)] | = |
|
||||||||||||||||||||||||
[b(x1)] | = |
|
||||||||||||||||||||||||
[a#(x1)] | = |
|
||||||||||||||||||||||||
[a(x1)] | = |
|
||||||||||||||||||||||||
[c(x1)] | = |
|
a(x1) | → | x1 | (1) |
a(a(x1)) | → | a(b(c(b(a(x1))))) | (2) |
b(c(x1)) | → | c(a(x1)) | (3) |
a#(a(x1)) | → | b#(c(b(a(x1)))) | (5) |
Using size-change termination in combination with the subterm criterion one obtains the following initial size-change graphs.
b#(c(x1)) | → | a#(x1) | (7) |
1 | > | 1 | |
a#(a(x1)) | → | b#(a(x1)) | (4) |
1 | ≥ | 1 |
As there is no critical graph in the transitive closure, there are no infinite chains.