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

WORST_CASE(?,O(n^1))