BEST_CASE(Omega(n^3),?)

Solution:
---------

  "Cons" :: ["A"(0, 0, 0) x "A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "Cons" :: ["A"(14, 6, 12) x "A"(0, 0, 0)] -(5)-> "A"(4, 1, 0)
  "Cons" :: ["A"(14, 6, 12) x "A"(0, 0, 0)] -(5)-> "A"(4, 0, 1)
  "Nil" :: [] -(0)-> "A"(4, 1, 0)
  "Nil" :: [] -(0)-> "A"(0, 0, 0)
  "Nil" :: [] -(0)-> "A"(4, 0, 1)
  "Nil" :: [] -(0)-> "A"(1, 1, 0)
  "f" :: ["A"(4, 0, 1) x "A"(0, 0, 0)] -(2)-> "A"(0, 0, 0)
  "g" :: ["A"(0, 0, 0) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)
  "h" :: ["A"(4, 1, 0) x "A"(0, 0, 0)] -(2)-> "A"(0, 0, 0)
  "r" :: ["A"(0, 0, 5) x "A"(0, 0, 0)] -(1)-> "A"(15, 15, 11)
  "sp1" :: ["A"(4, 0, 1) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)


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




Base Constructors:
------------------
  "\"Cons\"_A" :: ["A"(2, 1, 1) x "A"(0, 0, 0)] -(1)-> "A"(1, 0, 0)
  "\"Cons\"_A" :: ["A"(6, 2, 8) x "A"(0, 0, 0)] -(1)-> "A"(0, 1, 0)
  "\"Cons\"_A" :: ["A"(6, 2, 8) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1, 0, 0)
  "\"Nil\"_A" :: [] -(0)-> "A"(0, 1, 0)
  "\"Nil\"_A" :: [] -(0)-> "A"(0, 0, 1)