MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          active(cons(X1,X2)) -> cons(active(X1),X2)
          active(tail(X)) -> tail(active(X))
          active(tail(cons(X,XS))) -> mark(XS)
          active(zeros()) -> mark(cons(0(),zeros()))
          cons(mark(X1),X2) -> mark(cons(X1,X2))
          cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
          proper(0()) -> ok(0())
          proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
          proper(tail(X)) -> tail(proper(X))
          proper(zeros()) -> ok(zeros())
          tail(mark(X)) -> mark(tail(X))
          tail(ok(X)) -> ok(tail(X))
          top(mark(X)) -> top(proper(X))
          top(ok(X)) -> top(active(X))
      - Signature:
          {active/1,cons/2,proper/1,tail/1,top/1} / {0/0,mark/1,ok/1,zeros/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {active,cons,proper,tail,top} and constructors {0,mark,ok
          ,zeros}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE