WORST_CASE(?,O(n^2))

Solution:
---------

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


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

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "Cons" :: ["A"_cf(12, 0) x "A"_cf(12, 0)] -(12)-> "A"_cf(12, 0)
  "Cons" :: ["A"_cf(3, 0) x "A"_cf(3, 0)] -(3)-> "A"_cf(3, 0)
  "Cons" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "False" :: [] -(0)-> "A"_cf(0, 0)
  "Nil" :: [] -(0)-> "A"_cf(12, 0)
  "Nil" :: [] -(0)-> "A"_cf(12, 8)
  "Nil" :: [] -(0)-> "A"_cf(3, 0)
  "Nil" :: [] -(0)-> "A"_cf(12, 4)
  "Nil" :: [] -(0)-> "A"_cf(0, 0)
  "S" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "True" :: [] -(0)-> "A"_cf(0, 0)
  "cond_insert_ord_x_ys_1" :: ["A"_cf(0, 0) x "A"_cf(12, 0) x "A"_cf(3, 0) x "A"_cf(3, 0)] -(15)-> "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)
  "insert#3" :: ["A"_cf(12, 0) x "A"_cf(3, 0)] -(12)-> "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(0, 0)
  "sort#2" :: ["A"_cf(12, 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"(1, 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)