/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 X1 X2 XS Y YS)
(RULES
activate(n__app(X1,X2)) -> app(X1,X2)
activate(n__from(X)) -> from(X)
activate(n__nil) -> nil
activate(n__zWadr(X1,X2)) -> zWadr(X1,X2)
activate(X) -> X
app(nil,YS) -> YS
app(cons(X,XS),YS) -> cons(X,n__app(activate(XS),YS))
app(X1,X2) -> n__app(X1,X2)
from(X) -> cons(X,n__from(s(X)))
from(X) -> n__from(X)
nil -> n__nil
prefix(L) -> cons(nil,n__zWadr(L,prefix(L)))
zWadr(nil,YS) -> nil
zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,n__nil)),n__zWadr(activate(XS),activate(YS)))
zWadr(X1,X2) -> n__zWadr(X1,X2)
zWadr(XS,nil) -> nil
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__app(X1,X2)) -> APP(X1,X2)
 ACTIVATE(n__from(X)) -> FROM(X)
 ACTIVATE(n__nil) -> NIL
 ACTIVATE(n__zWadr(X1,X2)) -> ZWADR(X1,X2)
 APP(cons(X,XS),YS) -> ACTIVATE(XS)
 PREFIX(L) -> NIL
 PREFIX(L) -> PREFIX(L)
 ZWADR(cons(X,XS),cons(Y,YS)) -> ACTIVATE(XS)
 ZWADR(cons(X,XS),cons(Y,YS)) -> ACTIVATE(YS)
 ZWADR(cons(X,XS),cons(Y,YS)) -> APP(Y,cons(X,n__nil))
-> Rules:
 activate(n__app(X1,X2)) -> app(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__nil) -> nil
 activate(n__zWadr(X1,X2)) -> zWadr(X1,X2)
 activate(X) -> X
 app(nil,YS) -> YS
 app(cons(X,XS),YS) -> cons(X,n__app(activate(XS),YS))
 app(X1,X2) -> n__app(X1,X2)
 from(X) -> cons(X,n__from(s(X)))
 from(X) -> n__from(X)
 nil -> n__nil
 prefix(L) -> cons(nil,n__zWadr(L,prefix(L)))
 zWadr(nil,YS) -> nil
 zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,n__nil)),n__zWadr(activate(XS),activate(YS)))
 zWadr(X1,X2) -> n__zWadr(X1,X2)
 zWadr(XS,nil) -> nil

Problem 1: 

Infinite Processor:
-> Pairs:
 ACTIVATE(n__app(X1,X2)) -> APP(X1,X2)
 ACTIVATE(n__from(X)) -> FROM(X)
 ACTIVATE(n__nil) -> NIL
 ACTIVATE(n__zWadr(X1,X2)) -> ZWADR(X1,X2)
 APP(cons(X,XS),YS) -> ACTIVATE(XS)
 PREFIX(L) -> NIL
 PREFIX(L) -> PREFIX(L)
 ZWADR(cons(X,XS),cons(Y,YS)) -> ACTIVATE(XS)
 ZWADR(cons(X,XS),cons(Y,YS)) -> ACTIVATE(YS)
 ZWADR(cons(X,XS),cons(Y,YS)) -> APP(Y,cons(X,n__nil))
-> Rules:
 activate(n__app(X1,X2)) -> app(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__nil) -> nil
 activate(n__zWadr(X1,X2)) -> zWadr(X1,X2)
 activate(X) -> X
 app(nil,YS) -> YS
 app(cons(X,XS),YS) -> cons(X,n__app(activate(XS),YS))
 app(X1,X2) -> n__app(X1,X2)
 from(X) -> cons(X,n__from(s(X)))
 from(X) -> n__from(X)
 nil -> n__nil
 prefix(L) -> cons(nil,n__zWadr(L,prefix(L)))
 zWadr(nil,YS) -> nil
 zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,n__nil)),n__zWadr(activate(XS),activate(YS)))
 zWadr(X1,X2) -> n__zWadr(X1,X2)
 zWadr(XS,nil) -> nil
-> Pairs in cycle:
 PREFIX(L) -> PREFIX(L)

The problem is infinite.