WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> c(15)
  0 :: [] -(0)-> c(5)
  0 :: [] -(0)-> c(0)
  app :: [c(0) x b(6)] -(0)-> b(6)
  div :: [c(5) x c(0)] -(1)-> c(4)
  div' :: [c(15) x c(15)] -(0)-> a(15)
  div' :: [c(0) x c(0)] -(0)-> a(0)
  div' :: [c(4) x c(4)] -(0)-> a(4)
  egypt :: [a(15)] -(3)-> b(6)
  h :: [c(5) x c(0) x c(0)] -(0)-> c(4)
  i :: [a(0) x a(4)] -(2)-> a(15)
  minus :: [c(15) x c(15)] -(0)-> c(15)
  mult :: [c(0) x c(0)] -(0)-> c(15)
  nil :: [] -(0)-> b(8)
  s :: [c(15)] -(15)-> c(15)
  s :: [c(5)] -(5)-> c(5)
  s :: [c(0)] -(0)-> c(0)
  s :: [c(4)] -(4)-> c(4)


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

  0 :: [] -(0)-> c_cf(0)
  app :: [c_cf(0) x b_cf(0)] -(0)-> b_cf(0)
  div :: [c_cf(0) x c_cf(0)] -(0)-> c_cf(0)
  div' :: [c_cf(0) x c_cf(0)] -(0)-> a_cf(0)
  egypt :: [a_cf(0)] -(0)-> b_cf(0)
  h :: [c_cf(0) x c_cf(0) x c_cf(0)] -(0)-> c_cf(0)
  i :: [a_cf(0) x a_cf(0)] -(0)-> a_cf(0)
  minus :: [c_cf(0) x c_cf(0)] -(0)-> c_cf(0)
  mult :: [c_cf(0) x c_cf(0)] -(0)-> c_cf(0)
  nil :: [] -(0)-> b_cf(0)
  s :: [c_cf(0)] -(0)-> c_cf(0)


Base Constructors:
------------------
  0_c :: [] -(0)-> c(1)
  app_b :: [c(0) x b(1)] -(0)-> b(1)
  div'_a :: [c(0) x c(0)] -(0)-> a(0)
  minus_c :: [c(1) x c(1)] -(0)-> c(1)
  mult_c :: [c(0) x c(0)] -(0)-> c(1)
  nil_b :: [] -(0)-> b(1)
  s_c :: [c(1)] -(1)-> c(1)