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


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


NO

Problem 1: 

(RULES
f(0) -> cons(0,f(s(0)))
f(s(0)) -> f(p(s(0)))
p(s(0)) -> 0
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(0) -> F(s(0))
 F(s(0)) -> F(p(s(0)))
 F(s(0)) -> P(s(0))
-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(0)) -> 0

Problem 1: 

SCC Processor:
-> Pairs:
 F(0) -> F(s(0))
 F(s(0)) -> F(p(s(0)))
 F(s(0)) -> P(s(0))
-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(0)) -> 0
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(0) -> F(s(0))
 F(s(0)) -> F(p(s(0)))
->->-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(0)) -> 0

Problem 1: 

Infinite Processor:
-> Pairs:
 F(0) -> F(s(0))
 F(s(0)) -> F(p(s(0)))
-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(0)) -> 0
-> Pairs in cycle:
 F(p(s(0))) -> F(0)
 F(0) -> F(s(0))
 F(s(0)) -> F(p(s(0)))

The problem is infinite.