WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(11)
  0 :: [] -(0)-> A(15)
  2nd :: [A(14)] -(0)-> A(0)
  activate :: [A(11)] -(13)-> A(11)
  cons :: [A(0) x A(2)] -(2)-> A(2)
  cons :: [A(0) x A(14)] -(14)-> A(14)
  cons :: [A(0) x A(11)] -(11)-> A(11)
  from :: [A(0)] -(12)-> A(11)
  head :: [A(2)] -(0)-> A(0)
  n__from :: [A(0)] -(0)-> A(11)
  n__take :: [A(11) x A(11)] -(0)-> A(11)
  nil :: [] -(0)-> A(13)
  s :: [A(11)] -(11)-> A(11)
  s :: [A(15)] -(15)-> A(15)
  s :: [A(0)] -(0)-> A(0)
  sel :: [A(15) x A(11)] -(13)-> A(0)
  take :: [A(11) x A(11)] -(12)-> A(11)


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

  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)
  from :: [A_cf(0)] -(0)-> A_cf(0)
  n__from :: [A_cf(0)] -(0)-> A_cf(0)
  n__take :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  nil :: [] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  sel :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  take :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


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