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