%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT077+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 : 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:00 PM UTC 2026
% Result : Theorem 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 62 ( 29 ~; 23 |; 9 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl327,conjecture,
? [X1,X2] :
( in_open(X2,v0,v500)
& less(v100,X2)
& in_open(X1,v0,v800)
& less(v200,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl327) ).
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(ord_v100_v200,axiom,
less(v100,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v100_v200) ).
fof(ord_v200_v500,axiom,
less(v200,v500),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v500) ).
fof(ord_v0_v200,axiom,
less(v0,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v200) ).
fof(ord_v500_v800,axiom,
less(v500,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v500_v800) ).
fof(ord_v0_v500,axiom,
less(v0,v500),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v500) ).
fof(c_0_7,negated_conjecture,
~ ? [X1,X2] :
( in_open(X2,v0,v500)
& less(v100,X2)
& in_open(X1,v0,v800)
& less(v200,X1) ),
inference(assume_negation,[status(cth)],[odrl327]) ).
fof(c_0_8,negated_conjecture,
! [X88,X89] :
( ~ in_open(X89,v0,v500)
| ~ less(v100,X89)
| ~ in_open(X88,v0,v800)
| ~ less(v200,X88) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X46,X47,X48] :
( ( in_open(X46,X47,X48)
| ~ less(X46,X48)
| ~ less(X47,X46) )
& ( ~ in_open(X46,X47,X48)
| less(X46,X48) )
& ( ~ in_open(X46,X47,X48)
| less(X47,X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_open])])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ in_open(X2,v0,v500)
| ~ less(v100,X2)
| ~ in_open(X1,v0,v800)
| ~ less(v200,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ less(X2,X3)
| ~ less(X1,X2)
| in_open(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ less(v0,X2)
| ~ less(X2,v500)
| ~ less(v200,X1)
| ~ less(v100,X2)
| ~ in_open(X1,v0,v800) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( ~ less(v0,X2)
| ~ less(X2,v800)
| ~ less(v0,X1)
| ~ less(X1,v500)
| ~ less(v200,X2)
| ~ less(v100,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_14,plain,
less(v100,v200),
inference(split_conjunct,[status(thm)],[ord_v100_v200]) ).
cnf(c_0_15,plain,
less(v200,v500),
inference(split_conjunct,[status(thm)],[ord_v200_v500]) ).
cnf(c_0_16,plain,
less(v0,v200),
inference(split_conjunct,[status(thm)],[ord_v0_v200]) ).
cnf(c_0_17,negated_conjecture,
( ~ less(v0,X1)
| ~ less(X1,v800)
| ~ less(v200,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_18,plain,
less(v500,v800),
inference(split_conjunct,[status(thm)],[ord_v500_v800]) ).
cnf(c_0_19,plain,
less(v0,v500),
inference(split_conjunct,[status(thm)],[ord_v0_v500]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT077+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.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:24:43 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 551151 completed with status 0
% 0.14/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.46 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.46 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.46 % U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 551160 completed with status 0
% 0.14/0.46 % Result found by U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.46 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.46 % Preprocessing time : 0.002 s
% 0.14/0.46 % Presaturation interreduction done
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Theorem
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 45
% 0.14/0.46 % Removed by relevancy pruning/SinE : 0
% 0.14/0.46 % Initial clauses : 73
% 0.14/0.46 % Removed in clause preprocessing : 0
% 0.14/0.46 % Initial clauses in saturation : 73
% 0.14/0.46 % Processed clauses : 157
% 0.14/0.46 % ...of these trivial : 0
% 0.14/0.46 % ...subsumed : 1
% 0.14/0.46 % ...remaining for further processing : 156
% 0.14/0.46 % Other redundant clauses eliminated : 7
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 1
% 0.14/0.46 % Backward-rewritten : 0
% 0.14/0.46 % Generated clauses : 76
% 0.14/0.46 % ...of the previous two non-redundant : 61
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 0
% 0.14/0.46 % Paramodulations : 68
% 0.14/0.46 % Factorizations : 2
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 7
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 12
% 0.14/0.46 % ...of those cached : 4
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 77
% 0.14/0.46 % Positive orientable unit clauses : 23
% 0.14/0.46 % Positive unorientable unit clauses: 0
% 0.14/0.46 % Negative unit clauses : 14
% 0.14/0.46 % Non-unit-clauses : 40
% 0.14/0.46 % Current number of unprocessed clauses: 45
% 0.14/0.46 % ...number of literals in the above : 130
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 73
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 441
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 295
% 0.14/0.46 % Non-unit clause-clause subsumptions : 2
% 0.14/0.46 % Unit Clause-clause subsumption calls : 25
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 5
% 0.14/0.46 % BW rewrite match successes : 0
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 4901
% 0.14/0.46 % Search garbage collected termcells : 833
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.009 s
% 0.14/0.46 % System time : 0.006 s
% 0.14/0.46 % Total time : 0.015 s
% 0.14/0.46 % Maximum resident set size: 3676 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.032 s
% 0.14/0.46 % System time : 0.019 s
% 0.14/0.46 % Total time : 0.050 s
% 0.14/0.46 % Maximum resident set size: 4608 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------