WORST_CASE(?,O(n^2))

Solution:
---------

  "!EQ" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(14, 14)
  "0" :: [] -(0)-> "A"(0, 0)
  "Cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "Cons" :: ["A"(14, 0) x "A"(14, 0)] -(14)-> "A"(14, 0)
  "Cons" :: ["A"(0, 14) x "A"(14, 14)] -(14)-> "A"(0, 14)
  "False" :: [] -(0)-> "A"(2, 2)
  "False" :: [] -(0)-> "A"(13, 9)
  "False" :: [] -(0)-> "A"(14, 14)
  "Nil" :: [] -(0)-> "A"(14, 0)
  "Nil" :: [] -(0)-> "A"(0, 0)
  "S" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "True" :: [] -(0)-> "A"(2, 2)
  "True" :: [] -(0)-> "A"(13, 13)
  "True" :: [] -(0)-> "A"(15, 15)
  "loop" :: ["A"(0, 0) x "A"(14, 0) x "A"(0, 1) x "A"(0, 14)] -(15)-> "A"(3, 3)
  "loop[Ite]" :: ["A"(2, 2) x "A"(0, 0) x "A"(14, 0) x "A"(0, 1) x "A"(0, 14)] -(2)-> "A"(3, 3)
  "match1" :: ["A"(12, 12) x "A"(14, 15)] -(16)-> "A"(3, 3)


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




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