%--------------------------------------------------------------------------
% File     : BOO077-1 : TPTP v9.0.0. Released v2.6.0.
% Domain   : Boolean Algebra
% Problem  : Axiom C1 for Boolean algebra in the Sheffer stroke, part 1
% Version  : [EF+02] axioms.
% English  :

% Refs     : [EF+02] Ernst et al. (2002), More First-order Test Problems in
%          : [MV+02] McCune et al. (2002), Short Single Axioms for Boolean
% Source   : [TPTP]
% Names    :

% Status   : Satisfiable
% Rating   : 1.00 v6.3.0, 0.67 v6.2.0, 0.83 v6.1.0, 1.00 v2.6.0
% Syntax   : Number of clauses     :    2 (   2 unt;   0 nHn;   1 RR)
%            Number of literals    :    2 (   2 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    3 (   1 sgn)
% SPC      : CNF_SAT_RFO_PEQ_UEQ

% Comments : A UEQ part of BOO040-1
%--------------------------------------------------------------------------
cnf(c1,axiom,
    nand(nand(A,nand(nand(B,A),A)),nand(B,nand(A,C))) = B ).

cnf(prove_meredith_2_basis_1,negated_conjecture,
    nand(nand(a,a),nand(b,a)) != a ).

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