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

% Refs     : [Wos88] Wos (1988), Automated Reasoning - 33 Basic Research Pr
%          : [Win82] Winker (1982), Generation and Verification of Finite M
% Source   : [OTTER]
% Names    :

% Status   : Satisfiable
% Syntax   : Number of clauses     :    5 (   5 unt;   0 nHn;   0 RR)
%            Number of literals    :    5 (   5 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    :    2 (   2 usr;   0 con; 1-3 aty)
%            Number of variables   :   13 (   2 sgn)
% SPC      : 

% Comments : These axioms appear in [Win82], in which ternary_multiply_1 is
%            shown to be independant.
%          : These axioms are also used in [Wos88], p.222.
%--------------------------------------------------------------------------
cnf(associativity,axiom,
    multiply(multiply(V,W,X),Y,multiply(V,W,Z)) = multiply(V,W,multiply(X,Y,Z)) ).

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

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

cnf(left_inverse,axiom,
    multiply(inverse(Y),Y,X) = X ).

cnf(right_inverse,axiom,
    multiply(X,Y,inverse(Y)) = X ).

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