R
↳Dependency Pair Analysis
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)
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
E(g(X)) -> E(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)
E(g(X)) -> E(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)
{a, b}
E(x1) -> E(x1)
g(x1) -> g(x1)
f(x1) -> f(x1)
c(x1) -> x1
d(x1) -> x1
e(x1) -> e(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Dependency Graph
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)