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


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


NO

Problem 1: 

(VAR X X1 Y Z)
(RULES
2nd(cons(X,X1)) -> 2nd(cons1(X,X1))
2nd(cons1(X,cons(Y,Z))) -> Y
from(X) -> cons(X,from(s(X)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 2ND(cons(X,X1)) -> 2ND(cons1(X,X1))
 FROM(X) -> FROM(s(X))
-> Rules:
 2nd(cons(X,X1)) -> 2nd(cons1(X,X1))
 2nd(cons1(X,cons(Y,Z))) -> Y
 from(X) -> cons(X,from(s(X)))

Problem 1: 

Infinite Processor:
-> Pairs:
 2ND(cons(X,X1)) -> 2ND(cons1(X,X1))
 FROM(X) -> FROM(s(X))
-> Rules:
 2nd(cons(X,X1)) -> 2nd(cons1(X,X1))
 2nd(cons1(X,cons(Y,Z))) -> Y
 from(X) -> cons(X,from(s(X)))
-> Pairs in cycle:
 FROM(X) -> FROM(s(X))

The problem is infinite.