%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT082+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:28:09 PM UTC 2026
% Result : Theorem 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 115 ( 68 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 168 ( 77 ~; 10 |; 79 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 24 ( 2 sgn 10 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl411,conjecture,
~ ? [X1,X2,X3] :
( in_lopen(X3,v0,v32)
& leq(v16,X3)
& in_open(X2,v0,v500)
& less(v300,X2)
& in_closed(X1,v601,v601)
& in_closed(X1,v600,v600) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl411) ).
fof(in_closed,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X1,X5)
& leq(X4,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_closed) ).
fof(leq_antisym,axiom,
! [X1,X2] :
( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(distinct,axiom,
( v600 != v601
& v500 != v601
& v500 != v600
& v300 != v601
& v300 != v600
& v300 != v500
& v32 != v601
& v32 != v600
& v32 != v500
& v32 != v300
& v16 != v601
& v16 != v600
& v16 != v500
& v16 != v300
& v16 != v32
& v0 != v601
& v0 != v600
& v0 != v500
& v0 != v300
& v0 != v32
& v0 != v16 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
fof(c_0_4,negated_conjecture,
~ ~ ? [X1,X2,X3] :
( in_lopen(X3,v0,v32)
& leq(v16,X3)
& in_open(X2,v0,v500)
& less(v300,X2)
& in_closed(X1,v601,v601)
& in_closed(X1,v600,v600) ),
inference(assume_negation,[status(cth)],[odrl411]) ).
fof(c_0_5,plain,
! [X43,X44,X45] :
( ( in_closed(X43,X44,X45)
| ~ leq(X43,X45)
| ~ leq(X44,X43) )
& ( ~ in_closed(X43,X44,X45)
| leq(X43,X45) )
& ( ~ in_closed(X43,X44,X45)
| leq(X44,X43) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_closed])])])]) ).
fof(c_0_6,negated_conjecture,
( in_lopen(esk3_0,v0,v32)
& leq(v16,esk3_0)
& in_open(esk2_0,v0,v500)
& less(v300,esk2_0)
& in_closed(esk1_0,v601,v601)
& in_closed(esk1_0,v600,v600) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X21,X22] :
( X21 = X22
| ~ leq(X22,X21)
| ~ leq(X21,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])]) ).
cnf(c_0_8,plain,
( ~ in_closed(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
in_closed(esk1_0,v601,v601),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ in_closed(X2,X1,X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
in_closed(esk1_0,v600,v600),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
leq(esk1_0,v601),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
leq(v601,esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
fof(c_0_15,plain,
( v600 != v601
& v500 != v601
& v500 != v600
& v300 != v601
& v300 != v600
& v300 != v500
& v32 != v601
& v32 != v600
& v32 != v500
& v32 != v300
& v16 != v601
& v16 != v600
& v16 != v500
& v16 != v300
& v16 != v32
& v0 != v601
& v0 != v600
& v0 != v500
& v0 != v300
& v0 != v32
& v0 != v16 ),
inference(fof_simplification,[status(thm)],[distinct]) ).
cnf(c_0_16,negated_conjecture,
leq(v600,esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 = v601,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
leq(esk1_0,v600),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
fof(c_0_19,plain,
( v600 != v601
& v500 != v601
& v500 != v600
& v300 != v601
& v300 != v600
& v300 != v500
& v32 != v601
& v32 != v600
& v32 != v500
& v32 != v300
& v16 != v601
& v16 != v600
& v16 != v500
& v16 != v300
& v16 != v32
& v0 != v601
& v0 != v600
& v0 != v500
& v0 != v300
& v0 != v32
& v0 != v16 ),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
leq(v600,v601),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
leq(v601,v600),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,plain,
v600 != v601,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_21])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n009.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 01:25:13 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % new_bool_3 with pid 552761 completed with status 0
% 0.13/0.45 % Result found by new_bool_3
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGUSF-FFMM00-SFFFFFNN
% 0.13/0.45 % partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 552764 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGUSF-FFMM00-SFFFFFNN
% 0.13/0.45 % partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % Preprocessing time : 0.002 s
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Theorem
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 57
% 0.13/0.45 % Removed by relevancy pruning/SinE : 15
% 0.13/0.45 % Initial clauses : 75
% 0.13/0.45 % Removed in clause preprocessing : 0
% 0.13/0.45 % Initial clauses in saturation : 75
% 0.13/0.45 % Processed clauses : 80
% 0.13/0.45 % ...of these trivial : 0
% 0.13/0.45 % ...subsumed : 1
% 0.13/0.45 % ...remaining for further processing : 79
% 0.13/0.45 % Other redundant clauses eliminated : 1
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 0
% 0.13/0.45 % Backward-rewritten : 6
% 0.13/0.45 % Generated clauses : 29
% 0.13/0.45 % ...of the previous two non-redundant : 28
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 0
% 0.13/0.45 % Paramodulations : 26
% 0.13/0.45 % Factorizations : 2
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 1
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 14
% 0.13/0.45 % ...of those cached : 6
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 72
% 0.13/0.45 % Positive orientable unit clauses : 40
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 22
% 0.13/0.45 % Non-unit-clauses : 10
% 0.13/0.45 % Current number of unprocessed clauses: 20
% 0.13/0.45 % ...number of literals in the above : 44
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 6
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 15
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 15
% 0.13/0.45 % Non-unit clause-clause subsumptions : 1
% 0.13/0.45 % Unit Clause-clause subsumption calls : 45
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 2
% 0.13/0.45 % BW rewrite match successes : 1
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 2782
% 0.13/0.45 % Search garbage collected termcells : 489
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.007 s
% 0.13/0.45 % System time : 0.001 s
% 0.13/0.45 % Total time : 0.008 s
% 0.13/0.45 % Maximum resident set size: 3632 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.009 s
% 0.13/0.45 % System time : 0.006 s
% 0.13/0.45 % Total time : 0.014 s
% 0.13/0.45 % Maximum resident set size: 4864 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------