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