WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(1, 0)
  "Cons" :: ["A"(15, 0) x "A"(15, 10)] -(5)-> "A"(5, 10)
  "Cons" :: ["A"(4, 0) x "A"(4, 0)] -(4)-> "A"(4, 0)
  "Cons" :: ["A"(2, 0) x "A"(2, 0)] -(2)-> "A"(2, 0)
  "Cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "Cons" :: ["A"(6, 0) x "A"(6, 4)] -(2)-> "A"(2, 4)
  "False" :: [] -(0)-> "A"(3, 2)
  "False" :: [] -(0)-> "A"(13, 12)
  "Nil" :: [] -(0)-> "A"(5, 10)
  "Nil" :: [] -(0)-> "A"(4, 0)
  "Nil" :: [] -(0)-> "A"(2, 0)
  "Nil" :: [] -(0)-> "A"(14, 14)
  "S" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "S" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "True" :: [] -(0)-> "A"(3, 2)
  "True" :: [] -(0)-> "A"(13, 12)
  "cond_insert_ord_x_ys_1" :: ["A"(3, 2) x "A"(6, 0) x "A"(2, 0) x "A"(4, 0)] -(5)-> "A"(0, 0)
  "fold#3" :: ["A"(5, 10)] -(8)-> "A"(0, 0)
  "insert_ord#2" :: ["A"(6, 0) x "A"(4, 0)] -(3)-> "A"(0, 0)
  "leq#2" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(13, 12)
  "main" :: ["A"(11, 12)] -(16)-> "A"(0, 0)


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

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "Cons" :: ["A"_cf(10, 0) x "A"_cf(10, 0)] -(10)-> "A"_cf(10, 0)
  "Cons" :: ["A"_cf(4, 0) x "A"_cf(4, 0)] -(4)-> "A"_cf(4, 0)
  "Cons" :: ["A"_cf(6, 0) x "A"_cf(6, 0)] -(6)-> "A"_cf(6, 0)
  "Cons" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "False" :: [] -(0)-> "A"_cf(0, 0)
  "False" :: [] -(0)-> "A"_cf(8, 0)
  "False" :: [] -(0)-> "A"_cf(8, 8)
  "Nil" :: [] -(0)-> "A"_cf(10, 0)
  "Nil" :: [] -(0)-> "A"_cf(8, 8)
  "Nil" :: [] -(0)-> "A"_cf(4, 0)
  "Nil" :: [] -(0)-> "A"_cf(11, 8)
  "Nil" :: [] -(0)-> "A"_cf(0, 0)
  "Nil" :: [] -(0)-> "A"_cf(14, 14)
  "S" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "True" :: [] -(0)-> "A"_cf(0, 0)
  "True" :: [] -(0)-> "A"_cf(8, 0)
  "True" :: [] -(0)-> "A"_cf(8, 8)
  "cond_insert_ord_x_ys_1" :: ["A"_cf(0, 0) x "A"_cf(8, 0) x "A"_cf(4, 0) x "A"_cf(4, 0)] -(12)-> "A"_cf(4, 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(8, 0) x "A"_cf(0, 0) x "A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "fold#3" :: ["A"_cf(10, 0)] -(0)-> "A"_cf(4, 0)
  "insert_ord#2" :: ["A"_cf(8, 0) x "A"_cf(4, 0)] -(8)-> "A"_cf(4, 0)
  "insert_ord#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(0, 0)
  "leq#2" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(8, 4)


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"(1, 0)] -(0)-> "A"(0, 1)
  "\"True\"_A" :: [] -(0)-> "A"(1, 0)
  "\"True\"_A" :: [] -(0)-> "A"(0, 1)