%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MSC008-2.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 : n008.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.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of clauses : 43 ( 7 unt; 22 nHn; 29 RR)
% Number of literals : 112 ( 0 equ; 48 neg)
% Maximal clause size : 6 ( 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 : 98 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(greek_element_is_unique,axiom,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_element_is_unique) ).
cnf(greek_column_required,axiom,
( greek(X1,p2,X2)
| greek(X1,p1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_column_required) ).
cnf(p1_is_not_p2,axiom,
~ eq(p1,p2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1_is_not_p2) ).
cnf(greek_row_required,axiom,
( greek(p2,X1,X2)
| greek(p1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_row_required) ).
cnf(no_two_same,negated_conjecture,
( ~ latin(X5,X6,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X5,X1)
| eq(X6,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_two_same) ).
cnf(latin_row_is_unique,axiom,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_row_is_unique) ).
cnf(greek_row_is_unique,axiom,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_row_is_unique) ).
cnf(latin_column_required,axiom,
( latin(X1,p2,X2)
| latin(X1,p1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_column_required) ).
cnf(symmetry,axiom,
( ~ eq(X1,X2)
| eq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry) ).
cnf(latin_cell_element,axiom,
( latin(X1,X2,p2)
| latin(X1,X2,p1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_cell_element) ).
cnf(c_0_10,plain,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X4,X3) ),
inference(fof_simplification,[status(thm)],[greek_element_is_unique]) ).
cnf(c_0_11,plain,
( ~ greek(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X4,X3) ),
c_0_10 ).
cnf(c_0_12,axiom,
( greek(X1,p2,X2)
| greek(X1,p1,X2) ),
greek_column_required ).
cnf(c_0_13,plain,
~ eq(p1,p2),
inference(fof_simplification,[status(thm)],[p1_is_not_p2]) ).
cnf(c_0_14,plain,
( ~ greek(X1,p2,X3)
| eq(X2,X3)
| greek(X1,p1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
( greek(p2,X1,X2)
| greek(p1,X1,X2) ),
greek_row_required ).
cnf(c_0_16,negated_conjecture,
( ~ latin(X5,X6,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X5,X1)
| eq(X6,X2) ),
inference(fof_simplification,[status(thm)],[no_two_same]) ).
cnf(c_0_17,plain,
~ eq(p1,p2),
c_0_13 ).
cnf(c_0_18,plain,
( eq(X2,X1)
| greek(p2,p1,X2)
| greek(p1,p2,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X4,X1) ),
inference(fof_simplification,[status(thm)],[latin_row_is_unique]) ).
cnf(c_0_20,plain,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X4,X1) ),
inference(fof_simplification,[status(thm)],[greek_row_is_unique]) ).
cnf(c_0_21,negated_conjecture,
( ~ latin(X5,X6,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X1,X2,X3)
| eq(X5,X1)
| eq(X6,X2) ),
c_0_16 ).
cnf(c_0_22,plain,
( greek(p1,p2,p2)
| greek(p2,p1,p1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ latin(X4,X2,X3)
| ~ latin(X1,X2,X3)
| eq(X4,X1) ),
c_0_19 ).
cnf(c_0_24,axiom,
( latin(X1,p2,X2)
| latin(X1,p1,X2) ),
latin_column_required ).
cnf(c_0_25,plain,
( ~ greek(X4,X2,X3)
| ~ greek(X1,X2,X3)
| eq(X4,X1) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( ~ latin(X1,X2,X3)
| ~ latin(p2,p1,X3)
| ~ greek(X1,X2,p1)
| eq(p1,X2)
| eq(p2,X1)
| greek(p1,p2,p2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ latin(X3,p2,X2)
| eq(X1,X3)
| latin(X1,p1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ greek(X1,p1,p1)
| eq(p2,X1)
| greek(p1,p2,p2) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_29,plain,
( ~ eq(X1,X2)
| eq(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry]) ).
cnf(c_0_30,negated_conjecture,
( ~ latin(X1,p2,X2)
| eq(p2,X1)
| greek(p1,p2,p2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_12]),c_0_17]),c_0_27]),c_0_28]) ).
cnf(c_0_31,axiom,
( latin(X1,X2,p2)
| latin(X1,X2,p1) ),
latin_cell_element ).
cnf(c_0_32,plain,
( ~ eq(X1,X2)
| eq(X2,X1) ),
c_0_29 ).
cnf(c_0_33,negated_conjecture,
( eq(p2,X1)
| greek(p1,p2,p2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( eq(X1,p2)
| greek(p1,p2,p2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
greek(p1,p2,p2),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( ~ greek(X1,p2,p2)
| eq(p1,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( eq(p1,X1)
| greek(X1,p1,p2) ),
inference(spm,[status(thm)],[c_0_36,c_0_12]) ).
cnf(c_0_38,negated_conjecture,
( ~ latin(X1,X2,X3)
| ~ latin(p1,p2,X3)
| ~ greek(X1,X2,p2)
| eq(p2,X2)
| eq(p1,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
greek(p2,p1,p2),
inference(spm,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ~ latin(p1,p2,X1)
| eq(p2,p1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_17]),c_0_27]) ).
cnf(c_0_41,negated_conjecture,
eq(p2,p1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_40]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_41]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC008-2.002 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n008.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 01:28:10 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4055813 completed with status 0
% 0.14/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.46 % new_bool_3 with pid 4055822 completed with status 0
% 0.14/0.46 % Result found by new_bool_3
% 0.14/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.46 % Preprocessing time : 0.001 s
% 0.14/0.46 % Presaturation interreduction done
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Unsatisfiable
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 16
% 0.14/0.46 % Removed by relevancy pruning/SinE : 0
% 0.14/0.46 % Initial clauses : 16
% 0.14/0.46 % Removed in clause preprocessing : 0
% 0.14/0.46 % Initial clauses in saturation : 16
% 0.14/0.46 % Processed clauses : 340
% 0.14/0.46 % ...of these trivial : 0
% 0.14/0.46 % ...subsumed : 143
% 0.14/0.46 % ...remaining for further processing : 197
% 0.14/0.46 % Other redundant clauses eliminated : 0
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 29
% 0.14/0.46 % Backward-rewritten : 10
% 0.14/0.46 % Generated clauses : 1010
% 0.14/0.46 % ...of the previous two non-redundant : 825
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 5
% 0.14/0.46 % Paramodulations : 998
% 0.14/0.46 % Factorizations : 12
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 0
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 199
% 0.14/0.46 % ...of those cached : 187
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 142
% 0.14/0.46 % Positive orientable unit clauses : 6
% 0.14/0.46 % Positive unorientable unit clauses: 0
% 0.14/0.46 % Negative unit clauses : 1
% 0.14/0.46 % Non-unit-clauses : 135
% 0.14/0.46 % Current number of unprocessed clauses: 513
% 0.14/0.46 % ...number of literals in the above : 2222
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 55
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 6768
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 3272
% 0.14/0.46 % Non-unit clause-clause subsumptions : 175
% 0.14/0.46 % Unit Clause-clause subsumption calls : 184
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 11
% 0.14/0.46 % BW rewrite match successes : 4
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 13114
% 0.14/0.46 % Search garbage collected termcells : 41
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.028 s
% 0.14/0.46 % System time : 0.004 s
% 0.14/0.46 % Total time : 0.031 s
% 0.14/0.46 % Maximum resident set size: 3640 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.133 s
% 0.14/0.46 % System time : 0.013 s
% 0.14/0.46 % Total time : 0.146 s
% 0.14/0.46 % Maximum resident set size: 4864 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------