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
            main(xs) -> append(xs,nil())
        - Signature:
            {append/2,main/1} / {cons/2,nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {append,main} and constructors {cons,nil}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "append") :: ["A"(9) x "A"(1)] -(5)-> "A"(1)
          F (TrsFun "cons") :: ["A"(0) x "A"(9)] -(9)-> "A"(9)
          F (TrsFun "cons") :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          F (TrsFun "main") :: ["A"(15)] -(16)-> "A"(0)
          F (TrsFun "nil") :: [] -(0)-> "A"(9)
          F (TrsFun "nil") :: [] -(0)-> "A"(13)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "F (TrsFun \"cons\")_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "F (TrsFun \"nil\")_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))