%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT078+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 : 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:27:00 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 78 ( 9 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 76 ( 28 ~; 22 |; 22 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 41 ( 1 sgn 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl341,conjecture,
~ ? [X1,X2,X3] :
( leq(v8,X3)
& in_lopen(X3,v0,v32)
& leq(v200,X2)
& in_lopen(X2,v0,v800)
& leq(v1200,X1)
& in_lopen(X1,v0,v600) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl341) ).
fof(in_lopen,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( leq(X1,X5)
& less(X4,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(leq_antisym,axiom,
! [X1,X2] :
( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(leq_less_trans,axiom,
! [X1,X2,X3] :
( ( less(X2,X3)
& leq(X1,X2) )
=> less(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
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(ord_v600_v1200,axiom,
less(v600,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v1200) ).
fof(c_0_7,negated_conjecture,
~ ~ ? [X1,X2,X3] :
( leq(v8,X3)
& in_lopen(X3,v0,v32)
& leq(v200,X2)
& in_lopen(X2,v0,v800)
& leq(v1200,X1)
& in_lopen(X1,v0,v600) ),
inference(assume_negation,[status(cth)],[odrl341]) ).
fof(c_0_8,plain,
! [X31,X32,X33] :
( ( in_lopen(X31,X32,X33)
| ~ leq(X31,X33)
| ~ less(X32,X31) )
& ( ~ in_lopen(X31,X32,X33)
| leq(X31,X33) )
& ( ~ in_lopen(X31,X32,X33)
| less(X32,X31) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])])]) ).
fof(c_0_9,negated_conjecture,
( leq(v8,esk3_0)
& in_lopen(esk3_0,v0,v32)
& leq(v200,esk2_0)
& in_lopen(esk2_0,v0,v800)
& leq(v1200,esk1_0)
& in_lopen(esk1_0,v0,v600) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X18,X19] :
( X18 = X19
| ~ leq(X19,X18)
| ~ leq(X18,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])]) ).
fof(c_0_11,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
fof(c_0_12,plain,
! [X22,X23,X24] :
( less(X22,X24)
| ~ less(X23,X24)
| ~ leq(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_less_trans])])]) ).
cnf(c_0_13,plain,
( ~ in_lopen(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
in_lopen(esk1_0,v0,v600),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
leq(v1200,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X16,X17] :
( ( leq(X16,X17)
| X16 != X17 )
& ( leq(X16,X17)
| ~ less(X16,X17) )
& ( X16 = X17
| less(X16,X17)
| ~ leq(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])]) ).
fof(c_0_18,plain,
! [X34] : ~ less(X34,X34),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_19,plain,
( ~ less(X2,X3)
| ~ leq(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
leq(esk1_0,v600),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( ~ leq(esk1_0,v1200)
| esk1_0 = v1200 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ less(v600,X1)
| less(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ less(esk1_0,v1200)
| esk1_0 = v1200 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
less(v600,v1200),
inference(split_conjunct,[status(thm)],[ord_v600_v1200]) ).
cnf(c_0_27,negated_conjecture,
~ less(v600,esk1_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 = v1200,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n026.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:27:37 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % new_bool_3 with pid 1071637 completed with status 0
% 0.11/0.45 % Result found by new_bool_3
% 0.11/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGUSF-FFMM00-SFFFFFNN
% 0.11/0.45 % partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 1071640 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGUSF-FFMM00-SFFFFFNN
% 0.11/0.45 % partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 57
% 0.11/0.45 % Removed by relevancy pruning/SinE : 17
% 0.11/0.45 % Initial clauses : 69
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 69
% 0.11/0.45 % Processed clauses : 202
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 46
% 0.11/0.45 % ...remaining for further processing : 156
% 0.11/0.45 % Other redundant clauses eliminated : 1
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 3
% 0.11/0.45 % Backward-rewritten : 17
% 0.11/0.45 % Generated clauses : 308
% 0.11/0.45 % ...of the previous two non-redundant : 247
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 305
% 0.11/0.45 % Factorizations : 2
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 1
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 59
% 0.11/0.45 % ...of those cached : 34
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 135
% 0.11/0.45 % Positive orientable unit clauses : 38
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 47
% 0.11/0.45 % Non-unit-clauses : 50
% 0.11/0.45 % Current number of unprocessed clauses: 114
% 0.11/0.45 % ...number of literals in the above : 296
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 20
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 181
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 176
% 0.11/0.45 % Non-unit clause-clause subsumptions : 7
% 0.11/0.45 % Unit Clause-clause subsumption calls : 236
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 4
% 0.11/0.45 % BW rewrite match successes : 1
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 4278
% 0.11/0.45 % Search garbage collected termcells : 433
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.008 s
% 0.11/0.45 % System time : 0.002 s
% 0.11/0.45 % Total time : 0.010 s
% 0.11/0.45 % Maximum resident set size: 3684 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.012 s
% 0.11/0.45 % System time : 0.005 s
% 0.11/0.45 % Total time : 0.017 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------