WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(0)
  0 :: [] -(0)-> A(9)
  0 :: [] -(0)-> A(5)
  minus :: [A(9) x A(0)] -(1)-> A(9)
  quot :: [A(9) x A(1)] -(12)-> A(3)
  s :: [A(9)] -(9)-> A(9)
  s :: [A(0)] -(0)-> A(0)
  s :: [A(1)] -(1)-> A(1)
  s :: [A(3)] -(3)-> A(3)


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

  0 :: [] -(0)-> A_cf(0)
  minus :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  quot :: [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)
  s_A :: [A(1)] -(1)-> A(1)