WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a() -> n__a()
            activate(X) -> X
            activate(n__a()) -> a()
            activate(n__f(X)) -> f(activate(X))
            activate(n__g(X)) -> g(activate(X))
            f(X) -> n__f(X)
            f(f(a())) -> c(n__f(n__g(n__f(n__a()))))
            g(X) -> n__g(X)
        - Signature:
            {a/0,activate/1,f/1,g/1} / {c/1,n__a/0,n__f/1,n__g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {c,n__a,n__f,n__g}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          a :: [] -(1)-> "A"(0)
          activate :: ["A"(2)] -(2)-> "A"(0)
          c :: ["A"(0)] -(0)-> "A"(0)
          f :: ["A"(0)] -(1)-> "A"(0)
          g :: ["A"(0)] -(1)-> "A"(0)
          n__a :: [] -(0)-> "A"(2)
          n__a :: [] -(0)-> "A"(0)
          n__f :: ["A"(2)] -(2)-> "A"(2)
          n__f :: ["A"(0)] -(0)-> "A"(0)
          n__g :: ["A"(2)] -(2)-> "A"(2)
          n__g :: ["A"(0)] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "c_A" :: ["A"(0)] -(0)-> "A"(0)
          "n__a_A" :: [] -(0)-> "A"(0)
          "n__f_A" :: ["A"(0)] -(0)-> "A"(0)
          "n__g_A" :: ["A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(n^1))