YES(O(1), O(n^1)) 3.12/1.21 YES(O(1), O(n^1)) 3.12/1.26 3.12/1.26 3.12/1.26 3.12/1.26 3.12/1.26 3.12/1.26 Runtime Complexity (innermost) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml.xml 3.12/1.26 3.12/1.26 3.12/1.26
3.12/1.26
3.12/1.26
3.12/1.26
The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(O(1), O(n^1)).

0 CpxTRS
3.12/1.26 
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))
3.12/1.26 
↳2 CdtProblem
3.12/1.26 
↳3 CdtUnreachableProof (⇔)
3.12/1.26 
↳4 CdtProblem
3.12/1.26 
↳5 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))
3.12/1.26 
↳6 CdtProblem
3.12/1.26 
↳7 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID))
3.12/1.26 
↳8 CdtProblem
3.12/1.26 
↳9 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))
3.12/1.26 
↳10 CdtProblem
3.12/1.26 
↳11 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))
3.12/1.26 
↳12 CdtProblem
3.12/1.26 
↳13 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))
3.12/1.26 
↳14 CdtProblem
3.12/1.26 
↳15 SIsEmptyProof (BOTH BOUNDS(ID, ID))
3.12/1.26 
↳16 BOUNDS(O(1), O(1))
3.12/1.26
3.12/1.26 3.12/1.26
3.12/1.26
3.12/1.26

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), n__terms(n__s(N))) 3.12/1.26
sqr(0) → 0 3.12/1.26
sqr(s(X)) → s(add(sqr(X), dbl(X))) 3.12/1.26
dbl(0) → 0 3.12/1.26
dbl(s(X)) → s(s(dbl(X))) 3.12/1.26
add(0, X) → X 3.12/1.26
add(s(X), Y) → s(add(X, Y)) 3.12/1.26
first(0, X) → nil 3.12/1.26
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z))) 3.12/1.26
terms(X) → n__terms(X) 3.12/1.26
s(X) → n__s(X) 3.12/1.26
first(X1, X2) → n__first(X1, X2) 3.12/1.26
activate(n__terms(X)) → terms(activate(X)) 3.12/1.26
activate(n__s(X)) → s(activate(X)) 3.12/1.26
activate(n__first(X1, X2)) → first(activate(X1), activate(X2)) 3.12/1.26
activate(X) → X

Rewrite Strategy: INNERMOST
3.12/1.26
3.12/1.26

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted CpxTRS to CDT
3.12/1.26
3.12/1.26

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0 3.12/1.26
sqr(s(z0)) → s(add(sqr(z0), dbl(z0))) 3.12/1.26
dbl(0) → 0 3.12/1.26
dbl(s(z0)) → s(s(dbl(z0))) 3.12/1.26
add(0, z0) → z0 3.12/1.26
add(s(z0), z1) → s(add(z0, z1)) 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2))) 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0
Tuples:

TERMS(z0) → c(SQR(z0)) 3.12/1.26
SQR(s(z0)) → c3(S(add(sqr(z0), dbl(z0))), ADD(sqr(z0), dbl(z0)), SQR(z0), DBL(z0)) 3.12/1.26
DBL(s(z0)) → c5(S(s(dbl(z0))), S(dbl(z0)), DBL(z0)) 3.12/1.26
ADD(s(z0), z1) → c7(S(add(z0, z1)), ADD(z0, z1)) 3.12/1.26
FIRST(s(z0), cons(z1, z2)) → c9(ACTIVATE(z2)) 3.12/1.26
ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__s(z0)) → c13(S(activate(z0)), ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
S tuples:

TERMS(z0) → c(SQR(z0)) 3.12/1.26
SQR(s(z0)) → c3(S(add(sqr(z0), dbl(z0))), ADD(sqr(z0), dbl(z0)), SQR(z0), DBL(z0)) 3.12/1.26
DBL(s(z0)) → c5(S(s(dbl(z0))), S(dbl(z0)), DBL(z0)) 3.12/1.26
ADD(s(z0), z1) → c7(S(add(z0, z1)), ADD(z0, z1)) 3.12/1.26
FIRST(s(z0), cons(z1, z2)) → c9(ACTIVATE(z2)) 3.12/1.26
ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__s(z0)) → c13(S(activate(z0)), ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
K tuples:none
Defined Rule Symbols:

terms, sqr, dbl, add, first, s, activate

Defined Pair Symbols:

TERMS, SQR, DBL, ADD, FIRST, ACTIVATE

Compound Symbols:

c, c3, c5, c7, c9, c12, c13, c14

3.12/1.26
3.12/1.26

(3) CdtUnreachableProof (EQUIVALENT transformation)

The following tuples could be removed as they are not reachable from basic start terms:

SQR(s(z0)) → c3(S(add(sqr(z0), dbl(z0))), ADD(sqr(z0), dbl(z0)), SQR(z0), DBL(z0)) 3.12/1.26
DBL(s(z0)) → c5(S(s(dbl(z0))), S(dbl(z0)), DBL(z0)) 3.12/1.26
ADD(s(z0), z1) → c7(S(add(z0, z1)), ADD(z0, z1)) 3.12/1.26
FIRST(s(z0), cons(z1, z2)) → c9(ACTIVATE(z2))
3.12/1.26
3.12/1.26

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0 3.12/1.26
sqr(s(z0)) → s(add(sqr(z0), dbl(z0))) 3.12/1.26
dbl(0) → 0 3.12/1.26
dbl(s(z0)) → s(s(dbl(z0))) 3.12/1.26
add(0, z0) → z0 3.12/1.26
add(s(z0), z1) → s(add(z0, z1)) 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2))) 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0
Tuples:

