%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:26:59 PM UTC 2026
% Result : Theorem 40.43s 11.35s
% Output : CNFRefutation 40.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 24
% Syntax : Number of formulae : 128 ( 26 unt; 0 def)
% Number of atoms : 370 ( 33 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 422 ( 180 ~; 177 |; 48 &)
% ( 8 <=>; 9 =>; 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 : 338 ( 28 sgn 126 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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(in_closed,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X1,X5)
& leq(X4,X1) ) ),
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,X8,X9)
& in_closed(X1,X6,X7) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',axis_compatible_def) ).
fof(h_sup_ub,hypothesis,
! [X1] : leq(X1,nsup),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_sup_ub) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(less_leq_trans,axiom,
! [X1,X2,X3] :
( ( leq(X2,X3)
& less(X1,X2) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).
fof(hard_chain,conjecture,
( box_verdict(conflict,unknown) = conflict
& completion_compatible(n5,ninf,nsup)
& completion_conflict(n5,n10,ninf,nsup)
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& ? [X3] :
( less(X3,n10)
& less(n5,X3) )
& axis_conflict(n0,n3,n10,n20) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hard_chain) ).
fof(leq_less_trans,axiom,
! [X1,X2,X3] :
( ( less(X2,X3)
& leq(X1,X2) )
=> 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,X8,X9)
& in_closed(X1,X6,X7) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',axis_conflict_def) ).
fof(h_inf_lb,hypothesis,
! [X1] : leq(ninf,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_inf_lb) ).
fof(dense,axiom,
! [X1,X2] :
( less(X1,X2)
=> ? [X3] :
( less(X3,X2)
& less(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+1.ax',dense) ).
fof(disjoint_def,axiom,
! [X24,X25,X26,X27,X28,X29,X30,X31] :
( disjoint(X24,X25,X26,X27,X28,X29,X30,X31)
<=> ( prec(X29,X24,X31,X26)
| prec(X25,X28,X27,X30) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+5.ax',disjoint_def) ).
fof(h_5_10,hypothesis,
less(n5,n10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_5_10) ).
fof(leq_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( X1 = X2
| less(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(sharpness_conflict,axiom,
! [X15,X10,X13,X14] :
( ( leq(X10,X14)
& less(X15,X10)
& leq(X15,X14)
& leq(X13,X15) )
=> completion_conflict(X15,X10,X13,X14) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',sharpness_conflict) ).
fof(leq_antisym,axiom,
! [X1,X2] :
( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(completion_compat,axiom,
! [X10,X13,X14] :
( ( leq(X10,X14)
& leq(X13,X10) )
=> completion_compatible(X10,X13,X14) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',completion_compat) ).
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(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(transitive,axiom,
! [X1,X2,X3] :
( ( less(X2,X3)
& less(X1,X2) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(box_conflict,axiom,
! [X11,X12] :
( ( ( X12 = conflict
| X11 = conflict )
& is_verdict(X12)
& is_verdict(X11) )
=> box_verdict(X11,X12) = conflict ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',box_conflict) ).
fof(h_3_5,hypothesis,
less(n3,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_3_5) ).
fof(conflict_is_verdict,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
fof(unknown_is_verdict,axiom,
is_verdict(unknown),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',unknown_is_verdict) ).
fof(c_0_24,plain,
! [X88,X89,X90,X91,X92,X93,X94,X95,X96] :
( ( axis_subsumes(X93,X94,X95,X96)
| ~ in_closed(esk4_4(X93,X94,X95,X96),X95,X96) )
& ( axis_subsumes(X93,X94,X95,X96)
| in_closed(esk4_4(X93,X94,X95,X96),X93,X94) )
& ( in_closed(X92,X90,X91)
| ~ in_closed(X92,X88,X89)
| ~ axis_subsumes(X88,X89,X90,X91) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
fof(c_0_25,plain,
! [X56,X57,X58] :
( ( in_closed(X56,X57,X58)
| ~ leq(X56,X58)
| ~ leq(X57,X56) )
& ( ~ in_closed(X56,X57,X58)
| leq(X56,X58) )
& ( ~ in_closed(X56,X57,X58)
| leq(X57,X56) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_closed])])])]) ).
fof(c_0_26,plain,
! [X78,X79,X80,X81,X83,X84,X85,X86,X87] :
( ( axis_compatible(X83,X84,X85,X86)
| ~ in_closed(X87,X85,X86)
| ~ in_closed(X87,X83,X84) )
& ( ~ axis_compatible(X78,X79,X80,X81)
| in_closed(esk3_4(X78,X79,X80,X81),X80,X81) )
& ( ~ axis_compatible(X78,X79,X80,X81)
| in_closed(esk3_4(X78,X79,X80,X81),X78,X79) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
cnf(c_0_27,plain,
( ~ in_closed(esk4_4(X1,X2,X3,X4),X3,X4)
| axis_subsumes(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| in_closed(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_29,hypothesis,
! [X151] : leq(X151,nsup),
inference(variable_rename,[status(thm)],[h_sup_ub]) ).
fof(c_0_30,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
fof(c_0_31,plain,
! [X47,X48,X49] :
( less(X47,X49)
| ~ leq(X48,X49)
| ~ less(X47,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_leq_trans])])]) ).
cnf(c_0_32,plain,
( ~ in_closed(X2,X1,X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( ~ axis_compatible(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( ~ leq(X3,esk4_4(X1,X2,X3,X4))
| ~ leq(esk4_4(X1,X2,X3,X4),X4)
| axis_subsumes(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,hypothesis,
leq(X1,nsup),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( axis_subsumes(X1,X2,X3,X4)
| in_closed(esk4_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_37,negated_conjecture,
~ ( box_verdict(conflict,unknown) = conflict
& completion_compatible(n5,ninf,nsup)
& completion_conflict(n5,n10,ninf,nsup)
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& ? [X3] :
( less(X3,n10)
& less(n5,X3) )
& axis_conflict(n0,n3,n10,n20) ),
inference(assume_negation,[status(cth)],[hard_chain]) ).
fof(c_0_38,plain,
! [X32] : ~ less(X32,X32),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).
cnf(c_0_39,plain,
( ~ leq(X2,X3)
| ~ less(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,plain,
( ~ axis_compatible(X2,X3,X1,X4)
| leq(X1,esk3_4(X2,X3,X1,X4)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_41,plain,
! [X44,X45,X46] :
( less(X44,X46)
| ~ less(X45,X46)
| ~ leq(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_less_trans])])]) ).
cnf(c_0_42,plain,
( ~ in_closed(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_43,plain,
! [X68,X69,X70,X71,X72,X73,X74,X75,X76] :
( ( axis_conflict(X73,X74,X75,X76)
| in_closed(esk2_4(X73,X74,X75,X76),X75,X76) )
& ( axis_conflict(X73,X74,X75,X76)
| in_closed(esk2_4(X73,X74,X75,X76),X73,X74) )
& ( ~ in_closed(X72,X70,X71)
| ~ in_closed(X72,X68,X69)
| ~ axis_conflict(X68,X69,X70,X71) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_44,hypothesis,
( ~ leq(X3,esk4_4(X1,X2,X3,nsup))
| axis_subsumes(X1,X2,X3,nsup) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
( leq(X1,esk4_4(X1,X2,X3,X4))
| axis_subsumes(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_32,c_0_36]) ).
fof(c_0_46,negated_conjecture,
~ ( box_verdict(conflict,unknown) = conflict
& completion_compatible(n5,ninf,nsup)
& completion_conflict(n5,n10,ninf,nsup)
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& ? [X3] :
( less(X3,n10)
& less(n5,X3) )
& axis_conflict(n0,n3,n10,n20) ),
inference(fof_simplification,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
( ~ less(X1,X4)
| ~ axis_compatible(X2,X3,X4,X5)
| less(X1,esk3_4(X2,X3,X4,X5)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,plain,
( ~ less(X2,X3)
| ~ leq(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
( ~ axis_compatible(X1,X2,X3,X4)
| leq(esk3_4(X1,X2,X3,X4),X4) ),
inference(spm,[status(thm)],[c_0_42,c_0_33]) ).
cnf(c_0_51,plain,
( ~ in_closed(X1,X4,X5)
| ~ in_closed(X1,X2,X3)
| axis_compatible(X2,X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_52,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk2_4(X1,X2,X3,X4),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_53,hypothesis,
! [X150] : leq(ninf,X150),
inference(variable_rename,[status(thm)],[h_inf_lb]) ).
cnf(c_0_54,plain,
( ~ in_closed(X5,X1,X2)
| ~ axis_subsumes(X1,X2,X3,X4)
| in_closed(X5,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_55,hypothesis,
axis_subsumes(X1,X2,X1,nsup),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_56,negated_conjecture,
! [X152] :
( box_verdict(conflict,unknown) != conflict
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(X152,n10)
| ~ less(n5,X152)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])]) ).
fof(c_0_57,plain,
! [X53,X54] :
( ( ~ less(X53,X54)
| less(esk1_2(X53,X54),X54) )
& ( ~ less(X53,X54)
| less(X53,esk1_2(X53,X54)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dense])])])])]) ).
cnf(c_0_58,plain,
( ~ axis_compatible(X1,X2,X3,X4)
| in_closed(esk3_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_59,plain,
( ~ less(esk3_4(X1,X2,X3,X4),X3)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_60,plain,
( ~ less(X4,X5)
| ~ axis_compatible(X1,X2,X3,X4)
| less(esk3_4(X1,X2,X3,X4),X5) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_61,plain,
( ~ in_closed(esk2_4(X5,X6,X3,X4),X1,X2)
| axis_conflict(X5,X6,X3,X4)
| axis_compatible(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_62,hypothesis,
leq(ninf,X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_63,hypothesis,
( ~ in_closed(X1,X2,X3)
| in_closed(X1,X2,nsup) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_64,negated_conjecture,
( box_verdict(conflict,unknown) != conflict
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ less(X1,n10)
| ~ less(n5,X1)
| ~ axis_conflict(n0,n3,n10,n20)
| disjoint(n5,nsup,o,c,ninf,n10,c,o) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_65,plain,
( ~ less(X1,X2)
| less(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_66,plain,
( ~ axis_compatible(X1,X2,X3,X4)
| leq(esk3_4(X1,X2,X3,X4),X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_58]) ).
cnf(c_0_67,plain,
( ~ less(X4,X3)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_68,plain,
( axis_conflict(X3,X4,X1,X2)
| axis_compatible(X1,X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_52]) ).
cnf(c_0_69,hypothesis,
axis_subsumes(X1,X2,ninf,nsup),
inference(spm,[status(thm)],[c_0_44,c_0_62]) ).
cnf(c_0_70,hypothesis,
( ~ leq(X2,X1)
| ~ leq(X1,X3)
| in_closed(X1,X2,nsup) ),
inference(spm,[status(thm)],[c_0_63,c_0_28]) ).
fof(c_0_71,plain,
! [X142,X143,X144,X145,X146,X147,X148,X149] :
( ( disjoint(X142,X143,X144,X145,X146,X147,X148,X149)
| ~ prec(X147,X142,X149,X144) )
& ( 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) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[disjoint_def])])])]) ).
cnf(c_0_72,negated_conjecture,
( ~ less(X1,n10)
| ~ less(n5,esk1_2(X1,n10))
| ~ axis_conflict(n0,n3,n10,n20)
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| box_verdict(conflict,unknown) != conflict
| disjoint(n5,nsup,o,c,ninf,n10,c,o) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_73,plain,
( ~ less(X1,X2)
| less(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_74,hypothesis,
less(n5,n10),
inference(split_conjunct,[status(thm)],[h_5_10]) ).
cnf(c_0_75,plain,
( ~ less(X2,X5)
| ~ axis_compatible(X1,X2,X3,X4)
| less(esk3_4(X1,X2,X3,X4),X5) ),
inference(spm,[status(thm)],[c_0_49,c_0_66]) ).
cnf(c_0_76,plain,
( axis_conflict(X1,X2,X3,X4)
| in_closed(esk2_4(X1,X2,X3,X4),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_77,plain,
( ~ in_closed(X5,X3,X4)
| ~ in_closed(X5,X1,X2)
| ~ axis_conflict(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_78,plain,
( ~ less(X4,X3)
| axis_conflict(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_79,hypothesis,
( ~ in_closed(X1,X2,X3)
| in_closed(X1,ninf,nsup) ),
inference(spm,[status(thm)],[c_0_54,c_0_69]) ).
cnf(c_0_80,hypothesis,
( ~ leq(X2,X1)
| in_closed(X1,X2,nsup) ),
inference(spm,[status(thm)],[c_0_70,c_0_35]) ).
cnf(c_0_81,plain,
( ~ disjoint(X1,X2,X3,X4,X5,X6,X7,X8)
| prec(X6,X1,X8,X3)
| prec(X2,X5,X4,X7) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_82,negated_conjecture,
( ~ axis_conflict(n0,n3,n10,n20)
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| box_verdict(conflict,unknown) != conflict
| disjoint(n5,nsup,o,c,ninf,n10,c,o) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_83,plain,
( ~ less(X2,X3)
| ~ axis_compatible(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_59,c_0_75]) ).
cnf(c_0_84,plain,
( axis_conflict(X1,X2,X3,X4)
| axis_compatible(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_61,c_0_76]) ).
cnf(c_0_85,plain,
( ~ less(X3,X2)
| ~ in_closed(X1,X4,X5)
| ~ in_closed(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_86,hypothesis,
( ~ leq(X2,X1)
| in_closed(X1,ninf,nsup) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
fof(c_0_87,plain,
! [X38,X39] :
( ( leq(X38,X39)
| X38 != X39 )
& ( leq(X38,X39)
| ~ less(X38,X39) )
& ( X38 = X39
| less(X38,X39)
| ~ leq(X38,X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])]) ).
cnf(c_0_88,negated_conjecture,
( ~ axis_conflict(n0,n3,n10,n20)
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| box_verdict(conflict,unknown) != conflict
| prec(n10,n5,o,o)
| prec(nsup,ninf,c,c) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_89,plain,
( ~ less(X2,X3)
| axis_conflict(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
fof(c_0_90,plain,
! [X118,X119,X120,X121] :
( completion_conflict(X118,X119,X120,X121)
| ~ leq(X119,X121)
| ~ less(X118,X119)
| ~ leq(X118,X121)
| ~ leq(X120,X118) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sharpness_conflict])])]) ).
cnf(c_0_91,plain,
( ~ less(X4,X5)
| ~ leq(X5,X1)
| ~ leq(X1,X4)
| ~ in_closed(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_85,c_0_28]) ).
cnf(c_0_92,hypothesis,
in_closed(X1,ninf,nsup),
inference(spm,[status(thm)],[c_0_86,c_0_62]) ).
cnf(c_0_93,plain,
( X1 != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
fof(c_0_94,plain,
! [X40,X41] :
( X40 = X41
| ~ leq(X41,X40)
| ~ leq(X40,X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])]) ).
cnf(c_0_95,negated_conjecture,
( ~ less(n3,n10)
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| box_verdict(conflict,unknown) != conflict
| prec(nsup,ninf,c,c)
| prec(n10,n5,o,o) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_96,plain,
( ~ leq(X4,X3)
| ~ less(X2,X4)
| ~ leq(X2,X3)
| ~ leq(X1,X2)
| completion_conflict(X2,X4,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
fof(c_0_97,plain,
! [X107,X108,X109] :
( completion_compatible(X107,X108,X109)
| ~ leq(X107,X109)
| ~ leq(X108,X107) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[completion_compat])])]) ).
cnf(c_0_98,hypothesis,
( ~ less(X2,X3)
| ~ leq(X3,X1)
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_99,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_93]) ).
cnf(c_0_100,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_101,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
fof(c_0_102,plain,
! [X140,X141] :
( ( prec(X140,X141,o,o)
| ~ leq(X140,X141) )
& ( leq(X140,X141)
| ~ prec(X140,X141,o,o) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prec_oo])])]) ).
cnf(c_0_103,negated_conjecture,
( ~ less(n3,n10)
| ~ completion_compatible(n5,ninf,nsup)
| box_verdict(conflict,unknown) != conflict
| prec(n10,n5,o,o)
| prec(nsup,ninf,c,c) ),
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_95,c_0_96]),c_0_35]),c_0_35]),c_0_62]),c_0_74])]) ).
cnf(c_0_104,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| completion_compatible(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_105,hypothesis,
( ~ less(X2,X1)
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_106,hypothesis,
( ~ leq(X1,ninf)
| X1 = ninf ),
inference(spm,[status(thm)],[c_0_100,c_0_62]) ).
cnf(c_0_107,plain,
( ~ less(X1,X2)
| leq(esk1_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_101,c_0_65]) ).
fof(c_0_108,plain,
! [X134,X135] :
( ( prec(X134,X135,c,c)
| ~ less(X134,X135) )
& ( less(X134,X135)
| ~ prec(X134,X135,c,c) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prec_cc])])]) ).
cnf(c_0_109,plain,
( ~ prec(X1,X2,o,o)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_110,negated_conjecture,
( ~ less(n3,n10)
| box_verdict(conflict,unknown) != conflict
| prec(nsup,ninf,c,c)
| prec(n10,n5,o,o) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_35]),c_0_62])]) ).
cnf(c_0_111,hypothesis,
~ leq(n10,n5),
inference(spm,[status(thm)],[c_0_105,c_0_74]) ).
cnf(c_0_112,hypothesis,
( ~ less(X1,ninf)
| esk1_2(X1,ninf) = ninf ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
fof(c_0_113,plain,
! [X33,X34,X35] :
( less(X33,X35)
| ~ less(X34,X35)
| ~ less(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])])]) ).
cnf(c_0_114,plain,
( ~ prec(X1,X2,c,c)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_115,negated_conjecture,
( ~ less(n3,n10)
| box_verdict(conflict,unknown) != conflict
| prec(nsup,ninf,c,c) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).
cnf(c_0_116,hypothesis,
~ less(X1,ninf),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_112]),c_0_47]) ).
cnf(c_0_117,plain,
( ~ less(X2,X3)
| ~ less(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
fof(c_0_118,plain,
! [X99,X100] :
( ( box_verdict(X99,X100) = conflict
| ~ is_verdict(X100)
| ~ is_verdict(X99)
| X100 != conflict )
& ( box_verdict(X99,X100) = conflict
| ~ is_verdict(X100)
| ~ is_verdict(X99)
| X99 != conflict ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[box_conflict])])])]) ).
cnf(c_0_119,negated_conjecture,
( ~ less(n3,n10)
| box_verdict(conflict,unknown) != conflict ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116]) ).
cnf(c_0_120,hypothesis,
( ~ less(X1,n5)
| less(X1,n10) ),
inference(spm,[status(thm)],[c_0_117,c_0_74]) ).
cnf(c_0_121,hypothesis,
less(n3,n5),
inference(split_conjunct,[status(thm)],[h_3_5]) ).
cnf(c_0_122,plain,
( ~ is_verdict(X2)
| ~ is_verdict(X1)
| X1 != conflict
| box_verdict(X1,X2) = conflict ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_123,plain,
is_verdict(conflict),
inference(split_conjunct,[status(thm)],[conflict_is_verdict]) ).
cnf(c_0_124,hypothesis,
box_verdict(conflict,unknown) != conflict,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121])]) ).
cnf(c_0_125,plain,
( ~ is_verdict(X1)
| box_verdict(conflict,X1) = conflict ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_122]),c_0_123])]) ).
cnf(c_0_126,plain,
is_verdict(unknown),
inference(split_conjunct,[status(thm)],[unknown_is_verdict]) ).
cnf(c_0_127,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[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.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n026.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 01:27:57 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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
% 40.43/11.35 % Version: 3.5.1
% 40.43/11.35 % Preprocessing class: FSLSSMSMSSSNFFN.
% 40.43/11.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.43/11.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 40.43/11.35 % Starting new_bool_3 with 300s (1) cores
% 40.43/11.35 % Starting new_bool_1 with 300s (1) cores
% 40.43/11.35 % Starting sh5l with 300s (1) cores
% 40.43/11.35 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1072461 completed with status 0
% 40.43/11.35 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 40.43/11.35 % Preprocessing class: FSLSSMSMSSSNFFN.
% 40.43/11.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.43/11.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 40.43/11.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 40.43/11.35 % No SInE strategy applied
% 40.43/11.35 % Search class: FGHSS-FFMM33-SFFFFFNN
% 40.43/11.35 % partial match(1): FGHSF-FFMM33-SFFFFFNN
% 40.43/11.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 40.43/11.35 % Starting SubtermCWHack with 136s (1) cores
% 40.43/11.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 40.43/11.35 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 40.43/11.35 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 40.43/11.35 % Starting new_bool_3 with 136s (1) cores
% 40.43/11.35 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1072468 completed with status 0
% 40.43/11.35 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 40.43/11.35 % Preprocessing class: FSLSSMSMSSSNFFN.
% 40.43/11.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.43/11.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 40.43/11.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 40.43/11.35 % No SInE strategy applied
% 40.43/11.35 % Search class: FGHSS-FFMM33-SFFFFFNN
% 40.43/11.35 % partial match(1): FGHSF-FFMM33-SFFFFFNN
% 40.43/11.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 40.43/11.35 % Starting SubtermCWHack with 136s (1) cores
% 40.43/11.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 40.43/11.35 % Preprocessing time : 0.002 s
% 40.43/11.35 % Presaturation interreduction done
% 40.43/11.35
% 40.43/11.35 % Proof found!
% 40.43/11.35 % SZS status Theorem
% 40.43/11.35 % SZS output start CNFRefutation
% See solution above
% 40.43/11.35 % Parsed axioms : 60
% 40.43/11.35 % Removed by relevancy pruning/SinE : 0
% 40.43/11.35 % Initial clauses : 85
% 40.43/11.35 % Removed in clause preprocessing : 0
% 40.43/11.35 % Initial clauses in saturation : 85
% 40.43/11.35 % Processed clauses : 19761
% 40.43/11.35 % ...of these trivial : 216
% 40.43/11.35 % ...subsumed : 16609
% 40.43/11.35 % ...remaining for further processing : 2936
% 40.43/11.35 % Other redundant clauses eliminated : 75
% 40.43/11.35 % Clauses deleted for lack of memory : 0
% 40.43/11.35 % Backward-subsumed : 340
% 40.43/11.35 % Backward-rewritten : 52
% 40.43/11.35 % Generated clauses : 327025
% 40.43/11.35 % ...of the previous two non-redundant : 225343
% 40.43/11.35 % ...aggressively subsumed : 0
% 40.43/11.35 % Contextual simplify-reflections : 11
% 40.43/11.35 % Paramodulations : 326687
% 40.43/11.35 % Factorizations : 264
% 40.43/11.35 % NegExts : 0
% 40.43/11.35 % Equation resolutions : 75
% 40.43/11.35 % Disequality decompositions : 0
% 40.43/11.35 % Total rewrite steps : 107984
% 40.43/11.35 % ...of those cached : 107747
% 40.43/11.35 % Propositional unsat checks : 0
% 40.43/11.35 % Propositional check models : 0
% 40.43/11.35 % Propositional check unsatisfiable : 0
% 40.43/11.35 % Propositional clauses : 0
% 40.43/11.35 % Propositional clauses after purity: 0
% 40.43/11.35 % Propositional unsat core size : 0
% 40.43/11.35 % Propositional preprocessing time : 0.000
% 40.43/11.35 % Propositional encoding time : 0.000
% 40.43/11.35 % Propositional solver time : 0.000
% 40.43/11.35 % Success case prop preproc time : 0.000
% 40.43/11.35 % Success case prop encoding time : 0.000
% 40.43/11.35 % Success case prop solver time : 0.000
% 40.43/11.35 % Current number of processed clauses : 2457
% 40.43/11.35 % Positive orientable unit clauses : 107
% 40.43/11.35 % Positive unorientable unit clauses: 0
% 40.43/11.35 % Negative unit clauses : 86
% 40.43/11.35 % Non-unit-clauses : 2264
% 40.43/11.35 % Current number of unprocessed clauses: 204961
% 40.43/11.35 % ...number of literals in the above : 1139049
% 40.43/11.35 % Current number of archived formulas : 0
% 40.43/11.35 % Current number of archived clauses : 473
% 40.43/11.35 % Clause-clause subsumption calls (NU) : 1134537
% 40.43/11.35 % Rec. Clause-clause subsumption calls : 435178
% 40.43/11.35 % Non-unit clause-clause subsumptions : 7813
% 40.43/11.35 % Unit Clause-clause subsumption calls : 19472
% 40.43/11.35 % Rewrite failures with RHS unbound : 0
% 40.43/11.35 % BW rewrite match attempts : 403
% 40.43/11.35 % BW rewrite match successes : 46
% 40.43/11.35 % Condensation attempts : 0
% 40.43/11.35 % Condensation successes : 0
% 40.43/11.35 % Termbank termtop insertions : 3841038
% 40.43/11.35 % Search garbage collected termcells : 1105
% 40.43/11.35
% 40.43/11.35 % -------------------------------------------------
% 40.43/11.35 % User time : 5.505 s
% 40.43/11.35 % System time : 0.183 s
% 40.43/11.35 % Total time : 5.688 s
% 40.43/11.35 % Maximum resident set size: 3704 pages
% 40.43/11.35
% 40.43/11.35 % -------------------------------------------------
% 40.43/11.35 % User time : 27.781 s
% 40.43/11.35 % System time : 0.793 s
% 40.43/11.35 % Total time : 28.574 s
% 40.43/11.35 % Maximum resident set size: 4864 pages
% 40.43/11.35 % E exiting
%------------------------------------------------------------------------------