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

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 FIRST(s(X),cons(Y,Z)) -> FIRST(X,Z)
 FROM(X) -> FROM(s(X))
 SEL(s(X),cons(Y,Z)) -> SEL(X,Z)
-> Rules:
 first(0,Z) -> nil
 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
 from(X) -> cons(X,from(s(X)))
 sel(0,cons(X,Z)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,Z)

Problem 1: 

Infinite Processor:
-> Pairs:
 FIRST(s(X),cons(Y,Z)) -> FIRST(X,Z)
 FROM(X) -> FROM(s(X))
 SEL(s(X),cons(Y,Z)) -> SEL(X,Z)
-> Rules:
 first(0,Z) -> nil
 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
 from(X) -> cons(X,from(s(X)))
 sel(0,cons(X,Z)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,Z)
-> Pairs in cycle:
 FROM(X) -> FROM(s(X))

The problem is infinite.