Termination Proof using AProVE

Term Rewriting System R:
[N, X, Y, Z, X1, X2]
terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, 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)) -> ADD(sqr(X), dbl(X))
SQR(s(X)) -> SQR(X)
SQR(s(X)) -> DBL(X)
DBL(s(X)) -> DBL(X)
ADD(s(X), Y) -> ADD(X, Y)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)
HALF(s(s(X))) -> HALF(X)
ACTIVATE(n_{_terms}(X)) -> TERMS(X)
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)

Furthermore, R contains five SCCs.

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
ADD(s(X), Y) -> ADD(X, Y)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
DBL(s(X)) -> DBL(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
HALF(s(s(X))) -> HALF(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
SQR(s(X)) -> SQR(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pairs:
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
ADD(s(X), Y) -> ADD(X, Y)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
DBL(s(X)) -> DBL(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
HALF(s(s(X))) -> HALF(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
SQR(s(X)) -> SQR(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pairs:
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
ADD(s(X), Y) -> ADD(X, Y)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
DBL(s(X)) -> DBL(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
HALF(s(s(X))) -> HALF(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
SQR(s(X)) -> SQR(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pairs:
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
ADD(s(X), Y) -> ADD(X, Y)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
DBL(s(X)) -> DBL(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
HALF(s(s(X))) -> HALF(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
SQR(s(X)) -> SQR(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pairs:
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
ADD(s(X), Y) -> ADD(X, Y)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
DBL(s(X)) -> DBL(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
HALF(s(s(X))) -> HALF(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pair:
SQR(s(X)) -> SQR(X)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X
Dependency Pairs:
ACTIVATE(n_{_first}(X1, X2)) -> FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z)

Rules:

terms(N) -> cons(recip(sqr(N)), n_{_terms}(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
activate(n_{_terms}(X)) -> terms(X)
activate(n_{_first}(X1, X2)) -> first(X1, X2)
activate(X) -> X

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