%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MSC008-2.002 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n028.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:48:55 PM UTC 2026
% Result : Unsatisfiable 1.64s 1.80s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 15
% Syntax : Number of clauses : 75 ( 8 unt; 52 nHn; 43 RR)
% Number of literals : 208 ( 0 equ; 59 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 : 158 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(latin_column_is_unique,axiom,
( eq(X4,X2)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_column_is_unique) ).
cnf(latin_cell_element,axiom,
( latin(X1,X2,p1)
| latin(X1,X2,p2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_cell_element) ).
cnf(latin_row_required,axiom,
( latin(p1,X1,X2)
| latin(p2,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_row_required) ).
cnf(symmetry,axiom,
( eq(X2,X1)
| ~ eq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry) ).
cnf(p1_is_not_p2,axiom,
~ eq(p1,p2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1_is_not_p2) ).
cnf(latin_row_is_unique,axiom,
( eq(X4,X1)
| ~ latin(X1,X2,X3)
| ~ latin(X4,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_row_is_unique) ).
cnf(no_two_same,negated_conjecture,
( eq(X6,X2)
| eq(X5,X1)
| ~ greek(X1,X2,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X5,X6,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_two_same) ).
cnf(greek_column_required,axiom,
( greek(X1,p1,X2)
| greek(X1,p2,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_column_required) ).
cnf(greek_column_is_unique,axiom,
( eq(X4,X2)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_column_is_unique) ).
cnf(greek_cell_element,axiom,
( greek(X1,X2,p1)
| greek(X1,X2,p2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_cell_element) ).
cnf(greek_row_is_unique,axiom,
( eq(X4,X1)
| ~ greek(X1,X2,X3)
| ~ greek(X4,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_row_is_unique) ).
cnf(greek_row_required,axiom,
( greek(p1,X1,X2)
| greek(p2,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_row_required) ).
cnf(latin_element_is_unique,axiom,
( eq(X4,X3)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_element_is_unique) ).
cnf(latin_column_required,axiom,
( latin(X1,p1,X2)
| latin(X1,p2,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',latin_column_required) ).
cnf(greek_element_is_unique,axiom,
( eq(X4,X3)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greek_element_is_unique) ).
cnf(c_0_15,axiom,
( eq(X4,X2)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X4,X3) ),
latin_column_is_unique ).
cnf(c_0_16,axiom,
( latin(X1,X2,p1)
| latin(X1,X2,p2) ),
latin_cell_element ).
cnf(c_0_17,plain,
( latin(X1,X2,p1)
| eq(X2,X3)
| ~ latin(X1,X3,p2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( latin(p1,X1,X2)
| latin(p2,X1,X2) ),
latin_row_required ).
cnf(c_0_19,axiom,
( eq(X2,X1)
| ~ eq(X1,X2) ),
symmetry ).
cnf(c_0_20,plain,
( latin(p1,X1,p2)
| latin(p2,X2,p1)
| eq(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
~ eq(p1,p2),
p1_is_not_p2 ).
cnf(c_0_22,plain,
( latin(p2,X1,p1)
| latin(p1,X2,p2)
| eq(X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
( eq(X4,X1)
| ~ latin(X1,X2,X3)
| ~ latin(X4,X2,X3) ),
latin_row_is_unique ).
cnf(c_0_24,plain,
( latin(p1,p1,p2)
| latin(p2,p2,p1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( eq(X6,X2)
| eq(X5,X1)
| ~ greek(X1,X2,X3)
| ~ latin(X1,X2,X4)
| ~ greek(X5,X6,X3)
| ~ latin(X5,X6,X4) ),
no_two_same ).
cnf(c_0_26,axiom,
( greek(X1,p1,X2)
| greek(X1,p2,X2) ),
greek_column_required ).
cnf(c_0_27,plain,
( latin(p1,p1,p2)
| eq(p2,X1)
| ~ latin(X1,p2,p1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( latin(X1,X2,p1)
| latin(X1,X3,p1)
| eq(X3,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
( greek(X1,p1,X2)
| eq(p2,X3)
| eq(X1,X4)
| ~ greek(X4,X3,X2)
| ~ latin(X1,p2,X5)
| ~ latin(X4,X3,X5) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( latin(p1,p1,p2)
| latin(X1,X2,p1)
| eq(p2,X2)
| eq(p2,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,axiom,
( eq(X4,X2)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X4,X3) ),
greek_column_is_unique ).
cnf(c_0_32,negated_conjecture,
( greek(p2,p1,X1)
| latin(p1,p1,p2)
| eq(p2,X2)
| eq(p2,X3)
| ~ greek(X2,X3,X1)
| ~ latin(X2,X3,p1) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_33,plain,
( latin(p1,p1,p2)
| latin(X1,X1,p1)
| eq(p2,X1) ),
inference(ef,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
( greek(X1,p1,X2)
| eq(p2,X3)
| ~ greek(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_35,axiom,
( greek(X1,X2,p1)
| greek(X1,X2,p2) ),
greek_cell_element ).
cnf(c_0_36,axiom,
( eq(X4,X1)
| ~ greek(X1,X2,X3)
| ~ greek(X4,X2,X3) ),
greek_row_is_unique ).
cnf(c_0_37,negated_conjecture,
( greek(p2,p1,X1)
| latin(p1,p1,p2)
| eq(p2,X2)
| ~ greek(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( greek(X1,p1,p2)
| greek(X1,X2,p1)
| eq(p2,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( greek(X1,X2,p1)
| eq(X1,X3)
| ~ greek(X3,X2,p2) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( greek(p2,p1,p1)
| latin(p1,p1,p2)
| eq(p2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_41,axiom,
( greek(p1,X1,X2)
| greek(p2,X1,X2) ),
greek_row_required ).
cnf(c_0_42,axiom,
( eq(X4,X3)
| ~ latin(X1,X2,X3)
| ~ latin(X1,X2,X4) ),
latin_element_is_unique ).
cnf(c_0_43,negated_conjecture,
( greek(p2,p1,p1)
| latin(p1,p1,p2)
| eq(X1,p2) ),
inference(spm,[status(thm)],[c_0_19,c_0_40]) ).
cnf(c_0_44,plain,
( greek(p1,X1,X2)
| eq(X1,X3)
| ~ greek(p2,X3,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_41]) ).
cnf(c_0_45,plain,
( latin(p1,X1,X2)
| eq(X2,X3)
| ~ latin(p2,X1,X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_46,axiom,
( latin(X1,p1,X2)
| latin(X1,p2,X2) ),
latin_column_required ).
cnf(c_0_47,negated_conjecture,
( greek(p2,p1,p1)
| latin(p1,p1,p2) ),
inference(spm,[status(thm)],[c_0_21,c_0_43]) ).
cnf(c_0_48,plain,
( greek(p2,X1,p1)
| greek(p1,X2,p2)
| eq(X2,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_49,plain,
( latin(p2,p1,X1)
| latin(p1,p2,X2)
| eq(X2,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( latin(p1,p1,p2)
| eq(p1,X1)
| ~ greek(p2,X1,p1) ),
inference(spm,[status(thm)],[c_0_31,c_0_47]) ).
cnf(c_0_51,plain,
( greek(p1,p1,p2)
| greek(p2,p2,p1) ),
inference(spm,[status(thm)],[c_0_21,c_0_48]) ).
cnf(c_0_52,plain,
( latin(p1,p2,p1)
| latin(p2,p1,p2) ),
inference(spm,[status(thm)],[c_0_21,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( greek(p1,p1,p2)
| latin(p1,p1,p2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_21]) ).
cnf(c_0_54,plain,
( latin(p1,p2,p1)
| eq(p2,X1)
| ~ latin(X1,p1,p2) ),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_55,plain,
( latin(X1,p1,p2)
| latin(X1,X2,p1)
| eq(X2,p2) ),
inference(spm,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_56,negated_conjecture,
( greek(p2,p1,p2)
| latin(p1,p1,p2)
| eq(p2,p1) ),
inference(spm,[status(thm)],[c_0_37,c_0_53]) ).
cnf(c_0_57,plain,
( latin(p1,p2,p1)
| latin(X1,X2,p1)
| eq(X2,p2)
| eq(p2,X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( latin(p1,p1,p2)
| eq(p1,X1)
| ~ greek(X1,p1,p2) ),
inference(spm,[status(thm)],[c_0_36,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( greek(p2,p1,p2)
| latin(p1,p1,p2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_56]),c_0_21]) ).
cnf(c_0_60,plain,
( latin(p1,p2,p1)
| eq(p2,X1)
| eq(X2,p2)
| eq(p1,X3)
| ~ latin(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
latin(p1,p1,p2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_21]) ).
cnf(c_0_62,negated_conjecture,
( greek(p1,X1,X2)
| eq(p2,X3)
| eq(X1,X4)
| ~ greek(X3,X4,X2)
| ~ latin(p2,X1,X5)
| ~ latin(X3,X4,X5) ),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_63,plain,
( latin(p2,p1,p1)
| latin(p1,p2,p2) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_64,negated_conjecture,
( latin(p1,p2,p1)
| eq(p2,p1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_21]) ).
cnf(c_0_65,negated_conjecture,
( eq(p1,X1)
| ~ latin(p1,X1,p2) ),
inference(spm,[status(thm)],[c_0_15,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( greek(p1,p1,X1)
| latin(p1,p2,p2)
| eq(p1,X2)
| eq(p2,X3)
| ~ greek(X3,X2,X1)
| ~ latin(X3,X2,p1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
latin(p1,p2,p1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_64]),c_0_21]) ).
cnf(c_0_68,negated_conjecture,
~ latin(p1,p2,p2),
inference(spm,[status(thm)],[c_0_21,c_0_65]) ).
cnf(c_0_69,plain,
( greek(p1,X1,X2)
| greek(p1,X3,X2)
| eq(X3,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_41]) ).
cnf(c_0_70,negated_conjecture,
( greek(p1,p1,X1)
| eq(p2,p1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_21]),c_0_69]) ).
cnf(c_0_71,axiom,
( eq(X4,X3)
| ~ greek(X1,X2,X3)
| ~ greek(X1,X2,X4) ),
greek_element_is_unique ).
cnf(c_0_72,negated_conjecture,
greek(p1,p1,X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_70]),c_0_21]) ).
cnf(c_0_73,negated_conjecture,
eq(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_72])]) ).
cnf(c_0_74,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC008-2.002 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n028.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 23:34:01 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.64/1.80 % Version : CSE_E---1.7
% 1.64/1.80 % Problem : theBenchmark.p
% 1.64/1.80 % SZS status Unsatisfiable for theBenchmark.p
% 1.64/1.80 % SZS output start CNFRefutation
% See solution above
% 1.64/1.80 % Total time : 1.372s
%------------------------------------------------------------------------------