Term Rewriting System R:

   []
   f(0) -> cons(0)
   f(s(0)) -> f(p(s(0)))
   p(s(0)) -> 0

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, 5, 6

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 3 labelled cons(0)
* 3 to 2 labelled 0(0)
* 1 to 4 labelled f(0)
* 4 to 5 labelled p(0)
* 5 to 6 labelled s(0)
* 6 to 2 labelled 0(0)
* 1 to 2 labelled 0(0)
* 4 to 2 labelled 0(1)
* 1 to 4 labelled cons(1)




Termination of R successfully shown.


Duration: 0.315 seconds.