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

WORST_CASE(?,O(n^1))