WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "0" :: [] -(0)-> "A"(12)
  "f" :: ["A"(12) x "A"(12)] -(12)-> "A"(0)
  "g" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "g" :: ["A"(12) x "A"(12)] -(12)-> "A"(12)
  "g" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "g" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "nil" :: [] -(0)-> "A"(14)
  "nil" :: [] -(0)-> "A"(12)
  "nil" :: [] -(0)-> "A"(1)
  "norm" :: ["A"(14)] -(8)-> "A"(2)
  "rem" :: ["A"(1) x "A"(0)] -(12)-> "A"(1)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "s" :: ["A"(0)] -(0)-> "A"(10)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"g\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"nil\"_A" :: [] -(0)-> "A"(1)
  "\"s\"_A" :: ["A"(0)] -(0)-> "A"(1)