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