WORST_CASE(?,O(n^2))
* Step 1: Ara WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            cond_insert_ord_x_ys_1(False(),x3,x2,x1) -> Cons(x2,insert#3(x3,x1))
            cond_insert_ord_x_ys_1(True(),x3,x2,x1) -> Cons(x3,Cons(x2,x1))
            insert#3(x2,Nil()) -> Cons(x2,Nil())
            insert#3(x6,Cons(x4,x2)) -> cond_insert_ord_x_ys_1(leq#2(x6,x4),x6,x4,x2)
            leq#2(0(),x8) -> True()
            leq#2(S(x12),0()) -> False()
            leq#2(S(x4),S(x2)) -> leq#2(x4,x2)
            main(x1) -> sort#2(x1)
            sort#2(Cons(x4,x2)) -> insert#3(x4,sort#2(x2))
            sort#2(Nil()) -> Nil()
        - Signature:
            {cond_insert_ord_x_ys_1/4,insert#3/2,leq#2/2,main/1,sort#2/1} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {cond_insert_ord_x_ys_1,insert#3,leq#2,main
            ,sort#2} and constructors {0,Cons,False,Nil,S,True}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> A(0, 0)
          0 :: [] -(0)-> A(2, 0)
          Cons :: [A(3, 0) x A(3, 0)] -(3)-> A(3, 0)
          Cons :: [A(0, 0) x A(3, 3)] -(3)-> A(0, 3)
          Cons :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 0)
          False :: [] -(0)-> A(1, 0)
          Nil :: [] -(0)-> A(3, 0)
          Nil :: [] -(0)-> A(0, 3)
          Nil :: [] -(0)-> A(0, 7)
          Nil :: [] -(0)-> A(3, 1)
          S :: [A(0, 0)] -(0)-> A(0, 0)
          S :: [A(2, 0)] -(2)-> A(2, 0)
          True :: [] -(0)-> A(1, 0)
          True :: [] -(0)-> A(4, 0)
          cond_insert_ord_x_ys_1 :: [A(1, 0) x A(0, 0) x A(0, 0) x A(3, 0)] -(2)-> A(0, 0)
          insert#3 :: [A(0, 0) x A(3, 0)] -(1)-> A(0, 0)
          leq#2 :: [A(0, 0) x A(2, 0)] -(1)-> A(1, 0)
          main :: [A(4, 3)] -(2)-> A(0, 0)
          sort#2 :: [A(0, 3)] -(1)-> A(0, 0)
        
        
        Cost-free Signatures used:
        --------------------------
          0 :: [] -(0)-> A_cf(0, 0)
          Cons :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          Cons :: [A_cf(3, 0) x A_cf(3, 0)] -(3)-> A_cf(3, 0)
          False :: [] -(0)-> A_cf(0, 0)
          False :: [] -(0)-> A_cf(0, 1)
          False :: [] -(0)-> A_cf(1, 0)
          Nil :: [] -(0)-> A_cf(0, 0)
          Nil :: [] -(0)-> A_cf(3, 0)
          Nil :: [] -(0)-> A_cf(3, 5)
          S :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          True :: [] -(0)-> A_cf(0, 0)
          True :: [] -(0)-> A_cf(4, 0)
          True :: [] -(0)-> A_cf(1, 0)
          cond_insert_ord_x_ys_1 :: [A_cf(0, 0) x A_cf(0, 0) x A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          cond_insert_ord_x_ys_1 :: [A_cf(0, 0) x A_cf(3, 0) x A_cf(3, 0) x A_cf(3, 0)] -(6)-> A_cf(3, 0)
          insert#3 :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          insert#3 :: [A_cf(3, 0) x A_cf(3, 0)] -(3)-> A_cf(3, 0)
          leq#2 :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          leq#2 :: [A_cf(0, 0) x A_cf(0, 0)] -(1)-> A_cf(0, 0)
          leq#2 :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(1, 0)
          sort#2 :: [A_cf(3, 0)] -(0)-> A_cf(3, 0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          0_A :: [] -(0)-> A(1, 0)
          0_A :: [] -(0)-> A(0, 1)
          Cons_A :: [A(1, 0) x A(1, 0)] -(1)-> A(1, 0)
          Cons_A :: [A(0, 0) x A(1, 1)] -(1)-> A(0, 1)
          False_A :: [] -(0)-> A(1, 0)
          False_A :: [] -(0)-> A(0, 1)
          Nil_A :: [] -(0)-> A(1, 0)
          Nil_A :: [] -(0)-> A(0, 1)
          S_A :: [A(1, 0)] -(1)-> A(1, 0)
          S_A :: [A(0, 0)] -(0)-> A(0, 1)
          True_A :: [] -(0)-> A(1, 0)
          True_A :: [] -(0)-> A(0, 1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        cond_insert_ord_x_ys_1(False(),x3,x2,x1) -> Cons(x2,insert#3(x3,x1))
        cond_insert_ord_x_ys_1(True(),x3,x2,x1) -> Cons(x3,Cons(x2,x1))
        insert#3(x2,Nil()) -> Cons(x2,Nil())
        insert#3(x6,Cons(x4,x2)) -> cond_insert_ord_x_ys_1(leq#2(x6,x4),x6,x4,x2)
        leq#2(0(),x8) -> True()
        leq#2(S(x12),0()) -> False()
        leq#2(S(x4),S(x2)) -> leq#2(x4,x2)
        main(x1) -> sort#2(x1)
        sort#2(Cons(x4,x2)) -> insert#3(x4,sort#2(x2))
        sort#2(Nil()) -> Nil()
    - Signature:
        {cond_insert_ord_x_ys_1/4,insert#3/2,leq#2/2,main/1,sort#2/1} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {cond_insert_ord_x_ys_1,insert#3,leq#2,main
        ,sort#2} and constructors {0,Cons,False,Nil,S,True}
Following problems could not be solved:
  - Strict TRS:
      cond_insert_ord_x_ys_1(False(),x3,x2,x1) -> Cons(x2,insert#3(x3,x1))
      cond_insert_ord_x_ys_1(True(),x3,x2,x1) -> Cons(x3,Cons(x2,x1))
      insert#3(x2,Nil()) -> Cons(x2,Nil())
      insert#3(x6,Cons(x4,x2)) -> cond_insert_ord_x_ys_1(leq#2(x6,x4),x6,x4,x2)
      leq#2(0(),x8) -> True()
      leq#2(S(x12),0()) -> False()
      leq#2(S(x4),S(x2)) -> leq#2(x4,x2)
      main(x1) -> sort#2(x1)
      sort#2(Cons(x4,x2)) -> insert#3(x4,sort#2(x2))
      sort#2(Nil()) -> Nil()
  - Signature:
      {cond_insert_ord_x_ys_1/4,insert#3/2,leq#2/2,main/1,sort#2/1} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {cond_insert_ord_x_ys_1,insert#3,leq#2,main
      ,sort#2} and constructors {0,Cons,False,Nil,S,True}
WORST_CASE(?,O(n^2))