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