WORST_CASE(?,O(1))
* Step 1: Ara WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
            activate(X) -> X
            activate(n__cons(X1,X2)) -> cons(X1,X2)
            activate(n__from(X)) -> from(X)
            cons(X1,X2) -> n__cons(X1,X2)
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
        - Signature:
            {2nd/1,activate/1,cons/2,from/1} / {n__cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {2nd,activate,cons,from} and constructors {n__cons,n__from
            ,s}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          2nd :: ["A"(0)] -(3)-> "A"(0)
          activate :: ["A"(0)] -(3)-> "A"(0)
          cons :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
          from :: ["A"(0)] -(2)-> "A"(0)
          n__cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          n__from :: ["A"(0)] -(0)-> "A"(0)
          s :: ["A"(0)] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "n__cons_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          "n__from_A" :: ["A"(0)] -(0)-> "A"(0)
          "s_A" :: ["A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(1))