TSTP Solution File: MGT008+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : MGT008+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 : n005.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:46 EDT 2024
% Result : Theorem 0.14s 0.35s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT008+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Mar 21 03:08:30 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % SZS status Theorem for theBenchmark
% 0.14/0.35 % SZS output start Proof for theBenchmark
% 0.14/0.35
% 0.14/0.35 % Formula: mp5 ( axiom ) converted to clauses:
% 0.14/0.35 cnf(mp5-1, axiom, ( ~organization(_u2, _u1) | inertia(_u2, skolem1(_u2, _u1), _u1) )).
% 0.14/0.35
% 0.14/0.35 % Formula: a5_FOL ( hypothesis ) converted to clauses:
% 0.14/0.35 cnf(a5_FOL-1, hypothesis, ( greater(_u5, _u6) | ~greater(_u7, _u8) | ~organization(_u10, _u3) | ~class(_u10, _u9, _u3) | ~size(_u10, _u7, _u3) | ~inertia(_u10, _u5, _u3) | ~organization(_u11, _u4) | ~class(_u11, _u9, _u4) | ~size(_u11, _u8, _u4) | ~inertia(_u11, _u6, _u4) )).
% 0.14/0.35
% 0.14/0.35 % Formula: t1_FOL ( hypothesis ) converted to clauses:
% 0.14/0.35 cnf(t1_FOL-1, hypothesis, ( ~organization(_u19, _u17) | ~organization(_u18, _u16) | ~reorganization_free(_u19, _u17, _u17) | ~reorganization_free(_u18, _u16, _u16) | ~inertia(_u19, _u15, _u17) | ~inertia(_u18, _u14, _u16) | ~survival_chance(_u19, _u13, _u17) | ~survival_chance(_u18, _u12, _u16) | ~greater(_u14, _u15) | greater(_u12, _u13) )).
% 0.14/0.35
% 0.14/0.35 % Formula: t8_FOL ( conjecture ) (definitionally) converted to clauses:
% 0.14/0.35 cnf(t8_FOL-1, negated_conjecture, ( organization(skolem2, skolem9) )).
% 0.14/0.35 cnf(t8_FOL-2, negated_conjecture, ( organization(skolem3, skolem10) )).
% 0.14/0.35 cnf(t8_FOL-3, negated_conjecture, ( reorganization_free(skolem2, skolem9, skolem9) )).
% 0.14/0.35 cnf(t8_FOL-4, negated_conjecture, ( reorganization_free(skolem3, skolem10, skolem10) )).
% 0.14/0.35 cnf(t8_FOL-5, negated_conjecture, ( class(skolem2, skolem4, skolem9) )).
% 0.14/0.35 cnf(t8_FOL-6, negated_conjecture, ( class(skolem3, skolem4, skolem10) )).
% 0.14/0.35 cnf(t8_FOL-7, negated_conjecture, ( survival_chance(skolem2, skolem5, skolem9) )).
% 0.14/0.35 cnf(t8_FOL-8, negated_conjecture, ( survival_chance(skolem3, skolem6, skolem10) )).
% 0.14/0.35 cnf(t8_FOL-9, negated_conjecture, ( size(skolem2, skolem7, skolem9) )).
% 0.14/0.35 cnf(t8_FOL-10, negated_conjecture, ( size(skolem3, skolem8, skolem10) )).
% 0.14/0.35 cnf(t8_FOL-11, negated_conjecture, ( greater(skolem8, skolem7) )).
% 0.14/0.35 cnf(t8_FOL-12, negated_conjecture, ( ~greater(skolem6, skolem5) )).
% 0.14/0.35
% 0.14/0.35 % Problem matrix:
% 0.14/0.35 cnf(matrix-0, plain, ( ~organization(_u2, _u1) | inertia(_u2, skolem1(_u2, _u1), _u1) )).
% 0.14/0.35 cnf(matrix-1, plain, ( greater(_u5, _u6) | ~greater(_u7, _u8) | ~organization(_u10, _u3) | ~class(_u10, _u9, _u3) | ~size(_u10, _u7, _u3) | ~inertia(_u10, _u5, _u3) | ~organization(_u11, _u4) | ~class(_u11, _u9, _u4) | ~size(_u11, _u8, _u4) | ~inertia(_u11, _u6, _u4) )).
% 0.14/0.35 cnf(matrix-2, plain, ( ~organization(_u19, _u17) | ~organization(_u18, _u16) | ~reorganization_free(_u19, _u17, _u17) | ~reorganization_free(_u18, _u16, _u16) | ~inertia(_u19, _u15, _u17) | ~inertia(_u18, _u14, _u16) | ~survival_chance(_u19, _u13, _u17) | ~survival_chance(_u18, _u12, _u16) | ~greater(_u14, _u15) | greater(_u12, _u13) )).
% 0.14/0.35 cnf(matrix-3, plain, ( organization(skolem2, skolem9) )).
% 0.14/0.35 cnf(matrix-4, plain, ( organization(skolem3, skolem10) )).
% 0.14/0.35 cnf(matrix-5, plain, ( reorganization_free(skolem2, skolem9, skolem9) )).
% 0.14/0.35 cnf(matrix-6, plain, ( reorganization_free(skolem3, skolem10, skolem10) )).
% 0.14/0.35 cnf(matrix-7, plain, ( class(skolem2, skolem4, skolem9) )).
% 0.14/0.35 cnf(matrix-8, plain, ( class(skolem3, skolem4, skolem10) )).
% 0.14/0.35 cnf(matrix-9, plain, ( survival_chance(skolem2, skolem5, skolem9) )).
% 0.14/0.35 cnf(matrix-10, plain, ( survival_chance(skolem3, skolem6, skolem10) )).
% 0.14/0.35 cnf(matrix-11, plain, ( size(skolem2, skolem7, skolem9) )).
% 0.14/0.35 cnf(matrix-12, plain, ( size(skolem3, skolem8, skolem10) )).
% 0.14/0.35 cnf(matrix-13, plain, ( greater(skolem8, skolem7) )).
% 0.14/0.35 cnf(matrix-14, plain, ( ~greater(skolem6, skolem5) )).
% 0.14/0.35
% 0.14/0.35 % Proof stack:
% 0.14/0.35 cnf(proof-stack, plain,
% 0.14/0.35 proof_stack(
% 0.14/0.35 start(14),
% 0.14/0.35 left_branch(0, 2, 9, 2),
% 0.14/0.35 left_branch(0, 3, 0, 3),
% 0.14/0.35 right_branch(3),
% 0.14/0.35 left_branch(0, 1, 0, 4),
% 0.14/0.35 left_branch(0, 0, 1, 5),
% 0.14/0.35 left_branch(0, 3, 0, 6),
% 0.14/0.35 right_branch(6),
% 0.14/0.35 right_branch(5),
% 0.14/0.35 left_branch(0, 11, 0, 6),
% 0.14/0.35 right_branch(6),
% 0.14/0.35 left_branch(0, 7, 0, 7),
% 0.14/0.35 right_branch(7),
% 0.14/0.35 lemmata(0, 0),
% 0.14/0.35 left_branch(0, 0, 1, 9),
% 0.14/0.35 left_branch(0, 4, 0, 10),
% 0.14/0.35 right_branch(10),
% 0.14/0.35 right_branch(9),
% 0.14/0.35 left_branch(0, 12, 0, 10),
% 0.14/0.35 right_branch(10),
% 0.14/0.35 left_branch(0, 8, 0, 11),
% 0.14/0.35 right_branch(11),
% 0.14/0.35 left_branch(0, 4, 0, 12),
% 0.14/0.35 right_branch(12),
% 0.14/0.35 left_branch(0, 13, 0, 13),
% 0.14/0.35 right_branch(13),
% 0.14/0.35 right_branch(4),
% 0.14/0.35 left_branch(0, 10, 0, 5),
% 0.14/0.35 right_branch(5),
% 0.14/0.35 left_branch(0, 9, 0, 6),
% 0.14/0.35 right_branch(6),
% 0.14/0.35 left_branch(0, 0, 1, 7),
% 0.14/0.35 left_branch(0, 4, 0, 8),
% 0.14/0.35 right_branch(8),
% 0.14/0.35 right_branch(7),
% 0.14/0.35 left_branch(0, 0, 1, 8),
% 0.14/0.35 lemmata(0, 0),
% 0.14/0.35 right_branch(8),
% 0.14/0.35 left_branch(0, 6, 0, 9),
% 0.14/0.35 right_branch(9),
% 0.14/0.35 left_branch(0, 5, 0, 10),
% 0.14/0.35 right_branch(10),
% 0.14/0.35 left_branch(0, 4, 0, 11),
% 0.14/0.35 right_branch(11),
% 0.14/0.35 right_branch(2)
% 0.14/0.35 )).
% 0.14/0.35 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------