WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(2, 0)
  "0" :: [] -(0)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(8, 15)
  "0" :: [] -(0)-> "A"(12, 12)
  "0" :: [] -(0)-> "A"(14, 14)
  "0" :: [] -(0)-> "A"(15, 15)
  "a__f" :: ["A"(2, 0)] -(7)-> "A"(2, 0)
  "a__p" :: ["A"(0, 0)] -(1)-> "A"(2, 0)
  "cons" :: ["A"(15, 15) x "A"(15, 15)] -(15)-> "A"(8, 15)
  "cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(8, 0)
  "cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(2, 0)
  "f" :: ["A"(8, 15)] -(8)-> "A"(8, 15)
  "f" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "f" :: ["A"(2, 0)] -(2)-> "A"(2, 0)
  "mark" :: ["A"(8, 15)] -(1)-> "A"(2, 0)
  "p" :: ["A"(15, 15)] -(15)-> "A"(8, 15)
  "p" :: ["A"(0, 0)] -(0)-> "A"(2, 0)
  "s" :: ["A"(0, 0)] -(2)-> "A"(2, 0)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "s" :: ["A"(15, 15)] -(8)-> "A"(8, 15)
  "s" :: ["A"(2, 2)] -(1)-> "A"(1, 2)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"cons\"_A" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(1, 0)
  "\"cons\"_A" :: ["A"(1, 1) x "A"(1, 1)] -(1)-> "A"(0, 1)
  "\"f\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"f\"_A" :: ["A"(0, 1)] -(0)-> "A"(0, 1)
  "\"p\"_A" :: ["A"(0, 0)] -(0)-> "A"(1, 0)
  "\"p\"_A" :: ["A"(1, 1)] -(1)-> "A"(0, 1)
  "\"s\"_A" :: ["A"(0, 0)] -(1)-> "A"(1, 0)
  "\"s\"_A" :: ["A"(1, 1)] -(0)-> "A"(0, 1)