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