The rewrite relation of the following TRS is considered.
f(0) | → | cons(0,n__f(s(0))) | (1) |
f(s(0)) | → | f(p(s(0))) | (2) |
p(s(X)) | → | X | (3) |
f(X) | → | n__f(X) | (4) |
activate(n__f(X)) | → | f(X) | (5) |
activate(X) | → | X | (6) |
final states:
{0, 1, 2, 3}
transitions:
00 | → | 0 |
cons0(0,0) | → | 0 |
n__f0(0) | → | 0 |
s0(0) | → | 0 |
f0(0) | → | 1 |
p0(0) | → | 2 |
activate0(0) | → | 3 |
01 | → | 4 |
01 | → | 7 |
s1(7) | → | 6 |
n__f1(6) | → | 5 |
cons1(4,5) | → | 1 |
s1(7) | → | 9 |
p1(9) | → | 8 |
f1(8) | → | 1 |
n__f1(0) | → | 1 |
f1(0) | → | 3 |
cons1(4,5) | → | 3 |
f1(8) | → | 3 |
n__f2(8) | → | 1 |
n__f2(0) | → | 3 |
02 | → | 10 |
02 | → | 13 |
s2(13) | → | 12 |
n__f2(12) | → | 11 |
cons2(10,11) | → | 1 |
cons2(10,11) | → | 3 |
n__f2(8) | → | 3 |
0 | → | 2 |
0 | → | 3 |
7 | → | 8 |