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