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