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
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
C(b(a(X))) -> A(a(b(b(c(c(X))))))
C(b(a(X))) -> A(b(b(c(c(X)))))
C(b(a(X))) -> B(b(c(c(X))))
C(b(a(X))) -> B(c(c(X)))
C(b(a(X))) -> C(c(X))
C(b(a(X))) -> C(X)
R contains no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes