Term Rewriting System R:
[X]
c(b(a(X))) -> a(a(b(b(c(c(X))))))
c(X) -> e
a(X) -> e
b(X) -> e
Innermost Termination of R to be shown.
R
↳Removing Redundant Rules for Innermost Termination
Removing the following rules from R which left hand sides contain non normal subterms
c(b(a(X))) -> a(a(b(b(c(c(X))))))
R
↳RRRI
→TRS2
↳RFC Match Bounds
Termination could be shown with a Match Bound of 0.
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
1, 2
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 e(0)
Innermost Termination of R successfully shown.
Duration:
0:00 minutes