%------------------------------------------------------------------------------
% File     : GRA117-1 : TPTP v9.3.1. Released v9.3.0.
% Domain   : Graph Theory
% Problem  : Ramsey number r(3,3) = 6
% Version  : Especial.
% English  : The Ramsey property that if an undirected graph has at least 
%            R(m,n) vertices, then it must have either an m-clique or an 
%            n-anticlique.

% Refs     : [Ram30] Ramsey (1930), On a Problem of Formal Logic
%          : [Kal24] Kalizyk (2024), Email to G. Sutcliffe
% Source   : [Kal24]
% Names    : r_3_3_6 [Kal24]

% Status   : Unsatisfiable
% Rating   : 0.12 v9.3.0
% Syntax   : Number of clauses     :   18 (  15 unt;   2 nHn;  17 RR)
%            Number of literals    :   29 (  21 equ;  19 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   0 prp; 2-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    8 (   0 sgn)
% SPC      : CNF_UNS_EPR_SEQ_NHN

% Comments :
%------------------------------------------------------------------------------
cnf(rsym,axiom,
    ( ~ r(X,Y)
    | r(Y,X) ) ).

cnf(rno3cl,axiom,
    ( X = Y
    | X = Z
    | Y = Z
    | ~ r(X,Y)
    | ~ r(X,Z)
    | ~ r(Y,Z) ) ).

cnf(rno3acl,axiom,
    ( X = Y
    | X = Z
    | Y = Z
    | r(X,Y)
    | r(X,Z)
    | r(Y,Z) ) ).

cnf(v0nv1,axiom,
    v0 != v1 ).

cnf(v0nv2,axiom,
    v0 != v2 ).

cnf(v1nv2,axiom,
    v1 != v2 ).

cnf(v0nv3,axiom,
    v0 != v3 ).

cnf(v1nv3,axiom,
    v1 != v3 ).

cnf(v2nv3,axiom,
    v2 != v3 ).

cnf(v0nv4,axiom,
    v0 != v4 ).

cnf(v1nv4,axiom,
    v1 != v4 ).

cnf(v2nv4,axiom,
    v2 != v4 ).

cnf(v3nv4,axiom,
    v3 != v4 ).

cnf(v0nv5,axiom,
    v0 != v5 ).

cnf(v1nv5,axiom,
    v1 != v5 ).

cnf(v2nv5,axiom,
    v2 != v5 ).

cnf(v3nv5,axiom,
    v3 != v5 ).

cnf(v4nv5,axiom,
    v4 != v5 ).

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