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

WORST_CASE(?,O(n^1))