MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
          greaters(x,nil()) -> nil()
          lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
          lowers(x,nil()) -> nil()
          qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
          qsort(nil()) -> nil()
      - Signature:
          {greaters/2,lowers/2,qsort/1} / {++/2,./2,<=/2,if/3,nil/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {greaters,lowers,qsort} and constructors {++,.,<=,if,nil}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE