WORST_CASE(?,O(n^2))
* Step 1: Ara WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            append(cons(x,xs),ys) -> cons(x,append(xs,ys))
            append(nil(),ys) -> ys
            attach(x,cons(y,ys)) -> cons(pair(x,y),attach(x,ys))
            attach(x,nil()) -> nil()
            pairs(cons(x,xs)) -> append(attach(x,xs),pairs(xs))
            pairs(nil()) -> nil()
        - Signature:
            {append/2,attach/2,pairs/1} / {cons/2,nil/0,pair/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {append,attach,pairs} and constructors {cons,nil,pair}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "append") :: ["A"(1, 0) x "A"(0, 0)] -(4)-> "A"(0, 0)
          F (TrsFun "attach") :: ["A"(5, 3) x "A"(2, 0)] -(1)-> "A"(1, 0)
          F (TrsFun "cons") :: ["A"(1, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
          F (TrsFun "cons") :: ["A"(2, 0) x "A"(2, 0)] -(2)-> "A"(2, 0)
          F (TrsFun "cons") :: ["A"(12, 5) x "A"(12, 5)] -(7)-> "A"(7, 5)
          F (TrsFun "cons") :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
          F (TrsFun "nil") :: [] -(0)-> "A"(1, 0)
          F (TrsFun "nil") :: [] -(0)-> "A"(2, 0)
          F (TrsFun "nil") :: [] -(0)-> "A"(7, 5)
          F (TrsFun "nil") :: [] -(0)-> "A"(9, 8)
          F (TrsFun "nil") :: [] -(0)-> "A"(8, 8)
          F (TrsFun "pair") :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(1, 8)
          F (TrsFun "pairs") :: ["A"(7, 5)] -(1)-> "A"(0, 0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "F (TrsFun \"cons\")_A" :: ["A"(1, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
          "F (TrsFun \"cons\")_A" :: ["A"(1, 1) x "A"(1, 1)] -(0)-> "A"(0, 1)
          "F (TrsFun \"nil\")_A" :: [] -(0)-> "A"(1, 0)
          "F (TrsFun \"nil\")_A" :: [] -(0)-> "A"(0, 1)
          "F (TrsFun \"pair\")_A" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(1, 0)
          "F (TrsFun \"pair\")_A" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 1)
        

WORST_CASE(?,O(n^2))