WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(0)
  Cons :: [A(1) x A(1)] -(1)-> A(1)
  Cons :: [A(14) x A(14)] -(14)-> A(14)
  Cons :: [A(3) x A(3)] -(3)-> A(3)
  Cons :: [A(0) x A(0)] -(0)-> A(0)
  False :: [] -(0)-> A(14)
  Nil :: [] -(0)-> A(14)
  Nil :: [] -(0)-> A(1)
  Nil :: [] -(0)-> A(3)
  Nil :: [] -(0)-> A(12)
  S :: [A(0)] -(0)-> A(1)
  S :: [A(0)] -(0)-> A(3)
  S :: [A(0)] -(0)-> A(2)
  S :: [A(0)] -(0)-> A(6)
  S :: [A(0)] -(0)-> A(5)
  S :: [A(0)] -(0)-> A(13)
  True :: [] -(0)-> A(14)
  fold :: [A(15) x A(15)] -(15)-> A(0)
  foldl :: [A(3) x A(1)] -(1)-> A(2)
  foldr :: [A(6) x A(14)] -(10)-> A(5)
  notEmpty :: [A(3)] -(8)-> A(0)
  op :: [A(3) x A(2)] -(2)-> A(5)


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

  0 :: [] -(0)-> A_cf(0)
  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  S :: [A_cf(0)] -(0)-> A_cf(0)
  foldl :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  foldr :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  op :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  Cons_A :: [A(1) x A(1)] -(1)-> A(1)
  False_A :: [] -(0)-> A(1)
  Nil_A :: [] -(0)-> A(1)
  S_A :: [A(0)] -(0)-> A(1)
  True_A :: [] -(0)-> A(1)