The rewrite relation of the following TRS is considered.
f(f(a)) | → | c(n__f(g(f(a)))) | (1) |
f(X) | → | n__f(X) | (2) |
activate(n__f(X)) | → | f(X) | (3) |
activate(X) | → | X | (4) |
final states:
{0, 1, 2, 3, 4, 5}
transitions:
f0(0) | → | 0 |
f0(1) | → | 0 |
f0(2) | → | 0 |
f0(3) | → | 0 |
f0(4) | → | 0 |
f0(5) | → | 0 |
a0 | → | 1 |
c0(0) | → | 2 |
c0(1) | → | 2 |
c0(2) | → | 2 |
c0(3) | → | 2 |
c0(4) | → | 2 |
c0(5) | → | 2 |
n__f0(0) | → | 3 |
n__f0(1) | → | 3 |
n__f0(2) | → | 3 |
n__f0(3) | → | 3 |
n__f0(4) | → | 3 |
n__f0(5) | → | 3 |
g0(0) | → | 4 |
g0(1) | → | 4 |
g0(2) | → | 4 |
g0(3) | → | 4 |
g0(4) | → | 4 |
g0(5) | → | 4 |
activate0(0) | → | 5 |
activate0(1) | → | 5 |
activate0(2) | → | 5 |
activate0(3) | → | 5 |
activate0(4) | → | 5 |
activate0(5) | → | 5 |
a1 | → | 9 |
f1(9) | → | 8 |
g1(8) | → | 7 |
n__f1(7) | → | 6 |
c1(6) | → | 0 |
n__f1(0) | → | 0 |
n__f1(1) | → | 0 |
n__f1(2) | → | 0 |
n__f1(3) | → | 0 |
n__f1(4) | → | 0 |
n__f1(5) | → | 0 |
f1(0) | → | 5 |
f1(1) | → | 5 |
f1(2) | → | 5 |
f1(3) | → | 5 |
f1(4) | → | 5 |
f1(5) | → | 5 |
n__f2(0) | → | 0 |
n__f2(1) | → | 0 |
n__f2(2) | → | 0 |
n__f2(3) | → | 0 |
n__f2(4) | → | 0 |
n__f2(5) | → | 0 |
n__f2(9) | → | 8 |
0 | → | 5 |
1 | → | 5 |
2 | → | 5 |
3 | → | 5 |
4 | → | 5 |