Termination Proof using AProVE

Term Rewriting System R:
[X, Z, N, Y, X1, X2]
from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

FROM(X) -> CONS(X, n_{_from}(s(X)))
2NDSPOS(s(N), cons(X, n_{_cons}(Y, Z))) -> ACTIVATE(Y)
2NDSPOS(s(N), cons(X, n_{_cons}(Y, Z))) -> 2NDSNEG(N, activate(Z))
2NDSPOS(s(N), cons(X, n_{_cons}(Y, Z))) -> ACTIVATE(Z)
2NDSNEG(s(N), cons(X, n_{_cons}(Y, Z))) -> ACTIVATE(Y)
2NDSNEG(s(N), cons(X, n_{_cons}(Y, Z))) -> 2NDSPOS(N, activate(Z))
2NDSNEG(s(N), cons(X, n_{_cons}(Y, Z))) -> ACTIVATE(Z)
PI(X) -> 2NDSPOS(X, from(0))
PI(X) -> FROM(0)
PLUS(s(X), Y) -> PLUS(X, Y)
TIMES(s(X), Y) -> PLUS(Y, times(X, Y))
TIMES(s(X), Y) -> TIMES(X, Y)
SQUARE(X) -> TIMES(X, X)
ACTIVATE(n_{_from}(X)) -> FROM(X)
ACTIVATE(n_{_cons}(X1, X2)) -> CONS(X1, X2)

Furthermore, R contains two SCCs.

     ↳DPs

       →DP Problem 1

         ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳FwdInst

Dependency Pair:

PLUS(s(X), Y) -> PLUS(X, Y)

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Strategy:

innermost

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

PLUS(s(X), Y) -> PLUS(X, Y)

one new Dependency Pair is created:

PLUS(s(s(X'')), Y'') -> PLUS(s(X''), Y'')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 3

             ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳FwdInst

Dependency Pair:

PLUS(s(s(X'')), Y'') -> PLUS(s(X''), Y'')

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Strategy:

innermost

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

PLUS(s(s(X'')), Y'') -> PLUS(s(X''), Y'')

one new Dependency Pair is created:

PLUS(s(s(s(X''''))), Y'''') -> PLUS(s(s(X'''')), Y'''')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 3

             ↳FwdInst

...

               →DP Problem 4

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳FwdInst

Dependency Pair:

PLUS(s(s(s(X''''))), Y'''') -> PLUS(s(s(X'''')), Y'''')

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Strategy:

innermost

The following dependency pair can be strictly oriented:

PLUS(s(s(s(X''''))), Y'''') -> PLUS(s(s(X'''')), Y'''')

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(PLUS(x₁, x₂)) = 1 + x₁

POL(s(x₁)) = 1 + x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 3

             ↳FwdInst

...

               →DP Problem 5

                 ↳Dependency Graph

       →DP Problem 2

         ↳FwdInst

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Forward Instantiation Transformation

Dependency Pair:

TIMES(s(X), Y) -> TIMES(X, Y)

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Strategy:

innermost

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

TIMES(s(X), Y) -> TIMES(X, Y)

one new Dependency Pair is created:

TIMES(s(s(X'')), Y'') -> TIMES(s(X''), Y'')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

           →DP Problem 6

             ↳Forward Instantiation Transformation

Dependency Pair:

TIMES(s(s(X'')), Y'') -> TIMES(s(X''), Y'')

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Strategy:

innermost

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

TIMES(s(s(X'')), Y'') -> TIMES(s(X''), Y'')

one new Dependency Pair is created:

TIMES(s(s(s(X''''))), Y'''') -> TIMES(s(s(X'''')), Y'''')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

           →DP Problem 6

             ↳FwdInst

...

               →DP Problem 7

                 ↳Polynomial Ordering

Dependency Pair:

TIMES(s(s(s(X''''))), Y'''') -> TIMES(s(s(X'''')), Y'''')

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Strategy:

innermost

The following dependency pair can be strictly oriented:

TIMES(s(s(s(X''''))), Y'''') -> TIMES(s(s(X'''')), Y'''')

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(TIMES(x₁, x₂)) = 1 + x₁

POL(s(x₁)) = 1 + x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

           →DP Problem 6

             ↳FwdInst

...

               →DP Problem 8

                 ↳Dependency Graph

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(s(X)))
from(X) -> n_{_from}(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, n_{_cons}(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(X)
activate(n_{_cons}(X1, X2)) -> cons(X1, X2)
activate(X) -> X

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes

POL(PLUS(x₁, x₂))	= 1 + x₁
POL(s(x₁))	= 1 + x₁

POL(TIMES(x₁, x₂))	= 1 + x₁
POL(s(x₁))	= 1 + x₁