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


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


NO

Problem 1: 

(VAR v_NonEmpty:S X:S Y:S Z:S)
(RULES
add(0,X:S) -> X:S
add(s(X:S),Y:S) -> s(add(X:S,Y:S))
from(X:S) -> cons(X:S,from(s(X:S)))
fst(0,Z:S) -> nil
fst(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,fst(X:S,Z:S))
len(cons(X:S,Z:S)) -> s(len(Z:S))
len(nil) -> 0
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ADD(s(X:S),Y:S) -> ADD(X:S,Y:S)
 FROM(X:S) -> FROM(s(X:S))
 FST(s(X:S),cons(Y:S,Z:S)) -> FST(X:S,Z:S)
 LEN(cons(X:S,Z:S)) -> LEN(Z:S)
-> Rules:
 add(0,X:S) -> X:S
 add(s(X:S),Y:S) -> s(add(X:S,Y:S))
 from(X:S) -> cons(X:S,from(s(X:S)))
 fst(0,Z:S) -> nil
 fst(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,fst(X:S,Z:S))
 len(cons(X:S,Z:S)) -> s(len(Z:S))
 len(nil) -> 0

Problem 1: 

Infinite Processor:
-> Pairs:
 ADD(s(X:S),Y:S) -> ADD(X:S,Y:S)
 FROM(X:S) -> FROM(s(X:S))
 FST(s(X:S),cons(Y:S,Z:S)) -> FST(X:S,Z:S)
 LEN(cons(X:S,Z:S)) -> LEN(Z:S)
-> Rules:
 add(0,X:S) -> X:S
 add(s(X:S),Y:S) -> s(add(X:S,Y:S))
 from(X:S) -> cons(X:S,from(s(X:S)))
 fst(0,Z:S) -> nil
 fst(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,fst(X:S,Z:S))
 len(cons(X:S,Z:S)) -> s(len(Z:S))
 len(nil) -> 0
-> Pairs in cycle:
 FROM(X:S) -> FROM(s(X:S))

The problem is infinite.