WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(0, 0)
  0 :: [] -(0)-> A(1, 0)
  Cons :: [A(2, 0) x A(10, 8)] -(2)-> A(2, 8)
  Cons :: [A(3, 0) x A(3, 0)] -(3)-> A(3, 0)
  Cons :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 0)
  Cons :: [A(1, 0) x A(1, 0)] -(1)-> A(1, 0)
  Cons :: [A(0, 0) x A(5, 5)] -(0)-> A(0, 5)
  False :: [] -(0)-> A(10, 9)
  False :: [] -(0)-> A(15, 15)
  Nil :: [] -(0)-> A(2, 8)
  Nil :: [] -(0)-> A(3, 0)
  Nil :: [] -(0)-> A(7, 7)
  Nil :: [] -(0)-> A(15, 15)
  S :: [A(0, 0)] -(0)-> A(0, 0)
  S :: [A(1, 0)] -(1)-> A(1, 0)
  True :: [] -(0)-> A(10, 9)
  True :: [] -(0)-> A(15, 15)
  cond_insert_ord_x_ys_1 :: [A(10, 9) x A(0, 0) x A(1, 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(1, 0)] -(1)-> A(12, 12)
  main :: [A(12, 14)] -(15)-> A(0, 0)
  sort#2 :: [A(2, 8)] -(8)-> A(0, 0)


Cost Free Signatures:
---------------------

  0 :: [] -(0)-> A_cf(0, 0)
  Cons :: [A_cf(8, 0) x A_cf(8, 0)] -(8)-> A_cf(8, 0)
  Cons :: [A_cf(3, 0) x A_cf(3, 0)] -(3)-> A_cf(3, 0)
  Cons :: [A_cf(3, 0) x A_cf(13, 10)] -(3)-> A_cf(3, 10)
  Cons :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  Cons :: [A_cf(0, 0) x A_cf(4, 4)] -(0)-> A_cf(0, 4)
  False :: [] -(0)-> A_cf(0, 0)
  False :: [] -(0)-> A_cf(11, 11)
  False :: [] -(0)-> A_cf(0, 1)
  False :: [] -(0)-> A_cf(3, 3)
  Nil :: [] -(0)-> A_cf(8, 0)
  Nil :: [] -(0)-> A_cf(3, 3)
  Nil :: [] -(0)-> A_cf(3, 0)
  Nil :: [] -(0)-> A_cf(15, 11)
  Nil :: [] -(0)-> A_cf(0, 0)
  S :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  True :: [] -(0)-> A_cf(0, 0)
  True :: [] -(0)-> A_cf(11, 11)
  True :: [] -(0)-> A_cf(0, 1)
  True :: [] -(0)-> A_cf(3, 3)
  cond_insert_ord_x_ys_1 :: [A_cf(0, 0) x A_cf(8, 0) x A_cf(3, 0) x A_cf(3, 0)] -(10)-> A_cf(3, 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, 1) x A_cf(0, 0) x A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  insert#3 :: [A_cf(8, 0) x A_cf(3, 0)] -(7)-> A_cf(3, 0)
  insert#3 :: [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)] -(0)-> A_cf(8, 8)
  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)] -(0)-> A_cf(3, 3)
  sort#2 :: [A_cf(8, 0)] -(0)-> A_cf(3, 0)


Base Constructors:
------------------
  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)] -(0)-> 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)