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(add(n, x), y) -> add(n, app(x, y))
  , low(n, nil()) -> nil()
  , low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
  , if_low(true(), n, add(m, x)) -> add(m, low(n, x))
  , if_low(false(), n, add(m, x)) -> low(n, x)
  , high(n, nil()) -> nil()
  , high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
  , if_high(true(), n, add(m, x)) -> high(n, x)
  , if_high(false(), n, add(m, x)) -> add(m, high(n, x))
  , head(add(n, x)) -> n
  , tail(add(n, x)) -> x
  , isempty(nil()) -> true()
  , isempty(add(n, x)) -> false()
  , quicksort(x) ->
    if_qs(isempty(x),
          low(head(x), tail(x)),
          head(x),
          high(head(x), tail(x)))
  , if_qs(true(), x, n, y) -> nil()
  , if_qs(false(), x, n, y) ->
    app(quicksort(x), add(n, quicksort(y))) }
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..