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