WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(0)
  cons :: [A(0)] -(1)-> A(1)
  cons :: [A(0)] -(3)-> A(3)
  cons :: [A(0)] -(14)-> A(14)
  first :: [A(0) x A(1)] -(13)-> A(0)
  from :: [A(14)] -(15)-> A(0)
  nil :: [] -(0)-> A(14)
  s :: [A(0)] -(0)-> A(0)


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




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