WORST_CASE(?,O(n^1))

Solution:
---------

  = :: [A(14) x A(12)] -(14)-> A(0)
  and :: [A(0) x A(0)] -(0)-> A(2)
  and :: [A(0) x A(0)] -(0)-> A(6)
  implies :: [A(11) x A(14)] -(15)-> A(0)
  not :: [A(14)] -(14)-> A(0)
  or :: [A(12) x A(14)] -(14)-> A(0)
  true :: [] -(0)-> A(10)
  true :: [] -(0)-> A(8)
  true :: [] -(0)-> A(0)
  xor :: [A(0) x A(0)] -(0)-> A(4)
  xor :: [A(0) x A(0)] -(0)-> A(12)
  xor :: [A(0) x A(0)] -(0)-> A(2)
  xor :: [A(0) x A(0)] -(0)-> A(0)


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




Base Constructors:
------------------
  and_A :: [A(0) x A(0)] -(0)-> A(1)
  true_A :: [] -(0)-> A(1)
  xor_A :: [A(0) x A(0)] -(0)-> A(1)