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


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


NO

Problem 1: 

(VAR x y z)
(RULES
cons(x,cons(y,z)) -> big
inf(x) -> cons(x,inf(s(x)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 INF(x) -> CONS(x,inf(s(x)))
 INF(x) -> INF(s(x))
-> Rules:
 cons(x,cons(y,z)) -> big
 inf(x) -> cons(x,inf(s(x)))

Problem 1: 

Infinite Processor:
-> Pairs:
 INF(x) -> CONS(x,inf(s(x)))
 INF(x) -> INF(s(x))
-> Rules:
 cons(x,cons(y,z)) -> big
 inf(x) -> cons(x,inf(s(x)))
-> Pairs in cycle:
 INF(x) -> INF(s(x))

The problem is infinite.