WORST_CASE(?,O(1))
* Step 1: Ara WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__d(X)) -> d(X)
            activate(n__f(X)) -> f(X)
            c(X) -> d(activate(X))
            d(X) -> n__d(X)
            f(X) -> n__f(X)
            f(f(X)) -> c(n__f(g(n__f(X))))
            h(X) -> c(n__d(X))
        - Signature:
            {activate/1,c/1,d/1,f/1,h/1} / {g/1,n__d/1,n__f/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,c,d,f,h} and constructors {g,n__d,n__f}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          activate :: ["A"(0)] -(5)-> "A"(0)
          c :: ["A"(0)] -(7)-> "A"(0)
          d :: ["A"(0)] -(1)-> "A"(0)
          f :: ["A"(0)] -(4)-> "A"(0)
          g :: ["A"(0)] -(0)-> "A"(0)
          h :: ["A"(0)] -(8)-> "A"(0)
          n__d :: ["A"(0)] -(0)-> "A"(0)
          n__f :: ["A"(0)] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "g_A" :: ["A"(0)] -(0)-> "A"(0)
          "n__d_A" :: ["A"(0)] -(0)-> "A"(0)
          "n__f_A" :: ["A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(1))