Term Rewriting System R:
[x]
s1(s1(s0(s0(x)))) -> s0(s0(s0(s1(s1(s1(x))))))

Innermost Termination of R to be shown.



   TRS
RFC Match Bounds



Termination could be shown with a Match Bound of 4.
The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48

Node 1 is start node and node 2 is final node.

Those nodes are connect through the following edges:



Innermost Termination of R successfully shown.
Duration:
0:00 minutes