R
↳Dependency Pair Analysis
F(a, f(a, x)) -> F(x, f(a, f(f(a, a), a)))
F(a, f(a, x)) -> F(a, f(f(a, a), a))
F(a, f(a, x)) -> F(f(a, a), a)
F(a, f(a, x)) -> F(a, a)
R
↳DPs
→DP Problem 1
↳Narrowing Transformation
F(a, f(a, x)) -> F(a, f(f(a, a), a))
F(a, f(a, x)) -> F(x, f(a, f(f(a, a), a)))
f(a, f(a, x)) -> f(x, f(a, f(f(a, a), a)))
innermost
no new Dependency Pairs are created.
F(a, f(a, x)) -> F(a, f(f(a, a), a))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳Forward Instantiation Transformation
F(a, f(a, x)) -> F(x, f(a, f(f(a, a), a)))
f(a, f(a, x)) -> f(x, f(a, f(f(a, a), a)))
innermost
one new Dependency Pair is created:
F(a, f(a, x)) -> F(x, f(a, f(f(a, a), a)))
F(a, f(a, a)) -> F(a, f(a, f(f(a, a), a)))
R
↳DPs
→DP Problem 1
↳Nar
→DP Problem 2
↳FwdInst
...
→DP Problem 3
↳Narrowing Transformation
F(a, f(a, a)) -> F(a, f(a, f(f(a, a), a)))
f(a, f(a, x)) -> f(x, f(a, f(f(a, a), a)))
innermost
no new Dependency Pairs are created.
F(a, f(a, a)) -> F(a, f(a, f(f(a, a), a)))