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