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