%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT068+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n006.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:25 PM UTC 2026
% Result : Theorem 119.13s 68.99s
% Output : CNFRefutation 119.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 24
% Syntax : Number of formulae : 128 ( 27 unt; 0 def)
% Number of atoms : 355 ( 28 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 387 ( 160 ~; 170 |; 41 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-8 aty)
% Number of functors : 16 ( 16 usr; 11 con; 0-4 aty)
% Number of variables : 331 ( 22 sgn 126 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(transitive,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(dense,axiom,
! [X1,X2] :
( less(X1,X2)
=> ? [X3] :
( less(X1,X3)
& less(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+1.ax',dense) ).
fof(in_closed,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X4,X1)
& leq(X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_closed) ).
fof(axis_compatible_def,axiom,
! [X6,X7,X8,X9] :
( axis_compatible(X6,X7,X8,X9)
<=> ? [X1] :
( in_closed(X1,X6,X7)
& in_closed(X1,X8,X9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',axis_compatible_def) ).
fof(h_3_5,hypothesis,
less(n3,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_3_5) ).
fof(trichotomy,axiom,
! [X1,X2] :
( less(X1,X2)
| X1 = X2
| less(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',trichotomy) ).
fof(hard_chain,conjecture,
( axis_conflict(n0,n3,n10,n20)
& ? [X3] :
( less(n5,X3)
& less(X3,n10) )
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& completion_conflict(n5,n10,ninf,nsup)
& completion_compatible(n5,ninf,nsup)
& box_verdict(conflict,unknown) = conflict ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hard_chain) ).
fof(box_conflict,axiom,
! [X11,X12] :
( ( is_verdict(X11)
& is_verdict(X12)
& ( X11 = conflict
| X12 = conflict ) )
=> box_verdict(X11,X12) = conflict ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',box_conflict) ).
fof(less_leq_trans,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& leq(X2,X3) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).
fof(leq_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(conflict_is_verdict,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
fof(leq_less_trans,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(axis_conflict_def,axiom,
! [X6,X7,X8,X9] :
( axis_conflict(X6,X7,X8,X9)
<=> ~ ? [X1] :
( in_closed(X1,X6,X7)
& in_closed(X1,X8,X9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',axis_conflict_def) ).
fof(unknown_is_verdict,axiom,
is_verdict(unknown),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',unknown_is_verdict) ).
fof(completion_compat,axiom,
! [X10,X13,X14] :
( ( leq(X13,X10)
& leq(X10,X14) )
=> completion_compatible(X10,X13,X14) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',completion_compat) ).
fof(h_sup_ub,hypothesis,
! [X1] : leq(X1,nsup),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_sup_ub) ).
fof(h_inf_lb,hypothesis,
! [X1] : leq(ninf,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_inf_lb) ).
fof(h_5_10,hypothesis,
less(n5,n10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_5_10) ).
fof(axis_subsumes_def,axiom,
! [X6,X7,X8,X9] :
( axis_subsumes(X6,X7,X8,X9)
<=> ! [X1] :
( in_closed(X1,X6,X7)
=> in_closed(X1,X8,X9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',axis_subsumes_def) ).
fof(sharpness_conflict,axiom,
! [X15,X10,X13,X14] :
( ( leq(X13,X15)
& leq(X15,X14)
& less(X15,X10)
& leq(X10,X14) )
=> completion_conflict(X15,X10,X13,X14) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',sharpness_conflict) ).
fof(disjoint_def,axiom,
! [X24,X25,X26,X27,X28,X29,X30,X31] :
( disjoint(X24,X25,X26,X27,X28,X29,X30,X31)
<=> ( prec(X25,X28,X27,X30)
| prec(X29,X24,X31,X26) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+5.ax',disjoint_def) ).
fof(prec_cc,axiom,
! [X15,X23] :
( prec(X15,X23,c,c)
<=> less(X15,X23) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+5.ax',prec_cc) ).
fof(prec_oo,axiom,
! [X15,X23] :
( prec(X15,X23,o,o)
<=> leq(X15,X23) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+5.ax',prec_oo) ).
fof(c_0_24,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
fof(c_0_25,plain,
! [X139,X140,X141] :
( ~ less(X139,X140)
| ~ less(X140,X141)
| less(X139,X141) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])]) ).
fof(c_0_26,plain,
! [X159,X160] :
( ( less(X159,esk1_2(X159,X160))
| ~ less(X159,X160) )
& ( less(esk1_2(X159,X160),X160)
| ~ less(X159,X160) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dense])])])]) ).
fof(c_0_27,plain,
! [X162,X163,X164] :
( ( leq(X163,X162)
| ~ in_closed(X162,X163,X164) )
& ( leq(X162,X164)
| ~ in_closed(X162,X163,X164) )
& ( ~ leq(X163,X162)
| ~ leq(X162,X164)
| in_closed(X162,X163,X164) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_closed])])]) ).
fof(c_0_28,plain,
! [X184,X185,X186,X187,X189,X190,X191,X192,X193] :
( ( in_closed(esk3_4(X184,X185,X186,X187),X184,X185)
| ~ axis_compatible(X184,X185,X186,X187) )
& ( in_closed(esk3_4(X184,X185,X186,X187),X186,X187)
| ~ axis_compatible(X184,X185,X186,X187) )
& ( ~ in_closed(X193,X189,X190)
| ~ in_closed(X193,X191,X192)
| axis_compatible(X189,X190,X191,X192) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axis_compatible_def])])])])])]) ).
fof(c_0_29,plain,
! [X138] : ~ less(X138,X138),
inference(variable_rename,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( less(X1,X3)
| ~ less(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( less(X1,esk1_2(X1,X2))
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,hypothesis,
less(n3,n5),
inference(split_conjunct,[status(thm)],[h_3_5]) ).
fof(c_0_33,plain,
! [X142,X143] :
( less(X142,X143)
| X142 = X143
| less(X143,X142) ),
inference(variable_rename,[status(thm)],[trichotomy]) ).
fof(c_0_34,negated_conjecture,
~ ( axis_conflict(n0,n3,n10,n20)
& ? [X3] :
( less(n5,X3)
& less(X3,n10) )
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& completion_conflict(n5,n10,ninf,nsup)
& completion_compatible(n5,ninf,nsup)
& box_verdict(conflict,unknown) = conflict ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hard_chain])]) ).
fof(c_0_35,plain,
! [X205,X206] :
( ( X205 != conflict
| ~ is_verdict(X205)
| ~ is_verdict(X206)
| box_verdict(X205,X206) = conflict )
& ( X206 != conflict
| ~ is_verdict(X205)
| ~ is_verdict(X206)
| box_verdict(X205,X206) = conflict ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[box_conflict])])]) ).
fof(c_0_36,plain,
! [X153,X154,X155] :
( ~ less(X153,X154)
| ~ leq(X154,X155)
| less(X153,X155) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_leq_trans])]) ).
cnf(c_0_37,plain,
( leq(X1,X2)
| ~ in_closed(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
( in_closed(esk3_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( less(X1,esk1_2(X2,X3))
| ~ less(X1,X2)
| ~ less(X2,X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_41,hypothesis,
( less(X1,n5)
| ~ less(X1,n3) ),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_42,plain,
( less(X1,X2)
| X1 = X2
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_43,plain,
! [X144,X145] :
( ( ~ leq(X144,X145)
| less(X144,X145)
| X144 = X145 )
& ( ~ less(X144,X145)
| leq(X144,X145) )
& ( X144 != X145
| leq(X144,X145) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
fof(c_0_44,negated_conjecture,
! [X258] :
( ~ axis_conflict(n0,n3,n10,n20)
| ~ less(n5,X258)
| ~ less(X258,n10)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| box_verdict(conflict,unknown) != conflict ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])]) ).
cnf(c_0_45,plain,
( box_verdict(X1,X2) = conflict
| X1 != conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,plain,
is_verdict(conflict),
inference(split_conjunct,[status(thm)],[conflict_is_verdict]) ).
cnf(c_0_47,plain,
( less(X1,X3)
| ~ less(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,plain,
( leq(X1,esk3_4(X2,X3,X1,X4))
| ~ axis_compatible(X2,X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_49,plain,
! [X150,X151,X152] :
( ~ leq(X150,X151)
| ~ less(X151,X152)
| less(X150,X152) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_less_trans])]) ).
cnf(c_0_50,plain,
( leq(X1,X2)
| ~ in_closed(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_51,plain,
( in_closed(esk3_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_52,plain,
! [X174,X175,X176,X177,X178,X179,X180,X181,X182] :
( ( ~ axis_conflict(X174,X175,X176,X177)
| ~ in_closed(X178,X174,X175)
| ~ in_closed(X178,X176,X177) )
& ( in_closed(esk2_4(X179,X180,X181,X182),X179,X180)
| axis_conflict(X179,X180,X181,X182) )
& ( in_closed(esk2_4(X179,X180,X181,X182),X181,X182)
| axis_conflict(X179,X180,X181,X182) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axis_conflict_def])])])])])]) ).
cnf(c_0_53,plain,
( ~ less(esk1_2(X1,X2),X1)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_54,hypothesis,
( X1 = n3
| less(n3,X1)
| less(X1,n5) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_55,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_56,negated_conjecture,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ less(n5,X1)
| ~ less(X1,n10)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| box_verdict(conflict,unknown) != conflict ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_57,plain,
( box_verdict(conflict,X1) = conflict
| ~ is_verdict(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_46])]) ).
cnf(c_0_58,plain,
is_verdict(unknown),
inference(split_conjunct,[status(thm)],[unknown_is_verdict]) ).
fof(c_0_59,plain,
! [X213,X214,X215] :
( ~ leq(X214,X213)
| ~ leq(X213,X215)
| completion_compatible(X213,X214,X215) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[completion_compat])]) ).
fof(c_0_60,hypothesis,
! [X257] : leq(X257,nsup),
inference(variable_rename,[status(thm)],[h_sup_ub]) ).
fof(c_0_61,hypothesis,
! [X256] : leq(ninf,X256),
inference(variable_rename,[status(thm)],[h_inf_lb]) ).
cnf(c_0_62,plain,
( less(X1,esk3_4(X2,X3,X4,X5))
| ~ axis_compatible(X2,X3,X4,X5)
| ~ less(X1,X4) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_63,plain,
( less(X1,X3)
| ~ leq(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_64,plain,
( leq(esk3_4(X1,X2,X3,X4),X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_65,plain,
( axis_compatible(X2,X3,X4,X5)
| ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_66,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X3,X4)
| axis_conflict(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_67,plain,
( less(esk1_2(X1,X2),X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_68,hypothesis,
( esk1_2(n5,X1) = n3
| less(n3,esk1_2(n5,X1))
| ~ less(n5,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_69,hypothesis,
less(n5,n10),
inference(split_conjunct,[status(thm)],[h_5_10]) ).
cnf(c_0_70,hypothesis,
leq(n3,n5),
inference(spm,[status(thm)],[c_0_55,c_0_32]) ).
fof(c_0_71,plain,
! [X194,X195,X196,X197,X198,X199,X200,X201,X202] :
( ( ~ axis_subsumes(X194,X195,X196,X197)
| ~ in_closed(X198,X194,X195)
| in_closed(X198,X196,X197) )
& ( in_closed(esk4_4(X199,X200,X201,X202),X199,X200)
| axis_subsumes(X199,X200,X201,X202) )
& ( ~ in_closed(esk4_4(X199,X200,X201,X202),X201,X202)
| axis_subsumes(X199,X200,X201,X202) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axis_subsumes_def])])])])])]) ).
cnf(c_0_72,plain,
( leq(esk3_4(X1,X2,X3,X4),X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_50,c_0_38]) ).
cnf(c_0_73,negated_conjecture,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ less(X1,n10)
| ~ less(n5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_74,plain,
( completion_compatible(X2,X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_75,hypothesis,
leq(X1,nsup),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_76,hypothesis,
leq(ninf,X1),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
fof(c_0_77,plain,
! [X224,X225,X226,X227] :
( ~ leq(X226,X224)
| ~ leq(X224,X227)
| ~ less(X224,X225)
| ~ leq(X225,X227)
| completion_conflict(X224,X225,X226,X227) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sharpness_conflict])]) ).
cnf(c_0_78,plain,
( ~ axis_compatible(X1,X2,X3,X4)
| ~ less(esk3_4(X1,X2,X3,X4),X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_62]) ).
cnf(c_0_79,plain,
( less(esk3_4(X1,X2,X3,X4),X5)
| ~ axis_compatible(X1,X2,X3,X4)
| ~ less(X2,X5) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_80,plain,
( axis_compatible(X1,X2,X3,X4)
| axis_conflict(X5,X6,X3,X4)
| ~ in_closed(esk2_4(X5,X6,X3,X4),X1,X2) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_81,plain,
( in_closed(esk2_4(X1,X2,X3,X4),X1,X2)
| axis_conflict(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_82,plain,
( less(X1,X2)
| ~ less(X1,esk1_2(X3,X2))
| ~ less(X3,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_67]) ).
cnf(c_0_83,hypothesis,
( esk1_2(n5,n10) = n3
| less(n3,esk1_2(n5,n10)) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_84,hypothesis,
( less(n3,X1)
| ~ less(n5,X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_70]) ).
cnf(c_0_85,plain,
( in_closed(esk4_4(X1,X2,X3,X4),X1,X2)
| axis_subsumes(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_86,plain,
( less(esk3_4(X1,X2,X3,X4),X5)
| ~ axis_compatible(X1,X2,X3,X4)
| ~ less(X4,X5) ),
inference(spm,[status(thm)],[c_0_63,c_0_72]) ).
cnf(c_0_87,negated_conjecture,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ less(X1,n10)
| ~ less(n5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76])]) ).
cnf(c_0_88,plain,
( completion_conflict(X2,X4,X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3)
| ~ less(X2,X4)
| ~ leq(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_89,plain,
( ~ axis_compatible(X1,X2,X3,X4)
| ~ less(X2,X3) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_90,plain,
( axis_compatible(X1,X2,X3,X4)
| axis_conflict(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_91,hypothesis,
( esk1_2(n5,n10) = n3
| less(n3,n10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_69])]) ).
cnf(c_0_92,hypothesis,
~ less(n5,n3),
inference(spm,[status(thm)],[c_0_39,c_0_84]) ).
cnf(c_0_93,plain,
( axis_subsumes(X1,X2,X3,X4)
| axis_compatible(X5,X6,X1,X2)
| ~ in_closed(esk4_4(X1,X2,X3,X4),X5,X6) ),
inference(spm,[status(thm)],[c_0_65,c_0_85]) ).
cnf(c_0_94,plain,
( ~ axis_compatible(X1,X2,X3,X4)
| ~ less(X4,X3) ),
inference(spm,[status(thm)],[c_0_78,c_0_86]) ).
cnf(c_0_95,plain,
( axis_compatible(X1,X2,X1,X2)
| axis_conflict(X3,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_80,c_0_66]) ).
cnf(c_0_96,negated_conjecture,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ less(X1,n10)
| ~ less(n5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_75]),c_0_75]),c_0_76]),c_0_69])]) ).
cnf(c_0_97,plain,
( axis_conflict(X1,X2,X3,X4)
| ~ less(X2,X3) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_98,hypothesis,
less(n3,n10),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_91]),c_0_69])]),c_0_92]) ).
cnf(c_0_99,plain,
( axis_subsumes(X1,X2,X3,X4)
| axis_compatible(X1,X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_93,c_0_85]) ).
cnf(c_0_100,plain,
( ~ axis_conflict(X1,X2,X3,X4)
| ~ in_closed(X5,X1,X2)
| ~ in_closed(X5,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_101,plain,
( axis_conflict(X1,X2,X3,X4)
| ~ less(X4,X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_102,negated_conjecture,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(X1,n10)
| ~ less(n5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98])]) ).
cnf(c_0_103,plain,
( less(X1,X2)
| X1 = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_104,plain,
( in_closed(X5,X3,X4)
| ~ axis_subsumes(X1,X2,X3,X4)
| ~ in_closed(X5,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_105,plain,
( axis_subsumes(X1,X2,X3,X4)
| ~ less(X2,X1) ),
inference(spm,[status(thm)],[c_0_94,c_0_99]) ).
cnf(c_0_106,plain,
( ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5)
| ~ less(X3,X2) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
fof(c_0_107,plain,
! [X248,X249,X250,X251,X252,X253,X254,X255] :
( ( ~ disjoint(X248,X249,X250,X251,X252,X253,X254,X255)
| prec(X249,X252,X251,X254)
| prec(X253,X248,X255,X250) )
& ( ~ prec(X249,X252,X251,X254)
| disjoint(X248,X249,X250,X251,X252,X253,X254,X255) )
& ( ~ prec(X253,X248,X255,X250)
| disjoint(X248,X249,X250,X251,X252,X253,X254,X255) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[disjoint_def])])]) ).
cnf(c_0_108,negated_conjecture,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(n5,esk1_2(X1,n10))
| ~ less(X1,n10) ),
inference(spm,[status(thm)],[c_0_102,c_0_67]) ).
cnf(c_0_109,hypothesis,
( X1 = nsup
| less(X1,nsup) ),
inference(spm,[status(thm)],[c_0_103,c_0_75]) ).
cnf(c_0_110,plain,
( ~ in_closed(X1,X2,X3)
| ~ less(X3,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]) ).
cnf(c_0_111,plain,
( in_closed(X2,X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_112,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_113,plain,
! [X240,X241] :
( ( ~ prec(X240,X241,c,c)
| less(X240,X241) )
& ( ~ less(X240,X241)
| prec(X240,X241,c,c) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prec_cc])]) ).
cnf(c_0_114,plain,
( prec(X2,X5,X4,X7)
| prec(X6,X1,X8,X3)
| ~ disjoint(X1,X2,X3,X4,X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_115,negated_conjecture,
disjoint(n5,nsup,o,c,ninf,n10,c,o),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_31]),c_0_69])]) ).
cnf(c_0_116,hypothesis,
( esk1_2(nsup,X1) = nsup
| ~ less(nsup,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_109]) ).
cnf(c_0_117,plain,
( ~ leq(X1,X2)
| ~ leq(X3,X1)
| ~ less(X2,X3) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_118,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_112]) ).
fof(c_0_119,plain,
! [X246,X247] :
( ( ~ prec(X246,X247,o,o)
| leq(X246,X247) )
& ( ~ leq(X246,X247)
| prec(X246,X247,o,o) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prec_oo])]) ).
cnf(c_0_120,plain,
( less(X1,X2)
| ~ prec(X1,X2,c,c) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_121,negated_conjecture,
( prec(nsup,ninf,c,c)
| prec(n10,n5,o,o) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_122,hypothesis,
~ less(nsup,X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_116]),c_0_39]) ).
cnf(c_0_123,plain,
( ~ leq(X1,X2)
| ~ less(X2,X1) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_124,plain,
( leq(X1,X2)
| ~ prec(X1,X2,o,o) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_125,negated_conjecture,
prec(n10,n5,o,o),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_122]) ).
cnf(c_0_126,hypothesis,
~ leq(n10,n5),
inference(spm,[status(thm)],[c_0_123,c_0_69]) ).
cnf(c_0_127,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT068+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n006.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 23:33:46 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 119.13/68.99 % Version : CSE_E---1.7
% 119.13/68.99 % Problem : theBenchmark.p
% 119.13/68.99 % SZS status Theorem for theBenchmark.p
% 119.13/68.99 % SZS output start CNFRefutation
% See solution above
% 119.63/69.49 % Total time : 52.681s
%------------------------------------------------------------------------------