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


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


NO

Problem 1: 

(VAR N X XS)
(RULES
after(0,XS) -> XS
after(s(N),cons(X,XS)) -> after(N,XS)
from(X) -> cons(X,from(s(X)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 AFTER(s(N),cons(X,XS)) -> AFTER(N,XS)
 FROM(X) -> FROM(s(X))
-> Rules:
 after(0,XS) -> XS
 after(s(N),cons(X,XS)) -> after(N,XS)
 from(X) -> cons(X,from(s(X)))

Problem 1: 

Infinite Processor:
-> Pairs:
 AFTER(s(N),cons(X,XS)) -> AFTER(N,XS)
 FROM(X) -> FROM(s(X))
-> Rules:
 after(0,XS) -> XS
 after(s(N),cons(X,XS)) -> after(N,XS)
 from(X) -> cons(X,from(s(X)))
-> Pairs in cycle:
 FROM(X) -> FROM(s(X))

The problem is infinite.