%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT008+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:25:59 PM UTC 2026
% Result : Theorem 0.16s 5.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 164 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 211 ( 81 ~; 78 |; 47 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 56 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_FOL,conjecture,
! [X1,X4,X5,X12,X13,X6,X7,X10,X11] :
( ( greater(X7,X6)
& size(X4,X7,X11)
& size(X1,X6,X10)
& survival_chance(X4,X13,X11)
& survival_chance(X1,X12,X10)
& class(X4,X5,X11)
& class(X1,X5,X10)
& reorganization_free(X4,X11,X11)
& reorganization_free(X1,X10,X10)
& organization(X4,X11)
& organization(X1,X10) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL) ).
fof(a5_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( greater(X7,X6)
& inertia(X4,X9,X11)
& inertia(X1,X8,X10)
& size(X4,X7,X11)
& size(X1,X6,X10)
& class(X4,X5,X11)
& class(X1,X5,X10)
& organization(X4,X11)
& organization(X1,X10) )
=> greater(X9,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).
fof(t1_FOL,hypothesis,
! [X1,X4,X10,X11,X8,X9,X12,X13] :
( ( greater(X9,X8)
& survival_chance(X4,X13,X11)
& survival_chance(X1,X12,X10)
& inertia(X4,X9,X11)
& inertia(X1,X8,X10)
& reorganization_free(X4,X11,X11)
& reorganization_free(X1,X10,X10)
& organization(X4,X11)
& organization(X1,X10) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X4,X5,X12,X13,X6,X7,X10,X11] :
( ( greater(X7,X6)
& size(X4,X7,X11)
& size(X1,X6,X10)
& survival_chance(X4,X13,X11)
& survival_chance(X1,X12,X10)
& class(X4,X5,X11)
& class(X1,X5,X10)
& reorganization_free(X4,X11,X11)
& reorganization_free(X1,X10,X10)
& organization(X4,X11)
& organization(X1,X10) )
=> greater(X13,X12) ),
inference(assume_negation,[status(cth)],[t8_FOL]) ).
fof(c_0_5,hypothesis,
! [X14,X15,X16,X17,X18,X19,X20,X21,X22] :
( greater(X20,X19)
| ~ greater(X18,X17)
| ~ inertia(X15,X20,X22)
| ~ inertia(X14,X19,X21)
| ~ size(X15,X18,X22)
| ~ size(X14,X17,X21)
| ~ class(X15,X16,X22)
| ~ class(X14,X16,X21)
| ~ organization(X15,X22)
| ~ organization(X14,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5_FOL])])]) ).
fof(c_0_6,negated_conjecture,
( ~ greater(esk5_0,esk4_0)
& greater(esk7_0,esk6_0)
& size(esk2_0,esk7_0,esk9_0)
& size(esk1_0,esk6_0,esk8_0)
& survival_chance(esk2_0,esk5_0,esk9_0)
& survival_chance(esk1_0,esk4_0,esk8_0)
& class(esk2_0,esk3_0,esk9_0)
& class(esk1_0,esk3_0,esk8_0)
& reorganization_free(esk2_0,esk9_0,esk9_0)
& reorganization_free(esk1_0,esk8_0,esk8_0)
& organization(esk2_0,esk9_0)
& organization(esk1_0,esk8_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ size(X3,X7,X4)
| ~ size(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
size(esk2_0,esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
organization(esk2_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,hypothesis,
! [X23,X24,X25,X26,X27,X28,X29,X30] :
( greater(X30,X29)
| ~ greater(X28,X27)
| ~ survival_chance(X24,X30,X26)
| ~ survival_chance(X23,X29,X25)
| ~ inertia(X24,X28,X26)
| ~ inertia(X23,X27,X25)
| ~ reorganization_free(X24,X26,X26)
| ~ reorganization_free(X23,X25,X25)
| ~ organization(X24,X26)
| ~ organization(X23,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_FOL])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ organization(X4,X5)
| ~ inertia(X4,X2,X5)
| ~ inertia(esk2_0,X1,esk9_0)
| ~ class(X4,X6,X5)
| ~ class(esk2_0,X6,esk9_0)
| ~ size(X4,X3,X5)
| ~ greater(esk7_0,X3)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
class(esk2_0,esk3_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X40,X41] :
( inertia(X40,esk10_2(X40,X41),X41)
| ~ organization(X40,X41) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])]) ).
cnf(c_0_14,hypothesis,
( ~ greater(X6,X5)
| ~ survival_chance(X3,X8,X4)
| ~ survival_chance(X1,X7,X2)
| ~ inertia(X3,X6,X4)
| ~ inertia(X1,X5,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X8,X7) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
survival_chance(esk2_0,esk5_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
reorganization_free(esk2_0,esk9_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ organization(X4,X5)
| ~ inertia(X4,X2,X5)
| ~ inertia(esk2_0,X1,esk9_0)
| ~ class(X4,esk3_0,X5)
| ~ size(X4,X3,X5)
| ~ greater(esk7_0,X3)
| greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( ~ organization(X1,X2)
| inertia(X1,esk10_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ organization(X2,X3)
| ~ inertia(X2,X5,X3)
| ~ inertia(esk2_0,X4,esk9_0)
| ~ greater(X4,X5)
| ~ reorganization_free(X2,X3,X3)
| ~ survival_chance(X2,X1,X3)
| greater(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_9])]) ).
cnf(c_0_20,negated_conjecture,
( ~ organization(X3,X4)
| ~ inertia(X3,X1,X4)
| ~ class(X3,esk3_0,X4)
| ~ size(X3,X2,X4)
| ~ greater(esk7_0,X2)
| greater(esk10_2(esk2_0,esk9_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9])]) ).
cnf(c_0_21,negated_conjecture,
size(esk1_0,esk6_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
greater(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
class(esk1_0,esk3_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
organization(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( ~ organization(X2,X3)
| ~ inertia(X2,X4,X3)
| ~ greater(esk10_2(esk2_0,esk9_0),X4)
| ~ reorganization_free(X2,X3,X3)
| ~ survival_chance(X2,X1,X3)
| greater(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_9])]) ).
cnf(c_0_26,negated_conjecture,
( ~ inertia(esk1_0,X1,esk8_0)
| greater(esk10_2(esk2_0,esk9_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( ~ organization(X2,X3)
| ~ inertia(X2,X4,X3)
| ~ inertia(esk1_0,X4,esk8_0)
| ~ reorganization_free(X2,X3,X3)
| ~ survival_chance(X2,X1,X3)
| greater(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( ~ organization(X2,X3)
| ~ inertia(X2,esk10_2(esk1_0,esk8_0),X3)
| ~ reorganization_free(X2,X3,X3)
| ~ survival_chance(X2,X1,X3)
| greater(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
reorganization_free(esk1_0,esk8_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( ~ survival_chance(esk1_0,X1,esk8_0)
| greater(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_29]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
survival_chance(esk1_0,esk4_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
~ greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT008+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.39 % Computer : n015.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Mon Sep 21 01:24:11 UTC 2026
% 0.12/5.40 % CPUTime :
% 0.16/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.44 Running first-order theorem proving
% 0.16/5.44 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.16/5.47 % Version: 3.5.1
% 0.16/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.47 % Starting sh5l with 300s (1) cores
% 0.16/5.47 % new_bool_3 with pid 250477 completed with status 0
% 0.16/5.47 % Result found by new_bool_3
% 0.16/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.47 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.16/5.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.47 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.47 % SubtermCWHack with pid 250484 completed with status 0
% 0.16/5.47 % Result found by SubtermCWHack
% 0.16/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.47 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.16/5.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.47 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.47 % Preprocessing time : 0.001 s
% 0.16/5.47
% 0.16/5.47 % Proof found!
% 0.16/5.47 % SZS status Theorem
% 0.16/5.47 % SZS output start CNFRefutation
% See solution above
% 0.16/5.47 % Parsed axioms : 4
% 0.16/5.47 % Removed by relevancy pruning/SinE : 0
% 0.16/5.47 % Initial clauses : 15
% 0.16/5.47 % Removed in clause preprocessing : 0
% 0.16/5.47 % Initial clauses in saturation : 15
% 0.16/5.47 % Processed clauses : 30
% 0.16/5.47 % ...of these trivial : 0
% 0.16/5.47 % ...subsumed : 0
% 0.16/5.47 % ...remaining for further processing : 30
% 0.16/5.47 % Other redundant clauses eliminated : 0
% 0.16/5.47 % Clauses deleted for lack of memory : 0
% 0.16/5.47 % Backward-subsumed : 0
% 0.16/5.47 % Backward-rewritten : 0
% 0.16/5.47 % Generated clauses : 18
% 0.16/5.47 % ...of the previous two non-redundant : 17
% 0.16/5.47 % ...aggressively subsumed : 0
% 0.16/5.47 % Contextual simplify-reflections : 0
% 0.16/5.47 % Paramodulations : 18
% 0.16/5.47 % Factorizations : 0
% 0.16/5.47 % NegExts : 0
% 0.16/5.47 % Equation resolutions : 0
% 0.16/5.47 % Disequality decompositions : 0
% 0.16/5.47 % Total rewrite steps : 21
% 0.16/5.47 % ...of those cached : 14
% 0.16/5.47 % Propositional unsat checks : 0
% 0.16/5.47 % Propositional check models : 0
% 0.16/5.47 % Propositional check unsatisfiable : 0
% 0.16/5.47 % Propositional clauses : 0
% 0.16/5.47 % Propositional clauses after purity: 0
% 0.16/5.47 % Propositional unsat core size : 0
% 0.16/5.47 % Propositional preprocessing time : 0.000
% 0.16/5.47 % Propositional encoding time : 0.000
% 0.16/5.47 % Propositional solver time : 0.000
% 0.16/5.47 % Success case prop preproc time : 0.000
% 0.16/5.47 % Success case prop encoding time : 0.000
% 0.16/5.47 % Success case prop solver time : 0.000
% 0.16/5.47 % Current number of processed clauses : 30
% 0.16/5.47 % Positive orientable unit clauses : 11
% 0.16/5.47 % Positive unorientable unit clauses: 0
% 0.16/5.47 % Negative unit clauses : 1
% 0.16/5.47 % Non-unit-clauses : 18
% 0.16/5.47 % Current number of unprocessed clauses: 2
% 0.16/5.47 % ...number of literals in the above : 14
% 0.16/5.47 % Current number of archived formulas : 0
% 0.16/5.47 % Current number of archived clauses : 0
% 0.16/5.47 % Clause-clause subsumption calls (NU) : 112
% 0.16/5.47 % Rec. Clause-clause subsumption calls : 3
% 0.16/5.47 % Non-unit clause-clause subsumptions : 0
% 0.16/5.47 % Unit Clause-clause subsumption calls : 0
% 0.16/5.47 % Rewrite failures with RHS unbound : 0
% 0.16/5.47 % BW rewrite match attempts : 0
% 0.16/5.47 % BW rewrite match successes : 0
% 0.16/5.47 % Condensation attempts : 0
% 0.16/5.47 % Condensation successes : 0
% 0.16/5.47 % Termbank termtop insertions : 1977
% 0.16/5.47 % Search garbage collected termcells : 357
% 0.16/5.47
% 0.16/5.47 % -------------------------------------------------
% 0.16/5.47 % User time : 0.008 s
% 0.16/5.47 % System time : 0.001 s
% 0.16/5.47 % Total time : 0.009 s
% 0.16/5.47 % Maximum resident set size: 3640 pages
% 0.16/5.47
% 0.16/5.47 % -------------------------------------------------
% 0.16/5.47 % User time : 0.009 s
% 0.16/5.47 % System time : 0.006 s
% 0.16/5.47 % Total time : 0.015 s
% 0.16/5.47 % Maximum resident set size: 4608 pages
% 0.16/5.47 % E exiting
%------------------------------------------------------------------------------