WORST_CASE(?,O(1))
* Step 1: Ara WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__zeros()) -> zeros()
            tail(cons(X,XS)) -> activate(XS)
            zeros() -> cons(0(),n__zeros())
            zeros() -> n__zeros()
        - Signature:
            {activate/1,tail/1,zeros/0} / {0/0,cons/2,n__zeros/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,tail,zeros} and constructors {0,cons,n__zeros}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(0)
          activate :: ["A"(0)] -(2)-> "A"(0)
          cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          n__zeros :: [] -(0)-> "A"(0)
          tail :: ["A"(0)] -(3)-> "A"(0)
          zeros :: [] -(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__zeros_A" :: [] -(0)-> "A"(0)
        

WORST_CASE(?,O(1))