WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "0" :: [] -(0)-> "A"(8)
  "0" :: [] -(0)-> "A"(7)
  "Cons" :: ["A"(13) x "A"(0)] -(13)-> "A"(13)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Cons" :: ["A"(4) x "A"(0)] -(4)-> "A"(4)
  "Elem" :: ["A"(0)] -(0)-> "A"(0)
  "Elem" :: ["A"(8)] -(0)-> "A"(8)
  "False" :: [] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(14)
  "False" :: [] -(0)-> "A"(6)
  "Nil" :: [] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(13)
  "Nil" :: [] -(0)-> "A"(14)
  "Node" :: ["A"(0) x "A"(0) x "A"(0)] -(0)-> "A"(0)
  "Node" :: ["A"(8) x "A"(8) x "A"(8)] -(0)-> "A"(8)
  "Node" :: ["A"(11) x "A"(11) x "A"(11)] -(0)-> "A"(11)
  "Node" :: ["A"(13) x "A"(13) x "A"(13)] -(0)-> "A"(13)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "S" :: ["A"(8)] -(8)-> "A"(8)
  "S" :: ["A"(7)] -(7)-> "A"(7)
  "True" :: [] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(14)
  "cond_insTree_t_xs_1" :: ["A"(0) x "A"(0) x "A"(8) x "A"(0)] -(15)-> "A"(0)
  "cond_link_t1_t2_2" :: ["A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0) x "A"(0)] -(3)-> "A"(0)
  "leq#2" :: ["A"(0) x "A"(8)] -(4)-> "A"(14)
  "lt#2" :: ["A"(7) x "A"(0)] -(1)-> "A"(0)
  "main" :: ["A"(11) x "A"(13)] -(10)-> "A"(0)


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




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