%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MSC008-1.002 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:29:53 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.48s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 15
% Syntax : Number of clauses : 111 ( 14 unt; 41 nHn; 87 RR)
% Number of literals : 285 ( 0 equ; 139 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 : 191 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(greek_element_is_unique,axiom,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_element_is_unique) ).
cnf(latin_element_is_unique,axiom,
( ~ latin(X1,X2,X4)
| ~ latin(X1,X2,X3)
| eq(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_element_is_unique) ).
cnf(greek_column_required,axiom,
( greek(X1,p_2,X2)
| greek(X1,p_1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_column_required) ).
cnf(latin_column_required,axiom,
( latin(X1,p_2,X2)
| latin(X1,p_1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_column_required) ).
cnf(p_1_is_not_p_2,axiom,
~ eq(p_1,p_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_1_is_not_p_2) ).
cnf(greek_row_required,axiom,
( greek(p_2,X1,X2)
| greek(p_1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_row_required) ).
cnf(latin_row_required,axiom,
( latin(p_2,X1,X2)
| latin(p_1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_row_required) ).
cnf(greek_row_is_unique,axiom,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_row_is_unique) ).
cnf(latin_row_is_unique,axiom,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_row_is_unique) ).
cnf(symmetry,axiom,
( ~ eq(X1,X2)
| eq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry) ).
cnf(no_two_same1,negated_conjecture,
( ~ latin(X5,X6,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X2,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_two_same1) ).
cnf(greek_cell_element,axiom,
( greek(X1,X2,p_2)
| greek(X1,X2,p_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_cell_element) ).
cnf(latin_column_is_unique,axiom,
( ~ latin(X1,X4,X3)
| ~ latin(X1,X2,X3)
| eq(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_column_is_unique) ).
cnf(latin_cell_element,axiom,
( latin(X1,X2,p_2)
| latin(X1,X2,p_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_cell_element) ).
cnf(greek_column_is_unique,axiom,
( ~ greek(X1,X4,X3)
| ~ greek(X1,X2,X3)
| eq(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_column_is_unique) ).
cnf(c_0_15,plain,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X3,X4) ),
inference(fof_simplification,[status(thm)],[greek_element_is_unique]) ).
cnf(c_0_16,plain,
( ~ latin(X1,X2,X4)
| ~ latin(X1,X2,X3)
| eq(X3,X4) ),
inference(fof_simplification,[status(thm)],[latin_element_is_unique]) ).
cnf(c_0_17,plain,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X3,X4) ),
c_0_15 ).
cnf(c_0_18,axiom,
( greek(X1,p_2,X2)
| greek(X1,p_1,X2) ),
greek_column_required ).
cnf(c_0_19,plain,
( ~ latin(X1,X2,X4)
| ~ latin(X1,X2,X3)
| eq(X3,X4) ),
c_0_16 ).
cnf(c_0_20,axiom,
( latin(X1,p_2,X2)
| latin(X1,p_1,X2) ),
latin_column_required ).
cnf(c_0_21,plain,
~ eq(p_1,p_2),
inference(fof_simplification,[status(thm)],[p_1_is_not_p_2]) ).
cnf(c_0_22,plain,
( ~ greek(X1,p_2,X3)
| eq(X3,X2)
| greek(X1,p_1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
( greek(p_2,X1,X2)
| greek(p_1,X1,X2) ),
greek_row_required ).
cnf(c_0_24,plain,
( ~ latin(X1,p_2,X3)
| eq(X3,X2)
| latin(X1,p_1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
( latin(p_2,X1,X2)
| latin(p_1,X1,X2) ),
latin_row_required ).
cnf(c_0_26,plain,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X1,X4) ),
inference(fof_simplification,[status(thm)],[greek_row_is_unique]) ).
cnf(c_0_27,plain,
~ eq(p_1,p_2),
c_0_21 ).
cnf(c_0_28,plain,
( eq(X1,X2)
| greek(p_2,p_1,X2)
| greek(p_1,p_2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X1,X4) ),
inference(fof_simplification,[status(thm)],[latin_row_is_unique]) ).
cnf(c_0_30,plain,
( eq(X1,X2)
| latin(p_2,p_1,X2)
| latin(p_1,p_2,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X1,X4) ),
c_0_26 ).
cnf(c_0_32,plain,
( greek(p_1,p_2,p_1)
| greek(p_2,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X1,X4) ),
c_0_29 ).
cnf(c_0_34,plain,
( latin(p_1,p_2,p_1)
| latin(p_2,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_35,plain,
( ~ greek(X1,p_1,p_2)
| eq(X1,p_2)
| greek(p_1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( ~ latin(X1,p_1,p_2)
| eq(X1,p_2)
| latin(p_1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( ~ eq(X1,X2)
| eq(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry]) ).
cnf(c_0_38,plain,
( ~ greek(p_1,p_1,p_2)
| greek(p_1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_35]) ).
cnf(c_0_39,plain,
( ~ latin(p_1,p_1,p_2)
| latin(p_1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( ~ latin(X5,X6,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X2,X6) ),
inference(fof_simplification,[status(thm)],[no_two_same1]) ).
cnf(c_0_41,plain,
( ~ eq(X1,X2)
| eq(X2,X1) ),
c_0_37 ).
cnf(c_0_42,plain,
( ~ greek(X1,p_2,p_1)
| ~ greek(p_1,p_1,p_2)
| eq(X1,p_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_43,plain,
( ~ latin(X1,p_2,p_1)
| ~ latin(p_1,p_1,p_2)
| eq(X1,p_1) ),
inference(spm,[status(thm)],[c_0_33,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( ~ latin(X5,X6,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X2,X6) ),
c_0_40 ).
cnf(c_0_45,plain,
( ~ greek(X1,p_2,p_1)
| ~ greek(p_1,p_1,p_2)
| eq(p_1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( ~ latin(X1,p_2,p_1)
| ~ latin(p_1,p_1,p_2)
| eq(p_1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( ~ latin(X2,X1,X3)
| ~ latin(p_1,p_2,X3)
| ~ greek(X2,X1,p_1)
| ~ greek(p_1,p_1,p_2)
| eq(X1,p_2) ),
inference(spm,[status(thm)],[c_0_44,c_0_38]) ).
cnf(c_0_48,plain,
( ~ greek(p_2,p_2,p_1)
| ~ greek(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_45]) ).
cnf(c_0_49,plain,
( ~ latin(p_2,p_2,p_1)
| ~ latin(p_1,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( ~ latin(X2,X1,p_1)
| ~ latin(p_1,p_1,p_2)
| ~ greek(X2,X1,p_1)
| ~ greek(p_1,p_1,p_2)
| eq(X1,p_2) ),
inference(spm,[status(thm)],[c_0_47,c_0_39]) ).
cnf(c_0_51,plain,
( ~ greek(p_1,p_1,p_2)
| greek(p_2,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_48,c_0_18]) ).
cnf(c_0_52,plain,
( ~ latin(p_1,p_1,p_2)
| latin(p_2,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_49,c_0_20]) ).
cnf(c_0_53,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| ~ greek(p_1,p_1,p_2) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_27]),c_0_52]) ).
cnf(c_0_54,axiom,
( greek(X1,X2,p_2)
| greek(X1,X2,p_1) ),
greek_cell_element ).
cnf(c_0_55,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| greek(p_1,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| ~ greek(X1,p_1,p_1)
| eq(X1,p_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_55]) ).
cnf(c_0_57,plain,
( ~ greek(p_2,X1,X3)
| eq(X3,X2)
| greek(p_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_58,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| ~ greek(X1,p_1,p_1)
| eq(p_1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_56]) ).
cnf(c_0_59,plain,
( eq(X1,X2)
| greek(p_1,p_2,X2)
| greek(p_2,p_1,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_18]) ).
cnf(c_0_60,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| ~ greek(p_2,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_58]) ).
cnf(c_0_61,plain,
( greek(p_2,p_1,p_1)
| greek(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_59]) ).
cnf(c_0_62,plain,
( ~ latin(p_2,X1,X3)
| eq(X3,X2)
| latin(p_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_63,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| greek(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( eq(X1,X2)
| latin(p_1,p_2,X2)
| latin(p_2,p_1,X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_20]) ).
cnf(c_0_65,plain,
( ~ latin(X1,X4,X3)
| ~ latin(X1,X2,X3)
| eq(X2,X4) ),
inference(fof_simplification,[status(thm)],[latin_column_is_unique]) ).
cnf(c_0_66,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| ~ greek(X1,p_2,p_2)
| eq(X1,p_1) ),
inference(spm,[status(thm)],[c_0_31,c_0_63]) ).
cnf(c_0_67,plain,
( latin(p_2,p_1,p_1)
| latin(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_64]) ).
cnf(c_0_68,plain,
( ~ latin(X1,X4,X3)
| ~ latin(X1,X2,X3)
| eq(X2,X4) ),
c_0_65 ).
cnf(c_0_69,axiom,
( latin(X1,X2,p_2)
| latin(X1,X2,p_1) ),
latin_cell_element ).
cnf(c_0_70,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| ~ greek(X1,p_2,p_2)
| eq(p_1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_66]) ).
cnf(c_0_71,plain,
( ~ latin(X1,p_1,p_1)
| eq(X1,p_2)
| latin(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_33,c_0_67]) ).
cnf(c_0_72,plain,
( ~ latin(X1,X3,p_2)
| eq(X3,X2)
| latin(X1,X2,p_1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( ~ latin(X4,X3,X5)
| ~ latin(X1,p_2,X5)
| ~ greek(X4,X3,X2)
| eq(X3,p_2)
| greek(X1,p_1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_18]) ).
cnf(c_0_74,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| ~ greek(p_2,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_70]) ).
cnf(c_0_75,plain,
( ~ latin(p_1,p_1,p_1)
| latin(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_71]) ).
cnf(c_0_76,plain,
( ~ latin(p_2,X1,p_1)
| eq(X1,p_1)
| latin(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_68,c_0_67]) ).
cnf(c_0_77,plain,
( eq(X1,X2)
| latin(p_2,X2,p_1)
| latin(p_1,X1,p_2) ),
inference(spm,[status(thm)],[c_0_72,c_0_25]) ).
cnf(c_0_78,negated_conjecture,
( ~ latin(X3,X2,p_1)
| ~ latin(p_1,p_1,p_2)
| ~ greek(X3,X2,X1)
| eq(X2,p_2)
| greek(p_1,p_1,X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_39]) ).
cnf(c_0_79,negated_conjecture,
( ~ latin(p_1,p_1,p_2)
| greek(p_2,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_74,c_0_18]) ).
cnf(c_0_80,plain,
( ~ latin(X1,p_2,p_2)
| ~ latin(p_1,p_1,p_1)
| eq(X1,p_1) ),
inference(spm,[status(thm)],[c_0_33,c_0_75]) ).
cnf(c_0_81,plain,
( ~ greek(X1,X4,X3)
| ~ greek(X1,X2,X3)
| eq(X2,X4) ),
inference(fof_simplification,[status(thm)],[greek_column_is_unique]) ).
cnf(c_0_82,plain,
( ~ latin(p_2,X1,p_1)
| eq(p_1,X1)
| latin(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_41,c_0_76]) ).
cnf(c_0_83,plain,
( latin(p_1,p_1,p_2)
| latin(p_2,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_77]) ).
cnf(c_0_84,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_78,c_0_79]),c_0_27]),c_0_52]),c_0_53]) ).
cnf(c_0_85,plain,
( ~ latin(X1,p_2,p_2)
| ~ latin(p_1,p_1,p_1)
| eq(p_1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_80]) ).
cnf(c_0_86,plain,
( ~ greek(X1,X4,X3)
| ~ greek(X1,X2,X3)
| eq(X2,X4) ),
c_0_81 ).
cnf(c_0_87,plain,
( ~ latin(p_2,p_2,p_1)
| latin(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_82]) ).
cnf(c_0_88,plain,
latin(p_2,p_2,p_1),
inference(sr,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_89,plain,
( ~ latin(p_2,p_2,p_2)
| ~ latin(p_1,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_85]) ).
cnf(c_0_90,plain,
( ~ greek(X1,X3,p_2)
| eq(X3,X2)
| greek(X1,X2,p_1) ),
inference(spm,[status(thm)],[c_0_86,c_0_54]) ).
cnf(c_0_91,plain,
latin(p_1,p_2,p_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_92,plain,
( ~ latin(p_1,p_1,p_1)
| latin(p_2,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_89,c_0_20]) ).
cnf(c_0_93,negated_conjecture,
latin(p_1,p_1,p_1),
inference(spm,[status(thm)],[c_0_84,c_0_69]) ).
cnf(c_0_94,plain,
( ~ greek(p_2,X1,p_1)
| eq(X1,p_1)
| greek(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_86,c_0_61]) ).
cnf(c_0_95,plain,
( eq(X1,X2)
| greek(p_2,X2,p_1)
| greek(p_1,X1,p_2) ),
inference(spm,[status(thm)],[c_0_90,c_0_23]) ).
cnf(c_0_96,negated_conjecture,
( ~ latin(X2,X1,p_2)
| ~ greek(X2,X1,p_1)
| ~ greek(p_1,p_1,p_2)
| eq(X1,p_2) ),
inference(spm,[status(thm)],[c_0_47,c_0_91]) ).
cnf(c_0_97,plain,
latin(p_2,p_1,p_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_98,plain,
( ~ greek(p_2,X1,p_1)
| eq(p_1,X1)
| greek(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_41,c_0_94]) ).
cnf(c_0_99,plain,
( greek(p_1,p_1,p_2)
| greek(p_2,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_95]) ).
cnf(c_0_100,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_96,c_0_51]),c_0_97])]),c_0_27]) ).
cnf(c_0_101,plain,
( ~ latin(p_1,p_2,X1)
| ~ latin(p_1,p_1,p_1)
| eq(X1,p_2) ),
inference(spm,[status(thm)],[c_0_19,c_0_75]) ).
cnf(c_0_102,negated_conjecture,
( ~ latin(X4,X3,X5)
| ~ latin(p_2,X1,X5)
| ~ greek(X4,X3,X2)
| eq(X3,X1)
| greek(p_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_23]) ).
cnf(c_0_103,plain,
( ~ greek(p_2,p_2,p_1)
| greek(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_98]) ).
cnf(c_0_104,plain,
greek(p_2,p_2,p_1),
inference(sr,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_105,plain,
( ~ latin(p_1,p_2,p_1)
| ~ latin(p_1,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_101]) ).
cnf(c_0_106,negated_conjecture,
( ~ latin(X3,X2,p_2)
| ~ greek(X3,X2,X1)
| eq(X2,p_1)
| latin(p_1,p_2,p_1)
| greek(p_1,p_1,X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_34]) ).
cnf(c_0_107,plain,
greek(p_1,p_2,p_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]) ).
cnf(c_0_108,plain,
~ latin(p_1,p_2,p_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_93])]) ).
cnf(c_0_109,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_106,c_0_107]),c_0_91])]),c_0_100]),c_0_108]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_109]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC008-1.002 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 01:27:10 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.48 % Version: 3.5.1
% 0.12/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.48 % Starting sh5l with 300s (1) cores
% 0.12/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 675504 completed with status 0
% 0.12/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.48 % No SInE strategy applied
% 0.12/0.48 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.12/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.48 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 675511 completed with status 0
% 0.12/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.12/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.48 % No SInE strategy applied
% 0.12/0.48 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.12/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.48 % Preprocessing time : 0.001 s
% 0.12/0.48 % Presaturation interreduction done
% 0.12/0.48
% 0.12/0.48 % Proof found!
% 0.12/0.48 % SZS status Unsatisfiable
% 0.12/0.48 % SZS output start CNFRefutation
% See solution above
% 0.12/0.48 % Parsed axioms : 17
% 0.12/0.48 % Removed by relevancy pruning/SinE : 0
% 0.12/0.48 % Initial clauses : 17
% 0.12/0.48 % Removed in clause preprocessing : 0
% 0.12/0.48 % Initial clauses in saturation : 17
% 0.12/0.48 % Processed clauses : 844
% 0.12/0.48 % ...of these trivial : 6
% 0.12/0.48 % ...subsumed : 390
% 0.12/0.48 % ...remaining for further processing : 448
% 0.12/0.48 % Other redundant clauses eliminated : 0
% 0.12/0.48 % Clauses deleted for lack of memory : 0
% 0.12/0.48 % Backward-subsumed : 128
% 0.12/0.48 % Backward-rewritten : 114
% 0.12/0.48 % Generated clauses : 2467
% 0.12/0.48 % ...of the previous two non-redundant : 2206
% 0.12/0.48 % ...aggressively subsumed : 0
% 0.12/0.48 % Contextual simplify-reflections : 3
% 0.12/0.48 % Paramodulations : 2425
% 0.12/0.48 % Factorizations : 24
% 0.12/0.48 % NegExts : 0
% 0.12/0.48 % Equation resolutions : 0
% 0.12/0.48 % Disequality decompositions : 0
% 0.12/0.48 % Total rewrite steps : 461
% 0.12/0.48 % ...of those cached : 447
% 0.12/0.48 % Propositional unsat checks : 0
% 0.12/0.48 % Propositional check models : 0
% 0.12/0.48 % Propositional check unsatisfiable : 0
% 0.12/0.48 % Propositional clauses : 0
% 0.12/0.48 % Propositional clauses after purity: 0
% 0.12/0.48 % Propositional unsat core size : 0
% 0.12/0.48 % Propositional preprocessing time : 0.000
% 0.12/0.48 % Propositional encoding time : 0.000
% 0.12/0.48 % Propositional solver time : 0.000
% 0.12/0.48 % Success case prop preproc time : 0.000
% 0.12/0.48 % Success case prop encoding time : 0.000
% 0.12/0.48 % Success case prop solver time : 0.000
% 0.12/0.48 % Current number of processed clauses : 171
% 0.12/0.48 % Positive orientable unit clauses : 9
% 0.12/0.48 % Positive unorientable unit clauses: 0
% 0.12/0.48 % Negative unit clauses : 9
% 0.12/0.48 % Non-unit-clauses : 153
% 0.12/0.48 % Current number of unprocessed clauses: 1390
% 0.12/0.48 % ...number of literals in the above : 6377
% 0.12/0.48 % Current number of archived formulas : 0
% 0.12/0.48 % Current number of archived clauses : 277
% 0.12/0.48 % Clause-clause subsumption calls (NU) : 15345
% 0.12/0.48 % Rec. Clause-clause subsumption calls : 9492
% 0.12/0.48 % Non-unit clause-clause subsumptions : 396
% 0.12/0.48 % Unit Clause-clause subsumption calls : 500
% 0.12/0.48 % Rewrite failures with RHS unbound : 0
% 0.12/0.48 % BW rewrite match attempts : 26
% 0.12/0.48 % BW rewrite match successes : 6
% 0.12/0.48 % Condensation attempts : 0
% 0.12/0.48 % Condensation successes : 0
% 0.12/0.48 % Termbank termtop insertions : 34371
% 0.12/0.48 % Search garbage collected termcells : 45
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.037 s
% 0.12/0.48 % System time : 0.005 s
% 0.12/0.48 % Total time : 0.042 s
% 0.12/0.48 % Maximum resident set size: 3640 pages
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.192 s
% 0.12/0.48 % System time : 0.017 s
% 0.12/0.48 % Total time : 0.209 s
% 0.12/0.48 % Maximum resident set size: 4608 pages
% 0.12/0.48 % E exiting
%------------------------------------------------------------------------------