Term Rewriting System R:
[X]
f(f(X)) -> f(a(b(f(X))))
f(a(g(X))) -> b(X)
b(X) -> a(X)
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(f(X)) -> F(a(b(f(X))))
F(f(X)) -> B(f(X))
F(a(g(X))) -> B(X)
R contains no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes