TSTP Solution File: MGT026+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : MGT026+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Mar 6 09:10:55 EST 2024
% Result : Theorem 12.91s 13.10s
% Output : Proof 12.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT026+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Mar 4 04:10:27 EST 2024
% 0.13/0.33 % CPUTime :
% 12.91/13.10 % SZS status Theorem for theBenchmark
% 12.91/13.10 % SZS output start Proof for theBenchmark
% 12.91/13.10
% 12.91/13.10 % Formula: mp1_high_growth_rates ( axiom ) converted to clauses:
% 12.91/13.10 cnf(mp1_high_growth_rates-1, axiom, ( ~environment(_u3) | ~subpopulations(_u2, _u1, _u3, _u0) | ~greater(growth_rate(_u1, _u0), growth_rate(_u2, _u0)) | selection_favors(_u1, _u2, _u0) )).
% 12.91/13.10
% 12.91/13.10 % Formula: mp2_favour_members ( axiom ) converted to clauses:
% 12.91/13.10 cnf(mp2_favour_members-1, axiom, ( ~environment(_u7) | ~subpopulation(_u6, _u7, _u4) | ~subpopulation(_u5, _u7, _u4) | ~greater(cardinality_at_time(_u6, _u4), zero) | ( cardinality_at_time(_u5, _u4) != zero) | selection_favors(_u6, _u5, _u4) )).
% 12.91/13.10
% 12.91/13.10 % Formula: mp_non_empty_fm_and_ep ( axiom ) converted to clauses:
% 12.91/13.10 cnf(mp_non_empty_fm_and_ep-1, axiom, ( ~environment(_u9) | ~in_environment(_u9, _u8) | ~greater(cardinality_at_time(first_movers, _u8), zero) | ~greater(cardinality_at_time(efficient_producers, _u8), zero) | subpopulations(first_movers, efficient_producers, _u9, _u8) )).
% 12.91/13.10
% 12.91/13.10 % Formula: mp_first_movers_exist ( axiom ) converted to clauses:
% 12.91/13.10 cnf(mp_first_movers_exist-1, axiom, ( ~environment(_u11) | ~in_environment(_u11, _u10) | greater_or_equal(cardinality_at_time(first_movers, _u10), zero) )).
% 12.91/13.10
% 12.91/13.10 % Formula: mp_subpopulations ( axiom ) converted to clauses:
% 12.91/13.10 cnf(mp_subpopulations-1, axiom, ( ~environment(_u13) | ~in_environment(_u13, _u12) | subpopulation(first_movers, _u13, _u12) )).
% 12.91/13.10 cnf(mp_subpopulations-2, axiom, ( ~environment(_u13) | ~in_environment(_u13, _u12) | subpopulation(efficient_producers, _u13, _u12) )).
% 12.91/13.10
% 12.91/13.10 % Formula: mp_critical_point_after_EP ( axiom ) converted to clauses:
% 12.91/13.10 cnf(mp_critical_point_after_EP-1, axiom, ( ~environment(_u14) | greater_or_equal(critical_point(_u14), appear(efficient_producers, _u14)) )).
% 12.91/13.10
% 12.91/13.10 % Formula: mp_greater_transitivity ( axiom ) converted to clauses:
% 12.91/13.10 cnf(mp_greater_transitivity-1, axiom, ( ~greater(_u17, _u16) | ~greater(_u16, _u15) | greater(_u17, _u15) )).
% 12.91/13.10
% 12.91/13.10 % Formula: mp_greater_or_equal ( axiom ) converted to clauses:
% 12.91/13.10 cnf(mp_greater_or_equal-1, axiom, ( ~greater_or_equal(_u22, _u20) | greater(_u22, _u20) | ( _u22 = _u20) )).
% 12.91/13.10 cnf(mp_greater_or_equal-2, axiom, ( greater_or_equal(_u23, _u21) | ~greater(_u23, _u21) )).
% 12.91/13.10 cnf(mp_greater_or_equal-3, axiom, ( greater_or_equal(_u23, _u21) | ( _u23 != _u21) )).
% 12.91/13.10
% 12.91/13.10 % Formula: d1 ( hypothesis ) converted to clauses:
% 12.91/13.10 cnf(d1-1, hypothesis, ( ~environment(_u26) | ( _u25 != critical_point(_u26)) | ~greater(growth_rate(efficient_producers, _u25), growth_rate(first_movers, _u25)) )).
% 12.91/13.10 cnf(d1-2, hypothesis, ( ~environment(_u26) | ( _u25 != critical_point(_u26)) | ~subpopulations(first_movers, efficient_producers, _u26, _u24) | ~greater(_u24, _u25) | greater(growth_rate(efficient_producers, _u24), growth_rate(first_movers, _u24)) )).
% 12.91/13.10
% 12.91/13.10 % Formula: t6 ( hypothesis ) converted to clauses:
% 12.91/13.10 cnf(t6-1, hypothesis, ( ~environment(_u28) | ~in_environment(_u28, _u27) | ~greater_or_equal(_u27, appear(efficient_producers, _u28)) | greater(cardinality_at_time(efficient_producers, _u27), zero) )).
% 12.91/13.10
% 12.91/13.10 % Formula: prove_l8 ( conjecture ) converted to clauses:
% 12.91/13.10 cnf(prove_l8-1, negated_conjecture, ( environment(skolem1) )).
% 12.91/13.10 cnf(prove_l8-2, negated_conjecture, ( in_environment(skolem1, skolem2) )).
% 12.91/13.10 cnf(prove_l8-3, negated_conjecture, ( greater(skolem2, critical_point(skolem1)) )).
% 12.91/13.10 cnf(prove_l8-4, negated_conjecture, ( ~selection_favors(efficient_producers, first_movers, skolem2) )).
% 12.91/13.10
% 12.91/13.10 % Problem matrix:
% 12.91/13.10 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 12.91/13.10 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 12.91/13.10 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 12.91/13.10 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( growth_rate(__eqx_0, __eqx_1) = growth_rate(__eqy_0, __eqy_1)) )).
% 12.91/13.10 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( cardinality_at_time(__eqx_0, __eqx_1) = cardinality_at_time(__eqy_0, __eqy_1)) )).
% 12.91/13.10 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( critical_point(__eqx_0) = critical_point(__eqy_0)) )).
% 12.91/13.10 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( appear(__eqx_0, __eqx_1) = appear(__eqy_0, __eqy_1)) )).
% 12.91/13.10 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~environment(__eqx_0) | environment(__eqy_0) )).
% 12.91/13.10 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( __eqx_3 != __eqy_3) | ~subpopulations(__eqx_0, __eqx_1, __eqx_2, __eqx_3) | subpopulations(__eqy_0, __eqy_1, __eqy_2, __eqy_3) )).
% 12.91/13.10 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater(__eqx_0, __eqx_1) | greater(__eqy_0, __eqy_1) )).
% 12.91/13.10 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ~selection_favors(__eqx_0, __eqx_1, __eqx_2) | selection_favors(__eqy_0, __eqy_1, __eqy_2) )).
% 12.91/13.10 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ~subpopulation(__eqx_0, __eqx_1, __eqx_2) | subpopulation(__eqy_0, __eqy_1, __eqy_2) )).
% 12.91/13.10 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in_environment(__eqx_0, __eqx_1) | in_environment(__eqy_0, __eqy_1) )).
% 12.91/13.10 cnf(matrix-13, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater_or_equal(__eqx_0, __eqx_1) | greater_or_equal(__eqy_0, __eqy_1) )).
% 12.91/13.10 cnf(matrix-14, plain, ( ~environment(_u3) | ~subpopulations(_u2, _u1, _u3, _u0) | ~greater(growth_rate(_u1, _u0), growth_rate(_u2, _u0)) | selection_favors(_u1, _u2, _u0) )).
% 12.91/13.10 cnf(matrix-15, plain, ( ~environment(_u7) | ~subpopulation(_u6, _u7, _u4) | ~subpopulation(_u5, _u7, _u4) | ~greater(cardinality_at_time(_u6, _u4), zero) | ( cardinality_at_time(_u5, _u4) != zero) | selection_favors(_u6, _u5, _u4) )).
% 12.91/13.10 cnf(matrix-16, plain, ( ~environment(_u9) | ~in_environment(_u9, _u8) | ~greater(cardinality_at_time(first_movers, _u8), zero) | ~greater(cardinality_at_time(efficient_producers, _u8), zero) | subpopulations(first_movers, efficient_producers, _u9, _u8) )).
% 12.91/13.10 cnf(matrix-17, plain, ( ~environment(_u11) | ~in_environment(_u11, _u10) | greater_or_equal(cardinality_at_time(first_movers, _u10), zero) )).
% 12.91/13.10 cnf(matrix-18, plain, ( ~environment(_u13) | ~in_environment(_u13, _u12) | subpopulation(first_movers, _u13, _u12) )).
% 12.91/13.10 cnf(matrix-19, plain, ( ~environment(_u13) | ~in_environment(_u13, _u12) | subpopulation(efficient_producers, _u13, _u12) )).
% 12.91/13.10 cnf(matrix-20, plain, ( ~environment(_u14) | greater_or_equal(critical_point(_u14), appear(efficient_producers, _u14)) )).
% 12.91/13.10 cnf(matrix-21, plain, ( ~greater(_u17, _u16) | ~greater(_u16, _u15) | greater(_u17, _u15) )).
% 12.91/13.10 cnf(matrix-22, plain, ( ~greater_or_equal(_u22, _u20) | greater(_u22, _u20) | ( _u22 = _u20) )).
% 12.91/13.10 cnf(matrix-23, plain, ( greater_or_equal(_u23, _u21) | ~greater(_u23, _u21) )).
% 12.91/13.10 cnf(matrix-24, plain, ( greater_or_equal(_u23, _u21) | ( _u23 != _u21) )).
% 12.91/13.10 cnf(matrix-25, plain, ( ~environment(_u26) | ( _u25 != critical_point(_u26)) | ~greater(growth_rate(efficient_producers, _u25), growth_rate(first_movers, _u25)) )).
% 12.91/13.10 cnf(matrix-26, plain, ( ~environment(_u26) | ( _u25 != critical_point(_u26)) | ~subpopulations(first_movers, efficient_producers, _u26, _u24) | ~greater(_u24, _u25) | greater(growth_rate(efficient_producers, _u24), growth_rate(first_movers, _u24)) )).
% 12.91/13.10 cnf(matrix-27, plain, ( ~environment(_u28) | ~in_environment(_u28, _u27) | ~greater_or_equal(_u27, appear(efficient_producers, _u28)) | greater(cardinality_at_time(efficient_producers, _u27), zero) )).
% 12.91/13.10 cnf(matrix-28, plain, ( environment(skolem1) )).
% 12.91/13.10 cnf(matrix-29, plain, ( in_environment(skolem1, skolem2) )).
% 12.91/13.10 cnf(matrix-30, plain, ( greater(skolem2, critical_point(skolem1)) )).
% 12.91/13.10 cnf(matrix-31, plain, ( ~selection_favors(efficient_producers, first_movers, skolem2) )).
% 12.91/13.10
% 12.91/13.10 % Proof stack:
% 12.91/13.10 cnf(proof-stack, plain,
% 12.91/13.10 proof_stack(
% 12.91/13.10 start(28),
% 12.91/13.10 left_branch(0, 27, 0, 2),
% 12.91/13.10 left_branch(0, 16, 3, 3),
% 12.91/13.10 reduction(0, 0),
% 12.91/13.10 left_branch(0, 26, 2, 5),
% 12.91/13.10 lemmata(0, 0),
% 12.91/13.10 left_branch(0, 30, 0, 7),
% 12.91/13.10 right_branch(7),
% 12.91/13.10 left_branch(0, 14, 2, 8),
% 12.91/13.10 reduction(0, 0),
% 12.91/13.10 left_branch(0, 31, 0, 10),
% 12.91/13.10 right_branch(10),
% 12.91/13.10 reduction(0, 2),
% 12.91/13.10 right_branch(8),
% 12.91/13.10 left_branch(0, 5, 1, 9),
% 12.91/13.10 left_branch(0, 0, 0, 10),
% 12.91/13.10 right_branch(10),
% 12.91/13.10 right_branch(9),
% 12.91/13.10 right_branch(5),
% 12.91/13.10 left_branch(0, 22, 1, 6),
% 12.91/13.10 left_branch(0, 17, 2, 7),
% 12.91/13.10 reduction(0, 0),
% 12.91/13.10 left_branch(0, 29, 0, 9),
% 12.91/13.10 right_branch(9),
% 12.91/13.10 right_branch(7),
% 12.91/13.10 left_branch(0, 15, 4, 8),
% 12.91/13.10 reduction(0, 0),
% 12.91/13.10 left_branch(0, 31, 0, 10),
% 12.91/13.10 right_branch(10),
% 12.91/13.10 reduction(0, 1),
% 12.91/13.10 left_branch(0, 18, 2, 12),
% 12.91/13.10 lemmata(0, 0),
% 12.91/13.10 left_branch(0, 29, 0, 14),
% 12.91/13.10 right_branch(14),
% 12.91/13.10 right_branch(12),
% 12.91/13.10 left_branch(0, 19, 2, 13),
% 12.91/13.10 lemmata(0, 0),
% 12.91/13.10 left_branch(0, 29, 0, 15),
% 12.91/13.10 right_branch(15),
% 12.91/13.10 right_branch(13),
% 12.91/13.10 right_branch(8),
% 12.91/13.10 right_branch(6),
% 12.91/13.10 left_branch(0, 29, 0, 7),
% 12.91/13.10 right_branch(7),
% 12.91/13.10 right_branch(3),
% 12.91/13.10 left_branch(0, 23, 0, 4),
% 12.91/13.10 left_branch(0, 9, 3, 5),
% 12.91/13.10 left_branch(0, 1, 1, 6),
% 12.91/13.10 left_branch(0, 0, 0, 7),
% 12.91/13.10 right_branch(7),
% 12.91/13.10 right_branch(6),
% 12.91/13.10 left_branch(0, 30, 0, 7),
% 12.91/13.10 right_branch(7),
% 12.91/13.10 left_branch(0, 22, 2, 8),
% 12.91/13.10 left_branch(0, 20, 1, 9),
% 12.91/13.10 reduction(0, 0),
% 12.91/13.10 right_branch(9),
% 12.91/13.10 left_branch(0, 21, 1, 10),
% 12.91/13.10 left_branch(0, 30, 0, 11),
% 12.91/13.10 right_branch(11),
% 12.91/13.10 reduction(0, 2),
% 12.91/13.10 right_branch(10),
% 12.91/13.10 right_branch(8),
% 12.91/13.10 right_branch(5),
% 12.91/13.10 right_branch(4),
% 12.91/13.10 left_branch(0, 29, 0, 5),
% 12.91/13.10 right_branch(5),
% 12.91/13.10 right_branch(2)
% 12.91/13.10 )).
% 12.91/13.10 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------