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