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