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