MAYBE

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

Strict Trs:
  { lessElements(l, t) -> lessE(l, t, 0())
  , lessE(l, t, n) ->
    if(le(length(l), n), le(length(toList(t)), n), l, t, n)
  , if(true(), b, l, t, n) -> l
  , if(false(), true(), l, t, n) -> t
  , if(false(), false(), l, t, n) -> lessE(l, t, s(n))
  , le(0(), m) -> true()
  , le(s(n), 0()) -> false()
  , le(s(n), s(m)) -> le(n, m)
  , length(nil()) -> 0()
  , length(cons(n, l)) -> s(length(l))
  , toList(leaf()) -> nil()
  , toList(node(t1, n, t2)) ->
    append(toList(t1), cons(n, toList(t2)))
  , append(nil(), l2) -> l2
  , append(cons(n, l1), l2) -> cons(n, append(l1, l2))
  , a() -> c()
  , a() -> d() }
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..