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

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 LENGTH -> LENGTH1
 LENGTH1 -> LENGTH
-> Rules:
 from(X) -> cons(X)
 length -> 0
 length -> s(length1)
 length1 -> length
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 LENGTH -> LENGTH1
 LENGTH1 -> LENGTH
->->-> Rules:
 from(X) -> cons(X)
 length -> 0
 length -> s(length1)
 length1 -> length

Problem 1: 

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

The problem is infinite.