The rewrite relation of the following TRS is considered.
a__f(f(a)) | → | a__f(g(f(a))) | (1) |
mark(f(X)) | → | a__f(mark(X)) | (2) |
mark(a) | → | a | (3) |
mark(g(X)) | → | g(X) | (4) |
a__f(X) | → | f(X) | (5) |
final states:
{6, 7}
transitions:
a__f0(7) | → | 6 |
mark0(7) | → | 6 |
f1(7) | → | 6 |
a1 | → | 6 |
g1(7) | → | 6 |
a__f1(8) | → | 6 |
f2(8) | → | 6 |
a__f1(11) | → | 6 |
f2(11) | → | 6 |
a__f2(12) | → | 6 |
f3(12) | → | 6 |
f0(7) | → | 7 |
a0 | → | 7 |
g0(7) | → | 7 |
g1(9) | → | 8 |
f1(10) | → | 9 |
a1 | → | 10 |
mark1(7) | → | 11 |
a1 | → | 11 |
g1(7) | → | 11 |
a__f1(11) | → | 11 |
f2(11) | → | 11 |
a__f2(12) | → | 11 |
f3(12) | → | 11 |
g2(13) | → | 12 |
f2(14) | → | 13 |
a2 | → | 14 |