WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "Nat"(0)
  "0" :: [] -(0)-> "Nat"(2)
  "minus" :: ["Nat"(2) x "Nat"(0)] -(1)-> "Nat"(2)
  "quot" :: ["Nat"(2) x "Nat"(0)] -(1)-> "Nat"(0)
  "s" :: ["Nat"(2)] -(2)-> "Nat"(2)
  "s" :: ["Nat"(0)] -(0)-> "Nat"(0)


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:
------------------