MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { part(x, Nil(), xs1, xs2) -> app(quicksort(xs1), quicksort(xs2))
  , part(x', Cons(x, xs), xs1, xs2) ->
    part[Ite][True][Ite](>(x', x), x', Cons(x, xs), xs1, xs2)
  , app(Nil(), ys) -> ys
  , app(Cons(x, xs), ys) -> Cons(x, app(xs, ys))
  , quicksort(Nil()) -> Nil()
  , quicksort(Cons(x, Nil())) -> Cons(x, Nil())
  , quicksort(Cons(x, Cons(x', xs))) ->
    part(x, Cons(x, Cons(x', xs)), Cons(x, Nil()), Nil())
  , notEmpty(Nil()) -> False()
  , notEmpty(Cons(x, xs)) -> True()
  , goal(xs) -> quicksort(xs) }
Weak Trs:
  { part[Ite][True][Ite](True(), x', Cons(x, xs), xs1, xs2) ->
    part(x', xs, Cons(x, xs1), xs2)
  , part[Ite][True][Ite](False(), x', Cons(x, xs), xs1, xs2) ->
    part[Ite][True][Ite][False][Ite](<(x', x),
                                     x',
                                     Cons(x, xs),
                                     xs1,
                                     xs2)
  , >(S(x), S(y)) -> >(x, y)
  , >(S(x), 0()) -> True()
  , >(0(), y) -> False()
  , <(x, 0()) -> False()
  , <(S(x), S(y)) -> <(x, y)
  , <(0(), S(y)) -> True() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
   
   Empty strict component of the problem is NOT empty.

2) 'Best' failed due to the following reason:
   
   None of the processors succeeded.
   
   Details of failed attempt(s):
   -----------------------------
   1) 'WithProblem (timeout of 60 seconds)' failed due to the
      following reason:
      
      Computation stopped due to timeout after 60.0 seconds.
   
   2) 'Best' failed due to the following reason:
      
      None of the processors succeeded.
      
      Details of failed attempt(s):
      -----------------------------
      1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)'
         failed due to the following reason:
         
         Computation stopped due to timeout after 30.0 seconds.
      
      2) 'Best' failed due to the following reason:
         
         None of the processors succeeded.
         
         Details of failed attempt(s):
         -----------------------------
         1) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
            to the following reason:
            
            The input cannot be shown compatible
         
         2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
            following reason:
            
            The input cannot be shown compatible
         
      
      3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed
         due to the following reason:
         
         None of the processors succeeded.
         
         Details of failed attempt(s):
         -----------------------------
         1) 'Bounds with minimal-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
      
   


Arrrr..