MAYBE

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

Strict Trs:
  { a__primes() -> a__sieve(a__from(s(s(0()))))
  , a__primes() -> primes()
  , a__sieve(X) -> sieve(X)
  , a__sieve(cons(X, Y)) -> cons(mark(X), filter(X, sieve(Y)))
  , a__from(X) -> cons(mark(X), from(s(X)))
  , a__from(X) -> from(X)
  , mark(s(X)) -> s(mark(X))
  , mark(0()) -> 0()
  , mark(cons(X1, X2)) -> cons(mark(X1), X2)
  , mark(from(X)) -> a__from(mark(X))
  , mark(true()) -> true()
  , mark(false()) -> false()
  , mark(divides(X1, X2)) -> divides(mark(X1), mark(X2))
  , mark(filter(X1, X2)) -> a__filter(mark(X1), mark(X2))
  , mark(sieve(X)) -> a__sieve(mark(X))
  , mark(primes()) -> a__primes()
  , mark(head(X)) -> a__head(mark(X))
  , mark(tail(X)) -> a__tail(mark(X))
  , mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3)
  , a__head(X) -> head(X)
  , a__head(cons(X, Y)) -> mark(X)
  , a__tail(X) -> tail(X)
  , a__tail(cons(X, Y)) -> mark(Y)
  , a__if(X1, X2, X3) -> if(X1, X2, X3)
  , a__if(true(), X, Y) -> mark(X)
  , a__if(false(), X, Y) -> mark(Y)
  , a__filter(X1, X2) -> filter(X1, X2)
  , a__filter(s(s(X)), cons(Y, Z)) ->
    a__if(divides(s(s(mark(X))), mark(Y)),
          filter(s(s(X)), Z),
          cons(Y, filter(X, sieve(Y)))) }
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..