The rewrite relation of the following TRS is considered.
f(0) | → | cons(0) | (1) |
f(s(0)) | → | f(p(s(0))) | (2) |
p(s(0)) | → | 0 | (3) |
final states:
{1, 2}
transitions:
f0(2) | → | 1 |
p0(2) | → | 1 |
01 | → | 1 |
cons1(3) | → | 1 |
f1(4) | → | 1 |
cons2(7) | → | 1 |
00 | → | 2 |
cons0(2) | → | 2 |
s0(2) | → | 2 |
01 | → | 3 |
p1(5) | → | 4 |
02 | → | 4 |
s1(6) | → | 5 |
01 | → | 6 |
02 | → | 7 |