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


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


NO

Problem 1: 

(VAR L X XS Y YS)
(RULES
app(cons(X,XS),YS) -> cons(X,app(XS,YS))
app(nil,YS) -> YS
from(X) -> cons(X,from(s(X)))
prefix(L) -> cons(nil,zWadr(L,prefix(L)))
zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,nil)),zWadr(XS,YS))
zWadr(nil,YS) -> nil
zWadr(XS,nil) -> nil
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 APP(cons(X,XS),YS) -> APP(XS,YS)
 FROM(X) -> FROM(s(X))
 PREFIX(L) -> PREFIX(L)
 PREFIX(L) -> ZWADR(L,prefix(L))
 ZWADR(cons(X,XS),cons(Y,YS)) -> APP(Y,cons(X,nil))
 ZWADR(cons(X,XS),cons(Y,YS)) -> ZWADR(XS,YS)
-> Rules:
 app(cons(X,XS),YS) -> cons(X,app(XS,YS))
 app(nil,YS) -> YS
 from(X) -> cons(X,from(s(X)))
 prefix(L) -> cons(nil,zWadr(L,prefix(L)))
 zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,nil)),zWadr(XS,YS))
 zWadr(nil,YS) -> nil
 zWadr(XS,nil) -> nil

Problem 1: 

Infinite Processor:
-> Pairs:
 APP(cons(X,XS),YS) -> APP(XS,YS)
 FROM(X) -> FROM(s(X))
 PREFIX(L) -> PREFIX(L)
 PREFIX(L) -> ZWADR(L,prefix(L))
 ZWADR(cons(X,XS),cons(Y,YS)) -> APP(Y,cons(X,nil))
 ZWADR(cons(X,XS),cons(Y,YS)) -> ZWADR(XS,YS)
-> Rules:
 app(cons(X,XS),YS) -> cons(X,app(XS,YS))
 app(nil,YS) -> YS
 from(X) -> cons(X,from(s(X)))
 prefix(L) -> cons(nil,zWadr(L,prefix(L)))
 zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,nil)),zWadr(XS,YS))
 zWadr(nil,YS) -> nil
 zWadr(XS,nil) -> nil
-> Pairs in cycle:
 FROM(X) -> FROM(s(X))
 PREFIX(L) -> PREFIX(L)

The problem is infinite.