%------------------------------------------------------------------------------
% File : E---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/sandbox2/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:28:37 PM UTC 2026
% Result : Unsatisfiable 0.45s 0.50s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of clauses : 56 ( 10 unt; 29 nHn; 33 RR)
% Number of literals : 141 ( 0 equ; 57 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 : 129 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(greek_element_is_unique,axiom,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_element_is_unique) ).
cnf(greek_column_required,axiom,
( greek(X1,p_2,X2)
| greek(X1,p_1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_column_required) ).
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/sandbox2/benchmark/theBenchmark.p',no_two_same1) ).
cnf(p_1_is_not_p_2,axiom,
~ eq(p_1,p_2),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',greek_row_required) ).
cnf(latin_row_is_unique,axiom,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_row_is_unique) ).
cnf(greek_cell_element,axiom,
( greek(X1,X2,p_2)
| greek(X1,X2,p_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_cell_element) ).
cnf(latin_row_required,axiom,
( latin(p_2,X1,X2)
| latin(p_1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_row_required) ).
cnf(latin_column_required,axiom,
( latin(X1,p_2,X2)
| latin(X1,p_1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_column_required) ).
cnf(greek_row_is_unique,axiom,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_row_is_unique) ).
cnf(latin_cell_element,axiom,
( latin(X1,X2,p_2)
| latin(X1,X2,p_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_cell_element) ).
cnf(latin_element_is_unique,axiom,
( ~ latin(X1,X2,X4)
| ~ latin(X1,X2,X3)
| eq(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_element_is_unique) ).
cnf(c_0_12,plain,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X3,X4) ),
inference(fof_simplification,[status(thm)],[greek_element_is_unique]) ).
cnf(c_0_13,plain,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X3,X4) ),
c_0_12 ).
cnf(c_0_14,axiom,
( greek(X1,p_2,X2)
| greek(X1,p_1,X2) ),
greek_column_required ).
cnf(c_0_15,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_16,plain,
~ eq(p_1,p_2),
inference(fof_simplification,[status(thm)],[p_1_is_not_p_2]) ).
cnf(c_0_17,plain,
( ~ greek(X1,p_2,X3)
| eq(X3,X2)
| greek(X1,p_1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
( greek(p_2,X1,X2)
| greek(p_1,X1,X2) ),
greek_row_required ).
cnf(c_0_19,plain,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X1,X4) ),
inference(fof_simplification,[status(thm)],[latin_row_is_unique]) ).
cnf(c_0_20,negated_conjecture,
( ~ latin(X5,X6,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X2,X6) ),
c_0_15 ).
cnf(c_0_21,axiom,
( greek(X1,X2,p_2)
| greek(X1,X2,p_1) ),
greek_cell_element ).
cnf(c_0_22,plain,
~ eq(p_1,p_2),
c_0_16 ).
cnf(c_0_23,plain,
( eq(X1,X2)
| greek(p_2,p_1,X2)
| greek(p_1,p_2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X1,X4) ),
c_0_19 ).
cnf(c_0_25,axiom,
( latin(p_2,X1,X2)
| latin(p_1,X1,X2) ),
latin_row_required ).
cnf(c_0_26,negated_conjecture,
( ~ latin(X4,X3,X5)
| ~ latin(X1,X2,X5)
| ~ greek(X4,X3,p_2)
| eq(X3,X2)
| greek(X1,X2,p_1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( greek(p_1,p_2,p_1)
| greek(p_2,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ latin(X3,X1,X2)
| eq(X3,p_2)
| latin(p_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,axiom,
( latin(X1,p_2,X2)
| latin(X1,p_1,X2) ),
latin_column_required ).
cnf(c_0_30,negated_conjecture,
( ~ latin(X1,X2,X3)
| ~ latin(p_2,p_1,X3)
| eq(p_1,X2)
| greek(X1,X2,p_1)
| greek(p_1,p_2,p_1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( eq(X2,p_2)
| latin(X2,p_1,X1)
| latin(p_1,p_2,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X1,X4) ),
inference(fof_simplification,[status(thm)],[greek_row_is_unique]) ).
cnf(c_0_33,negated_conjecture,
( ~ latin(p_2,p_1,X2)
| eq(X1,p_2)
| greek(p_1,p_2,p_1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22]),c_0_24]) ).
cnf(c_0_34,axiom,
( latin(X1,X2,p_2)
| latin(X1,X2,p_1) ),
latin_cell_element ).
cnf(c_0_35,plain,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X1,X4) ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
( eq(X1,p_2)
| greek(p_1,p_2,p_1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_33]) ).
cnf(c_0_37,plain,
( ~ latin(X1,X2,X4)
| ~ latin(X1,X2,X3)
| eq(X3,X4) ),
inference(fof_simplification,[status(thm)],[latin_element_is_unique]) ).
cnf(c_0_38,plain,
( ~ greek(X3,p_2,X2)
| eq(X3,X1)
| greek(X1,p_1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_14]) ).
cnf(c_0_39,negated_conjecture,
greek(p_1,p_2,p_1),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_40,plain,
( ~ latin(X1,X2,X4)
| ~ latin(X1,X2,X3)
| eq(X3,X4) ),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
( eq(p_1,X1)
| greek(X1,p_1,p_1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( ~ latin(X1,p_2,X3)
| eq(X3,X2)
| latin(X1,p_1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_43,negated_conjecture,
( ~ latin(X2,X1,X3)
| ~ latin(p_1,p_2,X3)
| ~ greek(X2,X1,p_1)
| eq(X1,p_2) ),
inference(spm,[status(thm)],[c_0_20,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
greek(p_2,p_1,p_1),
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_45,plain,
( eq(X1,X2)
| latin(p_2,p_1,X2)
| latin(p_1,p_2,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_46,plain,
( ~ latin(p_2,X1,X3)
| eq(X3,X2)
| latin(p_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_25]) ).
cnf(c_0_47,negated_conjecture,
( ~ latin(p_2,p_1,X1)
| ~ latin(p_1,p_2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_22]) ).
cnf(c_0_48,plain,
( latin(p_1,p_2,p_1)
| latin(p_2,p_1,p_2) ),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_49,plain,
( eq(X1,X2)
| latin(p_1,p_2,X2)
| latin(p_2,p_1,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_29]) ).
cnf(c_0_50,negated_conjecture,
latin(p_1,p_2,p_1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_34]),c_0_48]) ).
cnf(c_0_51,plain,
( latin(p_2,p_1,p_1)
| latin(p_1,p_2,p_2) ),
inference(spm,[status(thm)],[c_0_22,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
~ latin(p_2,p_1,p_1),
inference(spm,[status(thm)],[c_0_47,c_0_50]) ).
cnf(c_0_53,plain,
latin(p_1,p_2,p_2),
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
~ latin(p_2,p_1,p_2),
inference(spm,[status(thm)],[c_0_47,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_34]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC008-1.002 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 01:27:11 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.45/0.50 % Version: 3.5.1
% 0.45/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.50 % Starting sh5l with 300s (1) cores
% 0.45/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 675571 completed with status 0
% 0.45/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.45/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.50 % No SInE strategy applied
% 0.45/0.50 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.45/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.45/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.45/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.45/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.45/0.50 % new_bool_3 with pid 675581 completed with status 0
% 0.45/0.50 % Result found by new_bool_3
% 0.45/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.50 % No SInE strategy applied
% 0.45/0.50 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.45/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.45/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.45/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.45/0.50 % Preprocessing time : 0.001 s
% 0.45/0.50 % Presaturation interreduction done
% 0.45/0.50
% 0.45/0.50 % Proof found!
% 0.45/0.50 % SZS status Unsatisfiable
% 0.45/0.50 % SZS output start CNFRefutation
% See solution above
% 0.45/0.50 % Parsed axioms : 17
% 0.45/0.50 % Removed by relevancy pruning/SinE : 0
% 0.45/0.50 % Initial clauses : 17
% 0.45/0.50 % Removed in clause preprocessing : 0
% 0.45/0.50 % Initial clauses in saturation : 17
% 0.45/0.50 % Processed clauses : 481
% 0.45/0.50 % ...of these trivial : 0
% 0.45/0.50 % ...subsumed : 188
% 0.45/0.50 % ...remaining for further processing : 293
% 0.45/0.50 % Other redundant clauses eliminated : 0
% 0.45/0.50 % Clauses deleted for lack of memory : 0
% 0.45/0.50 % Backward-subsumed : 33
% 0.45/0.50 % Backward-rewritten : 53
% 0.45/0.50 % Generated clauses : 2985
% 0.45/0.50 % ...of the previous two non-redundant : 2339
% 0.45/0.50 % ...aggressively subsumed : 0
% 0.45/0.50 % Contextual simplify-reflections : 3
% 0.45/0.50 % Paramodulations : 2964
% 0.45/0.50 % Factorizations : 20
% 0.45/0.50 % NegExts : 0
% 0.45/0.50 % Equation resolutions : 0
% 0.45/0.50 % Disequality decompositions : 0
% 0.45/0.50 % Total rewrite steps : 733
% 0.45/0.50 % ...of those cached : 719
% 0.45/0.50 % Propositional unsat checks : 0
% 0.45/0.50 % Propositional check models : 0
% 0.45/0.50 % Propositional check unsatisfiable : 0
% 0.45/0.50 % Propositional clauses : 0
% 0.45/0.50 % Propositional clauses after purity: 0
% 0.45/0.50 % Propositional unsat core size : 0
% 0.45/0.50 % Propositional preprocessing time : 0.000
% 0.45/0.50 % Propositional encoding time : 0.000
% 0.45/0.50 % Propositional solver time : 0.000
% 0.45/0.50 % Success case prop preproc time : 0.000
% 0.45/0.50 % Success case prop encoding time : 0.000
% 0.45/0.50 % Success case prop solver time : 0.000
% 0.45/0.50 % Current number of processed clauses : 189
% 0.45/0.50 % Positive orientable unit clauses : 8
% 0.45/0.50 % Positive unorientable unit clauses: 0
% 0.45/0.50 % Negative unit clauses : 3
% 0.45/0.50 % Non-unit-clauses : 178
% 0.45/0.50 % Current number of unprocessed clauses: 1889
% 0.45/0.50 % ...number of literals in the above : 8726
% 0.45/0.50 % Current number of archived formulas : 0
% 0.45/0.50 % Current number of archived clauses : 104
% 0.45/0.50 % Clause-clause subsumption calls (NU) : 12048
% 0.45/0.50 % Rec. Clause-clause subsumption calls : 4892
% 0.45/0.50 % Non-unit clause-clause subsumptions : 222
% 0.45/0.50 % Unit Clause-clause subsumption calls : 265
% 0.45/0.50 % Rewrite failures with RHS unbound : 0
% 0.45/0.50 % BW rewrite match attempts : 24
% 0.45/0.50 % BW rewrite match successes : 6
% 0.45/0.50 % Condensation attempts : 0
% 0.45/0.50 % Condensation successes : 0
% 0.45/0.50 % Termbank termtop insertions : 42773
% 0.45/0.50 % Search garbage collected termcells : 45
% 0.45/0.50
% 0.45/0.50 % -------------------------------------------------
% 0.45/0.50 % User time : 0.064 s
% 0.45/0.50 % System time : 0.005 s
% 0.45/0.50 % Total time : 0.070 s
% 0.45/0.50 % Maximum resident set size: 3384 pages
% 0.45/0.50
% 0.45/0.50 % -------------------------------------------------
% 0.45/0.50 % User time : 0.306 s
% 0.45/0.50 % System time : 0.023 s
% 0.45/0.50 % Total time : 0.329 s
% 0.45/0.50 % Maximum resident set size: 4608 pages
% 0.45/0.50 % E exiting
%------------------------------------------------------------------------------