%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT079+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 : n004.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:01 PM UTC 2026
% Result : Theorem 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 17 unt; 0 def)
% Number of atoms : 173 ( 71 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 238 ( 111 ~; 44 |; 79 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 60 ( 4 sgn 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(odrl350,conjecture,
? [X1,X2,X3] :
( ~ ( in_lopen(X3,v0,v16)
& in_lopen(X2,v0,v800)
& in_lopen(X1,v0,v1200) )
& in_lopen(X3,v0,v32)
& in_lopen(X2,v0,v400)
& in_lopen(X1,v0,v600) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl350) ).
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(ord_v16_v600,axiom,
less(v16,v600),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v16_v600) ).
fof(ord_v16_v32,axiom,
less(v16,v32),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v16_v32) ).
fof(distinct,axiom,
( v800 != v1200
& v600 != v1200
& v600 != v800
& v400 != v1200
& v400 != v800
& v400 != v600
& v32 != v1200
& v32 != v800
& v32 != v600
& v32 != v400
& v16 != v1200
& v16 != v800
& v16 != v600
& v16 != v400
& v16 != v32
& v0 != v1200
& v0 != v800
& v0 != v600
& v0 != v400
& v0 != v32
& v0 != v16 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
fof(ord_v0_v400,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
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(ord_v0_v16,axiom,
less(v0,v16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v16) ).
fof(ord_v0_v32,axiom,
less(v0,v32),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v32) ).
fof(c_0_11,plain,
! [X31,X32,X33] :
( leq(X31,X33)
| ~ leq(X32,X33)
| ~ leq(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_trans])])]) ).
fof(c_0_12,plain,
! [X19,X20] :
( ( leq(X19,X20)
| X19 != X20 )
& ( leq(X19,X20)
| ~ less(X19,X20) )
& ( X19 = X20
| less(X19,X20)
| ~ leq(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])]) ).
cnf(c_0_13,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,negated_conjecture,
~ ? [X1,X2,X3] :
( ~ ( in_lopen(X3,v0,v16)
& in_lopen(X2,v0,v800)
& in_lopen(X1,v0,v1200) )
& in_lopen(X3,v0,v32)
& in_lopen(X2,v0,v400)
& in_lopen(X1,v0,v600) ),
inference(assume_negation,[status(cth)],[odrl350]) ).
fof(c_0_16,plain,
! [X16,X17,X18] :
( ( in_lopen(X16,X17,X18)
| ~ leq(X16,X18)
| ~ less(X17,X16) )
& ( ~ in_lopen(X16,X17,X18)
| leq(X16,X18) )
& ( ~ in_lopen(X16,X17,X18)
| less(X17,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])])]) ).
cnf(c_0_17,plain,
( X1 != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ less(X3,X2)
| ~ leq(X1,X3)
| leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
less(v16,v600),
inference(split_conjunct,[status(thm)],[ord_v16_v600]) ).
fof(c_0_20,negated_conjecture,
! [X13,X14,X15] :
( ( ~ in_lopen(X15,v0,v32)
| ~ in_lopen(X14,v0,v400)
| ~ in_lopen(X13,v0,v600)
| in_lopen(X15,v0,v16) )
& ( ~ in_lopen(X15,v0,v32)
| ~ in_lopen(X14,v0,v400)
| ~ in_lopen(X13,v0,v600)
| in_lopen(X14,v0,v800) )
& ( ~ in_lopen(X15,v0,v32)
| ~ in_lopen(X14,v0,v400)
| ~ in_lopen(X13,v0,v600)
| in_lopen(X13,v0,v1200) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_21,plain,
( ~ leq(X2,X3)
| ~ less(X1,X2)
| in_lopen(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( ~ leq(X1,v16)
| leq(X1,v600) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
less(v16,v32),
inference(split_conjunct,[status(thm)],[ord_v16_v32]) ).
fof(c_0_25,plain,
( v800 != v1200
& v600 != v1200
& v600 != v800
& v400 != v1200
& v400 != v800
& v400 != v600
& v32 != v1200
& v32 != v800
& v32 != v600
& v32 != v400
& v16 != v1200
& v16 != v800
& v16 != v600
& v16 != v400
& v16 != v32
& v0 != v1200
& v0 != v800
& v0 != v600
& v0 != v400
& v0 != v32
& v0 != v16 ),
inference(fof_simplification,[status(thm)],[distinct]) ).
cnf(c_0_26,negated_conjecture,
( ~ in_lopen(X1,v0,v32)
| ~ in_lopen(X3,v0,v400)
| ~ in_lopen(X2,v0,v600)
| in_lopen(X1,v0,v16) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ less(X2,X1)
| in_lopen(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
less(v0,v400),
inference(split_conjunct,[status(thm)],[ord_v0_v400]) ).
cnf(c_0_29,plain,
leq(v16,v600),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
fof(c_0_30,plain,
! [X21,X22] :
( X21 = X22
| ~ leq(X22,X21)
| ~ leq(X21,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])]) ).
cnf(c_0_31,plain,
( ~ leq(X1,v16)
| leq(X1,v32) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
fof(c_0_32,plain,
( v800 != v1200
& v600 != v1200
& v600 != v800
& v400 != v1200
& v400 != v800
& v400 != v600
& v32 != v1200
& v32 != v800
& v32 != v600
& v32 != v400
& v16 != v1200
& v16 != v800
& v16 != v600
& v16 != v400
& v16 != v32
& v0 != v1200
& v0 != v800
& v0 != v600
& v0 != v400
& v0 != v32
& v0 != v16 ),
inference(fof_nnf,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( ~ in_lopen(X1,v0,v32)
| ~ in_lopen(X2,v0,v600)
| in_lopen(X1,v0,v16) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_34,plain,
( ~ less(X1,v16)
| in_lopen(v16,X1,v600) ),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_35,plain,
less(v0,v16),
inference(split_conjunct,[status(thm)],[ord_v0_v16]) ).
cnf(c_0_36,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
leq(v16,v32),
inference(spm,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_38,plain,
v16 != v32,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( ~ in_lopen(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_40,negated_conjecture,
( ~ in_lopen(X1,v0,v32)
| in_lopen(X1,v0,v16) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_41,plain,
~ leq(v32,v16),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( ~ in_lopen(X1,v0,v32)
| leq(X1,v16) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
~ in_lopen(v32,v0,v32),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
less(v0,v32),
inference(split_conjunct,[status(thm)],[ord_v0_v32]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_27]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT079+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.12/0.37 % Computer : n004.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 01:24:35 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.46 Running first-order theorem proving
% 0.15/0.46 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.20/0.56 % Version: 3.5.1
% 0.20/0.56 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.56 % Starting sh5l with 300s (1) cores
% 0.20/0.56 % new_bool_3 with pid 1961488 completed with status 0
% 0.20/0.56 % Result found by new_bool_3
% 0.20/0.56 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.56 % Search class: FGUSF-FFMM00-SFFFFFNN
% 0.20/0.56 % partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.20/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.56 % SubtermCWHack with pid 1961491 completed with status 0
% 0.20/0.56 % Result found by SubtermCWHack
% 0.20/0.56 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.56 % Search class: FGUSF-FFMM00-SFFFFFNN
% 0.20/0.56 % partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.20/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.56 % Preprocessing time : 0.002 s
% 0.20/0.56
% 0.20/0.56 % Proof found!
% 0.20/0.56 % SZS status Theorem
% 0.20/0.56 % SZS output start CNFRefutation
% See solution above
% 0.20/0.56 % Parsed axioms : 57
% 0.20/0.56 % Removed by relevancy pruning/SinE : 17
% 0.20/0.56 % Initial clauses : 66
% 0.20/0.56 % Removed in clause preprocessing : 0
% 0.20/0.56 % Initial clauses in saturation : 66
% 0.20/0.56 % Processed clauses : 321
% 0.20/0.56 % ...of these trivial : 0
% 0.20/0.56 % ...subsumed : 139
% 0.20/0.56 % ...remaining for further processing : 182
% 0.20/0.56 % Other redundant clauses eliminated : 1
% 0.20/0.56 % Clauses deleted for lack of memory : 0
% 0.20/0.56 % Backward-subsumed : 4
% 0.20/0.56 % Backward-rewritten : 0
% 0.20/0.56 % Generated clauses : 762
% 0.20/0.56 % ...of the previous two non-redundant : 652
% 0.20/0.56 % ...aggressively subsumed : 0
% 0.20/0.56 % Contextual simplify-reflections : 0
% 0.20/0.56 % Paramodulations : 759
% 0.20/0.56 % Factorizations : 2
% 0.20/0.56 % NegExts : 0
% 0.20/0.56 % Equation resolutions : 1
% 0.20/0.56 % Disequality decompositions : 0
% 0.20/0.56 % Total rewrite steps : 119
% 0.20/0.56 % ...of those cached : 94
% 0.20/0.56 % Propositional unsat checks : 0
% 0.20/0.56 % Propositional check models : 0
% 0.20/0.56 % Propositional check unsatisfiable : 0
% 0.20/0.56 % Propositional clauses : 0
% 0.20/0.56 % Propositional clauses after purity: 0
% 0.20/0.56 % Propositional unsat core size : 0
% 0.20/0.56 % Propositional preprocessing time : 0.000
% 0.20/0.56 % Propositional encoding time : 0.000
% 0.20/0.56 % Propositional solver time : 0.000
% 0.20/0.56 % Success case prop preproc time : 0.000
% 0.20/0.56 % Success case prop encoding time : 0.000
% 0.20/0.56 % Success case prop solver time : 0.000
% 0.20/0.56 % Current number of processed clauses : 177
% 0.20/0.56 % Positive orientable unit clauses : 32
% 0.20/0.56 % Positive unorientable unit clauses: 0
% 0.20/0.56 % Negative unit clauses : 52
% 0.20/0.56 % Non-unit-clauses : 93
% 0.20/0.56 % Current number of unprocessed clauses: 396
% 0.20/0.56 % ...number of literals in the above : 1288
% 0.20/0.56 % Current number of archived formulas : 0
% 0.20/0.56 % Current number of archived clauses : 4
% 0.20/0.56 % Clause-clause subsumption calls (NU) : 511
% 0.20/0.56 % Rec. Clause-clause subsumption calls : 500
% 0.20/0.56 % Non-unit clause-clause subsumptions : 82
% 0.20/0.56 % Unit Clause-clause subsumption calls : 198
% 0.20/0.56 % Rewrite failures with RHS unbound : 0
% 0.20/0.56 % BW rewrite match attempts : 0
% 0.20/0.56 % BW rewrite match successes : 0
% 0.20/0.56 % Condensation attempts : 0
% 0.20/0.56 % Condensation successes : 0
% 0.20/0.56 % Termbank termtop insertions : 8909
% 0.20/0.56 % Search garbage collected termcells : 457
% 0.20/0.56
% 0.20/0.56 % -------------------------------------------------
% 0.20/0.56 % User time : 0.030 s
% 0.20/0.56 % System time : 0.003 s
% 0.20/0.56 % Total time : 0.033 s
% 0.20/0.56 % Maximum resident set size: 3888 pages
% 0.20/0.56
% 0.20/0.56 % -------------------------------------------------
% 0.20/0.56 % User time : 0.033 s
% 0.20/0.56 % System time : 0.010 s
% 0.20/0.56 % Total time : 0.043 s
% 0.20/0.56 % Maximum resident set size: 4864 pages
% 0.20/0.56 % E exiting
%------------------------------------------------------------------------------