WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            foldr#3(Cons(x16,x6)) -> step_x_f(rev_l(),x16,foldr#3(x6))
            foldr#3(Nil()) -> fleft_op_e_xs_1()
            main(Cons(x8,x9)) -> step_x_f#1(rev_l(),x8,foldr#3(x9),Nil())
            main(Nil()) -> Nil()
            rev_l#2(x8,x10) -> Cons(x10,x8)
            step_x_f#1(rev_l(),x5,fleft_op_e_xs_1(),x3) -> rev_l#2(x3,x5)
            step_x_f#1(rev_l(),x5,step_x_f(x2,x3,x4),x1) -> step_x_f#1(x2,x3,x4,rev_l#2(x1,x5))
        - Signature:
            {foldr#3/1,main/1,rev_l#2/2,step_x_f#1/4} / {Cons/2,Nil/0,fleft_op_e_xs_1/0,rev_l/0,step_x_f/3}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {foldr#3,main,rev_l#2,step_x_f#1} and constructors {Cons
            ,Nil,fleft_op_e_xs_1,rev_l,step_x_f}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Cons :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
          Cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          Nil :: [] -(0)-> "A"(15)
          Nil :: [] -(0)-> "A"(7)
          fleft_op_e_xs_1 :: [] -(0)-> "A"(9)
          fleft_op_e_xs_1 :: [] -(0)-> "A"(15)
          foldr#3 :: ["A"(15)] -(1)-> "A"(9)
          main :: ["A"(15)] -(3)-> "A"(0)
          rev_l :: [] -(0)-> "A"(0)
          rev_l :: [] -(0)-> "A"(15)
          rev_l#2 :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
          step_x_f :: ["A"(9) x "A"(9) x "A"(9)] -(9)-> "A"(9)
          step_x_f#1 :: ["A"(0) x "A"(0) x "A"(9) x "A"(0)] -(8)-> "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)
          "fleft_op_e_xs_1_A" :: [] -(0)-> "A"(1)
          "rev_l_A" :: [] -(0)-> "A"(1)
          "step_x_f_A" :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))