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