MAYBE

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

Strict Trs:
  { le(0(), Y) -> true()
  , le(s(X), 0()) -> false()
  , le(s(X), s(Y)) -> le(X, Y)
  , app(nil(), Y) -> Y
  , app(cons(N, L), Y) -> cons(N, app(L, Y))
  , low(N, nil()) -> nil()
  , low(N, cons(M, L)) -> iflow(le(M, N), N, cons(M, L))
  , iflow(true(), N, cons(M, L)) -> cons(M, low(N, L))
  , iflow(false(), N, cons(M, L)) -> low(N, L)
  , high(N, nil()) -> nil()
  , high(N, cons(M, L)) -> ifhigh(le(M, N), N, cons(M, L))
  , ifhigh(true(), N, cons(M, L)) -> high(N, L)
  , ifhigh(false(), N, cons(M, L)) -> cons(M, high(N, L))
  , quicksort(nil()) -> nil()
  , quicksort(cons(N, L)) ->
    app(quicksort(low(N, L)), cons(N, quicksort(high(N, L)))) }
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) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
            following reason:
            
            The input cannot be shown compatible
         
         2) 'Polynomial Path Order (PS) (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..