WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(14)
  activate :: [A(1)] -(15)-> A(1)
  cons :: [A(9) x A(9)] -(9)-> A(9)
  cons :: [A(12) x A(12)] -(12)-> A(12)
  n__zeros :: [] -(0)-> A(1)
  n__zeros :: [] -(0)-> A(14)
  tail :: [A(9)] -(15)-> A(0)
  zeros :: [] -(14)-> A(2)


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




Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  cons_A :: [A(1) x A(1)] -(1)-> A(1)
  n__zeros_A :: [] -(0)-> A(1)