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