%--------------------------------------------------------------------------
% File     : BOO004-0 : TPTP v9.0.0. Released v1.0.0.
% Domain   : Boolean Algebra
% Axioms   : Boolean algebra (equality) axioms
% Version  : [Ver94] (equality) axioms.
% English  :

% Refs     : [Ver94] Veroff (1994), Problem Set
% Source   : [Ver94]
% Names    :

% Status   : Satisfiable
% Syntax   : Number of clauses     :    8 (   8 unt;   0 nHn;   0 RR)
%            Number of literals    :    8 (   8 equ;   0 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)
% SPC      : 

% Comments :
%--------------------------------------------------------------------------
cnf(commutativity_of_add,axiom,
    add(X,Y) = add(Y,X) ).

cnf(commutativity_of_multiply,axiom,
    multiply(X,Y) = multiply(Y,X) ).

cnf(distributivity1,axiom,
    add(X,multiply(Y,Z)) = multiply(add(X,Y),add(X,Z)) ).

cnf(distributivity2,axiom,
    multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)) ).

cnf(additive_id1,axiom,
    add(X,additive_identity) = X ).

cnf(multiplicative_id1,axiom,
    multiply(X,multiplicative_identity) = X ).

cnf(additive_inverse1,axiom,
    add(X,inverse(X)) = multiplicative_identity ).

cnf(multiplicative_inverse1,axiom,
    multiply(X,inverse(X)) = additive_identity ).

%--------------------------------------------------------------------------