TSTP Solution File: MGT032+2 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : MGT032+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 : n020.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:53 EDT 2024
% Result : Theorem 0.13s 0.34s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT032+2 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n020.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:17:28 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start Proof for theBenchmark
% 0.13/0.34
% 0.13/0.34 % Formula: mp1_high_growth_rates ( axiom ) converted to clauses:
% 0.13/0.34 cnf(mp1_high_growth_rates-1, axiom, ( ~environment(_u3) | ~subpopulations(_u2, _u1, _u3, _u0) | ~greater(growth_rate(_u1, _u0), growth_rate(_u2, _u0)) | selection_favors(_u1, _u2, _u0) )).
% 0.13/0.34
% 0.13/0.34 % Formula: l1 ( hypothesis ) converted to clauses:
% 0.13/0.34 cnf(l1-1, hypothesis, ( ~environment(_u6) | ~stable(_u6) | in_environment(_u6, skolem1(_u6)) )).
% 0.13/0.34 cnf(l1-2, hypothesis, ( ~environment(_u6) | ~stable(_u6) | ~subpopulations(first_movers, efficient_producers, _u6, _u4) | ~greater_or_equal(_u4, skolem1(_u6)) | greater(growth_rate(efficient_producers, _u4), growth_rate(first_movers, _u4)) )).
% 0.13/0.34
% 0.13/0.34 % Formula: prove_t1 ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.34 cnf(prove_t1-1, negated_conjecture, ( environment(skolem2) )).
% 0.13/0.34 cnf(prove_t1-2, negated_conjecture, ( stable(skolem2) )).
% 0.13/0.34 cnf(prove_t1-3, negated_conjecture, ( ~in_environment(skolem2, _u8) | ~_def0(_u8) )).
% 0.13/0.34 cnf(prove_t1-4, negated_conjecture, ( _def0(_u8) | subpopulations(first_movers, efficient_producers, skolem2, skolem3(_u8)) )).
% 0.13/0.34 cnf(prove_t1-5, negated_conjecture, ( _def0(_u8) | greater_or_equal(skolem3(_u8), _u8) )).
% 0.13/0.34 cnf(prove_t1-6, negated_conjecture, ( _def0(_u8) | ~selection_favors(efficient_producers, first_movers, skolem3(_u8)) )).
% 0.13/0.34
% 0.13/0.34 % Problem matrix:
% 0.13/0.34 cnf(matrix-0, plain, ( ~environment(_u3) | ~subpopulations(_u2, _u1, _u3, _u0) | ~greater(growth_rate(_u1, _u0), growth_rate(_u2, _u0)) | selection_favors(_u1, _u2, _u0) )).
% 0.13/0.34 cnf(matrix-1, plain, ( ~environment(_u6) | ~stable(_u6) | in_environment(_u6, skolem1(_u6)) )).
% 0.13/0.34 cnf(matrix-2, plain, ( ~environment(_u6) | ~stable(_u6) | ~subpopulations(first_movers, efficient_producers, _u6, _u4) | ~greater_or_equal(_u4, skolem1(_u6)) | greater(growth_rate(efficient_producers, _u4), growth_rate(first_movers, _u4)) )).
% 0.13/0.34 cnf(matrix-3, plain, ( environment(skolem2) )).
% 0.13/0.34 cnf(matrix-4, plain, ( stable(skolem2) )).
% 0.13/0.34 cnf(matrix-5, plain, ( ~in_environment(skolem2, _u8) | ~_def0(_u8) )).
% 0.13/0.34 cnf(matrix-6, plain, ( _def0(_u8) | subpopulations(first_movers, efficient_producers, skolem2, skolem3(_u8)) )).
% 0.13/0.34 cnf(matrix-7, plain, ( _def0(_u8) | greater_or_equal(skolem3(_u8), _u8) )).
% 0.13/0.34 cnf(matrix-8, plain, ( _def0(_u8) | ~selection_favors(efficient_producers, first_movers, skolem3(_u8)) )).
% 0.13/0.34
% 0.13/0.34 % Proof stack:
% 0.13/0.34 cnf(proof-stack, plain,
% 0.13/0.34 proof_stack(
% 0.13/0.34 start(5),
% 0.13/0.34 left_branch(0, 1, 2, 2),
% 0.13/0.34 left_branch(0, 3, 0, 3),
% 0.13/0.34 right_branch(3),
% 0.13/0.34 left_branch(0, 4, 0, 4),
% 0.13/0.34 right_branch(4),
% 0.13/0.34 right_branch(2),
% 0.13/0.34 left_branch(0, 8, 0, 3),
% 0.13/0.34 left_branch(0, 0, 3, 4),
% 0.13/0.34 left_branch(0, 3, 0, 5),
% 0.13/0.34 right_branch(5),
% 0.13/0.34 left_branch(0, 2, 4, 6),
% 0.13/0.34 left_branch(0, 3, 0, 7),
% 0.13/0.34 right_branch(7),
% 0.13/0.34 left_branch(0, 7, 1, 8),
% 0.13/0.34 reduction(0, 0),
% 0.13/0.34 right_branch(8),
% 0.13/0.34 left_branch(0, 6, 1, 9),
% 0.13/0.34 reduction(0, 0),
% 0.13/0.34 right_branch(9),
% 0.13/0.34 left_branch(0, 4, 0, 10),
% 0.13/0.34 right_branch(10),
% 0.13/0.34 right_branch(6),
% 0.13/0.34 left_branch(0, 6, 1, 7),
% 0.13/0.34 reduction(0, 0),
% 0.13/0.34 right_branch(7),
% 0.13/0.34 right_branch(4),
% 0.13/0.34 right_branch(3)
% 0.13/0.34 )).
% 0.13/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------