%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT023-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 : n007.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:04 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.42s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 9 unt; 11 nHn; 30 RR)
% Number of literals : 99 ( 12 equ; 59 neg)
% Maximal clause size : 5 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(d1_17,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_17) ).
cnf(l12_20,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,sk2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_20) ).
cnf(l12_21,hypothesis,
( ~ greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1)))
| ~ stable(X1)
| ~ environment(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_21) ).
cnf(l12_22,hypothesis,
( ~ greater(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_22) ).
cnf(d1_19,hypothesis,
( ~ greater(growth_rate(efficient_producers,sk1(X2,X1)),growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_19) ).
cnf(d1_18,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| greater(sk1(X2,X1),X2)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_18) ).
cnf(prove_l5_25,negated_conjecture,
~ in_environment(sk3,critical_point(sk3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l5_25) ).
cnf(prove_l5_24,negated_conjecture,
stable(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l5_24) ).
cnf(prove_l5_23,negated_conjecture,
environment(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l5_23) ).
cnf(c_0_9,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
inference(fof_simplification,[status(thm)],[d1_17]) ).
cnf(c_0_10,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,sk2(X1)) ),
inference(fof_simplification,[status(thm)],[l12_20]) ).
cnf(c_0_11,hypothesis,
( ~ greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1)))
| ~ stable(X1)
| ~ environment(X1) ),
inference(fof_simplification,[status(thm)],[l12_21]) ).
cnf(c_0_12,hypothesis,
( ~ greater(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
inference(fof_simplification,[status(thm)],[l12_22]) ).
cnf(c_0_13,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
c_0_9 ).
cnf(c_0_14,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,sk2(X1)) ),
c_0_10 ).
cnf(c_0_15,hypothesis,
( ~ greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1)))
| ~ stable(X1)
| ~ environment(X1) ),
c_0_11 ).
cnf(c_0_16,hypothesis,
( ~ greater(growth_rate(efficient_producers,sk1(X2,X1)),growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
inference(fof_simplification,[status(thm)],[d1_19]) ).
cnf(c_0_17,hypothesis,
( ~ greater(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
c_0_12 ).
cnf(c_0_18,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| subpopulations(first_movers,efficient_producers,X1,sk1(sk2(X1),X1))
| critical_point(X1) = sk2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| greater(sk1(X2,X1),X2)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
inference(fof_simplification,[status(thm)],[d1_18]) ).
cnf(c_0_20,negated_conjecture,
~ in_environment(sk3,critical_point(sk3)),
inference(fof_simplification,[status(thm)],[prove_l5_25]) ).
cnf(c_0_21,hypothesis,
( ~ greater(growth_rate(efficient_producers,sk1(X2,X1)),growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
c_0_16 ).
cnf(c_0_22,hypothesis,
( ~ environment(X1)
| ~ greater(sk1(sk2(X1),X1),sk2(X1))
| ~ stable(X1)
| greater(growth_rate(efficient_producers,sk1(sk2(X1),X1)),growth_rate(first_movers,sk1(sk2(X1),X1)))
| critical_point(X1) = sk2(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| X2 = critical_point(X1)
| greater(sk1(X2,X1),X2)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
~ in_environment(sk3,critical_point(sk3)),
c_0_20 ).
cnf(c_0_25,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| critical_point(X1) = sk2(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_14]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
stable(sk3),
prove_l5_24 ).
cnf(c_0_27,negated_conjecture,
environment(sk3),
prove_l5_23 ).
cnf(c_0_28,negated_conjecture,
~ in_environment(sk3,sk2(sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_29,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_14]),c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT023-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.09/0.36 % Computer : n007.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:19:50 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.42 % Version: 3.5.1
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.42 % Starting sh5l with 300s (1) cores
% 0.09/0.42 % new_bool_3 with pid 4055352 completed with status 0
% 0.09/0.42 % Result found by new_bool_3
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.09/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.42 % SubtermCWHack with pid 4055358 completed with status 0
% 0.09/0.42 % Result found by SubtermCWHack
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.09/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.42 % Preprocessing time : 0.001 s
% 0.09/0.42
% 0.09/0.42 % Proof found!
% 0.09/0.42 % SZS status Unsatisfiable
% 0.09/0.42 % SZS output start CNFRefutation
% See solution above
% 0.09/0.42 % Parsed axioms : 9
% 0.09/0.42 % Removed by relevancy pruning/SinE : 0
% 0.09/0.42 % Initial clauses : 9
% 0.09/0.42 % Removed in clause preprocessing : 0
% 0.09/0.42 % Initial clauses in saturation : 9
% 0.09/0.42 % Processed clauses : 13
% 0.09/0.42 % ...of these trivial : 0
% 0.09/0.42 % ...subsumed : 0
% 0.09/0.42 % ...remaining for further processing : 13
% 0.09/0.42 % Other redundant clauses eliminated : 0
% 0.09/0.42 % Clauses deleted for lack of memory : 0
% 0.09/0.42 % Backward-subsumed : 2
% 0.09/0.42 % Backward-rewritten : 0
% 0.09/0.42 % Generated clauses : 5
% 0.09/0.42 % ...of the previous two non-redundant : 4
% 0.09/0.42 % ...aggressively subsumed : 0
% 0.09/0.42 % Contextual simplify-reflections : 4
% 0.09/0.42 % Paramodulations : 5
% 0.09/0.42 % Factorizations : 0
% 0.09/0.42 % NegExts : 0
% 0.09/0.42 % Equation resolutions : 0
% 0.09/0.42 % Disequality decompositions : 0
% 0.09/0.42 % Total rewrite steps : 4
% 0.09/0.42 % ...of those cached : 2
% 0.09/0.42 % Propositional unsat checks : 0
% 0.09/0.42 % Propositional check models : 0
% 0.09/0.42 % Propositional check unsatisfiable : 0
% 0.09/0.42 % Propositional clauses : 0
% 0.09/0.42 % Propositional clauses after purity: 0
% 0.09/0.42 % Propositional unsat core size : 0
% 0.09/0.42 % Propositional preprocessing time : 0.000
% 0.09/0.42 % Propositional encoding time : 0.000
% 0.09/0.42 % Propositional solver time : 0.000
% 0.09/0.42 % Success case prop preproc time : 0.000
% 0.09/0.42 % Success case prop encoding time : 0.000
% 0.09/0.42 % Success case prop solver time : 0.000
% 0.09/0.42 % Current number of processed clauses : 11
% 0.09/0.42 % Positive orientable unit clauses : 2
% 0.09/0.42 % Positive unorientable unit clauses: 0
% 0.09/0.42 % Negative unit clauses : 2
% 0.09/0.42 % Non-unit-clauses : 7
% 0.09/0.42 % Current number of unprocessed clauses: 0
% 0.09/0.42 % ...number of literals in the above : 0
% 0.09/0.42 % Current number of archived formulas : 0
% 0.09/0.42 % Current number of archived clauses : 2
% 0.09/0.42 % Clause-clause subsumption calls (NU) : 50
% 0.09/0.42 % Rec. Clause-clause subsumption calls : 8
% 0.09/0.42 % Non-unit clause-clause subsumptions : 6
% 0.09/0.42 % Unit Clause-clause subsumption calls : 0
% 0.09/0.42 % Rewrite failures with RHS unbound : 0
% 0.09/0.42 % BW rewrite match attempts : 0
% 0.09/0.42 % BW rewrite match successes : 0
% 0.09/0.42 % Condensation attempts : 0
% 0.09/0.42 % Condensation successes : 0
% 0.09/0.42 % Termbank termtop insertions : 652
% 0.09/0.42 % Search garbage collected termcells : 31
% 0.09/0.42
% 0.09/0.42 % -------------------------------------------------
% 0.09/0.42 % User time : 0.003 s
% 0.09/0.42 % System time : 0.001 s
% 0.09/0.42 % Total time : 0.004 s
% 0.09/0.42 % Maximum resident set size: 3584 pages
% 0.09/0.42
% 0.09/0.42 % -------------------------------------------------
% 0.09/0.42 % User time : 0.004 s
% 0.09/0.42 % System time : 0.005 s
% 0.09/0.42 % Total time : 0.010 s
% 0.09/0.42 % Maximum resident set size: 4864 pages
% 0.09/0.42 % E exiting
%------------------------------------------------------------------------------