BEST_CASE(Omega(n^1),?)

Solution:
---------

  "'0" :: [] -(0)-> "d"(0)
  "'EQ" :: [] -(0)-> "a"(0)
  "'GT" :: [] -(0)-> "a"(0)
  "'LT" :: [] -(0)-> "a"(0)
  "'abs" :: ["d"(0)] -(1)-> "d"(0)
  "'add" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'and" :: ["c"(0) x "c"(0)] -(1)-> "c"(0)
  "'ckgt" :: ["a"(0)] -(1)-> "c"(0)
  "'cklt" :: ["a"(0)] -(1)-> "c"(0)
  "'compare" :: ["d"(0) x "d"(0)] -(1)-> "a"(0)
  "'div" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'divByZero" :: [] -(0)-> "d"(0)
  "'divsub" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'eq" :: ["d"(0) x "d"(0)] -(1)-> "c"(0)
  "'equal" :: ["d"(0) x "d"(0)] -(1)-> "c"(0)
  "'false" :: [] -(0)-> "c"(0)
  "'greater" :: ["d"(0) x "d"(0)] -(1)-> "c"(0)
  "'less" :: ["d"(0) x "d"(0)] -(1)-> "c"(0)
  "'mult" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'natadd" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'natdiv" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'natdiv'" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'natmult" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'natsub" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'neg" :: ["d"(0)] -(0)-> "d"(0)
  "'negative" :: ["d"(0)] -(1)-> "d"(0)
  "'pos" :: ["d"(0)] -(0)-> "d"(0)
  "'positive" :: ["d"(0)] -(1)-> "d"(0)
  "'pred" :: ["d"(0)] -(1)-> "d"(0)
  "'s" :: ["d"(0)] -(0)-> "d"(0)
  "'sub" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "'succ" :: ["d"(0)] -(1)-> "d"(0)
  "'true" :: [] -(0)-> "c"(0)
  "'underflow" :: [] -(0)-> "d"(0)
  "add" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "add'" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "add''1" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "add''2" :: ["d"(0) x "d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "add''3" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "bitToInt" :: ["d"(1)] -(1)-> "d"(0)
  "bitToInt'" :: ["d"(1) x "d"(0)] -(1)-> "d"(0)
  "bitToInt''1" :: ["d"(1) x "d"(0)] -(1)-> "d"(0)
  "compare" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "compare'1" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "compare'2" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "compare'3" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "compare'4" :: ["c"(0) x "d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "compare'5" :: ["c"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "compare'6" :: ["c"(0)] -(1)-> "d"(0)
  "dd" :: ["d"(0) x "d"(0)] -(0)-> "d"(0)
  "dd" :: ["d"(0) x "d"(1)] -(1)-> "d"(1)
  "diff" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "diff'1" :: ["c"(0)] -(1)-> "d"(0)
  "div" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "leq" :: ["d"(0) x "d"(0)] -(1)-> "c"(0)
  "mod" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "mult" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "mult'1" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "mult'2" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "mult'3" :: ["c"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "mult3" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "nil" :: [] -(0)-> "d"(0)
  "nil" :: [] -(0)-> "d"(1)
  "sub" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "sub'" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "sub''1" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "sub''2" :: ["d"(0) x "d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "sub''3" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "sub''4" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "sub''5" :: ["c"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "sub'1" :: ["d"(0)] -(1)-> "d"(0)
  "sum" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "sum'1" :: ["d"(0)] -(1)-> "d"(0)
  "sum'2" :: ["c"(0) x "d"(0)] -(1)-> "d"(0)
  "sum'3" :: ["c"(0) x "d"(0)] -(1)-> "d"(0)
  "sum'4" :: ["c"(0)] -(1)-> "d"(0)
  "tuple'2" :: ["d"(0) x "d"(0)] -(0)-> "d"(0)


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




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