Term Rewriting System R:
[X]
f(f(X)) -> f(g(f(g(f(X)))))
f(g(f(X))) -> f(g(X))
Termination of R to be shown.
R
↳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))
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
F(g(f(X))) -> F(g(X))
Rules:
f(f(X)) -> f(g(f(g(f(X)))))
f(g(f(X))) -> f(g(X))
Termination of R could not be shown.
Duration:
0:00 minutes