TSTP Solution File: MGT028+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : MGT028+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 : n013.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 0.12s 0.36s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT028+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Mar 4 04:02:33 EST 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% 0.12/0.36
% 0.12/0.36 % Formula: mp_first_movers_negative_growth ( axiom ) converted to clauses:
% 0.12/0.36 cnf(mp_first_movers_negative_growth-1, axiom, ( greater(skolem2(_u4), appear(efficient_producers, _u4)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | subpopulations(first_movers, efficient_producers, _u4, skolem1(_u4, _u1)) )).
% 0.12/0.36 cnf(mp_first_movers_negative_growth-2, axiom, ( greater(skolem2(_u4), appear(efficient_producers, _u4)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | greater_or_equal(skolem1(_u4, _u1), _u1) )).
% 0.12/0.36 cnf(mp_first_movers_negative_growth-3, axiom, ( greater(skolem2(_u4), appear(efficient_producers, _u4)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | ~greater(zero, growth_rate(first_movers, skolem1(_u4, _u1))) )).
% 0.12/0.36 cnf(mp_first_movers_negative_growth-4, axiom, ( ~subpopulations(first_movers, efficient_producers, _u4, _u2) | ~greater_or_equal(_u2, skolem2(_u4)) | greater(zero, growth_rate(first_movers, _u2)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | subpopulations(first_movers, efficient_producers, _u4, skolem1(_u4, _u1)) )).
% 0.12/0.36 cnf(mp_first_movers_negative_growth-5, axiom, ( ~subpopulations(first_movers, efficient_producers, _u4, _u2) | ~greater_or_equal(_u2, skolem2(_u4)) | greater(zero, growth_rate(first_movers, _u2)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | greater_or_equal(skolem1(_u4, _u1), _u1) )).
% 0.12/0.36 cnf(mp_first_movers_negative_growth-6, axiom, ( ~subpopulations(first_movers, efficient_producers, _u4, _u2) | ~greater_or_equal(_u2, skolem2(_u4)) | greater(zero, growth_rate(first_movers, _u2)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | ~greater(zero, growth_rate(first_movers, skolem1(_u4, _u1))) )).
% 0.12/0.36
% 0.12/0.36 % Formula: l11 ( hypothesis ) converted to clauses:
% 0.12/0.36 cnf(l11-1, hypothesis, ( ~environment(_u7) | ~stable(_u7) | in_environment(_u7, skolem3(_u7)) )).
% 0.12/0.36 cnf(l11-2, hypothesis, ( ~environment(_u7) | ~stable(_u7) | ~subpopulations(first_movers, efficient_producers, _u7, _u5) | ~greater_or_equal(_u5, skolem3(_u7)) | greater(growth_rate(efficient_producers, _u5), zero) )).
% 0.12/0.36 cnf(l11-3, hypothesis, ( ~environment(_u7) | ~stable(_u7) | ~subpopulations(first_movers, efficient_producers, _u7, _u5) | ~greater_or_equal(_u5, skolem3(_u7)) | greater(zero, growth_rate(first_movers, _u5)) )).
% 0.12/0.36
% 0.12/0.36 % Formula: prove_l10 ( conjecture ) converted to clauses:
% 0.12/0.36 cnf(prove_l10-1, negated_conjecture, ( environment(skolem4) )).
% 0.12/0.36 cnf(prove_l10-2, negated_conjecture, ( stable(skolem4) )).
% 0.12/0.36 cnf(prove_l10-3, negated_conjecture, ( ~greater(_u9, appear(efficient_producers, skolem4)) | subpopulations(first_movers, efficient_producers, skolem4, skolem5(_u9)) )).
% 0.12/0.36 cnf(prove_l10-4, negated_conjecture, ( ~greater(_u9, appear(efficient_producers, skolem4)) | greater_or_equal(skolem5(_u9), _u9) )).
% 0.12/0.36 cnf(prove_l10-5, negated_conjecture, ( ~greater(_u9, appear(efficient_producers, skolem4)) | ~greater(zero, growth_rate(first_movers, skolem5(_u9))) )).
% 0.12/0.36
% 0.12/0.36 % Problem matrix:
% 0.12/0.36 cnf(matrix-0, plain, ( greater(skolem2(_u4), appear(efficient_producers, _u4)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | subpopulations(first_movers, efficient_producers, _u4, skolem1(_u4, _u1)) )).
% 0.12/0.36 cnf(matrix-1, plain, ( greater(skolem2(_u4), appear(efficient_producers, _u4)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | greater_or_equal(skolem1(_u4, _u1), _u1) )).
% 0.12/0.36 cnf(matrix-2, plain, ( greater(skolem2(_u4), appear(efficient_producers, _u4)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | ~greater(zero, growth_rate(first_movers, skolem1(_u4, _u1))) )).
% 0.12/0.36 cnf(matrix-3, plain, ( ~subpopulations(first_movers, efficient_producers, _u4, _u2) | ~greater_or_equal(_u2, skolem2(_u4)) | greater(zero, growth_rate(first_movers, _u2)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | subpopulations(first_movers, efficient_producers, _u4, skolem1(_u4, _u1)) )).
% 0.12/0.36 cnf(matrix-4, plain, ( ~subpopulations(first_movers, efficient_producers, _u4, _u2) | ~greater_or_equal(_u2, skolem2(_u4)) | greater(zero, growth_rate(first_movers, _u2)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | greater_or_equal(skolem1(_u4, _u1), _u1) )).
% 0.12/0.36 cnf(matrix-5, plain, ( ~subpopulations(first_movers, efficient_producers, _u4, _u2) | ~greater_or_equal(_u2, skolem2(_u4)) | greater(zero, growth_rate(first_movers, _u2)) | ~environment(_u4) | ~stable(_u4) | ~in_environment(_u4, _u1) | ~greater(zero, growth_rate(first_movers, skolem1(_u4, _u1))) )).
% 0.12/0.36 cnf(matrix-6, plain, ( ~environment(_u7) | ~stable(_u7) | in_environment(_u7, skolem3(_u7)) )).
% 0.12/0.36 cnf(matrix-7, plain, ( ~environment(_u7) | ~stable(_u7) | ~subpopulations(first_movers, efficient_producers, _u7, _u5) | ~greater_or_equal(_u5, skolem3(_u7)) | greater(growth_rate(efficient_producers, _u5), zero) )).
% 0.12/0.36 cnf(matrix-8, plain, ( ~environment(_u7) | ~stable(_u7) | ~subpopulations(first_movers, efficient_producers, _u7, _u5) | ~greater_or_equal(_u5, skolem3(_u7)) | greater(zero, growth_rate(first_movers, _u5)) )).
% 0.12/0.36 cnf(matrix-9, plain, ( environment(skolem4) )).
% 0.12/0.36 cnf(matrix-10, plain, ( stable(skolem4) )).
% 0.12/0.36 cnf(matrix-11, plain, ( ~greater(_u9, appear(efficient_producers, skolem4)) | subpopulations(first_movers, efficient_producers, skolem4, skolem5(_u9)) )).
% 0.12/0.36 cnf(matrix-12, plain, ( ~greater(_u9, appear(efficient_producers, skolem4)) | greater_or_equal(skolem5(_u9), _u9) )).
% 0.12/0.36 cnf(matrix-13, plain, ( ~greater(_u9, appear(efficient_producers, skolem4)) | ~greater(zero, growth_rate(first_movers, skolem5(_u9))) )).
% 0.12/0.36
% 0.12/0.36 % Proof stack:
% 0.12/0.36 cnf(proof-stack, plain,
% 0.12/0.36 proof_stack(
% 0.12/0.36 start(13),
% 0.12/0.36 left_branch(0, 2, 0, 2),
% 0.12/0.36 left_branch(0, 8, 4, 3),
% 0.12/0.36 left_branch(0, 9, 0, 4),
% 0.12/0.36 right_branch(4),
% 0.12/0.36 left_branch(0, 1, 4, 5),
% 0.12/0.36 reduction(0, 0),
% 0.12/0.36 left_branch(0, 6, 2, 7),
% 0.12/0.36 lemmata(0, 0),
% 0.12/0.36 left_branch(0, 10, 0, 9),
% 0.12/0.36 right_branch(9),
% 0.12/0.36 right_branch(7),
% 0.12/0.36 left_branch(0, 10, 0, 8),
% 0.12/0.36 right_branch(8),
% 0.12/0.36 lemmata(0, 0),
% 0.12/0.36 right_branch(5),
% 0.12/0.36 left_branch(0, 0, 4, 6),
% 0.12/0.36 reduction(0, 0),
% 0.12/0.36 left_branch(0, 6, 2, 8),
% 0.12/0.36 lemmata(0, 0),
% 0.12/0.36 left_branch(0, 10, 0, 10),
% 0.12/0.36 right_branch(10),
% 0.12/0.36 right_branch(8),
% 0.12/0.36 left_branch(0, 10, 0, 9),
% 0.12/0.36 right_branch(9),
% 0.12/0.36 lemmata(0, 0),
% 0.12/0.36 right_branch(6),
% 0.12/0.36 left_branch(0, 10, 0, 7),
% 0.12/0.36 right_branch(7),
% 0.12/0.36 right_branch(3),
% 0.12/0.36 left_branch(0, 6, 2, 4),
% 0.12/0.36 left_branch(0, 9, 0, 5),
% 0.12/0.36 right_branch(5),
% 0.12/0.36 left_branch(0, 10, 0, 6),
% 0.12/0.36 right_branch(6),
% 0.12/0.36 right_branch(4),
% 0.12/0.36 left_branch(0, 10, 0, 5),
% 0.12/0.36 right_branch(5),
% 0.12/0.36 left_branch(0, 9, 0, 6),
% 0.12/0.36 right_branch(6),
% 0.12/0.36 right_branch(2),
% 0.12/0.36 left_branch(0, 5, 2, 3),
% 0.12/0.36 left_branch(0, 11, 1, 4),
% 0.12/0.36 lemmata(0, 0),
% 0.12/0.36 right_branch(4),
% 0.12/0.36 left_branch(0, 6, 2, 5),
% 0.12/0.36 left_branch(0, 9, 0, 6),
% 0.12/0.36 right_branch(6),
% 0.12/0.36 left_branch(0, 10, 0, 7),
% 0.12/0.36 right_branch(7),
% 0.12/0.36 right_branch(5),
% 0.12/0.36 left_branch(0, 10, 0, 6),
% 0.12/0.36 right_branch(6),
% 0.12/0.36 left_branch(0, 9, 0, 7),
% 0.12/0.36 right_branch(7),
% 0.12/0.36 left_branch(0, 8, 4, 8),
% 0.12/0.36 left_branch(0, 9, 0, 9),
% 0.12/0.36 right_branch(9),
% 0.12/0.36 left_branch(0, 4, 6, 10),
% 0.12/0.36 left_branch(0, 11, 1, 11),
% 0.12/0.36 left_branch(0, 1, 0, 12),
% 0.12/0.36 reduction(0, 2),
% 0.12/0.36 lemmata(0, 2),
% 0.12/0.36 lemmata(0, 3),
% 0.12/0.36 lemmata(0, 4),
% 0.12/0.36 right_branch(12),
% 0.12/0.36 right_branch(11),
% 0.12/0.36 lemmata(0, 2),
% 0.12/0.36 lemmata(0, 3),
% 0.12/0.36 lemmata(0, 4),
% 0.12/0.36 reduction(0, 0),
% 0.12/0.36 left_branch(0, 12, 1, 16),
% 0.12/0.36 lemmata(0, 0),
% 0.12/0.36 right_branch(16),
% 0.12/0.36 right_branch(10),
% 0.12/0.36 left_branch(0, 3, 6, 11),
% 0.12/0.36 left_branch(0, 11, 1, 12),
% 0.12/0.36 left_branch(0, 0, 0, 13),
% 0.12/0.36 reduction(0, 2),
% 0.12/0.36 lemmata(0, 2),
% 0.12/0.36 lemmata(0, 3),
% 0.12/0.36 lemmata(0, 4),
% 0.12/0.36 right_branch(13),
% 0.12/0.36 right_branch(12),
% 0.12/0.36 lemmata(0, 2),
% 0.12/0.36 lemmata(0, 3),
% 0.12/0.36 lemmata(0, 4),
% 0.12/0.36 reduction(0, 0),
% 0.12/0.36 left_branch(0, 12, 1, 17),
% 0.12/0.36 lemmata(0, 0),
% 0.12/0.36 right_branch(17),
% 0.12/0.36 right_branch(11),
% 0.12/0.36 lemmata(0, 3),
% 0.12/0.36 right_branch(8),
% 0.12/0.36 left_branch(0, 12, 1, 9),
% 0.12/0.36 lemmata(0, 0),
% 0.12/0.36 right_branch(9),
% 0.12/0.36 right_branch(3)
% 0.12/0.36 )).
% 0.12/0.36 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------