BEST_CASE(Omega(n^1),?)

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Cons" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "Elem" :: ["A"(0)] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(1)
  "Node" :: ["A"(0) x "A"(0) x "A"(0)] -(0)-> "A"(0)
  "Pair" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(0)
  "app#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_deleteMin_ts" :: ["A"(0)] -(1)-> "A"(0)
  "cond_insTree_t_xs_1" :: ["A"(0) x "A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_link_t1_t2_2" :: ["A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_merge_ts1_ts2_2" :: ["A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_merge_ts1_ts2_3" :: ["A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_removeMinTree_xs_2" :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_removeMinTree_xs_3" :: ["A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "insTree#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "leq#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "leqElem#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "link#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "lt#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "main" :: ["A"(1)] -(1)-> "A"(0)
  "merge#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "removeMinTree#1" :: ["A"(1)] -(0)-> "A"(0)
  "rev#1" :: ["A"(0)] -(1)-> "A"(0)


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

  "0" :: [] -(0)-> "A"_cf(0)
  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Elem" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "False" :: [] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "Node" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Pair" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "S" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "True" :: [] -(0)-> "A"_cf(0)
  "app#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "cond_insTree_t_xs_1" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "cond_link_t1_t2_2" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "cond_merge_ts1_ts2_2" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "cond_merge_ts1_ts2_3" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "cond_removeMinTree_xs_2" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "cond_removeMinTree_xs_3" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "insTree#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "leq#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "leqElem#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "link#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "lt#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "merge#2" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "removeMinTree#1" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "rev#1" :: ["A"_cf(0)] -(0)-> "A"_cf(0)