WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(6, 6)
  "0" :: [] -(0)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(1, 0)
  "0" :: [] -(0)-> "A"(12, 6)
  "false" :: [] -(0)-> "A"(0, 0)
  "if" :: ["A"(0, 0) x "A"(6, 6) x "A"(6, 6)] -(1)-> "A"(6, 6)
  "le" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(0, 0)
  "minus" :: ["A"(6, 6) x "A"(12, 6)] -(1)-> "A"(6, 6)
  "p" :: ["A"(6, 6)] -(1)-> "A"(12, 6)
  "s" :: ["A"(12, 6)] -(6)-> "A"(6, 6)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(18, 6)] -(12)-> "A"(12, 6)
  "true" :: [] -(0)-> "A"(0, 0)


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




Base Constructors:
------------------