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