WORST_CASE(?,O(n^2))

Solution:
---------

  "-" :: ["A"(0, 0) x "A"(4, 2)] -(1)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(4, 2)
  "0" :: [] -(0)-> "A"(2, 2)
  "greater" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "if" :: ["A"(0, 0) x "A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "p" :: ["A"(2, 2)] -(1)-> "A"(4, 2)
  "s" :: ["A"(6, 2)] -(4)-> "A"(4, 2)
  "s" :: ["A"(4, 2)] -(2)-> "A"(2, 2)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)


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




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