WORST_CASE(?,O(n^1))

Solution:
---------

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


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




Base Constructors:
------------------
  "\"0\"_c" :: [] -(0)-> "c"(1)
  "\"app\"_b" :: ["c"(0) x "b"(0)] -(0)-> "b"(1)
  "\"div'\"_a" :: ["c"(1) x "c"(1)] -(0)-> "a"(1)
  "\"minus\"_c" :: ["c"(0) x "c"(0)] -(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)