WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(1, 0)
  "0" :: [] -(0)-> "A"(0, 0)
  "Cons" :: ["A"(1, 0) x "A"(1, 0)] -(0)-> "A"(1, 1)
  "Cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "Cons" :: ["A"(0, 0) x "A"(1, 0)] -(0)-> "A"(0, 1)
  "Elem" :: ["A"(4, 0)] -(4)-> "A"(4, 0)
  "Elem" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "Elem" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "Elem" :: ["A"(2, 0)] -(2)-> "A"(2, 0)
  "False" :: [] -(0)-> "A"(0, 0)
  "Nil" :: [] -(0)-> "A"(1, 0)
  "Nil" :: [] -(0)-> "A"(1, 1)
  "Nil" :: [] -(0)-> "A"(0, 0)
  "Node" :: ["A"(3, 0) x "A"(4, 0) x "A"(0, 0)] -(0)-> "A"(3, 4)
  "Node" :: ["A"(0, 0) x "A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "Node" :: ["A"(1, 0) x "A"(1, 0) x "A"(0, 0)] -(0)-> "A"(1, 1)
  "Node" :: ["A"(5, 0) x "A"(6, 0) x "A"(0, 0)] -(0)-> "A"(5, 6)
  "Node" :: ["A"(1, 0) x "A"(0, 0) x "A"(0, 0)] -(0)-> "A"(1, 0)
  "Node" :: ["A"(0, 0) x "A"(1, 0) x "A"(0, 0)] -(0)-> "A"(0, 1)
  "Node" :: ["A"(1, 0) x "A"(2, 0) x "A"(0, 0)] -(0)-> "A"(1, 2)
  "Node" :: ["A"(4, 0) x "A"(4, 0) x "A"(0, 0)] -(0)-> "A"(4, 4)
  "S" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "S" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "True" :: [] -(0)-> "A"(0, 0)
  "cond_insTree_t_xs_1" :: ["A"(0, 0) x "A"(3, 4) x "A"(0, 0) x "A"(1, 0)] -(1)-> "A"(0, 0)
  "cond_link_t1_t2_2" :: ["A"(0, 0) x "A"(1, 1) x "A"(0, 0) x "A"(0, 0) x "A"(1, 0) x "A"(0, 0) x "A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "leq#2" :: ["A"(1, 0) x "A"(0, 0)] -(1)-> "A"(0, 0)
  "lt#2" :: ["A"(1, 0) x "A"(0, 0)] -(1)-> "A"(0, 0)
  "main" :: ["A"(5, 6) x "A"(1, 1)] -(3)-> "A"(0, 0)


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