The rewrite relation of the following TRS is considered.
a__f(X) | → | g(h(f(X))) | (1) |
mark(f(X)) | → | a__f(mark(X)) | (2) |
mark(g(X)) | → | g(X) | (3) |
mark(h(X)) | → | h(mark(X)) | (4) |
a__f(X) | → | f(X) | (5) |
final states:
{1, 2}
transitions:
a__f0(2) | → | 1 |
mark0(2) | → | 1 |
f1(2) | → | 1 |
g1(2) | → | 1 |
g1(8) | → | 1 |
a__f1(10) | → | 1 |
f2(10) | → | 1 |
h1(11) | → | 1 |
g2(12) | → | 1 |
g0(2) | → | 2 |
h0(2) | → | 2 |
f0(2) | → | 2 |
h1(9) | → | 8 |
f1(2) | → | 9 |
mark1(2) | → | 10 |
g1(2) | → | 10 |
a__f1(10) | → | 10 |
f2(10) | → | 10 |
h1(11) | → | 10 |
g2(12) | → | 10 |
mark1(2) | → | 11 |
g1(2) | → | 11 |
a__f1(10) | → | 11 |
f2(10) | → | 11 |
h1(11) | → | 11 |
g2(12) | → | 11 |
h2(13) | → | 12 |
f2(10) | → | 13 |