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


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


NO

Problem 1: 

(VAR v_NonEmpty:S X:S Y:S)
(RULES
from(X:S) -> cons(X:S,from(s(X:S)))
length(cons(X:S,Y:S)) -> s(length1(Y:S))
length(nil) -> 0
length1(X:S) -> length(X:S)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 FROM(X:S) -> FROM(s(X:S))
 LENGTH(cons(X:S,Y:S)) -> LENGTH1(Y:S)
 LENGTH1(X:S) -> LENGTH(X:S)
-> Rules:
 from(X:S) -> cons(X:S,from(s(X:S)))
 length(cons(X:S,Y:S)) -> s(length1(Y:S))
 length(nil) -> 0
 length1(X:S) -> length(X:S)

Problem 1: 

Infinite Processor:
-> Pairs:
 FROM(X:S) -> FROM(s(X:S))
 LENGTH(cons(X:S,Y:S)) -> LENGTH1(Y:S)
 LENGTH1(X:S) -> LENGTH(X:S)
-> Rules:
 from(X:S) -> cons(X:S,from(s(X:S)))
 length(cons(X:S,Y:S)) -> s(length1(Y:S))
 length(nil) -> 0
 length1(X:S) -> length(X:S)
-> Pairs in cycle:
 FROM(X:S) -> FROM(s(X:S))

The problem is infinite.