MAYBE

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

Strict Trs:
  { a__dbl(X) -> dbl(X)
  , a__dbl(0()) -> 0()
  , a__dbl(s(X)) -> s(s(dbl(X)))
  , a__dbls(X) -> dbls(X)
  , a__dbls(nil()) -> nil()
  , a__dbls(cons(X, Y)) -> cons(dbl(X), dbls(Y))
  , a__sel(X1, X2) -> sel(X1, X2)
  , a__sel(0(), cons(X, Y)) -> mark(X)
  , a__sel(s(X), cons(Y, Z)) -> a__sel(mark(X), mark(Z))
  , mark(0()) -> 0()
  , mark(s(X)) -> s(X)
  , mark(dbl(X)) -> a__dbl(mark(X))
  , mark(nil()) -> nil()
  , mark(cons(X1, X2)) -> cons(X1, X2)
  , mark(dbls(X)) -> a__dbls(mark(X))
  , mark(sel(X1, X2)) -> a__sel(mark(X1), mark(X2))
  , mark(indx(X1, X2)) -> a__indx(mark(X1), X2)
  , mark(from(X)) -> a__from(X)
  , a__indx(X1, X2) -> indx(X1, X2)
  , a__indx(nil(), X) -> nil()
  , a__indx(cons(X, Y), Z) -> cons(sel(X, Z), indx(Y, Z))
  , a__from(X) -> cons(X, from(s(X)))
  , a__from(X) -> from(X) }
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..