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