%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT068+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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 : Tue Sep 8 06:08:02 AM UTC 2026
% Result : Theorem 264.23s 36.53s
% Output : CNFRefutation 264.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 24
% Syntax : Number of formulae : 128 ( 26 unt; 0 def)
% Number of atoms : 356 ( 28 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 389 ( 161 ~; 171 |; 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 : 334 ( 22 sgn 125 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
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(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
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(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(conflict_is_verdict,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
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,
! [X33,X34,X35] :
( ~ less(X33,X34)
| ~ less(X34,X35)
| less(X33,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])]) ).
fof(c_0_25,plain,
! [X53,X54] :
( ( less(X53,esk1_2(X53,X54))
| ~ less(X53,X54) )
& ( less(esk1_2(X53,X54),X54)
| ~ less(X53,X54) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dense])])])]) ).
fof(c_0_26,plain,
! [X56,X57,X58] :
( ( leq(X57,X56)
| ~ in_closed(X56,X57,X58) )
& ( leq(X56,X58)
| ~ in_closed(X56,X57,X58) )
& ( ~ leq(X57,X56)
| ~ leq(X56,X58)
| in_closed(X56,X57,X58) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_closed])])]) ).
fof(c_0_27,plain,
! [X78,X79,X80,X81,X83,X84,X85,X86,X87] :
( ( in_closed(esk3_4(X78,X79,X80,X81),X78,X79)
| ~ axis_compatible(X78,X79,X80,X81) )
& ( in_closed(esk3_4(X78,X79,X80,X81),X80,X81)
| ~ axis_compatible(X78,X79,X80,X81) )
& ( ~ in_closed(X87,X83,X84)
| ~ in_closed(X87,X85,X86)
| axis_compatible(X83,X84,X85,X86) ) ),
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_28,plain,
! [X32] : ~ less(X32,X32),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexive])]) ).
cnf(c_0_29,plain,
( less(X1,X3)
| ~ less(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( less(X1,esk1_2(X1,X2))
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,hypothesis,
less(n3,n5),
inference(split_conjunct,[status(thm)],[h_3_5]) ).
fof(c_0_32,plain,
! [X36,X37] :
( less(X36,X37)
| X36 = X37
| less(X37,X36) ),
inference(variable_rename,[status(thm)],[trichotomy]) ).
fof(c_0_33,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(assume_negation,[status(cth)],[hard_chain]) ).
fof(c_0_34,plain,
! [X99,X100] :
( ( X99 != conflict
| ~ is_verdict(X99)
| ~ is_verdict(X100)
| box_verdict(X99,X100) = conflict )
& ( X100 != conflict
| ~ is_verdict(X99)
| ~ is_verdict(X100)
| box_verdict(X99,X100) = conflict ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[box_conflict])])]) ).
fof(c_0_35,plain,
! [X47,X48,X49] :
( ~ less(X47,X48)
| ~ leq(X48,X49)
| less(X47,X49) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_leq_trans])]) ).
cnf(c_0_36,plain,
( leq(X1,X2)
| ~ in_closed(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
( in_closed(esk3_4(X1,X2,X3,X4),X3,X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
( less(X1,esk1_2(X2,X3))
| ~ less(X1,X2)
| ~ less(X2,X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,hypothesis,
( less(X1,n5)
| ~ less(X1,n3) ),
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_41,plain,
( less(X1,X2)
| X1 = X2
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_42,plain,
! [X38,X39] :
( ( ~ leq(X38,X39)
| less(X38,X39)
| X38 = X39 )
& ( ~ less(X38,X39)
| leq(X38,X39) )
& ( X38 != X39
| leq(X38,X39) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
fof(c_0_43,plain,
! [X44,X45,X46] :
( ~ leq(X44,X45)
| ~ less(X45,X46)
| less(X44,X46) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_less_trans])]) ).
cnf(c_0_44,plain,
( leq(X1,X2)
| ~ in_closed(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_45,negated_conjecture,
! [X152] :
( ~ axis_conflict(n0,n3,n10,n20)
| ~ less(n5,X152)
| ~ less(X152,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)],[inference(fof_simplification,[status(thm)],[c_0_33])])])]) ).
cnf(c_0_46,plain,
( box_verdict(X1,X2) = conflict
| X1 != conflict
| ~ is_verdict(X1)
| ~ is_verdict(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,plain,
is_verdict(conflict),
inference(split_conjunct,[status(thm)],[conflict_is_verdict]) ).
cnf(c_0_48,plain,
( less(X1,X3)
| ~ less(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_49,plain,
( leq(X1,esk3_4(X2,X3,X1,X4))
| ~ axis_compatible(X2,X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_50,plain,
( in_closed(esk3_4(X1,X2,X3,X4),X1,X2)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_51,plain,
! [X68,X69,X70,X71,X72,X73,X74,X75,X76] :
( ( ~ axis_conflict(X68,X69,X70,X71)
| ~ in_closed(X72,X68,X69)
| ~ in_closed(X72,X70,X71) )
& ( in_closed(esk2_4(X73,X74,X75,X76),X73,X74)
| axis_conflict(X73,X74,X75,X76) )
& ( in_closed(esk2_4(X73,X74,X75,X76),X75,X76)
| axis_conflict(X73,X74,X75,X76) ) ),
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_52,plain,
( ~ less(esk1_2(X1,X2),X1)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_53,hypothesis,
( X1 = n3
| less(n3,X1)
| less(X1,n5) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_54,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_55,plain,
( less(X1,X3)
| ~ leq(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_56,plain,
( leq(esk3_4(X1,X2,X3,X4),X4)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_44,c_0_37]) ).
cnf(c_0_57,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_45]) ).
cnf(c_0_58,plain,
( box_verdict(conflict,X1) = conflict
| ~ is_verdict(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_47])]) ).
cnf(c_0_59,plain,
is_verdict(unknown),
inference(split_conjunct,[status(thm)],[unknown_is_verdict]) ).
fof(c_0_60,plain,
! [X107,X108,X109] :
( ~ leq(X108,X107)
| ~ leq(X107,X109)
| completion_compatible(X107,X108,X109) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[completion_compat])]) ).
fof(c_0_61,hypothesis,
! [X151] : leq(X151,nsup),
inference(variable_rename,[status(thm)],[h_sup_ub]) ).
fof(c_0_62,hypothesis,
! [X150] : leq(ninf,X150),
inference(variable_rename,[status(thm)],[h_inf_lb]) ).
cnf(c_0_63,plain,
( less(X1,esk3_4(X2,X3,X4,X5))
| ~ axis_compatible(X2,X3,X4,X5)
| ~ less(X1,X4) ),
inference(spm,[status(thm)],[c_0_48,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_44,c_0_50]) ).
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_27]) ).
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_51]) ).
cnf(c_0_67,plain,
( less(esk1_2(X1,X2),X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
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_52,c_0_53]) ).
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_54,c_0_31]) ).
fof(c_0_71,plain,
! [X88,X89,X90,X91,X92,X93,X94,X95,X96] :
( ( ~ axis_subsumes(X88,X89,X90,X91)
| ~ in_closed(X92,X88,X89)
| in_closed(X92,X90,X91) )
& ( in_closed(esk4_4(X93,X94,X95,X96),X93,X94)
| axis_subsumes(X93,X94,X95,X96) )
& ( ~ in_closed(esk4_4(X93,X94,X95,X96),X95,X96)
| axis_subsumes(X93,X94,X95,X96) ) ),
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,
( less(esk3_4(X1,X2,X3,X4),X5)
| ~ axis_compatible(X1,X2,X3,X4)
| ~ less(X4,X5) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
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_57,c_0_58]),c_0_59])]) ).
cnf(c_0_74,plain,
( completion_compatible(X2,X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_75,hypothesis,
leq(X1,nsup),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_76,hypothesis,
leq(ninf,X1),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
fof(c_0_77,plain,
! [X118,X119,X120,X121] :
( ~ leq(X120,X118)
| ~ leq(X118,X121)
| ~ less(X118,X119)
| ~ leq(X119,X121)
| completion_conflict(X118,X119,X120,X121) ),
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_38,c_0_63]) ).
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_55,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_51]) ).
cnf(c_0_82,plain,
( less(X1,X2)
| ~ less(X1,esk1_2(X3,X2))
| ~ less(X3,X2) ),
inference(spm,[status(thm)],[c_0_29,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_55,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,
( ~ axis_compatible(X1,X2,X3,X4)
| ~ less(X4,esk3_4(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_38,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_38,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_86,c_0_63]) ).
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_30,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_51]) ).
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_42]) ).
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,
! [X142,X143,X144,X145,X146,X147,X148,X149] :
( ( ~ disjoint(X142,X143,X144,X145,X146,X147,X148,X149)
| prec(X143,X146,X145,X148)
| prec(X147,X142,X149,X144) )
& ( ~ prec(X143,X146,X145,X148)
| disjoint(X142,X143,X144,X145,X146,X147,X148,X149) )
& ( ~ prec(X147,X142,X149,X144)
| disjoint(X142,X143,X144,X145,X146,X147,X148,X149) ) ),
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_26]) ).
cnf(c_0_112,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_113,plain,
! [X134,X135] :
( ( ~ prec(X134,X135,c,c)
| less(X134,X135) )
& ( ~ less(X134,X135)
| prec(X134,X135,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_30]),c_0_69])]) ).
cnf(c_0_116,hypothesis,
( esk1_2(nsup,X1) = nsup
| ~ less(nsup,X1) ),
inference(spm,[status(thm)],[c_0_52,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,
! [X140,X141] :
( ( ~ prec(X140,X141,o,o)
| leq(X140,X141) )
& ( ~ leq(X140,X141)
| prec(X140,X141,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_30,c_0_116]),c_0_38]) ).
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.02 % Problem : MGT068+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.34 % Computer : n003.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Mon Sep 7 13:52:55 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.13/0.40 # ENIGMATIC: Selected SinE mode:
% 0.13/0.40 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.40 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.40 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 264.23/36.53 # ENIGMATIC: Solved by autoschedule:
% 264.23/36.53 # No SInE strategy applied
% 264.23/36.53 # Trying AutoSched0 for 150 seconds
% 264.23/36.53 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 264.23/36.53 # and selection function SelectComplexExceptUniqMaxHorn.
% 264.23/36.53 #
% 264.23/36.53 # Preprocessing time : 0.029 s
% 264.23/36.53 # Presaturation interreduction done
% 264.23/36.53
% 264.23/36.53 # Proof found!
% 264.23/36.53 # SZS status Theorem
% 264.23/36.53 # SZS output start CNFRefutation
% See solution above
% 264.23/36.53 # Training examples: 0 positive, 0 negative
% 264.23/36.53
% 264.23/36.53 # -------------------------------------------------
% 264.23/36.53 # User time : 30.965 s
% 264.23/36.53 # System time : 1.124 s
% 264.23/36.53 # Total time : 32.089 s
% 264.23/36.53 # Maximum resident set size: 3584 pages
% 264.23/36.53
%------------------------------------------------------------------------------