MAYBE

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

Strict Trs:
  { eq(0(), 0()) -> true()
  , eq(0(), s(y)) -> false()
  , eq(s(x), 0()) -> false()
  , eq(s(x), s(y)) -> eq(x, y)
  , lt(x, 0()) -> false()
  , lt(0(), s(y)) -> true()
  , lt(s(x), s(y)) -> lt(x, y)
  , bin2s(nil()) -> 0()
  , bin2s(cons(x, xs)) -> bin2ss(x, xs)
  , bin2ss(x, nil()) -> x
  , bin2ss(x, cons(0(), xs)) -> bin2ss(double(x), xs)
  , bin2ss(x, cons(1(), xs)) -> bin2ss(s(double(x)), xs)
  , half(0()) -> 0()
  , half(s(0())) -> 0()
  , half(s(s(x))) -> s(half(x))
  , log(0()) -> 0()
  , log(s(0())) -> 0()
  , log(s(s(x))) -> s(log(half(s(s(x)))))
  , more(nil()) -> nil()
  , more(cons(xs, ys)) ->
    cons(cons(0(), xs), cons(cons(1(), xs), cons(xs, ys)))
  , s2bin(x) -> s2bin1(x, 0(), cons(nil(), nil()))
  , s2bin1(x, y, lists) -> if1(lt(y, log(x)), x, y, lists)
  , if1(true(), x, y, lists) -> s2bin1(x, s(y), more(lists))
  , if1(false(), x, y, lists) -> s2bin2(x, lists)
  , s2bin2(x, nil()) -> bug_list_not()
  , s2bin2(x, cons(xs, ys)) -> if2(eq(x, bin2s(xs)), x, xs, ys)
  , if2(true(), x, xs, ys) -> xs
  , if2(false(), x, xs, ys) -> s2bin2(x, ys) }
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..