TSTP Solution File: MGT036+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : MGT036+3 : 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 : n021.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.14s 0.36s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT036+3 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.35 % Computer : n021.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 : Thu Mar 21 03:15:48 EDT 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_subpopulations ( axiom ) converted to clauses:
% 0.14/0.36 cnf(mp_symmetry_of_subpopulations-1, axiom, ( ~environment(_u3) | ~subpopulations(_u2, _u1, _u3, _u0) | subpopulations(_u1, _u2, _u3, _u0) )).
% 0.14/0.36
% 0.14/0.36 % Formula: d2 ( hypothesis ) converted to clauses:
% 0.14/0.36 cnf(d2-1, hypothesis, ( ~environment(_u7) | ~subpopulations(_u6, _u5, _u7, _u4) | ~greater_or_equal(growth_rate(_u5, _u4), zero) | ~greater(zero, growth_rate(_u6, _u4)) | outcompetes(_u5, _u6, _u4) )).
% 0.14/0.36 cnf(d2-2, hypothesis, ( ~environment(_u7) | ~subpopulations(_u6, _u5, _u7, _u4) | ~outcompetes(_u5, _u6, _u4) | greater_or_equal(growth_rate(_u5, _u4), zero) )).
% 0.14/0.36 cnf(d2-3, hypothesis, ( ~environment(_u7) | ~subpopulations(_u6, _u5, _u7, _u4) | ~outcompetes(_u5, _u6, _u4) | greater(zero, growth_rate(_u6, _u4)) )).
% 0.14/0.36
% 0.14/0.36 % Formula: a13_star ( hypothesis ) converted to clauses:
% 0.14/0.36 cnf(a13_star-1, hypothesis, ( environment(skolem1) )).
% 0.14/0.36 cnf(a13_star-2, hypothesis, ( subpopulations(first_movers, efficient_producers, skolem1, skolem2) )).
% 0.14/0.36 cnf(a13_star-3, hypothesis, ( greater_or_equal(growth_rate(first_movers, skolem2), zero) )).
% 0.14/0.36 cnf(a13_star-4, hypothesis, ( greater(zero, growth_rate(efficient_producers, skolem2)) )).
% 0.14/0.36
% 0.14/0.36 % Formula: prove_t5_star ( conjecture ) (definitionally) converted to clauses:
% 0.14/0.36 cnf(prove_t5_star-1, negated_conjecture, ( ~environment(_u11) | ~subpopulations(first_movers, efficient_producers, _u11, _u10) | ~outcompetes(first_movers, efficient_producers, _u10) )).
% 0.14/0.36
% 0.14/0.36 % Problem matrix:
% 0.14/0.36 cnf(matrix-0, plain, ( ~environment(_u3) | ~subpopulations(_u2, _u1, _u3, _u0) | subpopulations(_u1, _u2, _u3, _u0) )).
% 0.14/0.36 cnf(matrix-1, plain, ( ~environment(_u7) | ~subpopulations(_u6, _u5, _u7, _u4) | ~greater_or_equal(growth_rate(_u5, _u4), zero) | ~greater(zero, growth_rate(_u6, _u4)) | outcompetes(_u5, _u6, _u4) )).
% 0.14/0.36 cnf(matrix-2, plain, ( ~environment(_u7) | ~subpopulations(_u6, _u5, _u7, _u4) | ~outcompetes(_u5, _u6, _u4) | greater_or_equal(growth_rate(_u5, _u4), zero) )).
% 0.14/0.36 cnf(matrix-3, plain, ( ~environment(_u7) | ~subpopulations(_u6, _u5, _u7, _u4) | ~outcompetes(_u5, _u6, _u4) | greater(zero, growth_rate(_u6, _u4)) )).
% 0.14/0.36 cnf(matrix-4, plain, ( environment(skolem1) )).
% 0.14/0.36 cnf(matrix-5, plain, ( subpopulations(first_movers, efficient_producers, skolem1, skolem2) )).
% 0.14/0.36 cnf(matrix-6, plain, ( greater_or_equal(growth_rate(first_movers, skolem2), zero) )).
% 0.14/0.36 cnf(matrix-7, plain, ( greater(zero, growth_rate(efficient_producers, skolem2)) )).
% 0.14/0.36 cnf(matrix-8, plain, ( ~environment(_u11) | ~subpopulations(first_movers, efficient_producers, _u11, _u10) | ~outcompetes(first_movers, efficient_producers, _u10) )).
% 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(8),
% 0.14/0.36 left_branch(0, 4, 0, 2),
% 0.14/0.36 right_branch(2),
% 0.14/0.36 left_branch(0, 1, 4, 3),
% 0.14/0.36 left_branch(0, 4, 0, 4),
% 0.14/0.36 right_branch(4),
% 0.14/0.36 left_branch(0, 7, 0, 5),
% 0.14/0.36 right_branch(5),
% 0.14/0.36 left_branch(0, 6, 0, 6),
% 0.14/0.36 right_branch(6),
% 0.14/0.36 left_branch(0, 0, 2, 7),
% 0.14/0.36 lemmata(0, 0),
% 0.14/0.36 left_branch(0, 5, 0, 9),
% 0.14/0.36 right_branch(9),
% 0.14/0.36 right_branch(7),
% 0.14/0.36 right_branch(3),
% 0.14/0.36 left_branch(0, 5, 0, 4),
% 0.14/0.36 right_branch(4)
% 0.14/0.36 )).
% 0.14/0.36 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------