WORST_CASE(?,O(n^1))

Solution:
---------

  2nd :: [A(15)] -(7)-> A(0)
  activate :: [A(15)] -(3)-> A(1)
  cons :: [A(0) x A(0)] -(0)-> A(0)
  cons :: [A(0) x A(15)] -(15)-> A(15)
  cons :: [A(0) x A(2)] -(2)-> A(2)
  cons1 :: [A(0) x A(0)] -(0)-> A(15)
  from :: [A(14)] -(14)-> A(1)
  n__from :: [A(15)] -(15)-> A(15)
  n__from :: [A(2)] -(2)-> A(2)
  n__from :: [A(7)] -(7)-> A(7)
  s :: [A(0)] -(0)-> A(10)


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

  2nd :: [A_cf(0)] -(0)-> A_cf(0)
  activate :: [A_cf(0)] -(0)-> A_cf(0)
  cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  cons1 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  from :: [A_cf(0)] -(0)-> A_cf(0)
  n__from :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  cons1_A :: [A(0) x A(0)] -(0)-> A(1)
  cons_A :: [A(0) x A(1)] -(1)-> A(1)
  n__from_A :: [A(0)] -(1)-> A(1)
  s_A :: [A(0)] -(0)-> A(1)