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

Innermost Termination of R to be shown.



   TRS
RFC Match Bounds



Termination could be shown with a Match Bound of 2.
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

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