WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(14)
  0 :: [] -(0)-> A(6)
  activate :: [A(14)] -(6)-> A(0)
  add :: [A(14) x A(14)] -(8)-> A(0)
  cons :: [A(14) x A(14)] -(14)-> A(14)
  cons :: [A(0) x A(0)] -(0)-> A(0)
  cons :: [A(1) x A(1)] -(1)-> A(1)
  from :: [A(3)] -(12)-> A(1)
  fst :: [A(14) x A(14)] -(8)-> A(0)
  len :: [A(14)] -(8)-> A(0)
  n__add :: [A(14) x A(14)] -(14)-> A(14)
  n__add :: [A(0) x A(0)] -(0)-> A(0)
  n__add :: [A(7) x A(7)] -(7)-> A(7)
  n__from :: [A(14)] -(14)-> A(14)
  n__from :: [A(1)] -(1)-> A(1)
  n__from :: [A(3)] -(3)-> A(3)
  n__fst :: [A(14) x A(14)] -(14)-> A(14)
  n__fst :: [A(0) x A(0)] -(0)-> A(0)
  n__fst :: [A(7) x A(7)] -(7)-> A(7)
  n__len :: [A(14)] -(14)-> A(14)
  n__len :: [A(0)] -(0)-> A(0)
  n__len :: [A(7)] -(7)-> A(7)
  nil :: [] -(0)-> A(14)
  nil :: [] -(0)-> A(6)
  s :: [A(14)] -(14)-> A(14)
  s :: [A(1)] -(1)-> A(1)
  s :: [A(0)] -(0)-> A(0)


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

  0 :: [] -(0)-> A_cf(0)
  activate :: [A_cf(0)] -(0)-> A_cf(0)
  add :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  from :: [A_cf(0)] -(0)-> A_cf(0)
  fst :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  len :: [A_cf(0)] -(0)-> A_cf(0)
  n__add :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  n__from :: [A_cf(0)] -(0)-> A_cf(0)
  n__fst :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  n__len :: [A_cf(0)] -(0)-> A_cf(0)
  nil :: [] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  cons_A :: [A(1) x A(1)] -(1)-> A(1)
  n__add_A :: [A(0) x A(0)] -(1)-> A(1)
  n__from_A :: [A(0)] -(1)-> A(1)
  n__fst_A :: [A(0) x A(0)] -(1)-> A(1)
  n__len_A :: [A(0)] -(1)-> A(1)
  nil_A :: [] -(0)-> A(1)
  s_A :: [A(1)] -(1)-> A(1)