Termination Proof using AProVE

Term Rewriting System R:
[N, X, Y, Z, X1, X2]
terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

TERMS(N) -> SQR(N)
SQR(s(X)) -> S(add(sqr(X), dbl(X)))
SQR(s(X)) -> ADD(sqr(X), dbl(X))
SQR(s(X)) -> SQR(X)
SQR(s(X)) -> DBL(X)
DBL(s(X)) -> S(s(dbl(X)))
DBL(s(X)) -> S(dbl(X))
DBL(s(X)) -> DBL(X)
ADD(s(X), Y) -> S(add(X, Y))
ADD(s(X), Y) -> ADD(X, Y)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)
HALF(s(s(X))) -> S(half(X))
HALF(s(s(X))) -> HALF(X)
ACTIVATE(n_{_terms}(X)) -> TERMS(activate(X))
ACTIVATE(n_{_terms}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_s}(X)) -> S(activate(X))
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(activate(X1), activate(X2))
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X2)

Furthermore, R contains five SCCs.

     ↳DPs

       →DP Problem 1

         ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

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

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

The following dependency pair can be strictly oriented:

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

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(ADD(x₁, x₂)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Dependency Graph

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polynomial Ordering

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

DBL(s(X)) -> DBL(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

The following dependency pair can be strictly oriented:

DBL(s(X)) -> DBL(X)

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(DBL(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 7

             ↳Dependency Graph

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polynomial Ordering

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

HALF(s(s(X))) -> HALF(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

The following dependency pair can be strictly oriented:

HALF(s(s(X))) -> HALF(X)

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

           →DP Problem 8

             ↳Dependency Graph

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polynomial Ordering

       →DP Problem 5

         ↳Polo

Dependency Pair:

SQR(s(X)) -> SQR(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

The following dependency pair can be strictly oriented:

SQR(s(X)) -> SQR(X)

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(SQR(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

           →DP Problem 9

             ↳Dependency Graph

       →DP Problem 5

         ↳Polo

Dependency Pair:

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polynomial Ordering

Dependency Pairs:

ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(activate(X1), activate(X2))
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_terms}(X)) -> ACTIVATE(X)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_first}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(activate(X1), activate(X2))

Additionally, the following usable rules using the Ce-refinement can be oriented:

activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
s(X) -> n_{_s}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(activate(x₁)) = x₁

POL(n__terms(x₁)) = x₁

POL(sqr(x₁)) = 0

POL(n__s(x₁)) = x₁

POL(terms(x₁)) = x₁

POL(ACTIVATE(x₁)) = x₁

POL(add(x₁, x₂)) = x₂

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

POL(0) = 0

POL(cons(x₁, x₂)) = x₂

POL(FIRST(x₁, x₂)) = x₂

POL(dbl(x₁)) = 0

POL(nil) = 0

POL(s(x₁)) = x₁

POL(recip(x₁)) = 0

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

           →DP Problem 10

             ↳Dependency Graph

Dependency Pairs:

ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_terms}(X)) -> ACTIVATE(X)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph the DP problem was split into 1 DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

           →DP Problem 10

             ↳DGraph

...

               →DP Problem 11

                 ↳Polynomial Ordering

Dependency Pairs:

ACTIVATE(n_{_terms}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

The following dependency pair can be strictly oriented:

ACTIVATE(n_{_terms}(X)) -> ACTIVATE(X)

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(n__s(x₁)) = x₁

POL(ACTIVATE(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

           →DP Problem 10

             ↳DGraph

...

               →DP Problem 12

                 ↳Polynomial Ordering

Dependency Pair:

ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

The following dependency pair can be strictly oriented:

ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(ACTIVATE(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

           →DP Problem 10

             ↳DGraph

...

               →DP Problem 13

                 ↳Dependency Graph

Dependency Pair:

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(n_{_s}(N)))
terms(X) -> n_{_terms}(X)
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X), dbl(X)))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
first(0, X) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, n_{_first}(X, activate(Z)))
first(X1, X2) -> n_{_first}(X1, X2)
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
half(dbl(X)) -> X
s(X) -> n_{_s}(X)
activate(n_{_terms}(X)) -> terms(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_first}(X1, X2)) -> first(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

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

POL(activate(x₁))	= x₁
POL(n__terms(x₁))	= x₁
POL(sqr(x₁))	= 0
POL(n__s(x₁))	= x₁
POL(terms(x₁))	= x₁
POL(ACTIVATE(x₁))	= x₁
POL(add(x₁, x₂))	= x₂
POL(first(x₁, x₂))	= 1 + x₁ + x₂
POL(0)	= 0
POL(cons(x₁, x₂))	= x₂
POL(FIRST(x₁, x₂))	= x₂
POL(dbl(x₁))	= 0
POL(nil)	= 0
POL(s(x₁))	= x₁
POL(recip(x₁))	= 0
POL(n__first(x₁, x₂))	= 1 + x₁ + x₂

POL(n__terms(x₁))	= 1 + x₁
POL(n__s(x₁))	= x₁
POL(ACTIVATE(x₁))	= x₁