Term Rewriting System R:
[X]
f(g(X)) -> g(f(f(X)))
f(h(X)) -> h(g(X))

Innermost Termination of R to be shown.



   TRS
Reversing




Rule(s) before reversing:

f(g(X)) -> g(f(f(X)))
f(h(X)) -> h(g(X))


Rule(s) after reversing:

g'(f'(x)) -> f'(f'(g'(x)))
h'(f'(x)) -> g'(h'(x))



   TRS
Rev
       →TRS2
RFC Match Bounds



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

The certificate consists of the following enumerated nodes:

129, 130, 131, 132, 133, 134, 135, 136

Node 129 is start node and node 130 is final node.

Those nodes are connect through the following edges:



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