Term Rewriting System R:
[x, y]
f(x, a(b(y))) -> f(c(d(x)), y)
f(c(x), y) -> f(x, a(y))
f(d(x), y) -> f(x, b(y))

Innermost Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

F(x, a(b(y))) -> F(c(d(x)), y)
F(c(x), y) -> F(x, a(y))
F(d(x), y) -> F(x, b(y))

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Instantiation Transformation`

Dependency Pairs:

F(d(x), y) -> F(x, b(y))
F(c(x), y) -> F(x, a(y))
F(x, a(b(y))) -> F(c(d(x)), y)

Rules:

f(x, a(b(y))) -> f(c(d(x)), y)
f(c(x), y) -> f(x, a(y))
f(d(x), y) -> f(x, b(y))

Strategy:

innermost

On this DP problem, an Instantiation SCC transformation can be performed.
As a result of transforming the rule

F(c(x), y) -> F(x, a(y))
three new Dependency Pairs are created:

F(c(x''), a(y'')) -> F(x'', a(a(y'')))
F(c(d(x'')), y'') -> F(d(x''), a(y''))
F(c(x''), b(y'')) -> F(x'', a(b(y'')))

The transformation is resulting in one new DP problem:

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Inst`
`           →DP Problem 2`
`             ↳Instantiation Transformation`

Dependency Pairs:

F(c(x''), b(y'')) -> F(x'', a(b(y'')))
F(c(x''), a(y'')) -> F(x'', a(a(y'')))
F(x, a(b(y))) -> F(c(d(x)), y)
F(c(d(x'')), y'') -> F(d(x''), a(y''))
F(d(x), y) -> F(x, b(y))

Rules:

f(x, a(b(y))) -> f(c(d(x)), y)
f(c(x), y) -> f(x, a(y))
f(d(x), y) -> f(x, b(y))

Strategy:

innermost

On this DP problem, an Instantiation SCC transformation can be performed.
As a result of transforming the rule

F(d(x), y) -> F(x, b(y))
four new Dependency Pairs are created:

F(d(x''), b(y'')) -> F(x'', b(b(y'')))
F(d(x'), a(a(y''''))) -> F(x', b(a(a(y''''))))
F(d(x'), a(y'''')) -> F(x', b(a(y'''')))
F(d(x'), a(b(y''''))) -> F(x', b(a(b(y''''))))

The transformation is resulting in one new DP problem:

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Inst`
`           →DP Problem 2`
`             ↳Inst`
`             ...`
`               →DP Problem 3`
`                 ↳Remaining Obligation(s)`

The following remains to be proven:
Dependency Pairs:

F(d(x'), a(b(y''''))) -> F(x', b(a(b(y''''))))
F(d(x'), a(y'''')) -> F(x', b(a(y'''')))
F(d(x''), b(y'')) -> F(x'', b(b(y'')))
F(d(x'), a(a(y''''))) -> F(x', b(a(a(y''''))))
F(c(d(x'')), y'') -> F(d(x''), a(y''))
F(c(x''), a(y'')) -> F(x'', a(a(y'')))
F(x, a(b(y))) -> F(c(d(x)), y)
F(c(x''), b(y'')) -> F(x'', a(b(y'')))

Rules:

f(x, a(b(y))) -> f(c(d(x)), y)
f(c(x), y) -> f(x, a(y))
f(d(x), y) -> f(x, b(y))

Strategy:

innermost

Innermost Termination of R could not be shown.
Duration:
0:00 minutes