MAYBE

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

Strict Trs:
  { minsort(Nil()) -> Nil()
  , minsort(Cons(x, xs)) -> appmin(x, xs, Cons(x, xs))
  , appmin(min, Nil(), xs) -> Cons(min, minsort(remove(min, xs)))
  , appmin(min, Cons(x, xs), xs') ->
    appmin[Ite][True][Ite](<(x, min), min, Cons(x, xs), xs')
  , remove(x, Nil()) -> Nil()
  , remove(x', Cons(x, xs)) ->
    remove[Ite][True][Ite](!EQ(x', x), x', Cons(x, xs))
  , notEmpty(Nil()) -> False()
  , notEmpty(Cons(x, xs)) -> True()
  , goal(xs) -> minsort(xs) }
Weak Trs:
  { remove[Ite][True][Ite](True(), x', Cons(x, xs)) -> xs
  , remove[Ite][True][Ite](False(), x', Cons(x, xs)) ->
    Cons(x, remove(x', xs))
  , !EQ(S(x), S(y)) -> !EQ(x, y)
  , !EQ(S(x), 0()) -> False()
  , !EQ(0(), S(y)) -> False()
  , !EQ(0(), 0()) -> True()
  , <(x, 0()) -> False()
  , <(S(x), S(y)) -> <(x, y)
  , <(0(), S(y)) -> True()
  , appmin[Ite][True][Ite](True(), min, Cons(x, xs), xs') ->
    appmin(x, xs, xs')
  , appmin[Ite][True][Ite](False(), min, Cons(x, xs), xs') ->
    appmin(min, xs, xs') }
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..