R
↳Dependency Pair Analysis
F(a, f(x, a)) -> F(a, f(f(a, x), f(a, a)))
F(a, f(x, a)) -> F(f(a, x), f(a, a))
F(a, f(x, a)) -> F(a, x)
F(a, f(x, a)) -> F(a, a)
R
↳DPs
→DP Problem 1
↳Narrowing Transformation
F(a, f(x, a)) -> F(a, x)
F(a, f(x, a)) -> F(f(a, x), f(a, a))
F(a, f(x, a)) -> F(a, f(f(a, x), f(a, a)))
f(a, f(x, a)) -> f(a, f(f(a, x), f(a, a)))
innermost
one new Dependency Pair is created:
F(a, f(x, a)) -> F(a, f(f(a, x), f(a, a)))
F(a, f(f(x'', a), a)) -> F(a, f(f(a, f(f(a, x''), f(a, a))), f(a, a)))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Narrowing Transformation
F(a, f(f(x'', a), a)) -> F(a, f(f(a, f(f(a, x''), f(a, a))), f(a, a)))
F(a, f(x, a)) -> F(f(a, x), f(a, a))
F(a, f(x, a)) -> F(a, x)
f(a, f(x, a)) -> f(a, f(f(a, x), f(a, a)))
innermost
one new Dependency Pair is created:
F(a, f(x, a)) -> F(f(a, x), f(a, a))
F(a, f(f(x'', a), a)) -> F(f(a, f(f(a, x''), f(a, a))), f(a, a))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Nar
...
→DP Problem 3
↳Remaining Obligation(s)
F(a, f(f(x'', a), a)) -> F(f(a, f(f(a, x''), f(a, a))), f(a, a))
F(a, f(x, a)) -> F(a, x)
F(a, f(f(x'', a), a)) -> F(a, f(f(a, f(f(a, x''), f(a, a))), f(a, a)))
f(a, f(x, a)) -> f(a, f(f(a, x), f(a, a)))
innermost