WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(15)
  0 :: [] -(0)-> A(12)
  0 :: [] -(0)-> A(14)
  S :: [A(15)] -(15)-> A(15)
  S :: [A(0)] -(0)-> A(0)
  compS_f :: [A(12)] -(12)-> A(12)
  compS_f :: [A(14)] -(14)-> A(14)
  compS_f#1 :: [A(12) x A(0)] -(15)-> A(0)
  id :: [] -(0)-> A(12)
  id :: [] -(0)-> A(14)
  iter#3 :: [A(15)] -(8)-> A(14)
  main :: [A(15)] -(14)-> A(0)


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

  0 :: [] -(0)-> A_cf(0)
  S :: [A_cf(0)] -(0)-> A_cf(0)
  compS_f :: [A_cf(0)] -(0)-> A_cf(0)
  compS_f#1 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  id :: [] -(0)-> A_cf(0)
  iter#3 :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  S_A :: [A(1)] -(1)-> A(1)
  compS_f_A :: [A(0)] -(1)-> A(1)
  id_A :: [] -(0)-> A(1)