WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__d(X)) -> d(X)
            activate(n__f(X)) -> f(activate(X))
            activate(n__g(X)) -> g(X)
            c(X) -> d(activate(X))
            d(X) -> n__d(X)
            f(X) -> n__f(X)
            f(f(X)) -> c(n__f(n__g(n__f(X))))
            g(X) -> n__g(X)
            h(X) -> c(n__d(X))
        - Signature:
            {activate/1,c/1,d/1,f/1,g/1,h/1} / {n__d/1,n__f/1,n__g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,c,d,f,g,h} and constructors {n__d,n__f,n__g}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          activate :: ["A"(11)] -(2)-> "A"(2)
          c :: ["A"(11)] -(6)-> "A"(10)
          d :: ["A"(0)] -(1)-> "A"(13)
          f :: ["A"(2)] -(10)-> "A"(2)
          g :: ["A"(0)] -(1)-> "A"(9)
          h :: ["A"(14)] -(12)-> "A"(2)
          n__d :: ["A"(0)] -(0)-> "A"(11)
          n__d :: ["A"(0)] -(0)-> "A"(15)
          n__f :: ["A"(11)] -(11)-> "A"(11)
          n__f :: ["A"(2)] -(2)-> "A"(2)
          n__f :: ["A"(0)] -(0)-> "A"(0)
          n__g :: ["A"(0)] -(0)-> "A"(11)
          n__g :: ["A"(0)] -(0)-> "A"(12)
          n__g :: ["A"(0)] -(0)-> "A"(9)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "n__d_A" :: ["A"(0)] -(0)-> "A"(1)
          "n__f_A" :: ["A"(0)] -(1)-> "A"(1)
          "n__g_A" :: ["A"(0)] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))