WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(14)
  activate :: [A(0)] -(2)-> A(0)
  afterNth :: [A(14) x A(4)] -(13)-> A(0)
  cons :: [A(0) x A(0)] -(0)-> A(0)
  cons :: [A(0) x A(0)] -(13)-> A(13)
  fst :: [A(8)] -(0)-> A(0)
  head :: [A(0)] -(1)-> A(0)
  n__natsFrom :: [A(0)] -(0)-> A(0)
  natsFrom :: [A(0)] -(1)-> A(0)
  nil :: [] -(0)-> A(14)
  pair :: [A(0) x A(0)] -(8)-> A(8)
  pair :: [A(0) x A(0)] -(3)-> A(3)
  pair :: [A(0) x A(0)] -(9)-> A(9)
  s :: [A(14)] -(14)-> A(14)
  s :: [A(0)] -(0)-> A(0)
  sel :: [A(14) x A(10)] -(15)-> A(0)
  snd :: [A(3)] -(0)-> A(0)
  splitAt :: [A(14) x A(0)] -(12)-> A(8)
  tail :: [A(13)] -(1)-> A(0)
  take :: [A(14) x A(2)] -(15)-> A(0)
  u :: [A(8) x A(0) x A(0) x A(0)] -(8)-> A(8)


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)
  n__natsFrom :: [A_cf(0)] -(0)-> A_cf(0)
  natsFrom :: [A_cf(0)] -(0)-> A_cf(0)
  nil :: [] -(0)-> A_cf(0)
  pair :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  splitAt :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  u :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


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