WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
            2nd(cons1(X,cons(Y,Z))) -> Y
            activate(X) -> X
            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)
        - Signature:
            {2nd/1,activate/1,from/1,s/1} / {cons/2,cons1/2,n__from/1,n__s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {2nd,activate,from,s} and constructors {cons,cons1,n__from
            ,n__s}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          2nd :: ["A"(15)] -(3)-> "A"(0)
          activate :: ["A"(13)] -(1)-> "A"(0)
          cons :: ["A"(0) x "A"(15)] -(15)-> "A"(15)
          cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          cons1 :: ["A"(0) x "A"(0)] -(0)-> "A"(15)
          from :: ["A"(0)] -(6)-> "A"(0)
          n__from :: ["A"(13)] -(13)-> "A"(13)
          n__from :: ["A"(0)] -(0)-> "A"(0)
          n__s :: ["A"(13)] -(13)-> "A"(13)
          n__s :: ["A"(0)] -(0)-> "A"(0)
          s :: ["A"(0)] -(1)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "cons1_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
          "cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "n__from_A" :: ["A"(0)] -(1)-> "A"(1)
          "n__s_A" :: ["A"(0)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))