MAYBE

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

Strict Trs:
  { 2nd(cons(X, n__cons(Y, Z))) -> activate(Y)
  , cons(X1, X2) -> n__cons(X1, X2)
  , activate(X) -> X
  , activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
  , activate(n__from(X)) -> from(activate(X))
  , activate(n__s(X)) -> s(activate(X))
  , from(X) -> cons(X, n__from(n__s(X)))
  , from(X) -> n__from(X)
  , s(X) -> n__s(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:
      
      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 processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
      2) '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
      
   
   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:
     { 2nd^#(cons(X, n__cons(Y, Z))) -> c_1(activate^#(Y))
     , activate^#(X) -> c_3(X)
     , activate^#(n__cons(X1, X2)) -> c_4(cons^#(activate(X1), X2))
     , activate^#(n__from(X)) -> c_5(from^#(activate(X)))
     , activate^#(n__s(X)) -> c_6(s^#(activate(X)))
     , cons^#(X1, X2) -> c_2(X1, X2)
     , from^#(X) -> c_7(cons^#(X, n__from(n__s(X))))
     , from^#(X) -> c_8(X)
     , s^#(X) -> c_9(X) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { 2nd^#(cons(X, n__cons(Y, Z))) -> c_1(activate^#(Y))
     , activate^#(X) -> c_3(X)
     , activate^#(n__cons(X1, X2)) -> c_4(cons^#(activate(X1), X2))
     , activate^#(n__from(X)) -> c_5(from^#(activate(X)))
     , activate^#(n__s(X)) -> c_6(s^#(activate(X)))
     , cons^#(X1, X2) -> c_2(X1, X2)
     , from^#(X) -> c_7(cons^#(X, n__from(n__s(X))))
     , from^#(X) -> c_8(X)
     , s^#(X) -> c_9(X) }
   Strict Trs:
     { 2nd(cons(X, n__cons(Y, Z))) -> activate(Y)
     , cons(X1, X2) -> n__cons(X1, X2)
     , activate(X) -> X
     , activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , from(X) -> cons(X, n__from(n__s(X)))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..