WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(3, 0)
  "0" :: [] -(0)-> "A"(1, 0)
  "0" :: [] -(0)-> "A"(4, 2)
  "activate" :: ["A"(3, 0)] -(2)-> "A"(0, 0)
  "cons" :: ["A"(1, 0) x "A"(1, 0)] -(0)-> "A"(1, 1)
  "f" :: ["A"(3, 0)] -(4)-> "A"(0, 0)
  "n__f" :: ["A"(3, 0)] -(3)-> "A"(3, 0)
  "n__f" :: ["A"(2, 1)] -(1)-> "A"(1, 1)
  "n__f" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "p" :: ["A"(2, 2)] -(0)-> "A"(3, 0)
  "s" :: ["A"(3, 0)] -(3)-> "A"(3, 0)
  "s" :: ["A"(4, 2)] -(2)-> "A"(2, 2)


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




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