MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          f(0()) -> 0()
          f(s(x)) -> s(f(f(p(s(x)))))
          p(s(x)) -> x
      - Signature:
          {f/1,p/1} / {0/0,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {f,p} and constructors {0,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