BEST_CASE(Omega(n^3),?)

Solution:
---------

  "0" :: [] -(0)-> "A"(0, 0, 0)
  "And" :: ["A"(0, 0, 0) x "A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "Cons" :: ["A"(0, 0, 0) x "A"(4, 0, 2)] -(3)-> "A"(2, 0, 1)
  "Cons" :: ["A"(0, 0, 0) x "A"(1, 0, 0)] -(1)-> "A"(1, 0, 0)
  "Cons" :: ["A"(0, 0, 0) x "A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "Cons" :: ["A"(0, 0, 0) x "A"(2, 0, 0)] -(2)-> "A"(2, 0, 0)
  "False" :: [] -(0)-> "A"(15, 15, 15)
  "False" :: [] -(0)-> "A"(15, 15, 1)
  "False" :: [] -(0)-> "A"(15, 15, 6)
  "False" :: [] -(0)-> "A"(0, 0, 0)
  "False" :: [] -(0)-> "A"(0, 0, 5)
  "Nil" :: [] -(0)-> "A"(2, 0, 1)
  "Nil" :: [] -(0)-> "A"(1, 0, 0)
  "Nil" :: [] -(0)-> "A"(0, 0, 0)
  "Not" :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "Or" :: ["A"(0, 0, 0) x "A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "Pair" :: ["A"(0, 0, 0) x "A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "S" :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "True" :: [] -(0)-> "A"(15, 15, 15)
  "True" :: [] -(0)-> "A"(15, 15, 1)
  "True" :: [] -(0)-> "A"(15, 15, 6)
  "True" :: [] -(0)-> "A"(0, 0, 0)
  "True" :: [] -(0)-> "A"(0, 0, 5)
  "Var" :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "assoc#2" :: ["A"(0, 0, 0) x "A"(1, 0, 0)] -(1)-> "A"(0, 0, 0)
  "aux#2" :: ["A"(0, 0, 0) x "A"(1, 0, 0)] -(1)-> "A"(0, 0, 0)
  "bot[0]#1" :: [] -(0)-> "A"(0, 0, 0)
  "concat#2" :: ["A"(1, 0, 0) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)
  "eqNat#2" :: ["A"(0, 0, 0) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 5)
  "eval#2" :: ["A"(1, 0, 0) x "A"(0, 0, 0)] -(2)-> "A"(0, 0, 0)
  "ite#3" :: ["A"(15, 15, 6) x "A"(0, 0, 0) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)
  "land#2" :: ["A"(15, 15, 15) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)
  "lnot#1" :: ["A"(15, 15, 1)] -(1)-> "A"(0, 0, 0)
  "lor#2" :: ["A"(15, 15, 15) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)
  "main" :: ["A"(0, 0, 0) x "A"(0, 0, 0) x "A"(1, 0, 1)] -(1)-> "A"(0, 0, 0)
  "table_make#3" :: ["A"(2, 0, 0) x "A"(2, 0, 1) x "A"(0, 0, 0)] -(4)-> "A"(0, 0, 0)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 0, 1)
  "\"And\"_A" :: ["A"(0, 0, 0) x "A"(7, 11, 13)] -(1)-> "A"(1, 0, 0)
  "\"And\"_A" :: ["A"(0, 0, 0) x "A"(5, 1, 0)] -(1)-> "A"(0, 1, 0)
  "\"And\"_A" :: ["A"(0, 0, 0) x "A"(9, 15, 12)] -(1)-> "A"(0, 0, 1)
  "\"Cons\"_A" :: ["A"(0, 0, 0) x "A"(1, 0, 0)] -(1)-> "A"(1, 0, 0)
  "\"Cons\"_A" :: ["A"(0, 0, 0) x "A"(7, 9, 0)] -(1)-> "A"(0, 1, 0)
  "\"Cons\"_A" :: ["A"(0, 0, 0) x "A"(2, 0, 2)] -(1)-> "A"(0, 0, 1)
  "\"False\"_A" :: [] -(0)-> "A"(1, 0, 0)
  "\"False\"_A" :: [] -(0)-> "A"(0, 1, 0)
  "\"False\"_A" :: [] -(0)-> "A"(0, 0, 1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1, 0, 0)
  "\"Nil\"_A" :: [] -(0)-> "A"(0, 1, 0)
  "\"Nil\"_A" :: [] -(0)-> "A"(0, 0, 1)
  "\"Not\"_A" :: ["A"(2, 0, 0)] -(1)-> "A"(1, 0, 0)
  "\"Not\"_A" :: ["A"(0, 15, 0)] -(1)-> "A"(0, 1, 0)
  "\"Not\"_A" :: ["A"(0, 0, 14)] -(1)-> "A"(0, 0, 1)
  "\"Or\"_A" :: ["A"(0, 0, 0) x "A"(4, 8, 0)] -(1)-> "A"(1, 0, 0)
  "\"Or\"_A" :: ["A"(0, 0, 0) x "A"(1, 6, 0)] -(1)-> "A"(0, 1, 0)
  "\"Or\"_A" :: ["A"(0, 0, 0) x "A"(12, 1, 14)] -(1)-> "A"(0, 0, 1)
  "\"Pair\"_A" :: ["A"(0, 0, 0) x "A"(15, 1, 0)] -(1)-> "A"(1, 0, 0)
  "\"Pair\"_A" :: ["A"(0, 0, 0) x "A"(12, 5, 0)] -(1)-> "A"(0, 1, 0)
  "\"Pair\"_A" :: ["A"(0, 0, 0) x "A"(0, 1, 4)] -(1)-> "A"(0, 0, 1)
  "\"S\"_A" :: ["A"(1, 1, 1)] -(1)-> "A"(1, 0, 0)
  "\"S\"_A" :: ["A"(0, 15, 1)] -(1)-> "A"(0, 1, 0)
  "\"S\"_A" :: ["A"(0, 0, 8)] -(1)-> "A"(0, 0, 1)
  "\"True\"_A" :: [] -(0)-> "A"(1, 0, 0)
  "\"True\"_A" :: [] -(0)-> "A"(0, 1, 0)
  "\"True\"_A" :: [] -(0)-> "A"(0, 0, 1)
  "\"Var\"_A" :: ["A"(8, 0, 0)] -(1)-> "A"(1, 0, 0)
  "\"Var\"_A" :: ["A"(0, 6, 0)] -(1)-> "A"(0, 1, 0)
  "\"Var\"_A" :: ["A"(0, 0, 4)] -(1)-> "A"(0, 0, 1)
  "\"bot[0]#1\"_A" :: [] -(0)-> "A"(1, 0, 0)
  "\"bot[0]#1\"_A" :: [] -(0)-> "A"(0, 1, 0)
  "\"bot[0]#1\"_A" :: [] -(0)-> "A"(0, 0, 1)