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


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


NO

Problem 1: 

(VAR N X XS Y)
(RULES
add(0,X) -> X
add(s(X),Y) -> s(add(X,Y))
fib(N) -> sel(N,fib1(s(0),s(0)))
fib1(X,Y) -> cons(X,fib1(Y,add(X,Y)))
sel(0,cons(X,XS)) -> X
sel(s(N),cons(X,XS)) -> sel(N,XS)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ADD(s(X),Y) -> ADD(X,Y)
 FIB(N) -> FIB1(s(0),s(0))
 FIB(N) -> SEL(N,fib1(s(0),s(0)))
 FIB1(X,Y) -> ADD(X,Y)
 FIB1(X,Y) -> FIB1(Y,add(X,Y))
 SEL(s(N),cons(X,XS)) -> SEL(N,XS)
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 fib(N) -> sel(N,fib1(s(0),s(0)))
 fib1(X,Y) -> cons(X,fib1(Y,add(X,Y)))
 sel(0,cons(X,XS)) -> X
 sel(s(N),cons(X,XS)) -> sel(N,XS)

Problem 1: 

Infinite Processor:
-> Pairs:
 ADD(s(X),Y) -> ADD(X,Y)
 FIB(N) -> FIB1(s(0),s(0))
 FIB(N) -> SEL(N,fib1(s(0),s(0)))
 FIB1(X,Y) -> ADD(X,Y)
 FIB1(X,Y) -> FIB1(Y,add(X,Y))
 SEL(s(N),cons(X,XS)) -> SEL(N,XS)
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 fib(N) -> sel(N,fib1(s(0),s(0)))
 fib1(X,Y) -> cons(X,fib1(Y,add(X,Y)))
 sel(0,cons(X,XS)) -> X
 sel(s(N),cons(X,XS)) -> sel(N,XS)
-> Pairs in cycle:
 FIB1(X,Y) -> FIB1(Y,add(X,Y))

The problem is infinite.