/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem 1: 

(VAR N X Y)
(RULES
add(0,X) -> X
add(s(X),Y) -> s(add(X,Y))
dbl(0) -> 0
dbl(s(X)) -> s(s(dbl(X)))
first(0,X) -> nil
first(s(X),cons(Y)) -> cons(Y)
half(dbl(X)) -> X
half(0) -> 0
half(s(0)) -> 0
half(s(s(X))) -> s(half(X))
sqr(0) -> 0
sqr(s(X)) -> s(add(sqr(X),dbl(X)))
terms(N) -> cons(recip(sqr(N)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ADD(s(X),Y) -> ADD(X,Y)
 DBL(s(X)) -> DBL(X)
 HALF(s(s(X))) -> HALF(X)
 SQR(s(X)) -> ADD(sqr(X),dbl(X))
 SQR(s(X)) -> DBL(X)
 SQR(s(X)) -> SQR(X)
 TERMS(N) -> SQR(N)
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))

Problem 1: 

SCC Processor:
-> Pairs:
 ADD(s(X),Y) -> ADD(X,Y)
 DBL(s(X)) -> DBL(X)
 HALF(s(s(X))) -> HALF(X)
 SQR(s(X)) -> ADD(sqr(X),dbl(X))
 SQR(s(X)) -> DBL(X)
 SQR(s(X)) -> SQR(X)
 TERMS(N) -> SQR(N)
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 HALF(s(s(X))) -> HALF(X)
->->-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->->Cycle:
->->-> Pairs:
 DBL(s(X)) -> DBL(X)
->->-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->->Cycle:
->->-> Pairs:
 ADD(s(X),Y) -> ADD(X,Y)
->->-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->->Cycle:
->->-> Pairs:
 SQR(s(X)) -> SQR(X)
->->-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))


The problem is decomposed in 4 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 HALF(s(s(X))) -> HALF(X)
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Projection:
 pi(HALF) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 DBL(s(X)) -> DBL(X)
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Projection:
 pi(DBL) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.3: 

Subterm Processor:
-> Pairs:
 ADD(s(X),Y) -> ADD(X,Y)
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Projection:
 pi(ADD) = 1

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.4: 

Subterm Processor:
-> Pairs:
 SQR(s(X)) -> SQR(X)
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Projection:
 pi(SQR) = 1

Problem 1.4: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 dbl(0) -> 0
 dbl(s(X)) -> s(s(dbl(X)))
 first(0,X) -> nil
 first(s(X),cons(Y)) -> cons(Y)
 half(dbl(X)) -> X
 half(0) -> 0
 half(s(0)) -> 0
 half(s(s(X))) -> s(half(X))
 sqr(0) -> 0
 sqr(s(X)) -> s(add(sqr(X),dbl(X)))
 terms(N) -> cons(recip(sqr(N)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.