Termination Proof using AProVE

Term Rewriting System R:
[X, Y, Z]
from(X) -> cons(X, from(s(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, Z)

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

FROM(X) -> FROM(s(X))
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Furthermore, R contains two SCCs.

     ↳DPs

       →DP Problem 1

         ↳Instantiation Transformation

       →DP Problem 2

         ↳Remaining

Dependency Pair:

FROM(X) -> FROM(s(X))

Rules:

from(X) -> cons(X, from(s(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, Z)

Strategy:

innermost

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

FROM(X) -> FROM(s(X))

one new Dependency Pair is created:

FROM(s(X'')) -> FROM(s(s(X'')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Inst

       →DP Problem 2

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
FROM(s(X'')) -> FROM(s(s(X'')))

Rules:

from(X) -> cons(X, from(s(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, Z)

Strategy:
innermost
Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

from(X) -> cons(X, from(s(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, Z)

Strategy:
innermost

     ↳DPs

       →DP Problem 1

         ↳Inst

       →DP Problem 2

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
FROM(s(X'')) -> FROM(s(s(X'')))

Rules:

from(X) -> cons(X, from(s(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, Z)

Strategy:
innermost
Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

from(X) -> cons(X, from(s(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, Z)

Strategy:
innermost

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