WORST_CASE(?,O(n^1))

Solution:
---------

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


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

  "0" :: [] -(0)-> "A"_cf(0)
  "ConsBTree" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "ConsNat" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "False" :: [] -(0)-> "A"_cf(0)
  "Leaf" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "NilBTree" :: [] -(0)-> "A"_cf(0)
  "NilNat" :: [] -(0)-> "A"_cf(0)
  "Node" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "S" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "True" :: [] -(0)-> "A"_cf(0)
  "anyEq" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "eq" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "ite" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "leq" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "lookup" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"ConsBTree\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"ConsNat\"_A" :: ["A"(1) 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"(0) x "A"(1)] -(0)-> "A"(1)
  "\"S\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)