TSTP Solution File: MSC008-1.002 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MSC008-1.002 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:39:14 EDT 2023
% Result : Unsatisfiable 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 15
% Syntax : Number of clauses : 102 ( 13 unt; 41 nHn; 78 RR)
% Number of literals : 259 ( 0 equ; 121 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 159 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(greek_element_is_unique,axiom,
( eq(X3,X4)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',greek_element_is_unique) ).
cnf(greek_column_required,axiom,
( greek(X1,p_1,X2)
| greek(X1,p_2,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',greek_column_required) ).
cnf(latin_element_is_unique,axiom,
( eq(X3,X4)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',latin_element_is_unique) ).
cnf(latin_column_required,axiom,
( latin(X1,p_1,X2)
| latin(X1,p_2,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',latin_column_required) ).
cnf(greek_row_required,axiom,
( greek(p_1,X1,X2)
| greek(p_2,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',greek_row_required) ).
cnf(latin_row_required,axiom,
( latin(p_1,X1,X2)
| latin(p_2,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',latin_row_required) ).
cnf(p_1_is_not_p_2,axiom,
~ eq(p_1,p_2),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',p_1_is_not_p_2) ).
cnf(greek_row_is_unique,axiom,
( eq(X1,X4)
| ~ greek(X1,X2,X3)
| ~ greek(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',greek_row_is_unique) ).
cnf(latin_row_is_unique,axiom,
( eq(X1,X4)
| ~ latin(X1,X2,X3)
| ~ latin(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',latin_row_is_unique) ).
cnf(symmetry,axiom,
( eq(X2,X1)
| ~ eq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',symmetry) ).
cnf(no_two_same1,negated_conjecture,
( eq(X2,X6)
| ~ greek(X1,X2,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X5,X6,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',no_two_same1) ).
cnf(greek_cell_element,axiom,
( greek(X1,X2,p_1)
| greek(X1,X2,p_2) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',greek_cell_element) ).
cnf(latin_column_is_unique,axiom,
( eq(X2,X4)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',latin_column_is_unique) ).
cnf(latin_cell_element,axiom,
( latin(X1,X2,p_1)
| latin(X1,X2,p_2) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',latin_cell_element) ).
cnf(greek_column_is_unique,axiom,
( eq(X2,X4)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p',greek_column_is_unique) ).
cnf(c_0_15,axiom,
( eq(X3,X4)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X2,X4) ),
greek_element_is_unique ).
cnf(c_0_16,axiom,
( greek(X1,p_1,X2)
| greek(X1,p_2,X2) ),
greek_column_required ).
cnf(c_0_17,axiom,
( eq(X3,X4)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X2,X4) ),
latin_element_is_unique ).
cnf(c_0_18,axiom,
( latin(X1,p_1,X2)
| latin(X1,p_2,X2) ),
latin_column_required ).
cnf(c_0_19,plain,
( greek(X1,p_1,X2)
| eq(X3,X2)
| ~ greek(X1,p_2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
( greek(p_1,X1,X2)
| greek(p_2,X1,X2) ),
greek_row_required ).
cnf(c_0_21,plain,
( latin(X1,p_1,X2)
| eq(X3,X2)
| ~ latin(X1,p_2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
( latin(p_1,X1,X2)
| latin(p_2,X1,X2) ),
latin_row_required ).
cnf(c_0_23,axiom,
~ eq(p_1,p_2),
p_1_is_not_p_2 ).
cnf(c_0_24,plain,
( greek(p_1,p_2,X1)
| greek(p_2,p_1,X2)
| eq(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( latin(p_1,p_2,X1)
| latin(p_2,p_1,X2)
| eq(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
( eq(X1,X4)
| ~ greek(X1,X2,X3)
| ~ greek(X4,X2,X3) ),
greek_row_is_unique ).
cnf(c_0_27,plain,
( greek(p_2,p_1,p_2)
| greek(p_1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,axiom,
( eq(X1,X4)
| ~ latin(X1,X2,X3)
| ~ latin(X4,X2,X3) ),
latin_row_is_unique ).
cnf(c_0_29,plain,
( latin(p_2,p_1,p_2)
| latin(p_1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_30,plain,
( greek(p_1,p_2,p_1)
| eq(X1,p_2)
| ~ greek(X1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( latin(p_1,p_2,p_1)
| eq(X1,p_2)
| ~ latin(X1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( greek(p_1,p_2,p_1)
| ~ greek(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_33,plain,
( latin(p_1,p_2,p_1)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_34,axiom,
( eq(X2,X1)
| ~ eq(X1,X2) ),
symmetry ).
cnf(c_0_35,plain,
( eq(X1,p_1)
| ~ greek(p_1,p_1,p_2)
| ~ greek(X1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_36,plain,
( eq(X1,p_1)
| ~ latin(p_1,p_1,p_2)
| ~ latin(X1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( eq(X2,X6)
| ~ greek(X1,X2,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X5,X6,X4) ),
no_two_same1 ).
cnf(c_0_38,plain,
( eq(p_1,X1)
| ~ greek(p_1,p_1,p_2)
| ~ greek(X1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( eq(p_1,X1)
| ~ latin(p_1,p_1,p_2)
| ~ latin(X1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( eq(X1,p_2)
| ~ greek(p_1,p_1,p_2)
| ~ greek(X2,X1,p_1)
| ~ latin(p_1,p_2,X3)
| ~ latin(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_41,plain,
( ~ greek(p_1,p_1,p_2)
| ~ greek(p_2,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_38]) ).
cnf(c_0_42,plain,
( ~ latin(p_1,p_1,p_2)
| ~ latin(p_2,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( eq(X1,p_2)
| ~ greek(p_1,p_1,p_2)
| ~ greek(X2,X1,p_1)
| ~ latin(p_1,p_1,p_2)
| ~ latin(X2,X1,p_1) ),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_44,plain,
( greek(p_2,p_1,p_1)
| ~ greek(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_41,c_0_16]) ).
cnf(c_0_45,plain,
( latin(p_2,p_1,p_1)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_46,negated_conjecture,
( ~ greek(p_1,p_1,p_2)
| ~ latin(p_1,p_1,p_2) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_23]),c_0_45]) ).
cnf(c_0_47,axiom,
( greek(X1,X2,p_1)
| greek(X1,X2,p_2) ),
greek_cell_element ).
cnf(c_0_48,negated_conjecture,
( greek(p_1,p_1,p_1)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( eq(X1,p_1)
| ~ greek(X1,p_1,p_1)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_26,c_0_48]) ).
cnf(c_0_50,plain,
( greek(p_1,X1,X2)
| eq(X3,X2)
| ~ greek(p_2,X1,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_51,negated_conjecture,
( eq(p_1,X1)
| ~ greek(X1,p_1,p_1)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_34,c_0_49]) ).
cnf(c_0_52,plain,
( greek(p_2,p_1,X1)
| greek(p_1,p_2,X2)
| eq(X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_16]) ).
cnf(c_0_53,negated_conjecture,
( ~ greek(p_2,p_1,p_1)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_51]) ).
cnf(c_0_54,plain,
( greek(p_1,p_2,p_2)
| greek(p_2,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_55,plain,
( latin(p_1,X1,X2)
| eq(X3,X2)
| ~ latin(p_2,X1,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_56,negated_conjecture,
( greek(p_1,p_2,p_2)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( latin(p_2,p_1,X1)
| latin(p_1,p_2,X2)
| eq(X1,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_18]) ).
cnf(c_0_58,negated_conjecture,
( eq(X1,p_1)
| ~ greek(X1,p_2,p_2)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_26,c_0_56]) ).
cnf(c_0_59,plain,
( latin(p_1,p_2,p_2)
| latin(p_2,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_57]) ).
cnf(c_0_60,axiom,
( eq(X2,X4)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X4,X3) ),
latin_column_is_unique ).
cnf(c_0_61,axiom,
( latin(X1,X2,p_1)
| latin(X1,X2,p_2) ),
latin_cell_element ).
cnf(c_0_62,negated_conjecture,
( eq(p_1,X1)
| ~ greek(X1,p_2,p_2)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_34,c_0_58]) ).
cnf(c_0_63,plain,
( latin(p_1,p_2,p_2)
| eq(X1,p_2)
| ~ latin(X1,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_28,c_0_59]) ).
cnf(c_0_64,plain,
( latin(X1,X2,p_1)
| eq(X3,X2)
| ~ latin(X1,X3,p_2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( greek(X1,p_1,X2)
| eq(X3,p_2)
| ~ greek(X4,X3,X2)
| ~ latin(X1,p_2,X5)
| ~ latin(X4,X3,X5) ),
inference(spm,[status(thm)],[c_0_37,c_0_16]) ).
cnf(c_0_66,negated_conjecture,
( ~ greek(p_2,p_2,p_2)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_62]) ).
cnf(c_0_67,plain,
( latin(p_1,p_2,p_2)
| ~ latin(p_1,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_63]) ).
cnf(c_0_68,plain,
( latin(p_1,p_2,p_2)
| eq(X1,p_1)
| ~ latin(p_2,X1,p_1) ),
inference(spm,[status(thm)],[c_0_60,c_0_59]) ).
cnf(c_0_69,plain,
( latin(p_1,X1,p_2)
| latin(p_2,X2,p_1)
| eq(X1,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_22]) ).
cnf(c_0_70,negated_conjecture,
( greek(p_1,p_1,X1)
| eq(X2,p_2)
| ~ greek(X3,X2,X1)
| ~ latin(p_1,p_1,p_2)
| ~ latin(X3,X2,p_1) ),
inference(spm,[status(thm)],[c_0_65,c_0_33]) ).
cnf(c_0_71,negated_conjecture,
( greek(p_2,p_1,p_2)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_66,c_0_16]) ).
cnf(c_0_72,plain,
( eq(X1,p_1)
| ~ latin(p_1,p_1,p_1)
| ~ latin(X1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_28,c_0_67]) ).
cnf(c_0_73,plain,
( latin(p_1,p_2,p_2)
| eq(p_1,X1)
| ~ latin(p_2,X1,p_1) ),
inference(spm,[status(thm)],[c_0_34,c_0_68]) ).
cnf(c_0_74,plain,
( latin(p_2,p_2,p_1)
| latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
~ latin(p_1,p_1,p_2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_23]),c_0_45]),c_0_46]) ).
cnf(c_0_76,plain,
( eq(p_1,X1)
| ~ latin(p_1,p_1,p_1)
| ~ latin(X1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_34,c_0_72]) ).
cnf(c_0_77,axiom,
( eq(X2,X4)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X4,X3) ),
greek_column_is_unique ).
cnf(c_0_78,plain,
( latin(p_1,p_2,p_2)
| ~ latin(p_2,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_73]) ).
cnf(c_0_79,plain,
latin(p_2,p_2,p_1),
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,plain,
( ~ latin(p_1,p_1,p_1)
| ~ latin(p_2,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_76]) ).
cnf(c_0_81,plain,
( greek(X1,X2,p_1)
| eq(X3,X2)
| ~ greek(X1,X3,p_2) ),
inference(spm,[status(thm)],[c_0_77,c_0_47]) ).
cnf(c_0_82,plain,
latin(p_1,p_2,p_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]) ).
cnf(c_0_83,plain,
( latin(p_2,p_1,p_2)
| ~ latin(p_1,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_80,c_0_18]) ).
cnf(c_0_84,negated_conjecture,
latin(p_1,p_1,p_1),
inference(spm,[status(thm)],[c_0_75,c_0_61]) ).
cnf(c_0_85,plain,
( greek(p_1,p_2,p_2)
| eq(X1,p_1)
| ~ greek(p_2,X1,p_1) ),
inference(spm,[status(thm)],[c_0_77,c_0_54]) ).
cnf(c_0_86,plain,
( greek(p_1,X1,p_2)
| greek(p_2,X2,p_1)
| eq(X1,X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_20]) ).
cnf(c_0_87,negated_conjecture,
( eq(X1,p_2)
| ~ greek(p_1,p_1,p_2)
| ~ greek(X2,X1,p_1)
| ~ latin(X2,X1,p_2) ),
inference(spm,[status(thm)],[c_0_40,c_0_82]) ).
cnf(c_0_88,plain,
latin(p_2,p_1,p_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).
cnf(c_0_89,plain,
( greek(p_1,p_2,p_2)
| eq(p_1,X1)
| ~ greek(p_2,X1,p_1) ),
inference(spm,[status(thm)],[c_0_34,c_0_85]) ).
cnf(c_0_90,plain,
( greek(p_2,p_2,p_1)
| greek(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_86]) ).
cnf(c_0_91,negated_conjecture,
~ greek(p_1,p_1,p_2),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_44]),c_0_88])]),c_0_23]) ).
cnf(c_0_92,plain,
( eq(X1,p_2)
| ~ latin(p_1,p_1,p_1)
| ~ latin(p_1,p_2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_67]) ).
cnf(c_0_93,negated_conjecture,
( greek(p_1,X1,X2)
| eq(X3,X1)
| ~ greek(X4,X3,X2)
| ~ latin(p_2,X1,X5)
| ~ latin(X4,X3,X5) ),
inference(spm,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_94,plain,
( greek(p_1,p_2,p_2)
| ~ greek(p_2,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_89]) ).
cnf(c_0_95,plain,
greek(p_2,p_2,p_1),
inference(sr,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_96,plain,
( ~ latin(p_1,p_1,p_1)
| ~ latin(p_1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_92]) ).
cnf(c_0_97,negated_conjecture,
( greek(p_1,p_1,X1)
| latin(p_1,p_2,p_1)
| eq(X2,p_1)
| ~ greek(X3,X2,X1)
| ~ latin(X3,X2,p_2) ),
inference(spm,[status(thm)],[c_0_93,c_0_29]) ).
cnf(c_0_98,plain,
greek(p_1,p_2,p_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95])]) ).
cnf(c_0_99,plain,
~ latin(p_1,p_2,p_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_84])]) ).
cnf(c_0_100,negated_conjecture,
eq(p_2,p_1),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_82])]),c_0_91]),c_0_99]) ).
cnf(c_0_101,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_100]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MSC008-1.002 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 11:15:15 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.zpkhqVIVzZ/E---3.1_31203.p
% 0.20/0.55 # Version: 3.1pre001
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_1 with pid 31326 completed with status 0
% 0.20/0.55 # Result found by new_bool_1
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # SAT001_MinMin_p005000_rr_RG with pid 31332 completed with status 0
% 0.20/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # Preprocessing time : 0.001 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Unsatisfiable
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 17
% 0.20/0.55 # Removed by relevancy pruning/SinE : 0
% 0.20/0.55 # Initial clauses : 17
% 0.20/0.55 # Removed in clause preprocessing : 0
% 0.20/0.55 # Initial clauses in saturation : 17
% 0.20/0.55 # Processed clauses : 844
% 0.20/0.55 # ...of these trivial : 6
% 0.20/0.55 # ...subsumed : 390
% 0.20/0.55 # ...remaining for further processing : 448
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 128
% 0.20/0.55 # Backward-rewritten : 114
% 0.20/0.55 # Generated clauses : 2467
% 0.20/0.55 # ...of the previous two non-redundant : 2206
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 3
% 0.20/0.55 # Paramodulations : 2425
% 0.20/0.55 # Factorizations : 24
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Total rewrite steps : 461
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 171
% 0.20/0.55 # Positive orientable unit clauses : 9
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 9
% 0.20/0.55 # Non-unit-clauses : 153
% 0.20/0.55 # Current number of unprocessed clauses: 1390
% 0.20/0.55 # ...number of literals in the above : 6377
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 277
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 15345
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 9492
% 0.20/0.55 # Non-unit clause-clause subsumptions : 396
% 0.20/0.55 # Unit Clause-clause subsumption calls : 500
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 26
% 0.20/0.55 # BW rewrite match successes : 6
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 34192
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.068 s
% 0.20/0.55 # System time : 0.004 s
% 0.20/0.55 # Total time : 0.072 s
% 0.20/0.55 # Maximum resident set size: 1636 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.069 s
% 0.20/0.55 # System time : 0.006 s
% 0.20/0.55 # Total time : 0.075 s
% 0.20/0.55 # Maximum resident set size: 1684 pages
% 0.20/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------