WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "<=" :: ["A"(0) x "A"(0)] -(0)-> "A"(14)
  "Cons" :: ["A"(9) x "A"(9)] -(9)-> "A"(9)
  "Cons" :: ["A"(12) x "A"(12)] -(12)-> "A"(12)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(3)
  "False" :: [] -(0)-> "A"(15)
  "Nil" :: [] -(0)-> "A"(12)
  "Nil" :: [] -(0)-> "A"(9)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(3)
  "True" :: [] -(0)-> "A"(15)
  "goal" :: ["A"(15) x "A"(14)] -(12)-> "A"(0)
  "merge" :: ["A"(9) x "A"(12)] -(9)-> "A"(0)
  "merge[Ite]" :: ["A"(3) x "A"(9) x "A"(12)] -(5)-> "A"(0)


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




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