MAYBE

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

Strict Trs:
  { from(X) -> cons(X, n__from(n__s(X)))
  , from(X) -> n__from(X)
  , sel(0(), cons(X, Y)) -> X
  , sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
  , s(X) -> n__s(X)
  , activate(X) -> X
  , activate(n__from(X)) -> from(activate(X))
  , activate(n__s(X)) -> s(activate(X)) }
Obligation:
  runtime complexity
Answer:
  MAYBE

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:
      
      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) 'WithProblem' failed due to the following reason:
         
         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) 'Fastest' failed due to the following reason:
            
            None of the processors succeeded.
            
            Details of failed attempt(s):
            -----------------------------
            1) 'WithProblem' failed due to the following reason:
               
               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) 'WithProblem' failed due to the following reason:
                  
                  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) 'WithProblem' failed due to the following reason:
                     
                     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) 'WithProblem' failed due to the following reason:
                        
                        Empty strict component of the problem is NOT empty.
                     
                  
               
            
            2) 'WithProblem' failed due to the following reason:
               
               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) 'WithProblem' 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) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
         to the following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
      2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
         following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
   
   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 perSymbol-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
      2) 'Bounds with minimal-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
   

3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { from^#(X) -> c_1(X, X)
     , from^#(X) -> c_2(X)
     , sel^#(0(), cons(X, Y)) -> c_3(X)
     , sel^#(s(X), cons(Y, Z)) -> c_4(sel^#(X, activate(Z)))
     , s^#(X) -> c_5(X)
     , activate^#(X) -> c_6(X)
     , activate^#(n__from(X)) -> c_7(from^#(activate(X)))
     , activate^#(n__s(X)) -> c_8(s^#(activate(X))) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { from^#(X) -> c_1(X, X)
     , from^#(X) -> c_2(X)
     , sel^#(0(), cons(X, Y)) -> c_3(X)
     , sel^#(s(X), cons(Y, Z)) -> c_4(sel^#(X, activate(Z)))
     , s^#(X) -> c_5(X)
     , activate^#(X) -> c_6(X)
     , activate^#(n__from(X)) -> c_7(from^#(activate(X)))
     , activate^#(n__s(X)) -> c_8(s^#(activate(X))) }
   Strict Trs:
     { from(X) -> cons(X, n__from(n__s(X)))
     , from(X) -> n__from(X)
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
     , s(X) -> n__s(X)
     , activate(X) -> X
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X)) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..