WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(1, 0)
  "0" :: [] -(0)-> "A"(5, 4)
  "false" :: [] -(0)-> "A"(0, 0)
  "if_mod" :: ["A"(0, 0) x "A"(4, 4) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "le" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(0, 0)
  "minus" :: ["A"(5, 4) x "A"(0, 0)] -(1)-> "A"(5, 4)
  "mod" :: ["A"(5, 4) x "A"(0, 0)] -(1)-> "A"(0, 0)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(9, 4)] -(5)-> "A"(5, 4)
  "s" :: ["A"(8, 4)] -(4)-> "A"(4, 4)
  "true" :: [] -(0)-> "A"(0, 0)


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




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