TPTP Problem File: PUZ065+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : PUZ065+1 : TPTP v9.0.0. Released v3.2.0.
% Domain : Puzzles
% Problem : Sudoku 13273
% Version : Especial.
% English :
% Refs : [Hill06] Hillenbrand (2006), Email to G. Sutcliffe
% Source : [Hill06]
% Names :
% Status : Satisfiable
% Rating : 0.17 v9.0.0, 0.40 v8.2.0, 0.33 v8.1.0, 0.25 v7.5.0, 0.33 v7.4.0, 0.00 v7.1.0, 0.25 v7.0.0, 0.00 v6.4.0, 0.60 v6.2.0, 0.50 v6.1.0, 0.60 v6.0.0, 0.50 v5.5.0, 0.00 v5.0.0, 0.33 v4.0.1, 0.75 v3.7.0, 0.33 v3.4.0, 0.40 v3.3.0, 0.00 v3.2.0
% Syntax : Number of formulae : 370 ( 18 unt; 0 def)
% Number of atoms : 3942 (3941 equ)
% Maximal formula atoms : 36 ( 10 avg)
% Number of connectives : 4580 (1008 ~;2592 |; 980 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 11 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 0 prp; 2-81 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?)
% SPC : FOF_SAT_RFO_SEQ
% Comments : The hardest for SPASS for saturation.
%------------------------------------------------------------------------------
%----Include Sudoku axioms
include('Axioms/PUZ005+0.ax').
%------------------------------------------------------------------------------
%----Preset values
fof(ax353,axiom,
ssA(n1,n2) = n1 ).
fof(ax354,axiom,
ssA(n1,n9) = n9 ).
fof(ax355,axiom,
ssA(n2,n4) = n3 ).
fof(ax356,axiom,
ssA(n2,n7) = n8 ).
fof(ax357,axiom,
ssA(n3,n7) = n6 ).
fof(ax358,axiom,
ssA(n4,n5) = n1 ).
fof(ax359,axiom,
ssA(n4,n6) = n2 ).
fof(ax360,axiom,
ssA(n4,n7) = n4 ).
fof(ax361,axiom,
ssA(n5,n1) = n7 ).
fof(ax362,axiom,
ssA(n5,n3) = n3 ).
fof(ax363,axiom,
ssA(n6,n1) = n5 ).
fof(ax364,axiom,
ssA(n7,n1) = n8 ).
fof(ax365,axiom,
ssA(n7,n4) = n6 ).
fof(ax366,axiom,
ssA(n8,n5) = n4 ).
fof(ax367,axiom,
ssA(n8,n8) = n2 ).
fof(ax368,axiom,
ssA(n9,n4) = n7 ).
fof(ax369,axiom,
ssA(n9,n8) = n5 ).
%------------------------------------------------------------------------------