%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT091+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:27:02 PM UTC 2026
% Result : Theorem 0.23s 0.60s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 21 unt; 0 def)
% Number of atoms : 106 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 102 ( 44 ~; 41 |; 12 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-8 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 87 ( 1 sgn 45 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( X1 = X2
| less(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(leq_trans,axiom,
! [X1,X2,X3] :
( ( leq(X2,X3)
& leq(X1,X2) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(in_closed,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X1,X5)
& leq(X4,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_closed) ).
fof(ord_v400_v800,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(ord_v400_v600,axiom,
less(v400,v600),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v600) ).
fof(odrl624,conjecture,
box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl624) ).
fof(ord_v0_v400,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(box2_overlap,axiom,
! [X15,X16,X17,X18,X22,X23,X24,X25] :
( box2_compatible(X15,X16,X17,X18,X22,X23,X24,X25)
<=> ( axis_compatible(X17,X18,X24,X25)
& axis_compatible(X15,X16,X22,X23) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+6.ax',box2_overlap) ).
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/sandbox2/benchmark/Axioms/MGT002+2.ax',axis_compatible_def) ).
fof(c_0_9,plain,
! [X32,X33] :
( ( leq(X32,X33)
| X32 != X33 )
& ( leq(X32,X33)
| ~ less(X32,X33) )
& ( X32 = X33
| less(X32,X33)
| ~ leq(X32,X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])]) ).
fof(c_0_10,plain,
! [X44,X45,X46] :
( leq(X44,X46)
| ~ leq(X45,X46)
| ~ leq(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_trans])])]) ).
fof(c_0_11,plain,
! [X47,X48,X49] :
( ( in_closed(X47,X48,X49)
| ~ leq(X47,X49)
| ~ leq(X48,X47) )
& ( ~ in_closed(X47,X48,X49)
| leq(X47,X49) )
& ( ~ in_closed(X47,X48,X49)
| leq(X48,X47) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_closed])])])]) ).
cnf(c_0_12,plain,
( X1 != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| in_closed(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ less(X3,X2)
| ~ leq(X1,X3)
| leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
less(v400,v800),
inference(split_conjunct,[status(thm)],[ord_v400_v800]) ).
cnf(c_0_19,plain,
( ~ leq(X2,X1)
| in_closed(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ leq(X1,v400)
| leq(X1,v800) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
less(v400,v600),
inference(split_conjunct,[status(thm)],[ord_v400_v600]) ).
cnf(c_0_22,plain,
( ~ leq(X1,v400)
| in_closed(v800,X1,v800) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ leq(X1,v400)
| leq(X1,v600) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
fof(c_0_24,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(assume_negation,[status(cth)],[odrl624]) ).
cnf(c_0_25,plain,
( ~ in_closed(X2,X1,X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,plain,
in_closed(v800,v400,v800),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_27,plain,
( ~ leq(X1,v400)
| in_closed(v600,X1,v600) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
fof(c_0_28,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
leq(v400,v800),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
in_closed(v600,v400,v600),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_31,plain,
less(v0,v400),
inference(split_conjunct,[status(thm)],[ord_v0_v400]) ).
fof(c_0_32,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(fof_nnf,[status(thm)],[c_0_28]) ).
fof(c_0_33,plain,
! [X113,X114,X115,X116,X117,X118,X119,X120] :
( ( box2_compatible(X113,X114,X115,X116,X117,X118,X119,X120)
| ~ axis_compatible(X115,X116,X119,X120)
| ~ axis_compatible(X113,X114,X117,X118) )
& ( ~ box2_compatible(X113,X114,X115,X116,X117,X118,X119,X120)
| axis_compatible(X115,X116,X119,X120) )
& ( ~ box2_compatible(X113,X114,X115,X116,X117,X118,X119,X120)
| axis_compatible(X113,X114,X117,X118) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[box2_overlap])])])]) ).
fof(c_0_34,plain,
! [X69,X70,X71,X72,X74,X75,X76,X77,X78] :
( ( axis_compatible(X74,X75,X76,X77)
| ~ in_closed(X78,X76,X77)
| ~ in_closed(X78,X74,X75) )
& ( ~ axis_compatible(X69,X70,X71,X72)
| in_closed(esk2_4(X69,X70,X71,X72),X71,X72) )
& ( ~ axis_compatible(X69,X70,X71,X72)
| in_closed(esk2_4(X69,X70,X71,X72),X69,X70) ) ),
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_35,plain,
( ~ leq(X1,v400)
| in_closed(v400,X1,v800) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_36,plain,
leq(v400,v600),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_37,plain,
( ~ leq(X1,v0)
| leq(X1,v400) ),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( ~ axis_compatible(X5,X6,X7,X8)
| ~ axis_compatible(X1,X2,X3,X4)
| box2_compatible(X1,X2,X5,X6,X3,X4,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
( ~ in_closed(X1,X4,X5)
| ~ in_closed(X1,X2,X3)
| axis_compatible(X2,X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
in_closed(v400,v400,v800),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_42,plain,
( ~ leq(X1,v400)
| in_closed(v400,X1,v600) ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_43,plain,
leq(v0,v400),
inference(spm,[status(thm)],[c_0_37,c_0_16]) ).
cnf(c_0_44,negated_conjecture,
~ axis_compatible(v0,v600,v400,v800),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ in_closed(v400,X1,X2)
| axis_compatible(X1,X2,v400,v800) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
in_closed(v400,v0,v600),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT091+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n005.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 01:26:18 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.23/0.60 % Version: 3.5.1
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 % Starting sh5l with 300s (1) cores
% 0.23/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2249355 completed with status 0
% 0.23/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.60 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.60 % SubtermCWHack with pid 2249362 completed with status 0
% 0.23/0.60 % Result found by SubtermCWHack
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Preprocessing time : 0.003 s
% 0.23/0.60
% 0.23/0.60 % Proof found!
% 0.23/0.60 % SZS status Theorem
% 0.23/0.60 % SZS output start CNFRefutation
% See solution above
% 0.23/0.60 % Parsed axioms : 47
% 0.23/0.60 % Removed by relevancy pruning/SinE : 0
% 0.23/0.60 % Initial clauses : 88
% 0.23/0.60 % Removed in clause preprocessing : 0
% 0.23/0.60 % Initial clauses in saturation : 88
% 0.23/0.60 % Processed clauses : 485
% 0.23/0.60 % ...of these trivial : 1
% 0.23/0.60 % ...subsumed : 241
% 0.23/0.60 % ...remaining for further processing : 243
% 0.23/0.60 % Other redundant clauses eliminated : 8
% 0.23/0.60 % Clauses deleted for lack of memory : 0
% 0.23/0.60 % Backward-subsumed : 0
% 0.23/0.60 % Backward-rewritten : 0
% 0.23/0.60 % Generated clauses : 1025
% 0.23/0.60 % ...of the previous two non-redundant : 761
% 0.23/0.60 % ...aggressively subsumed : 0
% 0.23/0.60 % Contextual simplify-reflections : 0
% 0.23/0.60 % Paramodulations : 1014
% 0.23/0.60 % Factorizations : 4
% 0.23/0.60 % NegExts : 0
% 0.23/0.60 % Equation resolutions : 8
% 0.23/0.60 % Disequality decompositions : 0
% 0.23/0.60 % Total rewrite steps : 276
% 0.23/0.60 % ...of those cached : 243
% 0.23/0.60 % Propositional unsat checks : 0
% 0.23/0.60 % Propositional check models : 0
% 0.23/0.60 % Propositional check unsatisfiable : 0
% 0.23/0.60 % Propositional clauses : 0
% 0.23/0.60 % Propositional clauses after purity: 0
% 0.23/0.60 % Propositional unsat core size : 0
% 0.23/0.60 % Propositional preprocessing time : 0.000
% 0.23/0.60 % Propositional encoding time : 0.000
% 0.23/0.60 % Propositional solver time : 0.000
% 0.23/0.60 % Success case prop preproc time : 0.000
% 0.23/0.60 % Success case prop encoding time : 0.000
% 0.23/0.60 % Success case prop solver time : 0.000
% 0.23/0.60 % Current number of processed clauses : 236
% 0.23/0.60 % Positive orientable unit clauses : 39
% 0.23/0.60 % Positive unorientable unit clauses: 0
% 0.23/0.60 % Negative unit clauses : 25
% 0.23/0.60 % Non-unit-clauses : 172
% 0.23/0.60 % Current number of unprocessed clauses: 364
% 0.23/0.60 % ...number of literals in the above : 1168
% 0.23/0.60 % Current number of archived formulas : 0
% 0.23/0.60 % Current number of archived clauses : 0
% 0.23/0.60 % Clause-clause subsumption calls (NU) : 5983
% 0.23/0.60 % Rec. Clause-clause subsumption calls : 4465
% 0.23/0.60 % Non-unit clause-clause subsumptions : 122
% 0.23/0.60 % Unit Clause-clause subsumption calls : 1305
% 0.23/0.60 % Rewrite failures with RHS unbound : 0
% 0.23/0.60 % BW rewrite match attempts : 11
% 0.23/0.60 % BW rewrite match successes : 0
% 0.23/0.60 % Condensation attempts : 0
% 0.23/0.60 % Condensation successes : 0
% 0.23/0.60 % Termbank termtop insertions : 15035
% 0.23/0.60 % Search garbage collected termcells : 1113
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.041 s
% 0.23/0.60 % System time : 0.008 s
% 0.23/0.60 % Total time : 0.049 s
% 0.23/0.60 % Maximum resident set size: 3684 pages
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.180 s
% 0.23/0.60 % System time : 0.032 s
% 0.23/0.60 % Total time : 0.212 s
% 0.23/0.60 % Maximum resident set size: 4608 pages
% 0.23/0.60 % E exiting
%------------------------------------------------------------------------------