%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT036+1 : 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:57 PM UTC 2026
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 126 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 148 ( 63 ~; 50 |; 22 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 85 ( 10 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t5,conjecture,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5) ).
fof(d2,hypothesis,
! [X1,X3,X4,X2] :
( ( subpopulations(X3,X4,X1,X2)
& environment(X1) )
=> ( ( greater(zero,growth_rate(X3,X2))
& greater_or_equal(growth_rate(X4,X2),zero) )
<=> outcompetes(X4,X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2) ).
fof(mp_symmetry_of_FM_and_EP,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> subpopulations(efficient_producers,first_movers,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_symmetry_of_FM_and_EP) ).
fof(mp_growth_rate_relationships,axiom,
! [X1,X3,X4,X2] :
( ( ( subpopulations(X3,X4,X1,X2)
& environment(X1) )
=> greater_or_equal(growth_rate(X3,X2),zero) )
<=> ~ greater(zero,growth_rate(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_growth_rate_relationships) ).
fof(a12,hypothesis,
! [X1,X3,X4,X2] :
( ( greater(resilience(X4),resilience(X3))
& ~ greater(zero,growth_rate(X3,X2))
& in_environment(X1,X2)
& environment(X1) )
=> ~ greater(zero,growth_rate(X4,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12) ).
fof(mp_time_point_occur,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_point_occur) ).
fof(a2,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(assume_negation,[status(cth)],[prove_t5]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,hypothesis,
! [X13,X14,X15,X16] :
( ( ~ subpopulations(X14,X15,X13,X16)
| ~ environment(X13)
| ~ outcompetes(X15,X14,X16)
| greater(zero,growth_rate(X14,X16)) )
& ( ~ subpopulations(X14,X15,X13,X16)
| ~ environment(X13)
| ~ outcompetes(X15,X14,X16)
| greater_or_equal(growth_rate(X15,X16),zero) )
& ( ~ subpopulations(X14,X15,X13,X16)
| ~ environment(X13)
| outcompetes(X15,X14,X16)
| ~ greater(zero,growth_rate(X14,X16))
| ~ greater_or_equal(growth_rate(X15,X16),zero) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2])])])]) ).
fof(c_0_10,negated_conjecture,
( outcompetes(first_movers,efficient_producers,esk2_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& environment(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X5,X6] :
( subpopulations(efficient_producers,first_movers,X5,X6)
| ~ subpopulations(first_movers,efficient_producers,X5,X6)
| ~ environment(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_symmetry_of_FM_and_EP])])]) ).
fof(c_0_12,plain,
! [X1,X3,X4,X2] :
( ( ( subpopulations(X3,X4,X1,X2)
& environment(X1) )
=> greater_or_equal(growth_rate(X3,X2),zero) )
<=> ~ greater(zero,growth_rate(X3,X2)) ),
inference(fof_simplification,[status(thm)],[mp_growth_rate_relationships]) ).
cnf(c_0_13,hypothesis,
( ~ subpopulations(X1,X3,X4,X2)
| ~ environment(X4)
| ~ outcompetes(X3,X1,X2)
| greater(zero,growth_rate(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
outcompetes(first_movers,efficient_producers,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| subpopulations(efficient_producers,first_movers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X9,X10,X11,X12] :
( ( greater_or_equal(growth_rate(X10,X12),zero)
| ~ subpopulations(X10,X11,X9,X12)
| ~ environment(X9)
| greater(zero,growth_rate(X10,X12)) )
& ( ~ greater(zero,growth_rate(X10,X12))
| ~ greater_or_equal(growth_rate(X10,X12),zero) )
& ( ~ greater(zero,growth_rate(X10,X12))
| subpopulations(X10,X11,X9,X12) )
& ( ~ greater(zero,growth_rate(X10,X12))
| environment(X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(efficient_producers,first_movers,X1,esk2_0)
| greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
subpopulations(efficient_producers,first_movers,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
fof(c_0_21,hypothesis,
! [X1,X3,X4,X2] :
( ( greater(resilience(X4),resilience(X3))
& ~ greater(zero,growth_rate(X3,X2))
& in_environment(X1,X2)
& environment(X1) )
=> ~ greater(zero,growth_rate(X4,X2)) ),
inference(fof_simplification,[status(thm)],[a12]) ).
cnf(c_0_22,plain,
( ~ greater(zero,growth_rate(X2,X3))
| environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]) ).
fof(c_0_24,hypothesis,
! [X17,X18,X19,X20] :
( ~ greater(zero,growth_rate(X19,X20))
| ~ greater(resilience(X19),resilience(X18))
| greater(zero,growth_rate(X18,X20))
| ~ in_environment(X17,X20)
| ~ environment(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
fof(c_0_25,plain,
! [X7,X8] :
( in_environment(X7,X8)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ environment(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occur])])]) ).
cnf(c_0_26,hypothesis,
( ~ subpopulations(X3,X1,X4,X2)
| ~ environment(X4)
| ~ outcompetes(X1,X3,X2)
| greater_or_equal(growth_rate(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
environment(X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ greater(zero,growth_rate(X1,X4))
| subpopulations(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,hypothesis,
( ~ greater(zero,growth_rate(X4,X2))
| ~ greater(resilience(X4),resilience(X3))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,hypothesis,
( ~ subpopulations(X3,X1,X4,X2)
| ~ outcompetes(X1,X3,X2)
| greater_or_equal(growth_rate(X1,X2),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
subpopulations(efficient_producers,X1,X2,esk2_0),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_33,hypothesis,
( ~ in_environment(X4,X2)
| ~ greater(resilience(X3),resilience(X1))
| ~ greater(zero,growth_rate(X3,X2))
| greater(zero,growth_rate(X1,X2)) ),
inference(csr,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_34,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_16]),c_0_17])]) ).
cnf(c_0_35,plain,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_36,negated_conjecture,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_14]),c_0_32])]) ).
cnf(c_0_37,negated_conjecture,
( ~ greater(resilience(X2),resilience(X1))
| ~ greater(zero,growth_rate(X2,esk2_0))
| greater(zero,growth_rate(X1,esk2_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(split_conjunct,[status(thm)],[a2]) ).
cnf(c_0_39,negated_conjecture,
~ greater(zero,growth_rate(first_movers,esk2_0)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT036+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 01:22:06 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.41 % Version: 3.5.1
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.41 % Starting sh5l with 300s (1) cores
% 0.12/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3855198 completed with status 0
% 0.12/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41 % No SInE strategy applied
% 0.12/0.41 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.12/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.41 % new_bool_1 with pid 3855206 completed with status 0
% 0.12/0.41 % Result found by new_bool_1
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41 % No SInE strategy applied
% 0.12/0.41 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.12/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.41 % Preprocessing time : 0.001 s
% 0.12/0.41 % Presaturation interreduction done
% 0.12/0.41
% 0.12/0.41 % Proof found!
% 0.12/0.41 % SZS status Theorem
% 0.12/0.41 % SZS output start CNFRefutation
% See solution above
% 0.12/0.41 % Parsed axioms : 7
% 0.12/0.41 % Removed by relevancy pruning/SinE : 0
% 0.12/0.41 % Initial clauses : 14
% 0.12/0.41 % Removed in clause preprocessing : 0
% 0.12/0.41 % Initial clauses in saturation : 14
% 0.12/0.41 % Processed clauses : 43
% 0.12/0.41 % ...of these trivial : 0
% 0.12/0.41 % ...subsumed : 0
% 0.12/0.41 % ...remaining for further processing : 43
% 0.12/0.41 % Other redundant clauses eliminated : 0
% 0.12/0.41 % Clauses deleted for lack of memory : 0
% 0.12/0.41 % Backward-subsumed : 0
% 0.12/0.41 % Backward-rewritten : 9
% 0.12/0.41 % Generated clauses : 20
% 0.12/0.41 % ...of the previous two non-redundant : 17
% 0.12/0.41 % ...aggressively subsumed : 0
% 0.12/0.41 % Contextual simplify-reflections : 3
% 0.12/0.41 % Paramodulations : 20
% 0.12/0.41 % Factorizations : 0
% 0.12/0.41 % NegExts : 0
% 0.12/0.41 % Equation resolutions : 0
% 0.12/0.41 % Disequality decompositions : 0
% 0.12/0.41 % Total rewrite steps : 24
% 0.12/0.41 % ...of those cached : 14
% 0.12/0.41 % Propositional unsat checks : 0
% 0.12/0.41 % Propositional check models : 0
% 0.12/0.41 % Propositional check unsatisfiable : 0
% 0.12/0.41 % Propositional clauses : 0
% 0.12/0.41 % Propositional clauses after purity: 0
% 0.12/0.41 % Propositional unsat core size : 0
% 0.12/0.41 % Propositional preprocessing time : 0.000
% 0.12/0.41 % Propositional encoding time : 0.000
% 0.12/0.41 % Propositional solver time : 0.000
% 0.12/0.41 % Success case prop preproc time : 0.000
% 0.12/0.41 % Success case prop encoding time : 0.000
% 0.12/0.41 % Success case prop solver time : 0.000
% 0.12/0.41 % Current number of processed clauses : 20
% 0.12/0.41 % Positive orientable unit clauses : 8
% 0.12/0.41 % Positive unorientable unit clauses: 0
% 0.12/0.41 % Negative unit clauses : 1
% 0.12/0.41 % Non-unit-clauses : 11
% 0.12/0.41 % Current number of unprocessed clauses: 0
% 0.12/0.41 % ...number of literals in the above : 0
% 0.12/0.41 % Current number of archived formulas : 0
% 0.12/0.41 % Current number of archived clauses : 23
% 0.12/0.41 % Clause-clause subsumption calls (NU) : 60
% 0.12/0.41 % Rec. Clause-clause subsumption calls : 36
% 0.12/0.41 % Non-unit clause-clause subsumptions : 3
% 0.12/0.41 % Unit Clause-clause subsumption calls : 2
% 0.12/0.41 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 6
% 0.12/0.42 % BW rewrite match successes : 5
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 1729
% 0.12/0.42 % Search garbage collected termcells : 219
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.005 s
% 0.12/0.42 % System time : 0.001 s
% 0.12/0.42 % Total time : 0.006 s
% 0.12/0.42 % Maximum resident set size: 3636 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.018 s
% 0.12/0.42 % System time : 0.010 s
% 0.12/0.42 % Total time : 0.028 s
% 0.12/0.42 % Maximum resident set size: 4608 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------