Term Rewriting System R:

   [x]
   f(f(x)) -> f(x)
   g(0) -> g(f(0))

Innermost Termination of R to be shown.


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:
1, 2, 3, 4

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

Those nodes are connect through the following edges:

* 2 to 2 labelled #(0)
* 1 to 2 labelled f(0)
* 1 to 3 labelled g(0)
* 3 to 4 labelled f(0)
* 4 to 2 labelled 0(0)
* 1 to 2 labelled f(1)




Innermost Termination of R successfully shown.


Duration: 0.313 seconds.