Term Rewriting System R:
[x]
f(f(x)) -> f(x)
f(s(x)) -> f(x)
g(s(0)) -> g(f(s(0)))
Innermost 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:
1, 2, 3, 4, 5
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 5 labelled s(0)
- 5 to 2 labelled 0(0)
- 1 to 2 labelled f(1)
- 3 to 5 labelled f(1)
Innermost Termination of R successfully shown.
Duration:
0:00 minutes