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