%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT036-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 : Unsatisfiable 0.12s 5.59s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 46 ( 14 unt; 0 nHn; 39 RR)
% Number of literals : 112 ( 0 equ; 73 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 : 97 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d2_9,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater(zero,growth_rate(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_9) ).
cnf(mp_symmetry_of_FM_and_EP_1,axiom,
( ~ 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_1) ).
cnf(mp_growth_rate_relationships_3,axiom,
( ~ greater(zero,growth_rate(X2,X3))
| environment(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_growth_rate_relationships_3) ).
cnf(prove_t5_13,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_13) ).
cnf(prove_t5_14,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_14) ).
cnf(prove_t5_12,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_12) ).
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/sandbox/benchmark/theBenchmark.p',d2_8) ).
cnf(mp_growth_rate_relationships_4,axiom,
( ~ greater(zero,growth_rate(X1,X4))
| subpopulations(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_growth_rate_relationships_4) ).
cnf(a12_10,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/sandbox/benchmark/theBenchmark.p',a12_10) ).
cnf(mp_growth_rate_relationships_5,axiom,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_growth_rate_relationships_5) ).
cnf(mp_time_point_occur_2,axiom,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_point_occur_2) ).
cnf(a2_11,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2_11) ).
cnf(c_0_12,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_13,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| subpopulations(efficient_producers,first_movers,X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_symmetry_of_FM_and_EP_1]) ).
cnf(c_0_14,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater(zero,growth_rate(X2,X4)) ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| subpopulations(efficient_producers,first_movers,X1,X2) ),
c_0_13 ).
cnf(c_0_16,plain,
( ~ greater(zero,growth_rate(X2,X3))
| environment(X1) ),
inference(fof_simplification,[status(thm)],[mp_growth_rate_relationships_3]) ).
cnf(c_0_17,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ outcompetes(first_movers,efficient_producers,X1)
| greater(zero,growth_rate(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
prove_t5_13 ).
cnf(c_0_19,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
prove_t5_14 ).
cnf(c_0_20,negated_conjecture,
environment(sk1),
prove_t5_12 ).
cnf(c_0_21,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_22,plain,
( ~ greater(zero,growth_rate(X2,X3))
| environment(X1) ),
c_0_16 ).
cnf(c_0_23,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_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_24,hypothesis,
( ~ outcompetes(X3,X2,X4)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| greater_or_equal(growth_rate(X3,X4),zero) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
environment(X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,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_27,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_24,c_0_25])]) ).
cnf(c_0_28,plain,
( ~ greater(zero,growth_rate(X1,X4))
| subpopulations(X1,X2,X3,X4) ),
c_0_26 ).
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(fof_simplification,[status(thm)],[a12_10]) ).
cnf(c_0_30,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_31,hypothesis,
( ~ greater(zero,growth_rate(X3,X2))
| ~ outcompetes(X1,X3,X2)
| greater_or_equal(growth_rate(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,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_29 ).
cnf(c_0_33,plain,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
c_0_30 ).
cnf(c_0_34,negated_conjecture,
( ~ outcompetes(X1,efficient_producers,sk2)
| greater_or_equal(growth_rate(X1,sk2),zero) ),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_35,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_32,c_0_22]) ).
cnf(c_0_36,negated_conjecture,
( ~ greater(zero,growth_rate(X1,sk2))
| ~ outcompetes(X1,efficient_producers,sk2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,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_38,negated_conjecture,
( ~ in_environment(X2,sk2)
| ~ greater(resilience(efficient_producers),resilience(X1))
| greater(zero,growth_rate(X1,sk2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_39,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
a2_11 ).
cnf(c_0_40,negated_conjecture,
~ greater(zero,growth_rate(first_movers,sk2)),
inference(spm,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_41,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
c_0_37 ).
cnf(c_0_42,hypothesis,
~ in_environment(X1,sk2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| in_environment(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_25])]) ).
cnf(c_0_44,hypothesis,
~ subpopulations(first_movers,efficient_producers,X1,sk2),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT036-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.53 % Computer : n006.cluster.edu
% 0.12/5.53 % Model : x86_64 x86_64
% 0.12/5.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.53 % Memory : 8046.5625MB
% 0.12/5.53 % OS : Linux 6.8.0-71-generic
% 0.12/5.53 % CPULimit : 300
% 0.12/5.53 % WCLimit : 300
% 0.12/5.53 % DateTime : Mon Sep 21 01:22:20 UTC 2026
% 0.12/5.53 % CPUTime :
% 0.12/5.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.57 Running first-order theorem proving
% 0.12/5.57 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/5.59 % Version: 3.5.1
% 0.12/5.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/5.59 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.59 % Starting new_bool_1 with 300s (1) cores
% 0.12/5.59 % Starting sh5l with 300s (1) cores
% 0.12/5.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1710684 completed with status 0
% 0.12/5.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/5.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/5.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/5.59 % No SInE strategy applied
% 0.12/5.59 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.12/5.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/5.59 % Starting SubtermCWHack with 136s (1) cores
% 0.12/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/5.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/5.59 % Starting new_bool_3 with 136s (1) cores
% 0.12/5.59 % Starting new_bool_1 with 136s (1) cores
% 0.12/5.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1710689 completed with status 0
% 0.12/5.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/5.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/5.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/5.59 % No SInE strategy applied
% 0.12/5.59 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.12/5.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/5.59 % Starting SubtermCWHack with 136s (1) cores
% 0.12/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/5.59 % Preprocessing time : 0.001 s
% 0.12/5.59 % Presaturation interreduction done
% 0.12/5.59
% 0.12/5.59 % Proof found!
% 0.12/5.59 % SZS status Unsatisfiable
% 0.12/5.59 % SZS output start CNFRefutation
% See solution above
% 0.12/5.59 % Parsed axioms : 14
% 0.12/5.59 % Removed by relevancy pruning/SinE : 0
% 0.12/5.59 % Initial clauses : 14
% 0.12/5.59 % Removed in clause preprocessing : 0
% 0.12/5.59 % Initial clauses in saturation : 14
% 0.12/5.59 % Processed clauses : 54
% 0.12/5.59 % ...of these trivial : 0
% 0.12/5.59 % ...subsumed : 4
% 0.12/5.59 % ...remaining for further processing : 50
% 0.12/5.59 % Other redundant clauses eliminated : 0
% 0.12/5.59 % Clauses deleted for lack of memory : 0
% 0.12/5.59 % Backward-subsumed : 3
% 0.12/5.59 % Backward-rewritten : 7
% 0.12/5.59 % Generated clauses : 37
% 0.12/5.59 % ...of the previous two non-redundant : 34
% 0.12/5.59 % ...aggressively subsumed : 0
% 0.12/5.59 % Contextual simplify-reflections : 3
% 0.12/5.59 % Paramodulations : 35
% 0.12/5.59 % Factorizations : 0
% 0.12/5.59 % NegExts : 0
% 0.12/5.59 % Equation resolutions : 0
% 0.12/5.59 % Disequality decompositions : 0
% 0.12/5.59 % Total rewrite steps : 16
% 0.12/5.59 % ...of those cached : 9
% 0.12/5.59 % Propositional unsat checks : 0
% 0.12/5.59 % Propositional check models : 0
% 0.12/5.59 % Propositional check unsatisfiable : 0
% 0.12/5.59 % Propositional clauses : 0
% 0.12/5.59 % Propositional clauses after purity: 0
% 0.12/5.59 % Propositional unsat core size : 0
% 0.12/5.59 % Propositional preprocessing time : 0.000
% 0.12/5.59 % Propositional encoding time : 0.000
% 0.12/5.59 % Propositional solver time : 0.000
% 0.12/5.59 % Success case prop preproc time : 0.000
% 0.12/5.59 % Success case prop encoding time : 0.000
% 0.12/5.59 % Success case prop solver time : 0.000
% 0.12/5.59 % Current number of processed clauses : 24
% 0.12/5.59 % Positive orientable unit clauses : 5
% 0.12/5.59 % Positive unorientable unit clauses: 0
% 0.12/5.59 % Negative unit clauses : 4
% 0.12/5.59 % Non-unit-clauses : 15
% 0.12/5.59 % Current number of unprocessed clauses: 7
% 0.12/5.59 % ...number of literals in the above : 24
% 0.12/5.59 % Current number of archived formulas : 0
% 0.12/5.59 % Current number of archived clauses : 26
% 0.12/5.59 % Clause-clause subsumption calls (NU) : 77
% 0.12/5.59 % Rec. Clause-clause subsumption calls : 55
% 0.12/5.59 % Non-unit clause-clause subsumptions : 5
% 0.12/5.59 % Unit Clause-clause subsumption calls : 28
% 0.12/5.59 % Rewrite failures with RHS unbound : 0
% 0.12/5.59 % BW rewrite match attempts : 4
% 0.12/5.59 % BW rewrite match successes : 4
% 0.12/5.59 % Condensation attempts : 0
% 0.12/5.59 % Condensation successes : 0
% 0.12/5.59 % Termbank termtop insertions : 1315
% 0.12/5.59 % Search garbage collected termcells : 46
% 0.12/5.59
% 0.12/5.59 % -------------------------------------------------
% 0.12/5.59 % User time : 0.004 s
% 0.12/5.59 % System time : 0.002 s
% 0.12/5.59 % Total time : 0.006 s
% 0.12/5.59 % Maximum resident set size: 3640 pages
% 0.12/5.59
% 0.12/5.59 % -------------------------------------------------
% 0.12/5.59 % User time : 0.012 s
% 0.12/5.59 % System time : 0.016 s
% 0.12/5.59 % Total time : 0.028 s
% 0.12/5.59 % Maximum resident set size: 4608 pages
% 0.12/5.59 % E exiting
%------------------------------------------------------------------------------