WORST_CASE(?,O(n^1))

Solution:
---------

  "a" :: [] -(0)-> "A"(14)
  "div" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "div" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "dx" :: ["A"(14)] -(2)-> "A"(0)
  "exp" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "exp" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "ln" :: ["A"(14)] -(14)-> "A"(14)
  "ln" :: ["A"(0)] -(0)-> "A"(0)
  "minus" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "minus" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "neg" :: ["A"(14)] -(14)-> "A"(14)
  "neg" :: ["A"(0)] -(0)-> "A"(0)
  "one" :: [] -(0)-> "A"(8)
  "one" :: [] -(0)-> "A"(12)
  "plus" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "plus" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "times" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "times" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "two" :: [] -(0)-> "A"(12)
  "zero" :: [] -(0)-> "A"(8)


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




Base Constructors:
------------------
  "\"a\"_A" :: [] -(0)-> "A"(1)
  "\"div\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"exp\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"ln\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"minus\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"neg\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"one\"_A" :: [] -(0)-> "A"(1)
  "\"plus\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"times\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"two\"_A" :: [] -(0)-> "A"(1)
  "\"zero\"_A" :: [] -(0)-> "A"(1)