TSTP Solution File: MGT036+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : MGT036+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 : n022.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:57 EST 2024
% Result : Theorem 0.14s 0.36s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : MGT036+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.14 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Mar 4 04:05:03 EST 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % SZS status Theorem for theBenchmark
% 0.14/0.36 % SZS output start Proof for theBenchmark
% 0.14/0.36
% 0.14/0.36 % Formula: mp_symmetry_of_FM_and_EP ( axiom ) converted to clauses:
% 0.14/0.36 cnf(mp_symmetry_of_FM_and_EP-1, axiom, ( ~environment(_u1) | ~subpopulations(first_movers, efficient_producers, _u1, _u0) | subpopulations(efficient_producers, first_movers, _u1, _u0) )).
% 0.14/0.36
% 0.14/0.36 % Formula: mp_time_point_occur ( axiom ) converted to clauses:
% 0.14/0.36 cnf(mp_time_point_occur-1, axiom, ( ~environment(_u3) | ~subpopulations(first_movers, efficient_producers, _u3, _u2) | in_environment(_u3, _u2) )).
% 0.14/0.36
% 0.14/0.36 % Formula: mp_growth_rate_relationships ( axiom ) converted to clauses:
% 0.14/0.36 cnf(mp_growth_rate_relationships-1, axiom, ( ~greater(zero, growth_rate(_u12, _u8)) | environment(_u14) )).
% 0.14/0.36 cnf(mp_growth_rate_relationships-2, axiom, ( ~greater(zero, growth_rate(_u12, _u8)) | subpopulations(_u12, _u10, _u14, _u8) )).
% 0.14/0.36 cnf(mp_growth_rate_relationships-3, axiom, ( ~greater(zero, growth_rate(_u12, _u8)) | ~greater_or_equal(growth_rate(_u12, _u8), zero) )).
% 0.14/0.36 cnf(mp_growth_rate_relationships-4, axiom, ( greater(zero, growth_rate(_u13, _u9)) | ~environment(_u15) | ~subpopulations(_u13, _u11, _u15, _u9) | greater_or_equal(growth_rate(_u13, _u9), zero) )).
% 0.14/0.36
% 0.14/0.36 % Formula: d2 ( hypothesis ) converted to clauses:
% 0.14/0.36 cnf(d2-1, hypothesis, ( ~environment(_u19) | ~subpopulations(_u18, _u17, _u19, _u16) | ~greater_or_equal(growth_rate(_u17, _u16), zero) | ~greater(zero, growth_rate(_u18, _u16)) | outcompetes(_u17, _u18, _u16) )).
% 0.14/0.36 cnf(d2-2, hypothesis, ( ~environment(_u19) | ~subpopulations(_u18, _u17, _u19, _u16) | ~outcompetes(_u17, _u18, _u16) | greater_or_equal(growth_rate(_u17, _u16), zero) )).
% 0.14/0.36 cnf(d2-3, hypothesis, ( ~environment(_u19) | ~subpopulations(_u18, _u17, _u19, _u16) | ~outcompetes(_u17, _u18, _u16) | greater(zero, growth_rate(_u18, _u16)) )).
% 0.14/0.36
% 0.14/0.36 % Formula: a12 ( hypothesis ) converted to clauses:
% 0.14/0.36 cnf(a12-1, hypothesis, ( ~environment(_u23) | ~in_environment(_u23, _u20) | greater(zero, growth_rate(_u22, _u20)) | ~greater(resilience(_u21), resilience(_u22)) | ~greater(zero, growth_rate(_u21, _u20)) )).
% 0.14/0.36
% 0.14/0.36 % Formula: a2 ( hypothesis ) converted to clauses:
% 0.14/0.36 cnf(a2-1, hypothesis, ( greater(resilience(efficient_producers), resilience(first_movers)) )).
% 0.14/0.36
% 0.14/0.36 % Formula: prove_t5 ( conjecture ) converted to clauses:
% 0.14/0.36 cnf(prove_t5-1, negated_conjecture, ( environment(skolem1) )).
% 0.14/0.36 cnf(prove_t5-2, negated_conjecture, ( subpopulations(first_movers, efficient_producers, skolem1, skolem2) )).
% 0.14/0.36 cnf(prove_t5-3, negated_conjecture, ( outcompetes(first_movers, efficient_producers, skolem2) )).
% 0.14/0.36
% 0.14/0.36 % Problem matrix:
% 0.14/0.36 cnf(matrix-0, plain, ( ~environment(_u1) | ~subpopulations(first_movers, efficient_producers, _u1, _u0) | subpopulations(efficient_producers, first_movers, _u1, _u0) )).
% 0.14/0.36 cnf(matrix-1, plain, ( ~environment(_u3) | ~subpopulations(first_movers, efficient_producers, _u3, _u2) | in_environment(_u3, _u2) )).
% 0.14/0.36 cnf(matrix-2, plain, ( ~greater(zero, growth_rate(_u12, _u8)) | environment(_u14) )).
% 0.14/0.36 cnf(matrix-3, plain, ( ~greater(zero, growth_rate(_u12, _u8)) | subpopulations(_u12, _u10, _u14, _u8) )).
% 0.14/0.36 cnf(matrix-4, plain, ( ~greater(zero, growth_rate(_u12, _u8)) | ~greater_or_equal(growth_rate(_u12, _u8), zero) )).
% 0.14/0.36 cnf(matrix-5, plain, ( greater(zero, growth_rate(_u13, _u9)) | ~environment(_u15) | ~subpopulations(_u13, _u11, _u15, _u9) | greater_or_equal(growth_rate(_u13, _u9), zero) )).
% 0.14/0.36 cnf(matrix-6, plain, ( ~environment(_u19) | ~subpopulations(_u18, _u17, _u19, _u16) | ~greater_or_equal(growth_rate(_u17, _u16), zero) | ~greater(zero, growth_rate(_u18, _u16)) | outcompetes(_u17, _u18, _u16) )).
% 0.14/0.36 cnf(matrix-7, plain, ( ~environment(_u19) | ~subpopulations(_u18, _u17, _u19, _u16) | ~outcompetes(_u17, _u18, _u16) | greater_or_equal(growth_rate(_u17, _u16), zero) )).
% 0.14/0.36 cnf(matrix-8, plain, ( ~environment(_u19) | ~subpopulations(_u18, _u17, _u19, _u16) | ~outcompetes(_u17, _u18, _u16) | greater(zero, growth_rate(_u18, _u16)) )).
% 0.14/0.36 cnf(matrix-9, plain, ( ~environment(_u23) | ~in_environment(_u23, _u20) | greater(zero, growth_rate(_u22, _u20)) | ~greater(resilience(_u21), resilience(_u22)) | ~greater(zero, growth_rate(_u21, _u20)) )).
% 0.14/0.36 cnf(matrix-10, plain, ( greater(resilience(efficient_producers), resilience(first_movers)) )).
% 0.14/0.36 cnf(matrix-11, plain, ( environment(skolem1) )).
% 0.14/0.36 cnf(matrix-12, plain, ( subpopulations(first_movers, efficient_producers, skolem1, skolem2) )).
% 0.14/0.36 cnf(matrix-13, plain, ( outcompetes(first_movers, efficient_producers, skolem2) )).
% 0.14/0.36
% 0.14/0.36 % Proof stack:
% 0.14/0.36 cnf(proof-stack, plain,
% 0.14/0.36 proof_stack(
% 0.14/0.36 start(4),
% 0.14/0.36 left_branch(0, 9, 2, 2),
% 0.14/0.36 left_branch(0, 11, 0, 3),
% 0.14/0.36 right_branch(3),
% 0.14/0.36 left_branch(0, 10, 0, 4),
% 0.14/0.36 right_branch(4),
% 0.14/0.36 left_branch(0, 8, 3, 5),
% 0.14/0.36 left_branch(0, 11, 0, 6),
% 0.14/0.36 right_branch(6),
% 0.14/0.36 left_branch(0, 13, 0, 7),
% 0.14/0.36 right_branch(7),
% 0.14/0.36 left_branch(0, 0, 2, 8),
% 0.14/0.36 lemmata(0, 0),
% 0.14/0.36 left_branch(0, 12, 0, 10),
% 0.14/0.36 right_branch(10),
% 0.14/0.36 right_branch(8),
% 0.14/0.36 right_branch(5),
% 0.14/0.36 left_branch(0, 1, 2, 6),
% 0.14/0.36 lemmata(0, 0),
% 0.14/0.36 left_branch(0, 12, 0, 8),
% 0.14/0.36 right_branch(8),
% 0.14/0.36 right_branch(6),
% 0.14/0.36 right_branch(2),
% 0.14/0.36 left_branch(0, 7, 3, 3),
% 0.14/0.36 left_branch(0, 11, 0, 4),
% 0.14/0.36 right_branch(4),
% 0.14/0.36 left_branch(0, 13, 0, 5),
% 0.14/0.36 right_branch(5),
% 0.14/0.36 left_branch(0, 0, 2, 6),
% 0.14/0.36 lemmata(0, 1),
% 0.14/0.36 left_branch(0, 12, 0, 8),
% 0.14/0.36 right_branch(8),
% 0.14/0.36 right_branch(6),
% 0.14/0.36 right_branch(3)
% 0.14/0.36 )).
% 0.14/0.36 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------