WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(1)
  0 :: [] -(0)-> A(0)
  0 :: [] -(0)-> A(4)
  div :: [A(4) x A(0)] -(1)-> A(0)
  false :: [] -(0)-> A(0)
  geq :: [A(1) x A(0)] -(1)-> A(0)
  if :: [A(0) x A(0) x A(0)] -(1)-> A(0)
  minus :: [A(1) x A(0)] -(1)-> A(4)
  s :: [A(1)] -(1)-> A(1)
  s :: [A(0)] -(0)-> A(0)
  s :: [A(4)] -(4)-> A(4)
  true :: [] -(0)-> A(0)


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

  0 :: [] -(0)-> A_cf(0)
  div :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  false :: [] -(0)-> A_cf(0)
  geq :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  if :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  minus :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  true :: [] -(0)-> A_cf(0)