%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT090+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 : n017.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.08s 0.46s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 13 unt; 0 def)
% Number of atoms : 56 ( 18 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 61 ( 28 ~; 15 |; 15 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 18 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl613,conjecture,
wf(lt,v600,v0,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl613) ).
fof(wf_lt,axiom,
! [X10,X13,X14] :
( wf(lt,X10,X13,X14)
<=> ( X10 != X13
& leq(X10,X14)
& leq(X13,X10) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+8.ax',wf_lt) ).
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(distinct,axiom,
( v600 != v1200
& v0 != v1200
& v0 != v600 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(ord_v600_v1200,axiom,
less(v600,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v1200) ).
fof(ord_v0_v600,axiom,
less(v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v600) ).
fof(c_0_6,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(assume_negation,[status(cth)],[odrl613]) ).
fof(c_0_7,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X10,X13,X14] :
( wf(lt,X10,X13,X14)
<=> ( X10 != X13
& leq(X10,X14)
& leq(X13,X10) ) ),
inference(fof_simplification,[status(thm)],[wf_lt]) ).
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,
( v600 != v1200
& v0 != v1200
& v0 != v600 ),
inference(fof_simplification,[status(thm)],[distinct]) ).
fof(c_0_11,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X25,X26,X27] :
( ( wf(lt,X25,X26,X27)
| X25 = X26
| ~ leq(X25,X27)
| ~ leq(X26,X25) )
& ( ~ wf(lt,X25,X26,X27)
| X25 != X26 )
& ( ~ wf(lt,X25,X26,X27)
| leq(X25,X27) )
& ( ~ wf(lt,X25,X26,X27)
| leq(X26,X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_13,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
less(v600,v1200),
inference(split_conjunct,[status(thm)],[ord_v600_v1200]) ).
cnf(c_0_15,plain,
less(v0,v600),
inference(split_conjunct,[status(thm)],[ord_v0_v600]) ).
fof(c_0_16,plain,
( v600 != v1200
& v0 != v1200
& v0 != v600 ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| wf(lt,X2,X1,X3)
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
leq(v600,v1200),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
leq(v0,v600),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_21,plain,
v0 != v600,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT090+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.08/0.37 % Computer : n017.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 21 01:21:56 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/0.41 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.08/0.46 % Version: 3.5.1
% 0.08/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.08/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.08/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.46 % Starting sh5l with 300s (1) cores
% 0.08/0.46 % new_bool_3 with pid 1124651 completed with status 0
% 0.08/0.46 % Result found by new_bool_3
% 0.08/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.08/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.08/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.46 % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.08/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.46 % SubtermCWHack with pid 1124654 completed with status 0
% 0.08/0.46 % Result found by SubtermCWHack
% 0.08/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.08/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.08/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.46 % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.08/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.46 % Preprocessing time : 0.003 s
% 0.08/0.46
% 0.08/0.46 % Proof found!
% 0.08/0.46 % SZS status Theorem
% 0.08/0.46 % SZS output start CNFRefutation
% See solution above
% 0.08/0.46 % Parsed axioms : 60
% 0.08/0.46 % Removed by relevancy pruning/SinE : 23
% 0.08/0.46 % Initial clauses : 53
% 0.08/0.46 % Removed in clause preprocessing : 0
% 0.08/0.46 % Initial clauses in saturation : 53
% 0.08/0.46 % Processed clauses : 132
% 0.08/0.46 % ...of these trivial : 2
% 0.08/0.46 % ...subsumed : 29
% 0.08/0.46 % ...remaining for further processing : 101
% 0.08/0.46 % Other redundant clauses eliminated : 3
% 0.08/0.46 % Clauses deleted for lack of memory : 0
% 0.08/0.46 % Backward-subsumed : 0
% 0.08/0.46 % Backward-rewritten : 0
% 0.08/0.46 % Generated clauses : 290
% 0.08/0.46 % ...of the previous two non-redundant : 187
% 0.08/0.46 % ...aggressively subsumed : 0
% 0.08/0.46 % Contextual simplify-reflections : 0
% 0.08/0.46 % Paramodulations : 285
% 0.08/0.46 % Factorizations : 2
% 0.08/0.46 % NegExts : 0
% 0.08/0.46 % Equation resolutions : 3
% 0.08/0.46 % Disequality decompositions : 0
% 0.08/0.46 % Total rewrite steps : 101
% 0.08/0.46 % ...of those cached : 94
% 0.08/0.46 % Propositional unsat checks : 0
% 0.08/0.46 % Propositional check models : 0
% 0.08/0.46 % Propositional check unsatisfiable : 0
% 0.08/0.46 % Propositional clauses : 0
% 0.08/0.46 % Propositional clauses after purity: 0
% 0.08/0.46 % Propositional unsat core size : 0
% 0.08/0.46 % Propositional preprocessing time : 0.000
% 0.08/0.46 % Propositional encoding time : 0.000
% 0.08/0.46 % Propositional solver time : 0.000
% 0.08/0.46 % Success case prop preproc time : 0.000
% 0.08/0.46 % Success case prop encoding time : 0.000
% 0.08/0.46 % Success case prop solver time : 0.000
% 0.08/0.46 % Current number of processed clauses : 98
% 0.08/0.46 % Positive orientable unit clauses : 15
% 0.08/0.46 % Positive unorientable unit clauses: 0
% 0.08/0.46 % Negative unit clauses : 23
% 0.08/0.46 % Non-unit-clauses : 60
% 0.08/0.46 % Current number of unprocessed clauses: 108
% 0.08/0.46 % ...number of literals in the above : 384
% 0.08/0.46 % Current number of archived formulas : 0
% 0.08/0.46 % Current number of archived clauses : 0
% 0.08/0.46 % Clause-clause subsumption calls (NU) : 598
% 0.08/0.46 % Rec. Clause-clause subsumption calls : 511
% 0.08/0.46 % Non-unit clause-clause subsumptions : 18
% 0.08/0.46 % Unit Clause-clause subsumption calls : 116
% 0.08/0.46 % Rewrite failures with RHS unbound : 0
% 0.08/0.46 % BW rewrite match attempts : 0
% 0.08/0.46 % BW rewrite match successes : 0
% 0.08/0.46 % Condensation attempts : 0
% 0.08/0.46 % Condensation successes : 0
% 0.08/0.46 % Termbank termtop insertions : 5298
% 0.08/0.46 % Search garbage collected termcells : 551
% 0.08/0.46
% 0.08/0.46 % -------------------------------------------------
% 0.08/0.46 % User time : 0.014 s
% 0.08/0.46 % System time : 0.006 s
% 0.08/0.46 % Total time : 0.020 s
% 0.08/0.46 % Maximum resident set size: 3688 pages
% 0.08/0.46
% 0.08/0.46 % -------------------------------------------------
% 0.08/0.46 % User time : 0.020 s
% 0.08/0.46 % System time : 0.011 s
% 0.08/0.46 % Total time : 0.031 s
% 0.08/0.46 % Maximum resident set size: 4864 pages
% 0.08/0.46 % E exiting
%------------------------------------------------------------------------------