WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            merge(x,nil()) -> x
            merge(++(x,y),++(u(),v())) -> ++(x,merge(y,++(u(),v())))
            merge(++(x,y),++(u(),v())) -> ++(u(),merge(++(x,y),v()))
            merge(nil(),y) -> y
        - Signature:
            {merge/2} / {++/2,nil/0,u/0,v/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {merge} and constructors {++,nil,u,v}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          ++ :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          ++ :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
          ++ :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          merge :: ["A"(1) x "A"(14)] -(1)-> "A"(0)
          nil :: [] -(0)-> "A"(14)
          nil :: [] -(0)-> "A"(1)
          u :: [] -(0)-> "A"(14)
          u :: [] -(0)-> "A"(4)
          v :: [] -(0)-> "A"(14)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "++_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          "nil_A" :: [] -(0)-> "A"(1)
          "u_A" :: [] -(0)-> "A"(1)
          "v_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))