WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(6)
  0 :: [] -(0)-> A(5)
  0 :: [] -(0)-> A(14)
  = :: [A(1) x A(0)] -(0)-> A(1)
  and :: [A(0) x A(0)] -(0)-> A(12)
  divp :: [A(0) x A(0)] -(1)-> A(1)
  false :: [] -(0)-> A(11)
  false :: [] -(0)-> A(15)
  not :: [A(1)] -(1)-> A(1)
  prime :: [A(6)] -(11)-> A(4)
  prime1 :: [A(0) x A(5)] -(4)-> A(9)
  rem :: [A(0) x A(0)] -(0)-> A(1)
  s :: [A(6)] -(6)-> A(6)
  s :: [A(5)] -(5)-> A(5)
  s :: [A(0)] -(0)-> A(0)
  true :: [] -(0)-> A(15)


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

  0 :: [] -(0)-> A_cf(0)
  = :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  and :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  divp :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  false :: [] -(0)-> A_cf(0)
  not :: [A_cf(0)] -(0)-> A_cf(0)
  prime1 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  rem :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  true :: [] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  =_A :: [A(0) x A(0)] -(0)-> A(0)
  and_A :: [A(0) x A(0)] -(0)-> A(1)
  false_A :: [] -(0)-> A(1)
  not_A :: [A(1)] -(1)-> A(1)
  rem_A :: [A(0) x A(0)] -(0)-> A(1)
  s_A :: [A(1)] -(1)-> A(1)
  true_A :: [] -(0)-> A(1)