TERMS(z0) → c(SQR(z0)) 3.12/1.26
ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__s(z0)) → c13(S(activate(z0)), ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
S tuples:

TERMS(z0) → c(SQR(z0)) 3.12/1.26
ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__s(z0)) → c13(S(activate(z0)), ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
K tuples:none
Defined Rule Symbols:

terms, sqr, dbl, add, first, s, activate

Defined Pair Symbols:

TERMS, ACTIVATE

Compound Symbols:

c, c12, c13, c14

3.12/1.26
3.12/1.26

(5) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)

Removed 3 trailing tuple parts
3.12/1.26
3.12/1.26

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0 3.12/1.26
sqr(s(z0)) → s(add(sqr(z0), dbl(z0))) 3.12/1.26
dbl(0) → 0 3.12/1.26
dbl(s(z0)) → s(s(dbl(z0))) 3.12/1.26
add(0, z0) → z0 3.12/1.26
add(s(z0), z1) → s(add(z0, z1)) 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2))) 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0
Tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
S tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
K tuples:none
Defined Rule Symbols:

terms, sqr, dbl, add, first, s, activate

Defined Pair Symbols:

ACTIVATE, TERMS

Compound Symbols:

c12, c, c13, c14

3.12/1.26
3.12/1.26

(7) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)

Removed 1 trailing nodes:

TERMS(z0) → c
3.12/1.26
3.12/1.26

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0 3.12/1.26
sqr(s(z0)) → s(add(sqr(z0), dbl(z0))) 3.12/1.26
dbl(0) → 0 3.12/1.26
dbl(s(z0)) → s(s(dbl(z0))) 3.12/1.26
add(0, z0) → z0 3.12/1.26
add(s(z0), z1) → s(add(z0, z1)) 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2))) 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0
Tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
S tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
K tuples:none
Defined Rule Symbols:

terms, sqr, dbl, add, first, s, activate

Defined Pair Symbols:

ACTIVATE, TERMS

Compound Symbols:

c12, c, c13, c14

3.12/1.26
3.12/1.26

(9) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0))
We considered the (Usable) Rules:

activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0
And the Tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
The order we found is given by the following interpretation:
Polynomial interpretation : 3.12/1.26

POL(0) = 0    3.12/1.26
POL(ACTIVATE(x1)) = x1    3.12/1.26
POL(TERMS(x1)) = 0    3.12/1.26
POL(activate(x1)) = 0    3.12/1.26
POL(c) = 0    3.12/1.26
POL(c12(x1, x2)) = x1 + x2    3.12/1.26
POL(c13(x1)) = x1    3.12/1.26
POL(c14(x1, x2)) = x1 + x2    3.12/1.26
POL(cons(x1, x2)) = [3] + x1    3.12/1.26
POL(first(x1, x2)) = [3]    3.12/1.26
POL(n__first(x1, x2)) = x1 + x2    3.12/1.26
POL(n__s(x1)) = [1] + x1    3.12/1.26
POL(n__terms(x1)) = x1    3.12/1.26
POL(nil) = [3]    3.12/1.26
POL(recip(x1)) = [3] + x1    3.12/1.26
POL(s(x1)) = [3]    3.12/1.26
POL(sqr(x1)) = [1]    3.12/1.26
POL(terms(x1)) = [3]   
3.12/1.26
3.12/1.26

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0 3.12/1.26
sqr(s(z0)) → s(add(sqr(z0), dbl(z0))) 3.12/1.26
dbl(0) → 0 3.12/1.26
dbl(s(z0)) → s(s(dbl(z0))) 3.12/1.26
add(0, z0) → z0 3.12/1.26
add(s(z0), z1) → s(add(z0, z1)) 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2))) 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0
Tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
S tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
K tuples:

ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0))
Defined Rule Symbols:

terms, sqr, dbl, add, first, s, activate

Defined Pair Symbols:

ACTIVATE, TERMS

Compound Symbols:

c12, c, c13, c14

3.12/1.26
3.12/1.26

(11) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
We considered the (Usable) Rules:

activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0
And the Tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
The order we found is given by the following interpretation:
Polynomial interpretation : 3.12/1.26

