Term Rewriting System R:
[x]
p(f(f(x))) -> q(f(g(x)))
p(g(g(x))) -> q(g(f(x)))
q(f(f(x))) -> p(f(g(x)))
q(g(g(x))) -> p(g(f(x)))

Innermost Termination of R to be shown.



   TRS
RFC Match Bounds



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

The certificate consists of the following enumerated nodes:

1, 2, 3, 4, 5, 6

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