WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            main(x1) -> take_l#2(x1)
            take_l#2(0()) -> Nil()
            take_l#2(S(x2)) -> Cons(take_l#2(x2))
        - Signature:
            {main/1,take_l#2/1} / {0/0,Cons/1,Nil/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {main,take_l#2} and constructors {0,Cons,Nil,S}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "0") :: [] -(0)-> "A"(1)
          F (TrsFun "Cons") :: ["A"(0)] -(0)-> "A"(0)
          F (TrsFun "Nil") :: [] -(0)-> "A"(0)
          F (TrsFun "S") :: ["A"(1)] -(1)-> "A"(1)
          F (TrsFun "main") :: ["A"(1)] -(2)-> "A"(0)
          F (TrsFun "take_l#2") :: ["A"(1)] -(1)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
        
        

WORST_CASE(?,O(n^1))