/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
fcons(X:S,Z:S) -> cons(X:S)
first(0,Z:S) -> nil
first(s(X:S),cons(Y:S)) -> cons(Y:S)
first1(0,Z:S) -> nil1
first1(s(X:S),cons(Y:S)) -> cons1(quote,first1(X:S,Z:S))
from(X:S) -> cons(X:S)
quote -> sel1(X:S,Z:S)
quote -> 01
quote -> s1(quote)
quote1 -> first1(X:S,Z:S)
quote1 -> cons1(quote,quote1)
quote1 -> nil1
sel(0,cons(X:S)) -> X:S
sel(s(X:S),cons(Y:S)) -> sel(X:S,Z:S)
sel1(0,cons(X:S)) -> quote
sel1(s(X:S),cons(Y:S)) -> sel1(X:S,Z:S)
unquote(01) -> 0
unquote(s1(X:S)) -> s(unquote(X:S))
unquote1(cons1(X:S,Z:S)) -> fcons(unquote(X:S),unquote1(Z:S))
unquote1(nil1) -> nil
)

Problem 1: 

Extra Variables Processor:
-> Rules:
 fcons(X:S,Z:S) -> cons(X:S)
 first(0,Z:S) -> nil
 first(s(X:S),cons(Y:S)) -> cons(Y:S)
 first1(0,Z:S) -> nil1
 first1(s(X:S),cons(Y:S)) -> cons1(quote,first1(X:S,Z:S))
 from(X:S) -> cons(X:S)
 quote -> sel1(X:S,Z:S)
 quote -> 01
 quote -> s1(quote)
 quote1 -> first1(X:S,Z:S)
 quote1 -> cons1(quote,quote1)
 quote1 -> nil1
 sel(0,cons(X:S)) -> X:S
 sel(s(X:S),cons(Y:S)) -> sel(X:S,Z:S)
 sel1(0,cons(X:S)) -> quote
 sel1(s(X:S),cons(Y:S)) -> sel1(X:S,Z:S)
 unquote(01) -> 0
 unquote(s1(X:S)) -> s(unquote(X:S))
 unquote1(cons1(X:S,Z:S)) -> fcons(unquote(X:S),unquote1(Z:S))
 unquote1(nil1) -> nil
-> The system has extra variables.

The problem is infinite.