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.
TRS
↳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:
2, 3, 4, 5, 6
Node 2 is start node and node 3 is final node.
Those nodes are connect through the following edges:
- 3 to 3 labelled #(0)
- 2 to 4 labelled f(0)
- 4 to 5 labelled p(0)
- 5 to 6 labelled s(0)
- 6 to 3 labelled 0(0)
- 2 to 3 labelled 0(0)
- 2 to 6 labelled cons(0)
- 4 to 3 labelled 0(1)
- 2 to 4 labelled cons(1)
Termination of R successfully shown.
Duration:
0:00 minutes