%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT075+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 : n018.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.14s 0.62s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 50 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 49 ( 21 ~; 16 |; 9 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 27 ( 1 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl302,conjecture,
~ ? [X1] :
( leq(v600,X1)
& in_open(X1,v0,v600) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl302) ).
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(in_open,axiom,
! [X1,X4,X5] :
( in_open(X1,X4,X5)
<=> ( less(X1,X5)
& less(X4,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_open) ).
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(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(c_0_5,negated_conjecture,
~ ~ ? [X1] :
( leq(v600,X1)
& in_open(X1,v0,v600) ),
inference(assume_negation,[status(cth)],[odrl302]) ).
fof(c_0_6,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_7,negated_conjecture,
( leq(v600,esk1_0)
& in_open(esk1_0,v0,v600) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X29,X30,X31] :
( ( in_open(X29,X30,X31)
| ~ less(X29,X31)
| ~ less(X30,X29) )
& ( ~ in_open(X29,X30,X31)
| less(X29,X31) )
& ( ~ in_open(X29,X30,X31)
| less(X30,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_open])])])]) ).
cnf(c_0_9,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
leq(v600,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,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])])])]) ).
cnf(c_0_12,plain,
( ~ in_open(X1,X3,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
in_open(esk1_0,v0,v600),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
cnf(c_0_15,negated_conjecture,
( ~ leq(esk1_0,v600)
| esk1_0 = v600 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
less(esk1_0,v600),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X32] : ~ less(X32,X32),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 = v600,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.56 % Computer : n018.cluster.edu
% 0.11/0.56 % Model : x86_64 x86_64
% 0.11/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.56 % Memory : 8046.5625MB
% 0.11/0.56 % OS : Linux 6.8.0-71-generic
% 0.11/0.56 % CPULimit : 300
% 0.11/0.56 % WCLimit : 300
% 0.11/0.56 % DateTime : Mon Sep 21 01:26:59 UTC 2026
% 0.11/0.56 % CPUTime :
% 0.11/0.56 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.61 Running first-order theorem proving
% 0.14/0.61 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.14/0.62 % Version: 3.5.1
% 0.14/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.62 % Starting sh5l with 300s (1) cores
% 0.14/0.62 % new_bool_3 with pid 675064 completed with status 0
% 0.14/0.62 % Result found by new_bool_3
% 0.14/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.62 % Search class: FGUSF-FFSS00-SFFFFFNN
% 0.14/0.62 % partial match(1): FGUNF-FFSS00-SFFFFFNN
% 0.14/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.62 % SubtermCWHack with pid 675067 completed with status 0
% 0.14/0.62 % Result found by SubtermCWHack
% 0.14/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.62 % Search class: FGUSF-FFSS00-SFFFFFNN
% 0.14/0.62 % partial match(1): FGUNF-FFSS00-SFFFFFNN
% 0.14/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.62 % Preprocessing time : 0.001 s
% 0.14/0.62
% 0.14/0.62 % Proof found!
% 0.14/0.62 % SZS status Theorem
% 0.14/0.62 % SZS output start CNFRefutation
% See solution above
% 0.14/0.62 % Parsed axioms : 32
% 0.14/0.62 % Removed by relevancy pruning/SinE : 19
% 0.14/0.63 % Initial clauses : 18
% 0.14/0.63 % Removed in clause preprocessing : 0
% 0.14/0.63 % Initial clauses in saturation : 18
% 0.14/0.63 % Processed clauses : 19
% 0.14/0.63 % ...of these trivial : 0
% 0.14/0.63 % ...subsumed : 1
% 0.14/0.63 % ...remaining for further processing : 18
% 0.14/0.63 % Other redundant clauses eliminated : 1
% 0.14/0.63 % Clauses deleted for lack of memory : 0
% 0.14/0.63 % Backward-subsumed : 0
% 0.14/0.63 % Backward-rewritten : 6
% 0.14/0.63 % Generated clauses : 10
% 0.14/0.63 % ...of the previous two non-redundant : 7
% 0.14/0.63 % ...aggressively subsumed : 0
% 0.14/0.63 % Contextual simplify-reflections : 0
% 0.14/0.63 % Paramodulations : 7
% 0.14/0.63 % Factorizations : 2
% 0.14/0.63 % NegExts : 0
% 0.14/0.63 % Equation resolutions : 1
% 0.14/0.63 % Disequality decompositions : 0
% 0.14/0.63 % Total rewrite steps : 5
% 0.14/0.63 % ...of those cached : 2
% 0.14/0.63 % Propositional unsat checks : 0
% 0.14/0.63 % Propositional check models : 0
% 0.14/0.63 % Propositional check unsatisfiable : 0
% 0.14/0.63 % Propositional clauses : 0
% 0.14/0.63 % Propositional clauses after purity: 0
% 0.14/0.63 % Propositional unsat core size : 0
% 0.14/0.63 % Propositional preprocessing time : 0.000
% 0.14/0.63 % Propositional encoding time : 0.000
% 0.14/0.63 % Propositional solver time : 0.000
% 0.14/0.63 % Success case prop preproc time : 0.000
% 0.14/0.63 % Success case prop encoding time : 0.000
% 0.14/0.63 % Success case prop solver time : 0.000
% 0.14/0.63 % Current number of processed clauses : 11
% 0.14/0.63 % Positive orientable unit clauses : 3
% 0.14/0.63 % Positive unorientable unit clauses: 0
% 0.14/0.63 % Negative unit clauses : 2
% 0.14/0.63 % Non-unit-clauses : 6
% 0.14/0.63 % Current number of unprocessed clauses: 6
% 0.14/0.63 % ...number of literals in the above : 18
% 0.14/0.63 % Current number of archived formulas : 0
% 0.14/0.63 % Current number of archived clauses : 6
% 0.14/0.63 % Clause-clause subsumption calls (NU) : 3
% 0.14/0.63 % Rec. Clause-clause subsumption calls : 3
% 0.14/0.63 % Non-unit clause-clause subsumptions : 1
% 0.14/0.63 % Unit Clause-clause subsumption calls : 0
% 0.14/0.63 % Rewrite failures with RHS unbound : 0
% 0.14/0.63 % BW rewrite match attempts : 2
% 0.14/0.63 % BW rewrite match successes : 1
% 0.14/0.63 % Condensation attempts : 0
% 0.14/0.63 % Condensation successes : 0
% 0.14/0.63 % Termbank termtop insertions : 1248
% 0.14/0.63 % Search garbage collected termcells : 303
% 0.14/0.63
% 0.14/0.63 % -------------------------------------------------
% 0.14/0.63 % User time : 0.003 s
% 0.14/0.63 % System time : 0.002 s
% 0.14/0.63 % Total time : 0.005 s
% 0.14/0.63 % Maximum resident set size: 3664 pages
% 0.14/0.63
% 0.14/0.63 % -------------------------------------------------
% 0.14/0.63 % User time : 0.007 s
% 0.14/0.63 % System time : 0.004 s
% 0.14/0.63 % Total time : 0.011 s
% 0.14/0.63 % Maximum resident set size: 4608 pages
% 0.14/0.63 % E exiting
%------------------------------------------------------------------------------