/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
dbl(0) -> 0
dbl(s) -> s
dbl1(0) -> 01
dbl1(s) -> s1(s1(dbl1(X)))
dbls(cons) -> cons
dbls(nil) -> nil
from -> cons
indx(cons) -> cons
indx(nil) -> nil
quote(dbl(X)) -> dbl1(X)
quote(sel(X,Y)) -> sel1(X,Y)
quote(0) -> 01
quote(s) -> s1(quote(X))
sel(0,cons) -> X
sel(s,cons) -> sel(X,Z)
sel1(0,cons) -> X
sel1(s,cons) -> sel1(X,Z)
)

Problem 1: 

Extra Variables Processor:
-> Rules:
 dbl(0) -> 0
 dbl(s) -> s
 dbl1(0) -> 01
 dbl1(s) -> s1(s1(dbl1(X)))
 dbls(cons) -> cons
 dbls(nil) -> nil
 from -> cons
 indx(cons) -> cons
 indx(nil) -> nil
 quote(dbl(X)) -> dbl1(X)
 quote(sel(X,Y)) -> sel1(X,Y)
 quote(0) -> 01
 quote(s) -> s1(quote(X))
 sel(0,cons) -> X
 sel(s,cons) -> sel(X,Z)
 sel1(0,cons) -> X
 sel1(s,cons) -> sel1(X,Z)
-> The system has extra variables.

The problem is infinite.