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


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


NO

Problem 1: 

(VAR v_NonEmpty:S X:S Y:S Z:S)
(RULES
dbl(0) -> 0
dbl(s(X:S)) -> s(s(dbl(X:S)))
dbl1(0) -> 01
dbl1(s(X:S)) -> s1(s1(dbl1(X:S)))
dbls(cons(X:S,Y:S)) -> cons(dbl(X:S),dbls(Y:S))
dbls(nil) -> nil
from(X:S) -> cons(X:S,from(s(X:S)))
indx(cons(X:S,Y:S),Z:S) -> cons(sel(X:S,Z:S),indx(Y:S,Z:S))
indx(nil,X:S) -> nil
quote(dbl(X:S)) -> dbl1(X:S)
quote(sel(X:S,Y:S)) -> sel1(X:S,Y:S)
quote(0) -> 01
quote(s(X:S)) -> s1(quote(X:S))
sel(0,cons(X:S,Y:S)) -> X:S
sel(s(X:S),cons(Y:S,Z:S)) -> sel(X:S,Z:S)
sel1(0,cons(X:S,Y:S)) -> X:S
sel1(s(X:S),cons(Y:S,Z:S)) -> sel1(X:S,Z:S)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 DBL(s(X:S)) -> DBL(X:S)
 DBL1(s(X:S)) -> DBL1(X:S)
 DBLS(cons(X:S,Y:S)) -> DBL(X:S)
 DBLS(cons(X:S,Y:S)) -> DBLS(Y:S)
 FROM(X:S) -> FROM(s(X:S))
 INDX(cons(X:S,Y:S),Z:S) -> INDX(Y:S,Z:S)
 INDX(cons(X:S,Y:S),Z:S) -> SEL(X:S,Z:S)
 QUOTE(dbl(X:S)) -> DBL1(X:S)
 QUOTE(sel(X:S,Y:S)) -> SEL1(X:S,Y:S)
 QUOTE(s(X:S)) -> QUOTE(X:S)
 SEL(s(X:S),cons(Y:S,Z:S)) -> SEL(X:S,Z:S)
 SEL1(s(X:S),cons(Y:S,Z:S)) -> SEL1(X:S,Z:S)
-> Rules:
 dbl(0) -> 0
 dbl(s(X:S)) -> s(s(dbl(X:S)))
 dbl1(0) -> 01
 dbl1(s(X:S)) -> s1(s1(dbl1(X:S)))
 dbls(cons(X:S,Y:S)) -> cons(dbl(X:S),dbls(Y:S))
 dbls(nil) -> nil
 from(X:S) -> cons(X:S,from(s(X:S)))
 indx(cons(X:S,Y:S),Z:S) -> cons(sel(X:S,Z:S),indx(Y:S,Z:S))
 indx(nil,X:S) -> nil
 quote(dbl(X:S)) -> dbl1(X:S)
 quote(sel(X:S,Y:S)) -> sel1(X:S,Y:S)
 quote(0) -> 01
 quote(s(X:S)) -> s1(quote(X:S))
 sel(0,cons(X:S,Y:S)) -> X:S
 sel(s(X:S),cons(Y:S,Z:S)) -> sel(X:S,Z:S)
 sel1(0,cons(X:S,Y:S)) -> X:S
 sel1(s(X:S),cons(Y:S,Z:S)) -> sel1(X:S,Z:S)

Problem 1: 

Infinite Processor:
-> Pairs:
 DBL(s(X:S)) -> DBL(X:S)
 DBL1(s(X:S)) -> DBL1(X:S)
 DBLS(cons(X:S,Y:S)) -> DBL(X:S)
 DBLS(cons(X:S,Y:S)) -> DBLS(Y:S)
 FROM(X:S) -> FROM(s(X:S))
 INDX(cons(X:S,Y:S),Z:S) -> INDX(Y:S,Z:S)
 INDX(cons(X:S,Y:S),Z:S) -> SEL(X:S,Z:S)
 QUOTE(dbl(X:S)) -> DBL1(X:S)
 QUOTE(sel(X:S,Y:S)) -> SEL1(X:S,Y:S)
 QUOTE(s(X:S)) -> QUOTE(X:S)
 SEL(s(X:S),cons(Y:S,Z:S)) -> SEL(X:S,Z:S)
 SEL1(s(X:S),cons(Y:S,Z:S)) -> SEL1(X:S,Z:S)
-> Rules:
 dbl(0) -> 0
 dbl(s(X:S)) -> s(s(dbl(X:S)))
 dbl1(0) -> 01
 dbl1(s(X:S)) -> s1(s1(dbl1(X:S)))
 dbls(cons(X:S,Y:S)) -> cons(dbl(X:S),dbls(Y:S))
 dbls(nil) -> nil
 from(X:S) -> cons(X:S,from(s(X:S)))
 indx(cons(X:S,Y:S),Z:S) -> cons(sel(X:S,Z:S),indx(Y:S,Z:S))
 indx(nil,X:S) -> nil
 quote(dbl(X:S)) -> dbl1(X:S)
 quote(sel(X:S,Y:S)) -> sel1(X:S,Y:S)
 quote(0) -> 01
 quote(s(X:S)) -> s1(quote(X:S))
 sel(0,cons(X:S,Y:S)) -> X:S
 sel(s(X:S),cons(Y:S,Z:S)) -> sel(X:S,Z:S)
 sel1(0,cons(X:S,Y:S)) -> X:S
 sel1(s(X:S),cons(Y:S,Z:S)) -> sel1(X:S,Z:S)
-> Pairs in cycle:
 FROM(X:S) -> FROM(s(X:S))

The problem is infinite.