WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            app_xs#1(Cons(x7,x8),x10) -> Cons(x7,app_xs#1(x8,x10))
            app_xs#1(Nil(),x6) -> x6
            main(x4,x2) -> app_xs#1(x4,app_xs#1(x4,x2))
        - Signature:
            {app_xs#1/2,main/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {app_xs#1,main} and constructors {Cons,Nil}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Cons :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          Cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          Nil :: [] -(0)-> "A"(1)
          app_xs#1 :: ["A"(1) x "A"(0)] -(1)-> "A"(0)
          main :: ["A"(8) x "A"(14)] -(15)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "Cons_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "Nil_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))