WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> Nat(1, 0)
  0 :: [] -(0)-> Nat(0, 13)
  0 :: [] -(0)-> Nat(6, 7)
  add :: [Nat(1, 0) x Nat(0, 0)] -(1)-> Nat(0, 0)
  mult :: [Nat(0, 13) x Nat(13, 12)] -(1)-> Nat(0, 0)
  s :: [Nat(1, 0)] -(1)-> Nat(1, 0)
  s :: [Nat(13, 13)] -(13)-> Nat(0, 13)
  s :: [Nat(0, 0)] -(0)-> Nat(0, 0)


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

  0 :: [] -(0)-> Nat_cf(0, 0)
  0 :: [] -(0)-> Nat_cf(2, 0)
  0 :: [] -(0)-> Nat_cf(2, 2)
  add :: [Nat_cf(0, 0) x Nat_cf(0, 0)] -(0)-> Nat_cf(0, 0)
  mult :: [Nat_cf(2, 0) x Nat_cf(0, 0)] -(10)-> Nat_cf(0, 0)
  s :: [Nat_cf(0, 0)] -(0)-> Nat_cf(0, 0)
  s :: [Nat_cf(2, 0)] -(2)-> Nat_cf(2, 0)


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