Termination Proof using AProVE

Term Rewriting System R:
[X, Z, N, Y, X1, X2]
from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

FROM(X) -> CONS(X, n_{_from}(n_{_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) -> S(plus(X, Y))
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(activate(X))
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_s}(X)) -> S(activate(X))
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_cons}(X1, X2)) -> CONS(activate(X1), X2)
ACTIVATE(n_{_cons}(X1, X2)) -> ACTIVATE(X1)

Furthermore, R contains four SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

Dependency Pairs:

ACTIVATE(n_{_cons}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)

Rules:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_cons}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)

The following rules can be oriented:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

{0, pi} > {2ndspos, 2ndsneg} > activate > from > {n_{_s}, s}
{0, pi} > {2ndspos, 2ndsneg} > activate > from > n_{_from}
{0, pi} > {2ndspos, 2ndsneg} > activate > from > {n_{_cons}, cons}
{0, pi} > {2ndspos, 2ndsneg} > negrecip
{0, pi} > {2ndspos, 2ndsneg} > rcons
{0, pi} > {2ndspos, 2ndsneg} > posrecip
{0, pi} > rnil
square > times > plus > {n_{_s}, s}

resulting in one new DP problem.
Used Argument Filtering System:

ACTIVATE(x₁) -> ACTIVATE(x₁)
n_{_cons}(x₁, x₂) -> n_{_cons}(x₁, x₂)
n_{_s}(x₁) -> n_{_s}(x₁)
n_{_from}(x₁) -> n_{_from}(x₁)
from(x₁) -> from(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
2ndspos(x₁, x₂) -> 2ndspos(x₁, x₂)
s(x₁) -> s(x₁)
rcons(x₁, x₂) -> rcons(x₁, x₂)
posrecip(x₁) -> posrecip(x₁)
2ndsneg(x₁, x₂) -> 2ndsneg(x₁, x₂)
activate(x₁) -> activate(x₁)
negrecip(x₁) -> negrecip(x₁)
pi(x₁) -> pi(x₁)
plus(x₁, x₂) -> plus(x₁, x₂)
times(x₁, x₂) -> times(x₁, x₂)
square(x₁) -> square(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 5

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳Argument Filtering and Ordering

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

Dependency Pair:

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

Rules:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

The following dependency pair can be strictly oriented:

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

The following rules can be oriented:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

{0, pi} > {2ndspos, 2ndsneg} > activate > from > n_{_s}
{0, pi} > {2ndspos, 2ndsneg} > activate > from > n_{_from}
{0, pi} > {2ndspos, 2ndsneg} > activate > from > {n_{_cons}, cons}
{0, pi} > {2ndspos, 2ndsneg} > activate > s > n_{_s}
{0, pi} > {2ndspos, 2ndsneg} > negrecip
{0, pi} > {2ndspos, 2ndsneg} > rcons
{0, pi} > {2ndspos, 2ndsneg} > posrecip
{0, pi} > rnil
square > times > plus > s > n_{_s}

resulting in one new DP problem.
Used Argument Filtering System:

PLUS(x₁, x₂) -> PLUS(x₁, x₂)
s(x₁) -> s(x₁)
from(x₁) -> from(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
n_{_from}(x₁) -> n_{_from}(x₁)
n_{_s}(x₁) -> n_{_s}(x₁)
2ndspos(x₁, x₂) -> 2ndspos(x₁, x₂)
n_{_cons}(x₁, x₂) -> n_{_cons}(x₁, x₂)
rcons(x₁, x₂) -> rcons(x₁, x₂)
posrecip(x₁) -> posrecip(x₁)
2ndsneg(x₁, x₂) -> 2ndsneg(x₁, x₂)
activate(x₁) -> activate(x₁)
negrecip(x₁) -> negrecip(x₁)
pi(x₁) -> pi(x₁)
plus(x₁, x₂) -> plus(x₁, x₂)
times(x₁, x₂) -> times(x₁, x₂)
square(x₁) -> square(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 6

             ↳Dependency Graph

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Argument Filtering and Ordering

       →DP Problem 4

         ↳AFS

Dependency Pairs:

2NDSNEG(s(N), cons(X, n_{_cons}(Y, Z))) -> 2NDSPOS(N, activate(Z))
2NDSPOS(s(N), cons(X, n_{_cons}(Y, Z))) -> 2NDSNEG(N, activate(Z))

Rules:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

The following dependency pairs can be strictly oriented:

2NDSNEG(s(N), cons(X, n_{_cons}(Y, Z))) -> 2NDSPOS(N, activate(Z))
2NDSPOS(s(N), cons(X, n_{_cons}(Y, Z))) -> 2NDSNEG(N, activate(Z))

The following rules can be oriented:

activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
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)

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

{2NDSNEG, 2NDSPOS} > activate > from > n_{_s}
{2NDSNEG, 2NDSPOS} > activate > from > n_{_from}
{2NDSNEG, 2NDSPOS} > activate > from > cons > n_{_cons}
{2NDSNEG, 2NDSPOS} > activate > s > n_{_s}
square > times > plus > s > n_{_s}
pi > 0
pi > {2ndspos, rnil, 2ndsneg} > activate > from > n_{_s}
pi > {2ndspos, rnil, 2ndsneg} > activate > from > n_{_from}
pi > {2ndspos, rnil, 2ndsneg} > activate > from > cons > n_{_cons}
pi > {2ndspos, rnil, 2ndsneg} > activate > s > n_{_s}
pi > {2ndspos, rnil, 2ndsneg} > negrecip
pi > {2ndspos, rnil, 2ndsneg} > rcons
pi > {2ndspos, rnil, 2ndsneg} > posrecip

resulting in one new DP problem.
Used Argument Filtering System:

2NDSPOS(x₁, x₂) -> 2NDSPOS(x₁, x₂)
2NDSNEG(x₁, x₂) -> 2NDSNEG(x₁, x₂)
s(x₁) -> s(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
activate(x₁) -> activate(x₁)
n_{_cons}(x₁, x₂) -> n_{_cons}(x₁, x₂)
n_{_from}(x₁) -> n_{_from}(x₁)
from(x₁) -> from(x₁)
n_{_s}(x₁) -> n_{_s}(x₁)
2ndspos(x₁, x₂) -> 2ndspos(x₁, x₂)
rcons(x₁, x₂) -> rcons(x₁, x₂)
posrecip(x₁) -> posrecip(x₁)
2ndsneg(x₁, x₂) -> 2ndsneg(x₁, x₂)
negrecip(x₁) -> negrecip(x₁)
pi(x₁) -> pi(x₁)
plus(x₁, x₂) -> plus(x₁, x₂)
times(x₁, x₂) -> times(x₁, x₂)
square(x₁) -> square(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 7

             ↳Dependency Graph

       →DP Problem 4

         ↳AFS

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳Argument Filtering and Ordering

Dependency Pair:

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

Rules:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

The following dependency pair can be strictly oriented:

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

The following rules can be oriented:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

{0, pi} > {2ndspos, rnil, 2ndsneg} > activate > from > {n_{_s}, s}
{0, pi} > {2ndspos, rnil, 2ndsneg} > activate > from > n_{_from}
{0, pi} > {2ndspos, rnil, 2ndsneg} > activate > from > {n_{_cons}, cons}
{0, pi} > {2ndspos, rnil, 2ndsneg} > negrecip
{0, pi} > {2ndspos, rnil, 2ndsneg} > rcons
{0, pi} > {2ndspos, rnil, 2ndsneg} > posrecip
square > times > plus > {n_{_s}, s}

resulting in one new DP problem.
Used Argument Filtering System:

TIMES(x₁, x₂) -> TIMES(x₁, x₂)
s(x₁) -> s(x₁)
from(x₁) -> from(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
n_{_from}(x₁) -> n_{_from}(x₁)
n_{_s}(x₁) -> n_{_s}(x₁)
2ndspos(x₁, x₂) -> 2ndspos(x₁, x₂)
n_{_cons}(x₁, x₂) -> n_{_cons}(x₁, x₂)
rcons(x₁, x₂) -> rcons(x₁, x₂)
posrecip(x₁) -> posrecip(x₁)
2ndsneg(x₁, x₂) -> 2ndsneg(x₁, x₂)
activate(x₁) -> activate(x₁)
negrecip(x₁) -> negrecip(x₁)
pi(x₁) -> pi(x₁)
plus(x₁, x₂) -> plus(x₁, x₂)
times(x₁, x₂) -> times(x₁, x₂)
square(x₁) -> square(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

           →DP Problem 8

             ↳Dependency Graph

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(n_{_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)
s(X) -> n_{_s}(X)
cons(X1, X2) -> n_{_cons}(X1, X2)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_cons}(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:23 minutes