WORST_CASE(?,O(n^2))
* Step 1: Ara WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            a() -> n__a()
            activate(X) -> X
            activate(n__a()) -> a()
            activate(n__f(X)) -> f(X)
            activate(n__g(X)) -> g(activate(X))
            f(X) -> n__f(X)
            f(n__f(n__a())) -> f(n__g(n__f(n__a())))
            g(X) -> n__g(X)
        - Signature:
            {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {n__a,n__f,n__g}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          a :: [] -(7)-> A(0, 0)
          activate :: [A(0, 15)] -(8)-> A(0, 0)
          f :: [A(1, 0)] -(15)-> A(0, 0)
          g :: [A(0, 0)] -(9)-> A(4, 0)
          n__a :: [] -(0)-> A(0, 15)
          n__a :: [] -(0)-> A(0, 0)
          n__a :: [] -(0)-> A(7, 7)
          n__a :: [] -(0)-> A(7, 13)
          n__f :: [A(15, 15)] -(15)-> A(0, 15)
          n__f :: [A(0, 0)] -(1)-> A(1, 0)
          n__f :: [A(0, 0)] -(8)-> A(8, 0)
          n__f :: [A(0, 0)] -(0)-> A(0, 0)
          n__g :: [A(0, 15)] -(15)-> A(0, 15)
          n__g :: [A(0, 0)] -(0)-> A(8, 0)
        
        
        Cost-free Signatures used:
        --------------------------
          a :: [] -(0)-> A_cf(0, 0)
          activate :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          f :: [A_cf(1, 0)] -(0)-> A_cf(0, 0)
          g :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          n__a :: [] -(0)-> A_cf(0, 0)
          n__a :: [] -(0)-> A_cf(11, 11)
          n__f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          n__f :: [A_cf(0, 0)] -(1)-> A_cf(1, 0)
          n__g :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          n__g :: [A_cf(0, 0)] -(0)-> A_cf(8, 0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          n__a_A :: [] -(0)-> A(1, 0)
          n__a_A :: [] -(0)-> A(0, 1)
          n__f_A :: [A(0)] -(1)-> A(1, 0)
          n__f_A :: [A(0)] -(1)-> A(0, 1)
          n__g_A :: [A(0)] -(0)-> A(1, 0)
          n__g_A :: [A(0)] -(1)-> A(0, 1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        a() -> n__a()
        activate(X) -> X
        activate(n__a()) -> a()
        activate(n__f(X)) -> f(X)
        activate(n__g(X)) -> g(activate(X))
        f(X) -> n__f(X)
        f(n__f(n__a())) -> f(n__g(n__f(n__a())))
        g(X) -> n__g(X)
    - Signature:
        {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {n__a,n__f,n__g}
Following problems could not be solved:
  - Strict TRS:
      a() -> n__a()
      activate(X) -> X
      activate(n__a()) -> a()
      activate(n__f(X)) -> f(X)
      activate(n__g(X)) -> g(activate(X))
      f(X) -> n__f(X)
      f(n__f(n__a())) -> f(n__g(n__f(n__a())))
      g(X) -> n__g(X)
  - Signature:
      {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {n__a,n__f,n__g}
WORST_CASE(?,O(n^2))