R
↳Dependency Pair Analysis
F(c(s(x), y)) -> F(c(x, s(y)))
G(c(x, s(y))) -> G(c(s(x), y))
R
↳DPs
→DP Problem 1
↳Instantiation Transformation
→DP Problem 2
↳Inst
F(c(s(x), y)) -> F(c(x, s(y)))
f(c(s(x), y)) -> f(c(x, s(y)))
g(c(x, s(y))) -> g(c(s(x), y))
innermost
one new Dependency Pair is created:
F(c(s(x), y)) -> F(c(x, s(y)))
F(c(s(x''), s(y''))) -> F(c(x'', s(s(y''))))
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 3
↳Instantiation Transformation
→DP Problem 2
↳Inst
F(c(s(x''), s(y''))) -> F(c(x'', s(s(y''))))
f(c(s(x), y)) -> f(c(x, s(y)))
g(c(x, s(y))) -> g(c(s(x), y))
innermost
one new Dependency Pair is created:
F(c(s(x''), s(y''))) -> F(c(x'', s(s(y''))))
F(c(s(x''''), s(s(y'''')))) -> F(c(x'''', s(s(s(y'''')))))
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 3
↳Inst
...
→DP Problem 4
↳Argument Filtering and Ordering
→DP Problem 2
↳Inst
F(c(s(x''''), s(s(y'''')))) -> F(c(x'''', s(s(s(y'''')))))
f(c(s(x), y)) -> f(c(x, s(y)))
g(c(x, s(y))) -> g(c(s(x), y))
innermost
F(c(s(x''''), s(s(y'''')))) -> F(c(x'''', s(s(s(y'''')))))
POL(s(x1)) = 1 + x1 POL(F(x1)) = x1
F(x1) -> F(x1)
c(x1, x2) -> x1
s(x1) -> s(x1)
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 3
↳Inst
...
→DP Problem 5
↳Dependency Graph
→DP Problem 2
↳Inst
f(c(s(x), y)) -> f(c(x, s(y)))
g(c(x, s(y))) -> g(c(s(x), y))
innermost
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 2
↳Instantiation Transformation
G(c(x, s(y))) -> G(c(s(x), y))
f(c(s(x), y)) -> f(c(x, s(y)))
g(c(x, s(y))) -> g(c(s(x), y))
innermost
one new Dependency Pair is created:
G(c(x, s(y))) -> G(c(s(x), y))
G(c(s(x''), s(y''))) -> G(c(s(s(x'')), y''))
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 2
↳Inst
→DP Problem 6
↳Instantiation Transformation
G(c(s(x''), s(y''))) -> G(c(s(s(x'')), y''))
f(c(s(x), y)) -> f(c(x, s(y)))
g(c(x, s(y))) -> g(c(s(x), y))
innermost
one new Dependency Pair is created:
G(c(s(x''), s(y''))) -> G(c(s(s(x'')), y''))
G(c(s(s(x'''')), s(y''''))) -> G(c(s(s(s(x''''))), y''''))
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 2
↳Inst
→DP Problem 6
↳Inst
...
→DP Problem 7
↳Argument Filtering and Ordering
G(c(s(s(x'''')), s(y''''))) -> G(c(s(s(s(x''''))), y''''))
f(c(s(x), y)) -> f(c(x, s(y)))
g(c(x, s(y))) -> g(c(s(x), y))
innermost
G(c(s(s(x'''')), s(y''''))) -> G(c(s(s(s(x''''))), y''''))
POL(G(x1)) = x1 POL(s(x1)) = 1 + x1
G(x1) -> G(x1)
c(x1, x2) -> x2
s(x1) -> s(x1)
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 2
↳Inst
→DP Problem 6
↳Inst
...
→DP Problem 8
↳Dependency Graph
f(c(s(x), y)) -> f(c(x, s(y)))
g(c(x, s(y))) -> g(c(s(x), y))
innermost