BEST_CASE(Omega(n^1),?)

Solution:
---------

  "0" :: [] -(0)-> "d"(0)
  "and" :: ["c"(1) x "c"(0)] -(1)-> "c"(0)
  "dd" :: ["d"(0) x "d"(1)] -(1)-> "d"(1)
  "dd" :: ["d"(0) x "d"(4)] -(4)-> "d"(4)
  "dd" :: ["d"(0) x "d"(0)] -(0)-> "d"(0)
  "edge" :: ["d"(0) x "d"(0) x "d"(0)] -(0)-> "d"(0)
  "elem" :: ["d"(0) x "d"(1)] -(1)-> "c"(0)
  "eq" :: ["d"(0) x "d"(0)] -(1)-> "c"(0)
  "false" :: [] -(0)-> "c"(1)
  "false" :: [] -(0)-> "c"(8)
  "false" :: [] -(0)-> "c"(0)
  "forrest" :: ["a"(1)] -(3)-> "b"(0)
  "graph" :: ["d"(1) x "d"(0)] -(1)-> "a"(1)
  "inBlock" :: ["d"(0) x "d"(4)] -(1)-> "c"(0)
  "insert" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "insert#q" :: ["c"(8) x "d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "join" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "d"(0)
  "join#q" :: ["c"(1) x "d"(0) x "d"(0) x "d"(0) x "d"(0)] -(2)-> "d"(0)
  "kruskal" :: ["d"(0) x "d"(0) x "d"(0)] -(1)-> "b"(0)
  "kruskal#q" :: ["c"(0) x "d"(0) x "d"(0) x "d"(0) x "d"(0)] -(1)-> "b"(0)
  "leq" :: ["d"(0) x "d"(0)] -(1)-> "c"(8)
  "nil" :: [] -(0)-> "d"(1)
  "nil" :: [] -(0)-> "d"(4)
  "nil" :: [] -(0)-> "d"(0)
  "or" :: ["c"(0) x "c"(0)] -(1)-> "c"(0)
  "pair" :: ["d"(0) x "d"(0)] -(0)-> "b"(0)
  "partitions" :: ["d"(1)] -(1)-> "d"(0)
  "pp" :: ["d"(0) x "d"(0)] -(1)-> "d"(0)
  "s" :: ["d"(0)] -(0)-> "d"(0)
  "sort" :: ["d"(1)] -(1)-> "d"(0)
  "src" :: ["d"(0)] -(1)-> "d"(0)
  "trg" :: ["d"(0)] -(1)-> "d"(0)
  "true" :: [] -(0)-> "c"(1)
  "true" :: [] -(0)-> "c"(8)
  "true" :: [] -(0)-> "c"(0)
  "wt" :: ["d"(0)] -(1)-> "d"(0)


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

  "0" :: [] -(0)-> "d"_cf(0)
  "and" :: ["c"_cf(0) x "c"_cf(0)] -(0)-> "c"_cf(0)
  "dd" :: ["d"_cf(0) x "d"_cf(0)] -(0)-> "d"_cf(0)
  "edge" :: ["d"_cf(0) x "d"_cf(0) x "d"_cf(0)] -(0)-> "d"_cf(0)
  "elem" :: ["d"_cf(0) x "d"_cf(0)] -(0)-> "c"_cf(0)
  "eq" :: ["d"_cf(0) x "d"_cf(0)] -(0)-> "c"_cf(0)
  "false" :: [] -(0)-> "c"_cf(0)
  "inBlock" :: ["d"_cf(0) x "d"_cf(0)] -(0)-> "c"_cf(0)
  "insert" :: ["d"_cf(0) x "d"_cf(0)] -(0)-> "d"_cf(0)
  "insert#q" :: ["c"_cf(0) x "d"_cf(0) x "d"_cf(0) x "d"_cf(0)] -(0)-> "d"_cf(0)
  "join" :: ["d"_cf(0) x "d"_cf(0) x "d"_cf(0)] -(0)-> "d"_cf(0)
  "join#q" :: ["c"_cf(0) x "d"_cf(0) x "d"_cf(0) x "d"_cf(0) x "d"_cf(0)] -(0)-> "d"_cf(0)
  "kruskal" :: ["d"_cf(0) x "d"_cf(0) x "d"_cf(0)] -(0)-> "b"_cf(0)
  "kruskal#q" :: ["c"_cf(0) x "d"_cf(0) x "d"_cf(0) x "d"_cf(0) x "d"_cf(0)] -(0)-> "b"_cf(0)
  "leq" :: ["d"_cf(0) x "d"_cf(0)] -(0)-> "c"_cf(0)
  "nil" :: [] -(0)-> "d"_cf(0)
  "or" :: ["c"_cf(0) x "c"_cf(0)] -(0)-> "c"_cf(0)
  "pair" :: ["d"_cf(0) x "d"_cf(0)] -(0)-> "b"_cf(0)
  "partitions" :: ["d"_cf(0)] -(0)-> "d"_cf(0)
  "pp" :: ["d"_cf(0) x "d"_cf(0)] -(0)-> "d"_cf(0)
  "s" :: ["d"_cf(0)] -(0)-> "d"_cf(0)
  "sort" :: ["d"_cf(0)] -(0)-> "d"_cf(0)
  "src" :: ["d"_cf(0)] -(0)-> "d"_cf(0)
  "trg" :: ["d"_cf(0)] -(0)-> "d"_cf(0)
  "true" :: [] -(0)-> "c"_cf(0)
  "wt" :: ["d"_cf(0)] -(0)-> "d"_cf(0)


Base Constructors:
------------------
  "\"0\"_d" :: [] -(0)-> "d"(1)
  "\"dd\"_d" :: ["d"(0) x "d"(1)] -(1)-> "d"(1)
  "\"edge\"_d" :: ["d"(0) x "d"(14) x "d"(0)] -(1)-> "d"(1)
  "\"false\"_c" :: [] -(0)-> "c"(1)
  "\"graph\"_a" :: ["d"(1) x "d"(0)] -(1)-> "a"(1)
  "\"nil\"_d" :: [] -(0)-> "d"(1)
  "\"pair\"_b" :: ["d"(10) x "d"(0)] -(1)-> "b"(1)
  "\"s\"_d" :: ["d"(11)] -(1)-> "d"(1)
  "\"true\"_c" :: [] -(0)-> "c"(1)