WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(cons(x,k),l) -> g(k,l,cons(x,k))
            f(empty(),l) -> l
            g(a,b,c) -> f(a,cons(b,c))
        - Signature:
            {f/2,g/3} / {cons/2,empty/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {cons,empty}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "cons") :: ["A"(0) x "A"(11)] -(11)-> "A"(11)
          F (TrsFun "cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "empty") :: [] -(0)-> "A"(11)
          F (TrsFun "f") :: ["A"(11) x "A"(0)] -(5)-> "A"(0)
          F (TrsFun "g") :: ["A"(11) x "A"(0) x "A"(0)] -(15)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "F (TrsFun \"cons\")_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "F (TrsFun \"empty\")_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))