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