%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT036-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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 : Unsatisfiable 0.23s 0.61s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 14 unt; 0 nHn; 37 RR)
% Number of literals : 107 ( 0 equ; 65 neg)
% Maximal clause size : 5 ( 2 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 : 100 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_symmetry_of_subpopulations_1,axiom,
( ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| subpopulations(X3,X2,X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_1) ).
cnf(a13_11,hypothesis,
( ~ greater(zero,growth_rate(X4,X2))
| ~ greater(resilience(X4),resilience(X3))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_11) ).
cnf(mp_growth_rate_relationships_3,axiom,
( ~ greater(zero,growth_rate(X2,X3))
| environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_growth_rate_relationships_3) ).
cnf(d2_9,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater(zero,growth_rate(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_9) ).
cnf(prove_t5_13,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_13) ).
cnf(prove_t5_12,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_12) ).
cnf(prove_t5_14,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_14) ).
cnf(mp_time_point_occur_2,axiom,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occur_2) ).
cnf(d2_8,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater_or_equal(growth_rate(X3,X4),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_8) ).
cnf(a2_10,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2_10) ).
cnf(mp_growth_rate_relationships_4,axiom,
( ~ greater(zero,growth_rate(X1,X4))
| subpopulations(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_growth_rate_relationships_4) ).
cnf(mp_growth_rate_relationships_5,axiom,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_growth_rate_relationships_5) ).
cnf(c_0_12,plain,
( ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| subpopulations(X3,X2,X1,X4) ),
inference(fof_simplification,[status(thm)],[mp_symmetry_of_subpopulations_1]) ).
cnf(c_0_13,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(fof_simplification,[status(thm)],[a13_11]) ).
cnf(c_0_14,plain,
( ~ greater(zero,growth_rate(X2,X3))
| environment(X1) ),
inference(fof_simplification,[status(thm)],[mp_growth_rate_relationships_3]) ).
cnf(c_0_15,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater(zero,growth_rate(X2,X4)) ),
inference(fof_simplification,[status(thm)],[d2_9]) ).
cnf(c_0_16,plain,
( ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| subpopulations(X3,X2,X1,X4) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
prove_t5_13 ).
cnf(c_0_18,negated_conjecture,
environment(sk1),
prove_t5_12 ).
cnf(c_0_19,hypothesis,
( ~ greater(zero,growth_rate(X4,X2))
| ~ greater(resilience(X4),resilience(X3))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(X3,X2)) ),
c_0_13 ).
cnf(c_0_20,plain,
( ~ greater(zero,growth_rate(X2,X3))
| environment(X1) ),
c_0_14 ).
cnf(c_0_21,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater(zero,growth_rate(X2,X4)) ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
subpopulations(efficient_producers,first_movers,sk1,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
prove_t5_14 ).
cnf(c_0_24,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_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_18])]) ).
cnf(c_0_26,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_time_point_occur_2]) ).
cnf(c_0_27,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater_or_equal(growth_rate(X3,X4),zero) ),
inference(fof_simplification,[status(thm)],[d2_8]) ).
cnf(c_0_28,hypothesis,
( ~ in_environment(X2,sk2)
| ~ greater(resilience(efficient_producers),resilience(X1))
| greater(zero,growth_rate(X1,sk2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
a2_10 ).
cnf(c_0_30,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
environment(X1),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_32,plain,
( ~ greater(zero,growth_rate(X1,X4))
| subpopulations(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[mp_growth_rate_relationships_4]) ).
cnf(c_0_33,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater_or_equal(growth_rate(X3,X4),zero) ),
c_0_27 ).
cnf(c_0_34,hypothesis,
( ~ in_environment(X1,sk2)
| greater(zero,growth_rate(first_movers,sk2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| in_environment(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_36,plain,
( ~ greater(zero,growth_rate(X1,X4))
| subpopulations(X1,X2,X3,X4) ),
c_0_32 ).
cnf(c_0_37,plain,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
inference(fof_simplification,[status(thm)],[mp_growth_rate_relationships_5]) ).
cnf(c_0_38,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_33,c_0_31])]) ).
cnf(c_0_39,hypothesis,
( ~ subpopulations(first_movers,efficient_producers,X1,sk2)
| greater(zero,growth_rate(first_movers,sk2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ~ greater(zero,growth_rate(X2,X4))
| subpopulations(X1,X2,X3,X4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_36]),c_0_20]) ).
cnf(c_0_41,plain,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
c_0_37 ).
cnf(c_0_42,negated_conjecture,
greater_or_equal(growth_rate(first_movers,sk2),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_22]),c_0_23])]) ).
cnf(c_0_43,hypothesis,
greater(zero,growth_rate(first_movers,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_25])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : MGT036-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n010.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 01:22:40 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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.23/0.61 % Version: 3.5.1
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.61 % Starting sh5l with 300s (1) cores
% 0.23/0.61 % new_bool_3 with pid 3949768 completed with status 0
% 0.23/0.61 % Result found by new_bool_3
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.61 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.23/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.61 % SubtermCWHack with pid 3949773 completed with status 0
% 0.23/0.61 % Result found by SubtermCWHack
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.61 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.23/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.61 % Preprocessing time : 0.002 s
% 0.23/0.61
% 0.23/0.61 % Proof found!
% 0.23/0.61 % SZS status Unsatisfiable
% 0.23/0.61 % SZS output start CNFRefutation
% See solution above
% 0.23/0.61 % Parsed axioms : 14
% 0.23/0.61 % Removed by relevancy pruning/SinE : 0
% 0.23/0.61 % Initial clauses : 14
% 0.23/0.61 % Removed in clause preprocessing : 0
% 0.23/0.61 % Initial clauses in saturation : 14
% 0.23/0.61 % Processed clauses : 34
% 0.23/0.61 % ...of these trivial : 0
% 0.23/0.61 % ...subsumed : 4
% 0.23/0.61 % ...remaining for further processing : 30
% 0.23/0.61 % Other redundant clauses eliminated : 0
% 0.23/0.61 % Clauses deleted for lack of memory : 0
% 0.23/0.61 % Backward-subsumed : 0
% 0.23/0.61 % Backward-rewritten : 8
% 0.23/0.61 % Generated clauses : 38
% 0.23/0.61 % ...of the previous two non-redundant : 27
% 0.23/0.61 % ...aggressively subsumed : 0
% 0.23/0.61 % Contextual simplify-reflections : 2
% 0.23/0.61 % Paramodulations : 38
% 0.23/0.61 % Factorizations : 0
% 0.23/0.61 % NegExts : 0
% 0.23/0.61 % Equation resolutions : 0
% 0.23/0.61 % Disequality decompositions : 0
% 0.23/0.61 % Total rewrite steps : 27
% 0.23/0.61 % ...of those cached : 17
% 0.23/0.61 % Propositional unsat checks : 0
% 0.23/0.61 % Propositional check models : 0
% 0.23/0.61 % Propositional check unsatisfiable : 0
% 0.23/0.61 % Propositional clauses : 0
% 0.23/0.61 % Propositional clauses after purity: 0
% 0.23/0.61 % Propositional unsat core size : 0
% 0.23/0.61 % Propositional preprocessing time : 0.000
% 0.23/0.61 % Propositional encoding time : 0.000
% 0.23/0.61 % Propositional solver time : 0.000
% 0.23/0.61 % Success case prop preproc time : 0.000
% 0.23/0.61 % Success case prop encoding time : 0.000
% 0.23/0.61 % Success case prop solver time : 0.000
% 0.23/0.61 % Current number of processed clauses : 22
% 0.23/0.61 % Positive orientable unit clauses : 8
% 0.23/0.61 % Positive unorientable unit clauses: 0
% 0.23/0.61 % Negative unit clauses : 0
% 0.23/0.61 % Non-unit-clauses : 14
% 0.23/0.61 % Current number of unprocessed clauses: 5
% 0.23/0.61 % ...number of literals in the above : 17
% 0.23/0.61 % Current number of archived formulas : 0
% 0.23/0.61 % Current number of archived clauses : 8
% 0.23/0.61 % Clause-clause subsumption calls (NU) : 40
% 0.23/0.61 % Rec. Clause-clause subsumption calls : 35
% 0.23/0.61 % Non-unit clause-clause subsumptions : 6
% 0.23/0.61 % Unit Clause-clause subsumption calls : 3
% 0.23/0.61 % Rewrite failures with RHS unbound : 0
% 0.23/0.61 % BW rewrite match attempts : 5
% 0.23/0.61 % BW rewrite match successes : 5
% 0.23/0.61 % Condensation attempts : 0
% 0.23/0.61 % Condensation successes : 0
% 0.23/0.61 % Termbank termtop insertions : 1130
% 0.23/0.61 % Search garbage collected termcells : 46
% 0.23/0.61
% 0.23/0.61 % -------------------------------------------------
% 0.23/0.61 % User time : 0.005 s
% 0.23/0.61 % System time : 0.004 s
% 0.23/0.61 % Total time : 0.010 s
% 0.23/0.61 % Maximum resident set size: 3640 pages
% 0.23/0.61
% 0.23/0.61 % -------------------------------------------------
% 0.23/0.61 % User time : 0.009 s
% 0.23/0.61 % System time : 0.010 s
% 0.23/0.61 % Total time : 0.019 s
% 0.23/0.61 % Maximum resident set size: 4608 pages
% 0.23/0.61 % E exiting
%------------------------------------------------------------------------------