WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "0" :: [] -(0)-> "A"(4)
  "0" :: [] -(0)-> "A"(1)
  "Cons" :: ["A"(4) x "A"(4)] -(4)-> "A"(4)
  "ConsTree" :: ["A"(4) x "A"(4)] -(4)-> "A"(4)
  "False" :: [] -(0)-> "A"(3)
  "False" :: [] -(0)-> "A"(6)
  "False" :: [] -(0)-> "A"(15)
  "Leaf" :: ["A"(4)] -(4)-> "A"(4)
  "Nil" :: [] -(0)-> "A"(4)
  "NilTree" :: [] -(0)-> "A"(4)
  "Node" :: ["A"(4) x "A"(4)] -(4)-> "A"(4)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "S" :: ["A"(4)] -(4)-> "A"(4)
  "S" :: ["A"(1)] -(1)-> "A"(1)
  "True" :: [] -(0)-> "A"(3)
  "True" :: [] -(0)-> "A"(6)
  "True" :: [] -(0)-> "A"(15)
  "anyEq#2" :: ["A"(0) x "A"(4)] -(2)-> "A"(9)
  "bot[0]" :: [] -(0)-> "A"(7)
  "bot[1]" :: [] -(0)-> "A"(7)
  "eqNat#2" :: ["A"(0) x "A"(4)] -(1)-> "A"(15)
  "ite#3" :: ["A"(6) x "A"(9)] -(2)-> "A"(9)
  "ite2#3" :: ["A"(3) x "A"(1) x "A"(1)] -(3)-> "A"(1)
  "leqNat#2" :: ["A"(0) x "A"(1)] -(2)-> "A"(14)
  "lookup#2" :: ["A"(0) x "A"(4)] -(0)-> "A"(1)
  "main" :: ["A"(6) x "A"(10)] -(8)-> "A"(0)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"Cons\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"ConsTree\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"False\"_A" :: [] -(0)-> "A"(1)
  "\"Leaf\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"NilTree\"_A" :: [] -(0)-> "A"(1)
  "\"Node\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"S\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)
  "\"bot[0]\"_A" :: [] -(0)-> "A"(1)
  "\"bot[1]\"_A" :: [] -(0)-> "A"(1)