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)] -(8)-> 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(6)
  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(6)


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

  a :: [] -(0)-> A_cf(0)
  div :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  dx :: [A_cf(0)] -(0)-> A_cf(0)
  exp :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  ln :: [A_cf(0)] -(0)-> A_cf(0)
  minus :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  neg :: [A_cf(0)] -(0)-> A_cf(0)
  one :: [] -(0)-> A_cf(0)
  plus :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  times :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  two :: [] -(0)-> A_cf(0)
  zero :: [] -(0)-> A_cf(0)


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)