TSTP Solution File: MGT020+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : MGT020+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 : n019.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:53 EST 2024
% Result : Theorem 12.44s 12.64s
% Output : Proof 12.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT020+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.32 % Computer : n019.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Mar 4 04:15:51 EST 2024
% 0.12/0.32 % CPUTime :
% 12.44/12.64 % SZS status Theorem for theBenchmark
% 12.44/12.64 % SZS output start Proof for theBenchmark
% 12.44/12.64
% 12.44/12.64 % Formula: l3 ( axiom ) converted to clauses:
% 12.44/12.64 cnf(l3-1, axiom, ( ~environment(_u1) | ~subpopulations(first_movers, efficient_producers, _u1, _u0) | ~decreases(difference(disbanding_rate(first_movers, _u0), disbanding_rate(efficient_producers, _u0))) )).
% 12.44/12.64
% 12.44/12.64 % Formula: mp_earliest_time_point ( axiom ) converted to clauses:
% 12.44/12.64 cnf(mp_earliest_time_point-1, axiom, ( ~environment(_u3) | ~in_environment(_u3, initial_FM_EP(_u3)) | subpopulations(first_movers, efficient_producers, _u3, initial_FM_EP(_u3)) )).
% 12.44/12.64 cnf(mp_earliest_time_point-2, axiom, ( ~environment(_u3) | ~subpopulations(first_movers, efficient_producers, _u3, _u2) | greater_or_equal(_u2, initial_FM_EP(_u3)) )).
% 12.44/12.64
% 12.44/12.64 % Formula: mp_positive_function_difference ( axiom ) converted to clauses:
% 12.44/12.64 cnf(mp_positive_function_difference-1, axiom, ( ~environment(_u7) | ~greater_or_equal(_u6, _u5) | ~greater_or_equal(_u4, _u6) | ~subpopulations(first_movers, efficient_producers, _u7, _u4) | ~greater(disbanding_rate(first_movers, _u5), disbanding_rate(efficient_producers, _u5)) | decreases(difference(disbanding_rate(first_movers, _u6), disbanding_rate(efficient_producers, _u6))) | greater(disbanding_rate(first_movers, _u4), disbanding_rate(efficient_producers, _u4)) )).
% 12.44/12.64
% 12.44/12.64 % Formula: mp_time_point_occurs ( axiom ) converted to clauses:
% 12.44/12.64 cnf(mp_time_point_occurs-1, axiom, ( ~environment(_u9) | ~subpopulations(first_movers, efficient_producers, _u9, _u8) | in_environment(_u9, _u8) )).
% 12.44/12.64
% 12.44/12.64 % Formula: mp_initial_time ( axiom ) converted to clauses:
% 12.44/12.64 cnf(mp_initial_time-1, axiom, ( ~environment(_u10) | greater_or_equal(initial_FM_EP(_u10), start_time(_u10)) )).
% 12.44/12.64
% 12.44/12.64 % Formula: mp_times_in_order ( axiom ) converted to clauses:
% 12.44/12.64 cnf(mp_times_in_order-1, axiom, ( in_environment(_u13, _u12) | ~environment(_u13) | ~greater_or_equal(_u12, start_time(_u13)) | ~greater(_u11, _u12) | ~in_environment(_u13, _u11) )).
% 12.44/12.64
% 12.44/12.64 % Formula: mp_greater_transitivity ( axiom ) converted to clauses:
% 12.44/12.64 cnf(mp_greater_transitivity-1, axiom, ( ~greater(_u16, _u15) | ~greater(_u15, _u14) | greater(_u16, _u14) )).
% 12.44/12.64
% 12.44/12.64 % Formula: mp_greater_or_equal ( axiom ) converted to clauses:
% 12.44/12.64 cnf(mp_greater_or_equal-1, axiom, ( ~greater_or_equal(_u18, _u17) | greater(_u18, _u17) | ( _u18 = _u17) )).
% 12.44/12.64
% 12.44/12.64 % Formula: a8 ( hypothesis ) converted to clauses:
% 12.44/12.64 cnf(a8-1, hypothesis, ( ~environment(_u19) | greater(disbanding_rate(first_movers, initial_FM_EP(_u19)), disbanding_rate(efficient_producers, initial_FM_EP(_u19))) )).
% 12.44/12.64
% 12.44/12.64 % Formula: a10 ( hypothesis ) converted to clauses:
% 12.44/12.64 cnf(a10-1, hypothesis, ( ~environment(_u23) | ~subpopulations(first_movers, efficient_producers, _u23, _u22) | ~subpopulations(first_movers, efficient_producers, _u23, _u21) | ~greater_or_equal(_u20, _u22) | ~greater_or_equal(_u21, _u20) | subpopulations(first_movers, efficient_producers, _u23, _u20) )).
% 12.44/12.64
% 12.44/12.64 % Formula: prove_l2 ( conjecture ) converted to clauses:
% 12.44/12.64 cnf(prove_l2-1, negated_conjecture, ( environment(skolem1) )).
% 12.44/12.64 cnf(prove_l2-2, negated_conjecture, ( subpopulations(first_movers, efficient_producers, skolem1, skolem2) )).
% 12.44/12.64 cnf(prove_l2-3, negated_conjecture, ( ~greater(disbanding_rate(first_movers, skolem2), disbanding_rate(efficient_producers, skolem2)) )).
% 12.44/12.64
% 12.44/12.64 % Problem matrix:
% 12.44/12.64 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 12.44/12.64 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 12.44/12.64 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 12.44/12.64 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( disbanding_rate(__eqx_0, __eqx_1) = disbanding_rate(__eqy_0, __eqy_1)) )).
% 12.44/12.64 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( difference(__eqx_0, __eqx_1) = difference(__eqy_0, __eqy_1)) )).
% 12.44/12.64 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( initial_FM_EP(__eqx_0) = initial_FM_EP(__eqy_0)) )).
% 12.44/12.64 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( start_time(__eqx_0) = start_time(__eqy_0)) )).
% 12.44/12.64 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~environment(__eqx_0) | environment(__eqy_0) )).
% 12.44/12.64 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.44/12.64 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ~decreases(__eqx_0) | decreases(__eqy_0) )).
% 12.44/12.64 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in_environment(__eqx_0, __eqx_1) | in_environment(__eqy_0, __eqy_1) )).
% 12.44/12.64 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater_or_equal(__eqx_0, __eqx_1) | greater_or_equal(__eqy_0, __eqy_1) )).
% 12.44/12.64 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater(__eqx_0, __eqx_1) | greater(__eqy_0, __eqy_1) )).
% 12.44/12.64 cnf(matrix-13, plain, ( ~environment(_u1) | ~subpopulations(first_movers, efficient_producers, _u1, _u0) | ~decreases(difference(disbanding_rate(first_movers, _u0), disbanding_rate(efficient_producers, _u0))) )).
% 12.44/12.64 cnf(matrix-14, plain, ( ~environment(_u3) | ~in_environment(_u3, initial_FM_EP(_u3)) | subpopulations(first_movers, efficient_producers, _u3, initial_FM_EP(_u3)) )).
% 12.44/12.64 cnf(matrix-15, plain, ( ~environment(_u3) | ~subpopulations(first_movers, efficient_producers, _u3, _u2) | greater_or_equal(_u2, initial_FM_EP(_u3)) )).
% 12.44/12.64 cnf(matrix-16, plain, ( ~environment(_u7) | ~greater_or_equal(_u6, _u5) | ~greater_or_equal(_u4, _u6) | ~subpopulations(first_movers, efficient_producers, _u7, _u4) | ~greater(disbanding_rate(first_movers, _u5), disbanding_rate(efficient_producers, _u5)) | decreases(difference(disbanding_rate(first_movers, _u6), disbanding_rate(efficient_producers, _u6))) | greater(disbanding_rate(first_movers, _u4), disbanding_rate(efficient_producers, _u4)) )).
% 12.44/12.64 cnf(matrix-17, plain, ( ~environment(_u9) | ~subpopulations(first_movers, efficient_producers, _u9, _u8) | in_environment(_u9, _u8) )).
% 12.44/12.64 cnf(matrix-18, plain, ( ~environment(_u10) | greater_or_equal(initial_FM_EP(_u10), start_time(_u10)) )).
% 12.44/12.64 cnf(matrix-19, plain, ( in_environment(_u13, _u12) | ~environment(_u13) | ~greater_or_equal(_u12, start_time(_u13)) | ~greater(_u11, _u12) | ~in_environment(_u13, _u11) )).
% 12.44/12.64 cnf(matrix-20, plain, ( ~greater(_u16, _u15) | ~greater(_u15, _u14) | greater(_u16, _u14) )).
% 12.44/12.64 cnf(matrix-21, plain, ( ~greater_or_equal(_u18, _u17) | greater(_u18, _u17) | ( _u18 = _u17) )).
% 12.44/12.64 cnf(matrix-22, plain, ( ~environment(_u19) | greater(disbanding_rate(first_movers, initial_FM_EP(_u19)), disbanding_rate(efficient_producers, initial_FM_EP(_u19))) )).
% 12.44/12.64 cnf(matrix-23, plain, ( ~environment(_u23) | ~subpopulations(first_movers, efficient_producers, _u23, _u22) | ~subpopulations(first_movers, efficient_producers, _u23, _u21) | ~greater_or_equal(_u20, _u22) | ~greater_or_equal(_u21, _u20) | subpopulations(first_movers, efficient_producers, _u23, _u20) )).
% 12.44/12.64 cnf(matrix-24, plain, ( environment(skolem1) )).
% 12.44/12.64 cnf(matrix-25, plain, ( subpopulations(first_movers, efficient_producers, skolem1, skolem2) )).
% 12.44/12.64 cnf(matrix-26, plain, ( ~greater(disbanding_rate(first_movers, skolem2), disbanding_rate(efficient_producers, skolem2)) )).
% 12.44/12.64
% 12.44/12.64 % Proof stack:
% 12.44/12.64 cnf(proof-stack, plain,
% 12.44/12.64 proof_stack(
% 12.44/12.64 start(24),
% 12.44/12.64 left_branch(0, 19, 1, 2),
% 12.44/12.64 left_branch(0, 14, 1, 3),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 left_branch(0, 16, 3, 5),
% 12.44/12.64 lemmata(0, 0),
% 12.44/12.64 left_branch(0, 13, 2, 7),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 reduction(0, 2),
% 12.44/12.64 right_branch(7),
% 12.44/12.64 left_branch(0, 22, 1, 8),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 right_branch(8),
% 12.44/12.64 left_branch(0, 16, 4, 9),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 left_branch(0, 13, 2, 11),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 reduction(0, 2),
% 12.44/12.64 right_branch(11),
% 12.44/12.64 left_branch(0, 26, 0, 12),
% 12.44/12.64 right_branch(12),
% 12.44/12.64 left_branch(0, 25, 0, 13),
% 12.44/12.64 right_branch(13),
% 12.44/12.64 left_branch(0, 15, 2, 14),
% 12.44/12.64 lemmata(0, 0),
% 12.44/12.64 lemmata(0, 6),
% 12.44/12.64 right_branch(14),
% 12.44/12.64 left_branch(0, 15, 2, 15),
% 12.44/12.64 lemmata(0, 0),
% 12.44/12.64 reduction(0, 2),
% 12.44/12.64 right_branch(15),
% 12.44/12.64 right_branch(9),
% 12.44/12.64 left_branch(0, 15, 2, 10),
% 12.44/12.64 lemmata(0, 0),
% 12.44/12.64 reduction(0, 2),
% 12.44/12.64 right_branch(10),
% 12.44/12.64 lemmata(0, 4),
% 12.44/12.64 right_branch(5),
% 12.44/12.64 right_branch(3),
% 12.44/12.64 left_branch(0, 21, 1, 4),
% 12.44/12.64 left_branch(0, 15, 2, 5),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 left_branch(0, 25, 0, 7),
% 12.44/12.64 right_branch(7),
% 12.44/12.64 right_branch(5),
% 12.44/12.64 left_branch(0, 11, 0, 6),
% 12.44/12.64 left_branch(0, 23, 3, 7),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 reduction(0, 3),
% 12.44/12.64 left_branch(0, 17, 1, 10),
% 12.44/12.64 lemmata(0, 2),
% 12.44/12.64 lemmata(0, 0),
% 12.44/12.64 right_branch(10),
% 12.44/12.64 left_branch(0, 8, 5, 11),
% 12.44/12.64 left_branch(0, 0, 0, 12),
% 12.44/12.64 right_branch(12),
% 12.44/12.64 left_branch(0, 25, 0, 13),
% 12.44/12.64 right_branch(13),
% 12.44/12.64 reduction(0, 2),
% 12.44/12.64 left_branch(0, 0, 0, 15),
% 12.44/12.64 right_branch(15),
% 12.44/12.64 left_branch(0, 0, 0, 16),
% 12.44/12.64 right_branch(16),
% 12.44/12.64 right_branch(11),
% 12.44/12.64 lemmata(0, 5),
% 12.44/12.64 right_branch(7),
% 12.44/12.64 left_branch(0, 15, 2, 8),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 left_branch(0, 25, 0, 10),
% 12.44/12.64 right_branch(10),
% 12.44/12.64 right_branch(8),
% 12.44/12.64 left_branch(0, 5, 1, 9),
% 12.44/12.64 left_branch(0, 0, 0, 10),
% 12.44/12.64 right_branch(10),
% 12.44/12.64 right_branch(9),
% 12.44/12.64 right_branch(6),
% 12.44/12.64 right_branch(4),
% 12.44/12.64 left_branch(0, 18, 1, 5),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 right_branch(5),
% 12.44/12.64 left_branch(0, 17, 2, 6),
% 12.44/12.64 reduction(0, 0),
% 12.44/12.64 left_branch(0, 25, 0, 8),
% 12.44/12.64 right_branch(8),
% 12.44/12.64 right_branch(6),
% 12.44/12.64 right_branch(2)
% 12.44/12.64 )).
% 12.44/12.64 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------