MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          a__app(X1,X2) -> app(X1,X2)
          a__app(cons(X,XS),YS) -> cons(mark(X),app(XS,YS))
          a__app(nil(),YS) -> mark(YS)
          a__from(X) -> cons(mark(X),from(s(X)))
          a__from(X) -> from(X)
          a__prefix(L) -> cons(nil(),zWadr(L,prefix(L)))
          a__prefix(X) -> prefix(X)
          a__zWadr(X1,X2) -> zWadr(X1,X2)
          a__zWadr(XS,nil()) -> nil()
          a__zWadr(cons(X,XS),cons(Y,YS)) -> cons(a__app(mark(Y),cons(mark(X),nil())),zWadr(XS,YS))
          a__zWadr(nil(),YS) -> nil()
          mark(app(X1,X2)) -> a__app(mark(X1),mark(X2))
          mark(cons(X1,X2)) -> cons(mark(X1),X2)
          mark(from(X)) -> a__from(mark(X))
          mark(nil()) -> nil()
          mark(prefix(X)) -> a__prefix(mark(X))
          mark(s(X)) -> s(mark(X))
          mark(zWadr(X1,X2)) -> a__zWadr(mark(X1),mark(X2))
      - Signature:
          {a__app/2,a__from/1,a__prefix/1,a__zWadr/2,mark/1} / {app/2,cons/2,from/1,nil/0,prefix/1,s/1,zWadr/2}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {a__app,a__from,a__prefix,a__zWadr
          ,mark} and constructors {app,cons,from,nil,prefix,s,zWadr}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE