WORST_CASE(?,O(n^1))

Solution:
---------

  - :: [A(8) x A(8)] -(8)-> A(0)
  0 :: [] -(0)-> A(15)
  0 :: [] -(0)-> A(2)
  0 :: [] -(0)-> A(8)
  0 :: [] -(0)-> A(13)
  0 :: [] -(0)-> A(5)
  0 :: [] -(0)-> A(7)
  double :: [A(15)] -(12)-> A(2)
  half :: [A(2)] -(1)-> A(0)
  if :: [A(13) x A(15) x A(15)] -(8)-> A(0)
  s :: [A(15)] -(15)-> A(15)
  s :: [A(2)] -(2)-> A(2)
  s :: [A(8)] -(8)-> A(8)
  s :: [A(13)] -(13)-> A(13)
  s :: [A(0)] -(0)-> A(0)


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

  - :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  0 :: [] -(0)-> A_cf(0)
  double :: [A_cf(0)] -(0)-> A_cf(0)
  half :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


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