/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 Y)
(RULES
from(X) -> cons(X,from(s(X)))
length(cons(X,Y)) -> s(length1(Y))
length(nil) -> 0
length1(X) -> length(X)
)

Problem 1: 

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

Problem 1: 

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

The problem is infinite.