%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT036-3 : 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 : 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.30s 0.51s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 11 unt; 0 nHn; 22 RR)
% Number of literals : 50 ( 0 equ; 33 neg)
% Maximal clause size : 5 ( 2 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d2_2,hypothesis,
( ~ greater(zero,growth_rate(X2,X4))
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| outcompetes(X3,X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_2) ).
cnf(prove_t5_star_9,negated_conjecture,
( ~ outcompetes(first_movers,efficient_producers,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_star_9) ).
cnf(a13_star_8,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_8) ).
cnf(a13_star_6,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_6) ).
cnf(a13_star_5,hypothesis,
environment(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_5) ).
cnf(mp_symmetry_of_subpopulations_1,axiom,
( ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| subpopulations(X3,X2,X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_1) ).
cnf(a13_star_7,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_7) ).
cnf(c_0_7,hypothesis,
( ~ greater(zero,growth_rate(X2,X4))
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| outcompetes(X3,X2,X4) ),
inference(fof_simplification,[status(thm)],[d2_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ outcompetes(first_movers,efficient_producers,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(fof_simplification,[status(thm)],[prove_t5_star_9]) ).
cnf(c_0_9,hypothesis,
( ~ greater(zero,growth_rate(X2,X4))
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| outcompetes(X3,X2,X4) ),
c_0_7 ).
cnf(c_0_10,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
a13_star_8 ).
cnf(c_0_11,negated_conjecture,
( ~ outcompetes(first_movers,efficient_producers,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
c_0_8 ).
cnf(c_0_12,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
a13_star_6 ).
cnf(c_0_13,hypothesis,
environment(sk1),
a13_star_5 ).
cnf(c_0_14,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_15,hypothesis,
( ~ environment(X2)
| ~ subpopulations(efficient_producers,X1,X2,sk2)
| ~ greater_or_equal(growth_rate(X1,sk2),zero)
| outcompetes(X1,efficient_producers,sk2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
a13_star_7 ).
cnf(c_0_17,hypothesis,
~ outcompetes(first_movers,efficient_producers,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_18,plain,
( ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| subpopulations(X3,X2,X1,X4) ),
c_0_14 ).
cnf(c_0_19,hypothesis,
( ~ environment(X1)
| ~ subpopulations(efficient_producers,first_movers,X1,sk2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,hypothesis,
subpopulations(efficient_producers,first_movers,sk1,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_13])]) ).
cnf(c_0_21,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT036-3 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n010.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 01:23:26 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.49 Running first-order theorem proving
% 0.18/0.49 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.30/0.51 % Version: 3.5.1
% 0.30/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.51 % Starting sh5l with 300s (1) cores
% 0.30/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3951365 completed with status 0
% 0.30/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.30/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.51 % No SInE strategy applied
% 0.30/0.51 % Search class: FHHNF-FFSS22-SFFFFFNN
% 0.30/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.30/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.30/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.30/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.30/0.51 % SubtermCWHack with pid 3951369 completed with status 0
% 0.30/0.51 % Result found by SubtermCWHack
% 0.30/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.51 % No SInE strategy applied
% 0.30/0.51 % Search class: FHHNF-FFSS22-SFFFFFNN
% 0.30/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.51 % Preprocessing time : 0.001 s
% 0.30/0.51
% 0.30/0.51 % Proof found!
% 0.30/0.51 % SZS status Unsatisfiable
% 0.30/0.51 % SZS output start CNFRefutation
% See solution above
% 0.30/0.51 % Parsed axioms : 9
% 0.30/0.51 % Removed by relevancy pruning/SinE : 0
% 0.30/0.51 % Initial clauses : 9
% 0.30/0.51 % Removed in clause preprocessing : 0
% 0.30/0.51 % Initial clauses in saturation : 9
% 0.30/0.51 % Processed clauses : 15
% 0.30/0.51 % ...of these trivial : 0
% 0.30/0.51 % ...subsumed : 0
% 0.30/0.51 % ...remaining for further processing : 15
% 0.30/0.51 % Other redundant clauses eliminated : 0
% 0.30/0.51 % Clauses deleted for lack of memory : 0
% 0.30/0.51 % Backward-subsumed : 0
% 0.30/0.51 % Backward-rewritten : 0
% 0.30/0.51 % Generated clauses : 12
% 0.30/0.51 % ...of the previous two non-redundant : 8
% 0.30/0.51 % ...aggressively subsumed : 0
% 0.30/0.51 % Contextual simplify-reflections : 0
% 0.30/0.51 % Paramodulations : 12
% 0.30/0.51 % Factorizations : 0
% 0.30/0.51 % NegExts : 0
% 0.30/0.51 % Equation resolutions : 0
% 0.30/0.51 % Disequality decompositions : 0
% 0.30/0.51 % Total rewrite steps : 11
% 0.30/0.51 % ...of those cached : 7
% 0.30/0.51 % Propositional unsat checks : 0
% 0.30/0.51 % Propositional check models : 0
% 0.30/0.51 % Propositional check unsatisfiable : 0
% 0.30/0.51 % Propositional clauses : 0
% 0.30/0.51 % Propositional clauses after purity: 0
% 0.30/0.51 % Propositional unsat core size : 0
% 0.30/0.51 % Propositional preprocessing time : 0.000
% 0.30/0.51 % Propositional encoding time : 0.000
% 0.30/0.51 % Propositional solver time : 0.000
% 0.30/0.51 % Success case prop preproc time : 0.000
% 0.30/0.51 % Success case prop encoding time : 0.000
% 0.30/0.51 % Success case prop solver time : 0.000
% 0.30/0.51 % Current number of processed clauses : 15
% 0.30/0.51 % Positive orientable unit clauses : 5
% 0.30/0.51 % Positive unorientable unit clauses: 0
% 0.30/0.51 % Negative unit clauses : 1
% 0.30/0.51 % Non-unit-clauses : 9
% 0.30/0.51 % Current number of unprocessed clauses: 2
% 0.30/0.51 % ...number of literals in the above : 9
% 0.30/0.51 % Current number of archived formulas : 0
% 0.30/0.51 % Current number of archived clauses : 0
% 0.30/0.51 % Clause-clause subsumption calls (NU) : 1
% 0.30/0.51 % Rec. Clause-clause subsumption calls : 0
% 0.30/0.51 % Non-unit clause-clause subsumptions : 0
% 0.30/0.51 % Unit Clause-clause subsumption calls : 1
% 0.30/0.51 % Rewrite failures with RHS unbound : 0
% 0.30/0.51 % BW rewrite match attempts : 0
% 0.30/0.51 % BW rewrite match successes : 0
% 0.30/0.51 % Condensation attempts : 0
% 0.30/0.51 % Condensation successes : 0
% 0.30/0.51 % Termbank termtop insertions : 547
% 0.30/0.51 % Search garbage collected termcells : 25
% 0.30/0.51
% 0.30/0.51 % -------------------------------------------------
% 0.30/0.51 % User time : 0.004 s
% 0.30/0.51 % System time : 0.003 s
% 0.30/0.51 % Total time : 0.007 s
% 0.30/0.51 % Maximum resident set size: 3380 pages
% 0.30/0.51
% 0.30/0.51 % -------------------------------------------------
% 0.30/0.51 % User time : 0.013 s
% 0.30/0.51 % System time : 0.011 s
% 0.30/0.51 % Total time : 0.024 s
% 0.30/0.51 % Maximum resident set size: 4608 pages
% 0.30/0.51 % E exiting
%------------------------------------------------------------------------------