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