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

WORST_CASE(?,O(n^1))