TPTP Problem File: GRA117+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% 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.29 v9.3.0
% Syntax : Number of formulae : 18 ( 15 unt; 0 def)
% Number of atoms : 29 ( 21 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 30 ( 19 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 ( 8 !; 0 ?)
% SPC : FOF_UNS_RFO_SEQ
% Comments :
%------------------------------------------------------------------------------
fof(rsym,axiom,
! [X,Y] :
( ~ r(X,Y)
| r(Y,X) ) ).
fof(rno3cl,axiom,
! [X,Y,Z] :
( X = Y
| X = Z
| Y = Z
| ~ r(X,Y)
| ~ r(X,Z)
| ~ r(Y,Z) ) ).
fof(rno3acl,axiom,
! [X,Y,Z] :
( X = Y
| X = Z
| Y = Z
| r(X,Y)
| r(X,Z)
| r(Y,Z) ) ).
fof(v0nv1,axiom,
v0 != v1 ).
fof(v0nv2,axiom,
v0 != v2 ).
fof(v1nv2,axiom,
v1 != v2 ).
fof(v0nv3,axiom,
v0 != v3 ).
fof(v1nv3,axiom,
v1 != v3 ).
fof(v2nv3,axiom,
v2 != v3 ).
fof(v0nv4,axiom,
v0 != v4 ).
fof(v1nv4,axiom,
v1 != v4 ).
fof(v2nv4,axiom,
v2 != v4 ).
fof(v3nv4,axiom,
v3 != v4 ).
fof(v0nv5,axiom,
v0 != v5 ).
fof(v1nv5,axiom,
v1 != v5 ).
fof(v2nv5,axiom,
v2 != v5 ).
fof(v3nv5,axiom,
v3 != v5 ).
fof(v4nv5,axiom,
v4 != v5 ).
%------------------------------------------------------------------------------