WORST_CASE(?,O(n^1))

Solution:
---------

  implies :: [A(15) x A(15)] -(11)-> A(2)
  not :: [A(15)] -(15)-> A(15)
  or :: [A(15) x A(15)] -(15)-> A(15)
  or :: [A(7) x A(7)] -(7)-> A(7)
  or :: [A(2) x A(2)] -(2)-> A(2)


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

  implies :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  not :: [A_cf(0)] -(0)-> A_cf(0)
  or :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


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