%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT092+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 : n009.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.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 23 unt; 0 def)
% Number of atoms : 108 ( 26 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 119 ( 58 ~; 35 |; 22 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 55 ( 0 sgn 31 !; 0 ?)
% 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(odrl633,conjecture,
completion_conflict(v400,v800,v0,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl633) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(transitive,axiom,
! [X1,X2,X3] :
( ( less(X2,X3)
& less(X1,X2) )
=> less(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(ord_v0_v400,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(ord_v800_v1200,axiom,
less(v800,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v800_v1200) ).
fof(sharpness_conflict,axiom,
! [X7,X4,X5,X6] :
( ( leq(X4,X6)
& less(X7,X4)
& leq(X7,X6)
& leq(X5,X7) )
=> completion_conflict(X7,X4,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+4.ax',sharpness_conflict) ).
fof(ord_v400_v800,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(distinct,axiom,
( v800 != v1200
& v400 != v1200
& v400 != v800
& v0 != v1200
& v0 != v800
& v0 != v400 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
fof(trichotomy,axiom,
! [X1,X2] :
( less(X2,X1)
| X1 = X2
| less(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',trichotomy) ).
fof(c_0_11,plain,
! [X48,X49,X50] :
( leq(X48,X50)
| ~ leq(X49,X50)
| ~ leq(X48,X49) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_trans])])]) ).
fof(c_0_12,plain,
! [X36,X37] :
( ( leq(X36,X37)
| X36 != X37 )
& ( leq(X36,X37)
| ~ less(X36,X37) )
& ( X36 = X37
| less(X36,X37)
| ~ leq(X36,X37) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])]) ).
fof(c_0_13,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(assume_negation,[status(cth)],[odrl633]) ).
cnf(c_0_14,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
fof(c_0_17,plain,
! [X31,X32,X33] :
( less(X31,X33)
| ~ less(X32,X33)
| ~ less(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])])]) ).
fof(c_0_18,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ less(X3,X2)
| ~ leq(X1,X3)
| leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
less(v0,v400),
inference(split_conjunct,[status(thm)],[ord_v0_v400]) ).
cnf(c_0_21,plain,
( X1 != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X30] : ~ less(X30,X30),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
cnf(c_0_23,plain,
( ~ less(X2,X3)
| ~ less(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
less(v800,v1200),
inference(split_conjunct,[status(thm)],[ord_v800_v1200]) ).
fof(c_0_25,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X26,X27,X28,X29] :
( completion_conflict(X26,X27,X28,X29)
| ~ leq(X27,X29)
| ~ less(X26,X27)
| ~ leq(X26,X29)
| ~ leq(X28,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sharpness_conflict])])]) ).
cnf(c_0_27,plain,
( ~ leq(X1,v0)
| leq(X1,v400) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( ~ less(X1,v800)
| less(X1,v1200) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
less(v400,v800),
inference(split_conjunct,[status(thm)],[ord_v400_v800]) ).
fof(c_0_32,plain,
( v800 != v1200
& v400 != v1200
& v400 != v800
& v0 != v1200
& v0 != v800
& v0 != v400 ),
inference(fof_simplification,[status(thm)],[distinct]) ).
cnf(c_0_33,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,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_26]) ).
cnf(c_0_35,plain,
leq(v0,v400),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
~ less(v1200,v800),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( ~ less(X1,v400)
| less(X1,v800) ),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
fof(c_0_38,plain,
! [X34,X35] :
( less(X35,X34)
| X34 = X35
| less(X34,X35) ),
inference(variable_rename,[status(thm)],[trichotomy]) ).
fof(c_0_39,plain,
( v800 != v1200
& v400 != v1200
& v400 != v800
& v0 != v1200
& v0 != v800
& v0 != v400 ),
inference(fof_nnf,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
( ~ leq(v400,v1200)
| ~ leq(v800,v1200) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]),c_0_35])]) ).
cnf(c_0_41,plain,
~ less(v1200,v400),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( less(X2,X1)
| X1 = X2
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
v400 != v1200,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ leq(v400,v1200),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_15]),c_0_24])]) ).
cnf(c_0_45,plain,
less(v400,v1200),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_15]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 01:26:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_3 with pid 555430 completed with status 0
% 0.10/0.44 % Result found by new_bool_3
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGUSF-FFSM00-SFFFFFNN
% 0.10/0.44 % partial match(1): FGUNF-FFSM00-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 555436 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGUSF-FFSM00-SFFFFFNN
% 0.10/0.44 % partial match(1): FGUNF-FFSM00-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 42
% 0.10/0.44 % Removed by relevancy pruning/SinE : 22
% 0.10/0.44 % Initial clauses : 27
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 27
% 0.10/0.44 % Processed clauses : 84
% 0.10/0.44 % ...of these trivial : 1
% 0.10/0.44 % ...subsumed : 26
% 0.10/0.44 % ...remaining for further processing : 57
% 0.10/0.44 % Other redundant clauses eliminated : 1
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 1
% 0.10/0.44 % Backward-rewritten : 0
% 0.10/0.44 % Generated clauses : 161
% 0.10/0.44 % ...of the previous two non-redundant : 139
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 158
% 0.10/0.44 % Factorizations : 2
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 1
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 18
% 0.10/0.44 % ...of those cached : 12
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 55
% 0.10/0.44 % Positive orientable unit clauses : 10
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 14
% 0.10/0.44 % Non-unit-clauses : 31
% 0.10/0.44 % Current number of unprocessed clauses: 82
% 0.10/0.44 % ...number of literals in the above : 289
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 1
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 101
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 89
% 0.10/0.44 % Non-unit clause-clause subsumptions : 17
% 0.10/0.44 % Unit Clause-clause subsumption calls : 1
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 0
% 0.10/0.44 % BW rewrite match successes : 0
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 3071
% 0.10/0.44 % Search garbage collected termcells : 414
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.007 s
% 0.10/0.44 % System time : 0.001 s
% 0.10/0.44 % Total time : 0.008 s
% 0.10/0.44 % Maximum resident set size: 3684 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.010 s
% 0.10/0.44 % System time : 0.005 s
% 0.10/0.44 % Total time : 0.015 s
% 0.10/0.44 % Maximum resident set size: 4864 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------