BEST_CASE(Omega(n^1),?)

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "ConsBTree" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "ConsNat" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "ConsNat" :: ["A"(0) x "A"(2)] -(2)-> "A"(2)
  "False" :: [] -(0)-> "A"(14)
  "False" :: [] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(2)
  "Leaf" :: ["A"(1)] -(1)-> "A"(1)
  "NilBTree" :: [] -(0)-> "A"(0)
  "NilNat" :: [] -(0)-> "A"(1)
  "NilNat" :: [] -(0)-> "A"(2)
  "Node" :: ["A"(2) x "A"(0)] -(1)-> "A"(1)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(14)
  "True" :: [] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(2)
  "True" :: [] -(0)-> "A"(11)
  "True" :: [] -(0)-> "A"(8)
  "anyEq" :: ["A"(0) x "A"(1)] -(1)-> "A"(0)
  "eq" :: ["A"(0) x "A"(0)] -(0)-> "A"(9)
  "ite" :: ["A"(14) x "A"(0) x "A"(0)] -(0)-> "A"(0)
  "leq" :: ["A"(0) x "A"(0)] -(0)-> "A"(14)
  "lookup" :: ["A"(0) x "A"(1)] -(1)-> "A"(0)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"ConsBTree\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"ConsNat\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"False\"_A" :: [] -(0)-> "A"(1)
  "\"Leaf\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"NilBTree\"_A" :: [] -(0)-> "A"(1)
  "\"NilNat\"_A" :: [] -(0)-> "A"(1)
  "\"Node\"_A" :: ["A"(2) x "A"(0)] -(1)-> "A"(1)
  "\"S\"_A" :: ["A"(16)] -(1)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)