%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT019-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 : n001.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:10 PM UTC 2026
% Result : Satisfiable 0.16s 0.45s
% Output : Saturation 0.16s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_14ERROR: Could not build tree for root c_0_29ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_15,plain,
( ~ greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1))
| ~ greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
c_0_12,
[final] ).
cnf(c_0_16,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_13,
[final] ).
cnf(c_0_19,negated_conjecture,
( ~ greater(growth_rate(efficient_producers,sk5(X1)),growth_rate(first_movers,sk5(X1)))
| ~ in_environment(sk4,X1) ),
c_0_14,
[final] ).
cnf(c_0_20,plain,
( ~ greater_or_equal(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| ~ greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1))
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| disbanding_rate(efficient_producers,X1) = disbanding_rate(first_movers,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
cnf(c_0_21,hypothesis,
( ~ greater_or_equal(X2,sk3(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater_or_equal(founding_rate(efficient_producers,X2),founding_rate(first_movers,X2)) ),
c_0_17,
[final] ).
cnf(c_0_22,negated_conjecture,
( ~ in_environment(sk4,X1)
| greater_or_equal(sk5(X1),X1) ),
c_0_18,
[final] ).
cnf(c_0_24,negated_conjecture,
( ~ greater_or_equal(disbanding_rate(first_movers,sk5(X1)),disbanding_rate(efficient_producers,sk5(X1)))
| ~ greater_or_equal(founding_rate(efficient_producers,sk5(X1)),founding_rate(first_movers,sk5(X1)))
| ~ in_environment(sk4,X1)
| disbanding_rate(efficient_producers,sk5(X1)) = disbanding_rate(first_movers,sk5(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]),
[final] ).
cnf(c_0_25,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,sk5(sk3(X1)))
| ~ stable(X1)
| ~ in_environment(sk4,sk3(X1))
| greater_or_equal(founding_rate(efficient_producers,sk5(sk3(X1))),founding_rate(first_movers,sk5(sk3(X1)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]),
[final] ).
cnf(c_0_26,plain,
~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
c_0_23,
[final] ).
cnf(c_0_29,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,sk5(sk3(X1)))
| ~ greater_or_equal(disbanding_rate(first_movers,sk5(sk3(X1))),disbanding_rate(efficient_producers,sk5(sk3(X1))))
| ~ stable(X1)
| ~ in_environment(sk4,sk3(X1))
| disbanding_rate(efficient_producers,sk5(sk3(X1))) = disbanding_rate(first_movers,sk5(sk3(X1))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[final] ).
cnf(c_0_30,negated_conjecture,
( ~ greater_or_equal(growth_rate(efficient_producers,sk5(X1)),growth_rate(first_movers,sk5(X1)))
| ~ in_environment(sk4,X1)
| growth_rate(efficient_producers,sk5(X1)) = growth_rate(first_movers,sk5(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]),
[final] ).
cnf(c_0_31,plain,
( ~ greater_or_equal(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))
| disbanding_rate(efficient_producers,sk2) = disbanding_rate(first_movers,sk2) ),
inference(spm,[status(thm)],[c_0_26,c_0_16]),
[final] ).
cnf(c_0_32,negated_conjecture,
( ~ in_environment(sk4,X1)
| subpopulations(first_movers,efficient_producers,sk4,sk5(X1)) ),
c_0_27,
[final] ).
cnf(c_0_33,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,sk3(X1)) ),
c_0_28,
[final] ).
cnf(c_0_34,axiom,
subpopulations(first_movers,efficient_producers,sk1,sk2),
l2_23,
[final] ).
cnf(c_0_35,negated_conjecture,
stable(sk4),
prove_l1_30,
[final] ).
cnf(c_0_36,negated_conjecture,
environment(sk4),
prove_l1_29,
[final] ).
cnf(c_0_37,axiom,
environment(sk1),
l2_22,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT019-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n001.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 01:26:43 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.16/0.45 % Version: 3.5.1
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % Starting sh5l with 300s (1) cores
% 0.16/0.45 % new_bool_1 with pid 1904997 completed with status 1
% 0.16/0.45 % Result found by new_bool_1
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 % Search class: FGHSF-FFSS21-SFFFFFNN
% 0.16/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.45 % SubtermCWHack with pid 1904999 completed with status 1
% 0.16/0.45 % Result found by SubtermCWHack
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 % Search class: FGHSF-FFSS21-SFFFFFNN
% 0.16/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.45 % Preprocessing time : 0.001 s
% 0.16/0.45
% 0.16/0.45 % No proof found!
% 0.16/0.45 % SZS status Satisfiable
% 0.16/0.45 % SZS output start Saturation
% See solution above
% 0.16/0.45 % Parsed axioms : 12
% 0.16/0.45 % Removed by relevancy pruning/SinE : 0
% 0.16/0.45 % Initial clauses : 12
% 0.16/0.45 % Removed in clause preprocessing : 0
% 0.16/0.45 % Initial clauses in saturation : 12
% 0.16/0.45 % Processed clauses : 18
% 0.16/0.45 % ...of these trivial : 0
% 0.16/0.45 % ...subsumed : 0
% 0.16/0.45 % ...remaining for further processing : 18
% 0.16/0.45 % Other redundant clauses eliminated : 0
% 0.16/0.45 % Clauses deleted for lack of memory : 0
% 0.16/0.45 % Backward-subsumed : 0
% 0.16/0.45 % Backward-rewritten : 0
% 0.16/0.45 % Generated clauses : 6
% 0.16/0.45 % ...of the previous two non-redundant : 6
% 0.16/0.45 % ...aggressively subsumed : 0
% 0.16/0.45 % Contextual simplify-reflections : 0
% 0.16/0.45 % Paramodulations : 6
% 0.16/0.45 % Factorizations : 0
% 0.16/0.45 % NegExts : 0
% 0.16/0.45 % Equation resolutions : 0
% 0.16/0.45 % Disequality decompositions : 0
% 0.16/0.45 % Total rewrite steps : 0
% 0.16/0.45 % ...of those cached : 0
% 0.16/0.45 % Propositional unsat checks : 0
% 0.16/0.45 % Propositional check models : 0
% 0.16/0.45 % Propositional check unsatisfiable : 0
% 0.16/0.45 % Propositional clauses : 0
% 0.16/0.45 % Propositional clauses after purity: 0
% 0.16/0.45 % Propositional unsat core size : 0
% 0.16/0.45 % Propositional preprocessing time : 0.000
% 0.16/0.45 % Propositional encoding time : 0.000
% 0.16/0.45 % Propositional solver time : 0.000
% 0.16/0.45 % Success case prop preproc time : 0.000
% 0.16/0.45 % Success case prop encoding time : 0.000
% 0.16/0.45 % Success case prop solver time : 0.000
% 0.16/0.45 % Current number of processed clauses : 18
% 0.16/0.45 % Positive orientable unit clauses : 4
% 0.16/0.45 % Positive unorientable unit clauses: 0
% 0.16/0.45 % Negative unit clauses : 1
% 0.16/0.45 % Non-unit-clauses : 13
% 0.16/0.45 % Current number of unprocessed clauses: 0
% 0.16/0.45 % ...number of literals in the above : 0
% 0.16/0.45 % Current number of archived formulas : 0
% 0.16/0.45 % Current number of archived clauses : 0
% 0.16/0.45 % Clause-clause subsumption calls (NU) : 57
% 0.16/0.45 % Rec. Clause-clause subsumption calls : 17
% 0.16/0.45 % Non-unit clause-clause subsumptions : 0
% 0.16/0.45 % Unit Clause-clause subsumption calls : 0
% 0.16/0.45 % Rewrite failures with RHS unbound : 0
% 0.16/0.45 % BW rewrite match attempts : 0
% 0.16/0.45 % BW rewrite match successes : 0
% 0.16/0.45 % Condensation attempts : 0
% 0.16/0.45 % Condensation successes : 0
% 0.16/0.45 % Termbank termtop insertions : 730
% 0.16/0.45 % Search garbage collected termcells : 32
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.004 s
% 0.16/0.45 % System time : 0.001 s
% 0.16/0.45 % Total time : 0.005 s
% 0.16/0.45 % Maximum resident set size: 3640 pages
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.006 s
% 0.16/0.45 % System time : 0.006 s
% 0.16/0.45 % Total time : 0.012 s
% 0.16/0.45 % Maximum resident set size: 4864 pages
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------