/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
f(X) -> cons(X,f(g(X)))
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
sel(0,cons(X,Y)) -> X
sel(s(X),cons(Y,Z)) -> sel(X,Z)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(X) -> F(g(X))
 F(X) -> G(X)
 G(s(X)) -> G(X)
 SEL(s(X),cons(Y,Z)) -> SEL(X,Z)
-> Rules:
 f(X) -> cons(X,f(g(X)))
 g(0) -> s(0)
 g(s(X)) -> s(s(g(X)))
 sel(0,cons(X,Y)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,Z)

Problem 1: 

Infinite Processor:
-> Pairs:
 F(X) -> F(g(X))
 F(X) -> G(X)
 G(s(X)) -> G(X)
 SEL(s(X),cons(Y,Z)) -> SEL(X,Z)
-> Rules:
 f(X) -> cons(X,f(g(X)))
 g(0) -> s(0)
 g(s(X)) -> s(s(g(X)))
 sel(0,cons(X,Y)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,Z)
-> Pairs in cycle:
 F(X) -> F(g(X))

The problem is infinite.