WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(0, 1)
  1 :: [] -(0)-> A(0, 1)
  c :: [A(10, 0)] -(10)-> A(10, 0)
  c :: [A(0, 0)] -(0)-> A(0, 2)
  f :: [A(0, 1)] -(1)-> A(14, 14)
  false :: [] -(0)-> A(1, 0)
  false :: [] -(0)-> A(15, 14)
  g :: [A(1, 2) x A(10, 0)] -(1)-> A(9, 0)
  if :: [A(1, 0) x A(15, 0) x A(11, 0)] -(1)-> A(11, 0)
  s :: [A(0, 1)] -(1)-> A(0, 1)
  s :: [A(0, 2)] -(2)-> A(1, 2)
  s :: [A(0, 0)] -(0)-> A(10, 0)
  s :: [A(0, 0)] -(0)-> A(15, 0)
  s :: [A(0, 0)] -(0)-> A(11, 0)
  s :: [A(0, 2)] -(2)-> A(9, 2)
  true :: [] -(0)-> A(1, 0)
  true :: [] -(0)-> A(15, 14)


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

  0 :: [] -(0)-> A_cf(0, 0)
  1 :: [] -(0)-> A_cf(0, 0)
  c :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  f :: [A_cf(0, 0)] -(0)-> A_cf(12, 8)
  false :: [] -(0)-> A_cf(0, 0)
  false :: [] -(0)-> A_cf(1, 0)
  false :: [] -(0)-> A_cf(14, 10)
  g :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  g :: [A_cf(1, 0) x A_cf(0, 0)] -(0)-> A_cf(1, 0)
  if :: [A_cf(0, 0) x A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  if :: [A_cf(1, 0) x A_cf(10, 0) x A_cf(8, 0)] -(0)-> A_cf(8, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(1, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(10, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(8, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(2, 0)
  true :: [] -(0)-> A_cf(0, 0)
  true :: [] -(0)-> A_cf(1, 0)
  true :: [] -(0)-> A_cf(14, 10)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1, 0)
  0_A :: [] -(0)-> A(0, 1)
  1_A :: [] -(0)-> A(1, 0)
  1_A :: [] -(0)-> A(0, 1)
  c_A :: [A(1, 0)] -(1)-> A(1, 0)
  c_A :: [A(0, 0)] -(0)-> A(0, 1)
  false_A :: [] -(0)-> A(1, 0)
  false_A :: [] -(0)-> A(0, 1)
  s_A :: [A(0, 0)] -(0)-> A(1, 0)
  s_A :: [A(0, 1)] -(1)-> A(0, 1)
  true_A :: [] -(0)-> A(1, 0)
  true_A :: [] -(0)-> A(0, 1)