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