MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          app(Cons(x,xs),ys) -> Cons(x,app(xs,ys))
          app(Nil(),ys) -> ys
          notEmpty(Cons(x,xs)) -> True()
          notEmpty(Nil()) -> False()
          part(x,Nil(),xs1,xs2) -> app(xs1,xs2)
          part(x',Cons(x,xs),xs1,xs2) -> part[Ite](>(x',x),x',Cons(x,xs),xs1,xs2)
          qs(x',Cons(x,xs)) -> app(Cons(x,Nil()),Cons(x',quicksort(xs)))
          quicksort(Cons(x,Cons(x',xs))) -> qs(x,part(x,Cons(x',xs),Nil(),Nil()))
          quicksort(Cons(x,Nil())) -> Cons(x,Nil())
          quicksort(Nil()) -> Nil()
      - Weak TRS:
          <(x,0()) -> False()
          <(0(),S(y)) -> True()
          <(S(x),S(y)) -> <(x,y)
          >(0(),y) -> False()
          >(S(x),0()) -> True()
          >(S(x),S(y)) -> >(x,y)
          part[False][Ite](False(),x',Cons(x,xs),xs1,xs2) -> part(x',xs,xs1,xs2)
          part[False][Ite](True(),x',Cons(x,xs),xs1,xs2) -> part(x',xs,xs1,Cons(x,xs2))
          part[Ite](False(),x',Cons(x,xs),xs1,xs2) -> part[False][Ite](<(x',x),x',Cons(x,xs),xs1,xs2)
          part[Ite](True(),x',Cons(x,xs),xs1,xs2) -> part(x',xs,Cons(x,xs1),xs2)
      - Signature:
          {</2,>/2,app/2,notEmpty/1,part/4,part[False][Ite]/5,part[Ite]/5,qs/2,quicksort/1} / {0/0,Cons/2,False/0
          ,Nil/0,S/1,True/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {<,>,app,notEmpty,part,part[False][Ite],part[Ite],qs
          ,quicksort} and constructors {0,Cons,False,Nil,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