POL(0) = [2]    3.12/1.26
POL(ACTIVATE(x1)) = [5] + [4]x1    3.12/1.26
POL(TERMS(x1)) = 0    3.12/1.26
POL(activate(x1)) = 0    3.12/1.26
POL(c) = 0    3.12/1.26
POL(c12(x1, x2)) = x1 + x2    3.12/1.26
POL(c13(x1)) = x1    3.12/1.26
POL(c14(x1, x2)) = x1 + x2    3.12/1.26
POL(cons(x1, x2)) = [3] + x1    3.12/1.26
POL(first(x1, x2)) = [3]    3.12/1.26
POL(n__first(x1, x2)) = [4] + x1 + x2    3.12/1.26
POL(n__s(x1)) = x1    3.12/1.26
POL(n__terms(x1)) = x1    3.12/1.26
POL(nil) = [3]    3.12/1.26
POL(recip(x1)) = [3] + x1    3.12/1.26
POL(s(x1)) = [3]    3.12/1.26
POL(sqr(x1)) = [4]    3.12/1.26
POL(terms(x1)) = [3]   
3.12/1.26
3.12/1.26

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0 3.12/1.26
sqr(s(z0)) → s(add(sqr(z0), dbl(z0))) 3.12/1.26
dbl(0) → 0 3.12/1.26
dbl(s(z0)) → s(s(dbl(z0))) 3.12/1.26
add(0, z0) → z0 3.12/1.26
add(s(z0), z1) → s(add(z0, z1)) 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2))) 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0
Tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
S tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c
K tuples:

ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
Defined Rule Symbols:

terms, sqr, dbl, add, first, s, activate

Defined Pair Symbols:

ACTIVATE, TERMS

Compound Symbols:

c12, c, c13, c14

3.12/1.26
3.12/1.26

(13) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c
We considered the (Usable) Rules:

activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0
And the Tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
The order we found is given by the following interpretation:
Polynomial interpretation : 3.12/1.26

POL(0) = [2]    3.12/1.26
POL(ACTIVATE(x1)) = [2]x1    3.12/1.26
POL(TERMS(x1)) = [3]    3.12/1.26
POL(activate(x1)) = [2]x1    3.12/1.26
POL(c) = 0    3.12/1.26
POL(c12(x1, x2)) = x1 + x2    3.12/1.26
POL(c13(x1)) = x1    3.12/1.26
POL(c14(x1, x2)) = x1 + x2    3.12/1.26
POL(cons(x1, x2)) = [3] + x1    3.12/1.26
POL(first(x1, x2)) = x1 + x2    3.12/1.26
POL(n__first(x1, x2)) = x1 + x2    3.12/1.26
POL(n__s(x1)) = x1    3.12/1.26
POL(n__terms(x1)) = [2] + x1    3.12/1.26
POL(nil) = [2]    3.12/1.26
POL(recip(x1)) = [1]    3.12/1.26
POL(s(x1)) = x1    3.12/1.26
POL(sqr(x1)) = [4]    3.12/1.26
POL(terms(x1)) = [4] + x1   
3.12/1.26
3.12/1.26

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0))) 3.12/1.26
terms(z0) → n__terms(z0) 3.12/1.26
sqr(0) → 0 3.12/1.26
sqr(s(z0)) → s(add(sqr(z0), dbl(z0))) 3.12/1.26
dbl(0) → 0 3.12/1.26
dbl(s(z0)) → s(s(dbl(z0))) 3.12/1.26
add(0, z0) → z0 3.12/1.26
add(s(z0), z1) → s(add(z0, z1)) 3.12/1.26
first(0, z0) → nil 3.12/1.26
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2))) 3.12/1.26
first(z0, z1) → n__first(z0, z1) 3.12/1.26
s(z0) → n__s(z0) 3.12/1.26
activate(n__terms(z0)) → terms(activate(z0)) 3.12/1.26
activate(n__s(z0)) → s(activate(z0)) 3.12/1.26
activate(n__first(z0, z1)) → first(activate(z0), activate(z1)) 3.12/1.26
activate(z0) → z0
Tuples:

ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c 3.12/1.26
ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1))
S tuples:none
K tuples:

ACTIVATE(n__s(z0)) → c13(ACTIVATE(z0)) 3.12/1.26
ACTIVATE(n__first(z0, z1)) → c14(ACTIVATE(z0), ACTIVATE(z1)) 3.12/1.26
ACTIVATE(n__terms(z0)) → c12(TERMS(activate(z0)), ACTIVATE(z0)) 3.12/1.26
TERMS(z0) → c
Defined Rule Symbols:

terms, sqr, dbl, add, first, s, activate

Defined Pair Symbols:

ACTIVATE, TERMS

Compound Symbols:

c12, c, c13, c14

3.12/1.26
3.12/1.26

(15) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty
3.12/1.26
3.12/1.26

(16) BOUNDS(O(1), O(1))

3.12/1.26
3.12/1.26
3.43/1.34 EOF