WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            append(Cons(x,xs),ys) -> Cons(x,append(xs,ys))
            append(Nil(),ys) -> ys
            goal(x,y) -> append(x,y)
        - Signature:
            {append/2,goal/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {append,goal} and constructors {Cons,Nil}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Cons :: ["A"(13) x "A"(13)] -(13)-> "A"(13)
          Cons :: ["A"(2) x "A"(2)] -(2)-> "A"(2)
          Nil :: [] -(0)-> "A"(13)
          append :: ["A"(13) x "A"(2)] -(1)-> "A"(2)
          goal :: ["A"(15) x "A"(14)] -(16)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "Cons_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "Nil_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))