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