WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> Nat(0)
  0 :: [] -(0)-> Nat(13)
  0 :: [] -(0)-> Nat(14)
  minus :: [Nat(13) x Nat(0)] -(8)-> Nat(13)
  quot :: [Nat(13) x Nat(1)] -(4)-> Nat(0)
  s :: [Nat(13)] -(13)-> Nat(13)
  s :: [Nat(0)] -(0)-> Nat(0)
  s :: [Nat(1)] -(1)-> Nat(1)


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

  0 :: [] -(0)-> Nat_cf(0)
  minus :: [Nat_cf(0) x Nat_cf(0)] -(0)-> Nat_cf(0)
  quot :: [Nat_cf(0) x Nat_cf(0)] -(0)-> Nat_cf(0)
  s :: [Nat_cf(0)] -(0)-> Nat_cf(0)


Base Constructors:
------------------
  0_Nat :: [] -(0)-> Nat(1)
  s_Nat :: [Nat(1)] -(1)-> Nat(1)