%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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.03s 0.44s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 72 ( 25 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 71 ( 30 ~; 25 |; 11 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 30 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl311,conjecture,
! [X1] :
( leq(v800,X1)
=> leq(v400,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl311) ).
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(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(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(ord_v400_v800,axiom,
less(v400,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(trichotomy,axiom,
! [X1,X2] :
( less(X2,X1)
| X1 = X2
| less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',trichotomy) ).
fof(distinct,axiom,
( v400 != v800
& v0 != v800
& v0 != v400 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( leq(v800,X1)
=> leq(v400,X1) ),
inference(assume_negation,[status(cth)],[odrl311]) ).
fof(c_0_8,plain,
! [X16,X17] :
( X16 = X17
| ~ leq(X17,X16)
| ~ leq(X16,X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])]) ).
fof(c_0_9,negated_conjecture,
( ~ leq(v400,esk1_0)
& leq(v800,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_10,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
leq(v800,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X14,X15] :
( ( leq(X14,X15)
| X14 != X15 )
& ( leq(X14,X15)
| ~ less(X14,X15) )
& ( X14 = X15
| less(X14,X15)
| ~ leq(X14,X15) ) ),
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,plain,
! [X30,X31,X32] :
( less(X30,X32)
| ~ less(X31,X32)
| ~ less(X30,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ leq(esk1_0,v800)
| esk1_0 = v800 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ less(X2,X3)
| ~ less(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
less(v400,v800),
inference(split_conjunct,[status(thm)],[ord_v400_v800]) ).
cnf(c_0_18,negated_conjecture,
( ~ less(esk1_0,v800)
| esk1_0 = v800 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ less(X1,v400)
| less(X1,v800) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X33,X34] :
( less(X34,X33)
| X33 = X34
| less(X33,X34) ),
inference(variable_rename,[status(thm)],[trichotomy]) ).
cnf(c_0_21,negated_conjecture,
~ leq(v400,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( ~ less(esk1_0,v400)
| esk1_0 = v800 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( less(X2,X1)
| X1 = X2
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ less(v400,esk1_0),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
fof(c_0_25,plain,
( v400 != v800
& v0 != v800
& v0 != v400 ),
inference(fof_simplification,[status(thm)],[distinct]) ).
cnf(c_0_26,negated_conjecture,
( esk1_0 = v800
| esk1_0 = v400 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
fof(c_0_27,plain,
( v400 != v800
& v0 != v800
& v0 != v400 ),
inference(fof_nnf,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 = v400,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_26]),c_0_17])]) ).
cnf(c_0_29,plain,
v400 != v800,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_28]),c_0_28]),c_0_17])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n014.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 01:24:50 UTC 2026
% 0.03/0.38 % CPUTime :
% 0.03/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.42 Running first-order theorem proving
% 0.03/0.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
% 0.03/0.44 % Version: 3.5.1
% 0.03/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.44 % Starting sh5l with 300s (1) cores
% 0.03/0.44 % new_bool_1 with pid 2860320 completed with status 0
% 0.03/0.44 % Result found by new_bool_1
% 0.03/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.44 % Search class: FGUSF-FFSM00-SFFFFFNN
% 0.03/0.44 % partial match(1): FGUNF-FFSM00-SFFFFFNN
% 0.03/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.03/0.44 % SubtermCWHack with pid 2860323 completed with status 0
% 0.03/0.44 % Result found by SubtermCWHack
% 0.03/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.44 % Search class: FGUSF-FFSM00-SFFFFFNN
% 0.03/0.44 % partial match(1): FGUNF-FFSM00-SFFFFFNN
% 0.03/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.03/0.44 % Preprocessing time : 0.001 s
% 0.03/0.44
% 0.03/0.44 % Proof found!
% 0.03/0.44 % SZS status Theorem
% 0.03/0.44 % SZS output start CNFRefutation
% See solution above
% 0.03/0.44 % Parsed axioms : 35
% 0.03/0.44 % Removed by relevancy pruning/SinE : 18
% 0.03/0.44 % Initial clauses : 22
% 0.03/0.44 % Removed in clause preprocessing : 0
% 0.03/0.44 % Initial clauses in saturation : 22
% 0.03/0.44 % Processed clauses : 34
% 0.03/0.44 % ...of these trivial : 0
% 0.03/0.44 % ...subsumed : 3
% 0.03/0.44 % ...remaining for further processing : 31
% 0.03/0.44 % Other redundant clauses eliminated : 1
% 0.03/0.44 % Clauses deleted for lack of memory : 0
% 0.03/0.44 % Backward-subsumed : 0
% 0.03/0.44 % Backward-rewritten : 8
% 0.03/0.44 % Generated clauses : 35
% 0.03/0.44 % ...of the previous two non-redundant : 29
% 0.03/0.44 % ...aggressively subsumed : 0
% 0.03/0.44 % Contextual simplify-reflections : 0
% 0.03/0.44 % Paramodulations : 31
% 0.03/0.44 % Factorizations : 3
% 0.03/0.44 % NegExts : 0
% 0.03/0.44 % Equation resolutions : 1
% 0.03/0.44 % Disequality decompositions : 0
% 0.03/0.44 % Total rewrite steps : 10
% 0.03/0.44 % ...of those cached : 7
% 0.03/0.44 % Propositional unsat checks : 0
% 0.03/0.44 % Propositional check models : 0
% 0.03/0.44 % Propositional check unsatisfiable : 0
% 0.03/0.44 % Propositional clauses : 0
% 0.03/0.44 % Propositional clauses after purity: 0
% 0.03/0.44 % Propositional unsat core size : 0
% 0.03/0.44 % Propositional preprocessing time : 0.000
% 0.03/0.44 % Propositional encoding time : 0.000
% 0.03/0.44 % Propositional solver time : 0.000
% 0.03/0.44 % Success case prop preproc time : 0.000
% 0.03/0.44 % Success case prop encoding time : 0.000
% 0.03/0.44 % Success case prop solver time : 0.000
% 0.03/0.44 % Current number of processed clauses : 22
% 0.03/0.44 % Positive orientable unit clauses : 8
% 0.03/0.44 % Positive unorientable unit clauses: 0
% 0.03/0.44 % Negative unit clauses : 5
% 0.03/0.44 % Non-unit-clauses : 9
% 0.03/0.44 % Current number of unprocessed clauses: 16
% 0.03/0.44 % ...number of literals in the above : 46
% 0.03/0.44 % Current number of archived formulas : 0
% 0.03/0.44 % Current number of archived clauses : 8
% 0.03/0.44 % Clause-clause subsumption calls (NU) : 6
% 0.03/0.44 % Rec. Clause-clause subsumption calls : 6
% 0.03/0.44 % Non-unit clause-clause subsumptions : 3
% 0.03/0.44 % Unit Clause-clause subsumption calls : 0
% 0.03/0.44 % Rewrite failures with RHS unbound : 0
% 0.03/0.44 % BW rewrite match attempts : 3
% 0.03/0.44 % BW rewrite match successes : 1
% 0.03/0.44 % Condensation attempts : 0
% 0.03/0.44 % Condensation successes : 0
% 0.03/0.44 % Termbank termtop insertions : 1431
% 0.03/0.44 % Search garbage collected termcells : 298
% 0.03/0.44
% 0.03/0.44 % -------------------------------------------------
% 0.03/0.44 % User time : 0.004 s
% 0.03/0.44 % System time : 0.002 s
% 0.03/0.44 % Total time : 0.006 s
% 0.03/0.44 % Maximum resident set size: 3616 pages
% 0.03/0.44
% 0.03/0.44 % -------------------------------------------------
% 0.03/0.44 % User time : 0.008 s
% 0.03/0.44 % System time : 0.005 s
% 0.03/0.44 % Total time : 0.013 s
% 0.03/0.44 % Maximum resident set size: 4864 pages
% 0.03/0.44 % E exiting
%------------------------------------------------------------------------------