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

WORST_CASE(?,O(n^1))