WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(9)
  0 :: [] -(0)-> A(7)
  f :: [A(11) x A(9)] -(11)-> A(0)
  g :: [A(14) x A(0)] -(14)-> A(14)
  g :: [A(9) x A(0)] -(9)-> A(9)
  g :: [A(0) x A(0)] -(0)-> A(0)
  nil :: [] -(0)-> A(14)
  nil :: [] -(0)-> A(9)
  nil :: [] -(0)-> A(5)
  nil :: [] -(0)-> A(13)
  norm :: [A(14)] -(8)-> A(1)
  rem :: [A(14) x A(9)] -(8)-> A(7)
  s :: [A(9)] -(9)-> A(9)
  s :: [A(1)] -(1)-> A(1)


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

  0 :: [] -(0)-> A_cf(0)
  f :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  g :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  nil :: [] -(0)-> A_cf(0)
  norm :: [A_cf(0)] -(0)-> A_cf(0)
  rem :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  g_A :: [A(1) x A(0)] -(1)-> A(1)
  nil_A :: [] -(0)-> A(1)
  s_A :: [A(1)] -(1)-> A(1)