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