MAYBE

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

Strict Trs:
  { sort(l) -> st(0(), l)
  , st(n, l) -> cond1(member(n, l), n, l)
  , cond1(true(), n, l) -> cons(n, st(s(n), l))
  , cond1(false(), n, l) -> cond2(gt(n, max(l)), n, l)
  , member(n, cons(m, l)) -> or(equal(n, m), member(n, l))
  , member(n, nil()) -> false()
  , cond2(true(), n, l) -> nil()
  , cond2(false(), n, l) -> st(s(n), l)
  , gt(0(), v) -> false()
  , gt(s(u), 0()) -> true()
  , gt(s(u), s(v)) -> gt(u, v)
  , max(cons(u, l)) -> if(gt(u, max(l)), u, max(l))
  , max(nil()) -> 0()
  , or(x, true()) -> true()
  , or(x, false()) -> x
  , equal(0(), 0()) -> true()
  , equal(0(), s(y)) -> false()
  , equal(s(x), 0()) -> false()
  , equal(s(x), s(y)) -> equal(x, y)
  , if(true(), u, v) -> u
  , if(false(), u, v) -> v }
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..