/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 Y)
(RULES
from(X) -> cons(X)
minus(s(X),s(Y)) -> minus(X,Y)
minus(X,0) -> 0
quot(0,s(Y)) -> 0
quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
sel(0,cons(X)) -> X
sel(s(N),cons(X)) -> sel(N,XS)
zWquot(cons(X),cons(Y)) -> cons(quot(X,Y))
zWquot(nil,XS) -> nil
zWquot(XS,nil) -> nil
)

Problem 1: 

Extra Variables Processor:
-> Rules:
 from(X) -> cons(X)
 minus(s(X),s(Y)) -> minus(X,Y)
 minus(X,0) -> 0
 quot(0,s(Y)) -> 0
 quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
 sel(0,cons(X)) -> X
 sel(s(N),cons(X)) -> sel(N,XS)
 zWquot(cons(X),cons(Y)) -> cons(quot(X,Y))
 zWquot(nil,XS) -> nil
 zWquot(XS,nil) -> nil
-> The system has extra variables.

The problem is infinite.