MAYBE

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

Strict Trs:
  { isEmpty(empty()) -> true()
  , isEmpty(node(l, x, r)) -> false()
  , left(empty()) -> empty()
  , left(node(l, x, r)) -> l
  , right(empty()) -> empty()
  , right(node(l, x, r)) -> r
  , elem(node(l, x, r)) -> x
  , append(nil(), x) -> cons(x, nil())
  , append(cons(y(), ys), x) -> cons(y(), append(ys, x))
  , listify(n, xs) ->
    if(isEmpty(n),
       isEmpty(left(n)),
       right(n),
       node(left(left(n)),
            elem(left(n)),
            node(right(left(n)), elem(n), right(n))),
       xs,
       append(xs, n))
  , if(true(), b, n, m, xs, ys) -> xs
  , if(false(), true(), n, m, xs, ys) -> listify(n, ys)
  , if(false(), false(), n, m, xs, ys) -> listify(m, xs)
  , toList(n) -> listify(n, nil()) }
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..