WORST_CASE(?,O(n^1))

Solution:
---------

  and :: [A(7) x A(7) x A(7)] -(3)-> A(0)
  band :: [A(0) x A(0)] -(0)-> A(11)
  not :: [A(7)] -(7)-> A(7)


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

  and :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  band :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  not :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  band_A :: [A(0) x A(0)] -(0)-> A(1)
  not_A :: [A(1)] -(1)-> A(1)