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


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


NO

Problem 1: 

(VAR X Y Z)
(RULES
add(0,X) -> X
add(s(X),Y) -> s(add(X,Y))
and(false,Y) -> false
and(true,X) -> X
first(0,X) -> nil
first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
from(X) -> cons(X,from(s(X)))
if(false,X,Y) -> Y
if(true,X,Y) -> X
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ADD(s(X),Y) -> ADD(X,Y)
 FIRST(s(X),cons(Y,Z)) -> FIRST(X,Z)
 FROM(X) -> FROM(s(X))
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 and(false,Y) -> false
 and(true,X) -> X
 first(0,X) -> nil
 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
 from(X) -> cons(X,from(s(X)))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X

Problem 1: 

Infinite Processor:
-> Pairs:
 ADD(s(X),Y) -> ADD(X,Y)
 FIRST(s(X),cons(Y,Z)) -> FIRST(X,Z)
 FROM(X) -> FROM(s(X))
-> Rules:
 add(0,X) -> X
 add(s(X),Y) -> s(add(X,Y))
 and(false,Y) -> false
 and(true,X) -> X
 first(0,X) -> nil
 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
 from(X) -> cons(X,from(s(X)))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X
-> Pairs in cycle:
 FROM(X) -> FROM(s(X))

The problem is infinite.