MAYBE

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

Strict Trs:
  { from(X) -> cons(X, n__from(s(X)))
  , from(X) -> n__from(X)
  , sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
  , sel(0(), cons(X, XS)) -> X
  , activate(X) -> X
  , activate(n__from(X)) -> from(X)
  , activate(n__zWquot(X1, X2)) -> zWquot(X1, X2)
  , minus(X, 0()) -> 0()
  , minus(s(X), s(Y)) -> minus(X, Y)
  , quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
  , quot(0(), s(Y)) -> 0()
  , zWquot(X1, X2) -> n__zWquot(X1, X2)
  , zWquot(XS, nil()) -> nil()
  , zWquot(cons(X, XS), cons(Y, YS)) ->
    cons(quot(X, Y), n__zWquot(activate(XS), activate(YS)))
  , zWquot(nil(), XS) -> 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) '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..