%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT036+3 : 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 : 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:26:50 PM UTC 2026
% Result : Theorem 0.15s 5.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 75 ( 31 ~; 26 |; 15 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t5_star,conjecture,
? [X1,X4] :
( outcompetes(first_movers,efficient_producers,X4)
& subpopulations(first_movers,efficient_producers,X1,X4)
& environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_star) ).
fof(d2,hypothesis,
! [X1,X2,X3,X4] :
( ( subpopulations(X2,X3,X1,X4)
& environment(X1) )
=> ( ( greater(zero,growth_rate(X2,X4))
& greater_or_equal(growth_rate(X3,X4),zero) )
<=> outcompetes(X3,X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2) ).
fof(a13_star,hypothesis,
? [X1,X4] :
( greater(zero,growth_rate(efficient_producers,X4))
& greater_or_equal(growth_rate(first_movers,X4),zero)
& subpopulations(first_movers,efficient_producers,X1,X4)
& environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_star) ).
fof(mp_symmetry_of_subpopulations,axiom,
! [X1,X2,X3,X4] :
( ( subpopulations(X2,X3,X1,X4)
& environment(X1) )
=> subpopulations(X3,X2,X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations) ).
fof(c_0_4,negated_conjecture,
~ ? [X1,X4] :
( outcompetes(first_movers,efficient_producers,X4)
& subpopulations(first_movers,efficient_producers,X1,X4)
& environment(X1) ),
inference(assume_negation,[status(cth)],[prove_t5_star]) ).
fof(c_0_5,hypothesis,
! [X5,X6,X7,X8] :
( ( ~ subpopulations(X6,X7,X5,X8)
| ~ environment(X5)
| ~ outcompetes(X7,X6,X8)
| greater(zero,growth_rate(X6,X8)) )
& ( ~ subpopulations(X6,X7,X5,X8)
| ~ environment(X5)
| ~ outcompetes(X7,X6,X8)
| greater_or_equal(growth_rate(X7,X8),zero) )
& ( ~ subpopulations(X6,X7,X5,X8)
| ~ environment(X5)
| outcompetes(X7,X6,X8)
| ~ greater(zero,growth_rate(X6,X8))
| ~ greater_or_equal(growth_rate(X7,X8),zero) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2])])])]) ).
fof(c_0_6,hypothesis,
( greater(zero,growth_rate(efficient_producers,esk2_0))
& greater_or_equal(growth_rate(first_movers,esk2_0),zero)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& environment(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[a13_star])]) ).
fof(c_0_7,negated_conjecture,
! [X11,X12] :
( ~ outcompetes(first_movers,efficient_producers,X12)
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,hypothesis,
( ~ subpopulations(X3,X1,X4,X2)
| ~ environment(X4)
| ~ greater(zero,growth_rate(X3,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero)
| outcompetes(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ outcompetes(first_movers,efficient_producers,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X13,X14,X15,X16] :
( subpopulations(X15,X14,X13,X16)
| ~ subpopulations(X14,X15,X13,X16)
| ~ environment(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_symmetry_of_subpopulations])])]) ).
cnf(c_0_14,hypothesis,
( ~ environment(X2)
| ~ subpopulations(efficient_producers,X1,X2,esk2_0)
| ~ greater_or_equal(growth_rate(X1,esk2_0),zero)
| outcompetes(X1,efficient_producers,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,hypothesis,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,hypothesis,
~ outcompetes(first_movers,efficient_producers,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,plain,
( ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| subpopulations(X3,X2,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
( ~ environment(X1)
| ~ subpopulations(efficient_producers,first_movers,X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,hypothesis,
subpopulations(efficient_producers,first_movers,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_12])]) ).
cnf(c_0_20,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT036+3 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n017.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 01:18:46 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.44 % Version: 3.5.1
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % Starting sh5l with 300s (1) cores
% 0.15/5.44 % new_bool_3 with pid 1116924 completed with status 0
% 0.15/5.44 % Result found by new_bool_3
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.44 % Search class: FHHNF-FFSS22-SFFFFFNN
% 0.15/5.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.44 % SubtermCWHack with pid 1116929 completed with status 0
% 0.15/5.44 % Result found by SubtermCWHack
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.44 % Search class: FHHNF-FFSS22-SFFFFFNN
% 0.15/5.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.44 % Preprocessing time : 0.001 s
% 0.15/5.44
% 0.15/5.44 % Proof found!
% 0.15/5.44 % SZS status Theorem
% 0.15/5.44 % SZS output start CNFRefutation
% See solution above
% 0.15/5.44 % Parsed axioms : 4
% 0.15/5.44 % Removed by relevancy pruning/SinE : 0
% 0.15/5.44 % Initial clauses : 9
% 0.15/5.44 % Removed in clause preprocessing : 0
% 0.15/5.44 % Initial clauses in saturation : 9
% 0.15/5.44 % Processed clauses : 15
% 0.15/5.44 % ...of these trivial : 0
% 0.15/5.44 % ...subsumed : 0
% 0.15/5.44 % ...remaining for further processing : 15
% 0.15/5.44 % Other redundant clauses eliminated : 0
% 0.15/5.44 % Clauses deleted for lack of memory : 0
% 0.15/5.44 % Backward-subsumed : 0
% 0.15/5.44 % Backward-rewritten : 0
% 0.15/5.44 % Generated clauses : 12
% 0.15/5.44 % ...of the previous two non-redundant : 8
% 0.15/5.44 % ...aggressively subsumed : 0
% 0.15/5.44 % Contextual simplify-reflections : 0
% 0.15/5.44 % Paramodulations : 12
% 0.15/5.44 % Factorizations : 0
% 0.15/5.44 % NegExts : 0
% 0.15/5.44 % Equation resolutions : 0
% 0.15/5.44 % Disequality decompositions : 0
% 0.15/5.44 % Total rewrite steps : 11
% 0.15/5.44 % ...of those cached : 7
% 0.15/5.44 % Propositional unsat checks : 0
% 0.15/5.44 % Propositional check models : 0
% 0.15/5.44 % Propositional check unsatisfiable : 0
% 0.15/5.44 % Propositional clauses : 0
% 0.15/5.44 % Propositional clauses after purity: 0
% 0.15/5.44 % Propositional unsat core size : 0
% 0.15/5.44 % Propositional preprocessing time : 0.000
% 0.15/5.44 % Propositional encoding time : 0.000
% 0.15/5.44 % Propositional solver time : 0.000
% 0.15/5.44 % Success case prop preproc time : 0.000
% 0.15/5.44 % Success case prop encoding time : 0.000
% 0.15/5.44 % Success case prop solver time : 0.000
% 0.15/5.44 % Current number of processed clauses : 15
% 0.15/5.44 % Positive orientable unit clauses : 5
% 0.15/5.44 % Positive unorientable unit clauses: 0
% 0.15/5.44 % Negative unit clauses : 1
% 0.15/5.44 % Non-unit-clauses : 9
% 0.15/5.44 % Current number of unprocessed clauses: 2
% 0.15/5.44 % ...number of literals in the above : 9
% 0.15/5.44 % Current number of archived formulas : 0
% 0.15/5.44 % Current number of archived clauses : 0
% 0.15/5.44 % Clause-clause subsumption calls (NU) : 1
% 0.15/5.44 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.44 % Non-unit clause-clause subsumptions : 0
% 0.15/5.44 % Unit Clause-clause subsumption calls : 1
% 0.15/5.44 % Rewrite failures with RHS unbound : 0
% 0.15/5.44 % BW rewrite match attempts : 0
% 0.15/5.44 % BW rewrite match successes : 0
% 0.15/5.44 % Condensation attempts : 0
% 0.15/5.44 % Condensation successes : 0
% 0.15/5.44 % Termbank termtop insertions : 892
% 0.15/5.44 % Search garbage collected termcells : 125
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.004 s
% 0.15/5.44 % System time : 0.002 s
% 0.15/5.44 % Total time : 0.007 s
% 0.15/5.44 % Maximum resident set size: 3632 pages
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.005 s
% 0.15/5.44 % System time : 0.007 s
% 0.15/5.44 % Total time : 0.013 s
% 0.15/5.44 % Maximum resident set size: 4608 pages
% 0.15/5.44 % E exiting
%------------------------------------------------------------------------------