WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> Nat(14)
  0 :: [] -(0)-> Nat(10)
  id :: [Nat(14)] -(15)-> Nat(0)
  s :: [Nat(14)] -(14)-> Nat(14)
  s :: [Nat(0)] -(0)-> Nat(0)


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

  0 :: [] -(0)-> Nat_cf(0)
  id :: [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)