MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          min(X,0()) -> X
          min(min(X,Y),Z()) -> min(X,plus(Y,Z()))
          min(s(X),s(Y)) -> min(X,Y)
          plus(0(),Y) -> Y
          plus(s(X),Y) -> s(plus(X,Y))
          quot(0(),s(Y)) -> 0()
          quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y)))
      - Signature:
          {min/2,plus/2,quot/2} / {0/0,Z/0,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {min,plus,quot} and constructors {0,Z,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