WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a__c() -> a__f(g(c()))
            a__c() -> c()
            a__f(X) -> f(X)
            a__f(g(X)) -> g(X)
            mark(c()) -> a__c()
            mark(f(X)) -> a__f(X)
            mark(g(X)) -> g(X)
        - Signature:
            {a__c/0,a__f/1,mark/1} / {c/0,f/1,g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a__c,a__f,mark} and constructors {c,f,g}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          a__c :: [] -(14)-> "A"(0)
          a__f :: ["A"(6)] -(5)-> "A"(2)
          c :: [] -(0)-> "A"(7)
          c :: [] -(0)-> "A"(14)
          f :: ["A"(7)] -(7)-> "A"(7)
          f :: ["A"(3)] -(3)-> "A"(3)
          g :: ["A"(6)] -(6)-> "A"(6)
          g :: ["A"(7)] -(7)-> "A"(7)
          g :: ["A"(3)] -(3)-> "A"(3)
          g :: ["A"(2)] -(2)-> "A"(2)
          mark :: ["A"(7)] -(15)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "c_A" :: [] -(0)-> "A"(1)
          "f_A" :: ["A"(1)] -(1)-> "A"(1)
          "g_A" :: ["A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))