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)
  "Nil" :: [] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(1)
  "Pair" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "Triple" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "add_1#3" :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "add_int#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "append#2" :: ["A"(1) x "A"(0)] -(1)-> "A"(0)
  "bot[0]" :: [] -(0)-> "A"(0)
  "bot[1]" :: [] -(0)-> "A"(0)
  "cond_add_b_c_carry_2" :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_add_int_b_n_1" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_div_mod_n_m" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_div_mod_n_m_2" :: ["A"(0)] -(1)-> "A"(0)
  "cond_mult_int_b_n_carry_1" :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "cond_split_n" :: ["A"(0)] -(1)-> "A"(0)
  "div_mod#2" :: ["A"(0)] -(1)-> "A"(0)
  "ite#3" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "main" :: ["A"(1) x "A"(0)] -(1)-> "A"(0)
  "minus'#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "mult_1#3" :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "mult_3#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "mult_int_1#3" :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "plus#2" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "split#1" :: ["A"(0)] -(1)-> "A"(0)
  "zeros#1" :: ["A"(0)] -(1)-> "A"(0)


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




Base Constructors:
------------------