TSTP Solution File: MGT014+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : MGT014+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 : n025.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:52 EST 2024
% Result : Theorem 5.23s 5.39s
% Output : Proof 5.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n025.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:26:40 EST 2024
% 0.12/0.33 % CPUTime :
% 5.23/5.39 % SZS status Theorem for theBenchmark
% 5.23/5.39 % SZS output start Proof for theBenchmark
% 5.23/5.39
% 5.23/5.39 % Formula: mp6_1 ( axiom ) converted to clauses:
% 5.23/5.39 cnf(mp6_1-1, axiom, ( ~greater(_u1, _u0) | ( _u1 != _u0) )).
% 5.23/5.39
% 5.23/5.39 % Formula: mp6_2 ( axiom ) converted to clauses:
% 5.23/5.39 cnf(mp6_2-1, axiom, ( ~greater(_u3, _u2) | ~greater(_u2, _u3) )).
% 5.23/5.39
% 5.23/5.39 % Formula: mp15 ( axiom ) converted to clauses:
% 5.23/5.39 cnf(mp15-1, axiom, ( ~organization(_u5, _u4) | time(_u4) )).
% 5.23/5.39
% 5.23/5.39 % Formula: mp16 ( axiom ) converted to clauses:
% 5.23/5.39 cnf(mp16-1, axiom, ( ~time(_u7) | ~time(_u6) | greater(_u7, _u6) | ( _u7 = _u6) | greater(_u6, _u7) )).
% 5.23/5.39
% 5.23/5.39 % Formula: mp17 ( axiom ) converted to clauses:
% 5.23/5.39 cnf(mp17-1, axiom, ( ~reorganization_free(_u10, _u9, _u8) | reorganization_free(_u10, _u8, _u9) )).
% 5.23/5.39
% 5.23/5.39 % Formula: mp19 ( axiom ) converted to clauses:
% 5.23/5.39 cnf(mp19-1, axiom, ( ( _u14 = _u13) | ~organization(_u15, _u12) | ~size(_u15, _u14, _u12) | ~organization(_u15, _u11) | ~size(_u15, _u13, _u11) | ( _u12 != _u11) )).
% 5.23/5.39
% 5.23/5.39 % Formula: t11_FOL ( hypothesis ) converted to clauses:
% 5.23/5.39 cnf(t11_FOL-1, hypothesis, ( ~greater(_u19, _u18) | ~organization(_u20, _u17) | ~size(_u20, _u19, _u17) | ~organization(_u20, _u16) | ~reorganization_free(_u20, _u17, _u16) | ~size(_u20, _u18, _u16) | ~greater(_u16, _u17) )).
% 5.23/5.39
% 5.23/5.39 % Formula: t12_FOL ( hypothesis ) converted to clauses:
% 5.23/5.39 cnf(t12_FOL-1, hypothesis, ( ~greater(_u24, _u23) | ~organization(_u25, _u22) | ~complexity(_u25, _u24, _u22) | ~organization(_u25, _u21) | ~reorganization_free(_u25, _u22, _u21) | ~complexity(_u25, _u23, _u21) | ~greater(_u21, _u22) )).
% 5.23/5.39
% 5.23/5.39 % Formula: t14_FOL ( conjecture ) converted to clauses:
% 5.23/5.39 cnf(t14_FOL-1, negated_conjecture, ( greater(skolem2, skolem3) )).
% 5.23/5.39 cnf(t14_FOL-2, negated_conjecture, ( greater(skolem5, skolem4) )).
% 5.23/5.39 cnf(t14_FOL-3, negated_conjecture, ( organization(skolem1, skolem6) )).
% 5.23/5.39 cnf(t14_FOL-4, negated_conjecture, ( complexity(skolem1, skolem2, skolem6) )).
% 5.23/5.39 cnf(t14_FOL-5, negated_conjecture, ( size(skolem1, skolem4, skolem6) )).
% 5.23/5.39 cnf(t14_FOL-6, negated_conjecture, ( organization(skolem1, skolem7) )).
% 5.23/5.39 cnf(t14_FOL-7, negated_conjecture, ( reorganization_free(skolem1, skolem6, skolem7) )).
% 5.23/5.39 cnf(t14_FOL-8, negated_conjecture, ( complexity(skolem1, skolem3, skolem7) )).
% 5.23/5.39 cnf(t14_FOL-9, negated_conjecture, ( size(skolem1, skolem5, skolem7) )).
% 5.23/5.39
% 5.23/5.39 % Problem matrix:
% 5.23/5.39 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 5.23/5.39 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 5.23/5.39 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 5.23/5.39 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater(__eqx_0, __eqx_1) | greater(__eqy_0, __eqy_1) )).
% 5.23/5.39 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~organization(__eqx_0, __eqx_1) | organization(__eqy_0, __eqy_1) )).
% 5.23/5.39 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ~time(__eqx_0) | time(__eqy_0) )).
% 5.23/5.39 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ~reorganization_free(__eqx_0, __eqx_1, __eqx_2) | reorganization_free(__eqy_0, __eqy_1, __eqy_2) )).
% 5.23/5.39 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ~size(__eqx_0, __eqx_1, __eqx_2) | size(__eqy_0, __eqy_1, __eqy_2) )).
% 5.23/5.39 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ~complexity(__eqx_0, __eqx_1, __eqx_2) | complexity(__eqy_0, __eqy_1, __eqy_2) )).
% 5.23/5.39 cnf(matrix-9, plain, ( ~greater(_u1, _u0) | ( _u1 != _u0) )).
% 5.23/5.39 cnf(matrix-10, plain, ( ~greater(_u3, _u2) | ~greater(_u2, _u3) )).
% 5.23/5.39 cnf(matrix-11, plain, ( ~organization(_u5, _u4) | time(_u4) )).
% 5.23/5.39 cnf(matrix-12, plain, ( ~time(_u7) | ~time(_u6) | greater(_u7, _u6) | ( _u7 = _u6) | greater(_u6, _u7) )).
% 5.23/5.39 cnf(matrix-13, plain, ( ~reorganization_free(_u10, _u9, _u8) | reorganization_free(_u10, _u8, _u9) )).
% 5.23/5.39 cnf(matrix-14, plain, ( ( _u14 = _u13) | ~organization(_u15, _u12) | ~size(_u15, _u14, _u12) | ~organization(_u15, _u11) | ~size(_u15, _u13, _u11) | ( _u12 != _u11) )).
% 5.23/5.39 cnf(matrix-15, plain, ( ~greater(_u19, _u18) | ~organization(_u20, _u17) | ~size(_u20, _u19, _u17) | ~organization(_u20, _u16) | ~reorganization_free(_u20, _u17, _u16) | ~size(_u20, _u18, _u16) | ~greater(_u16, _u17) )).
% 5.23/5.39 cnf(matrix-16, plain, ( ~greater(_u24, _u23) | ~organization(_u25, _u22) | ~complexity(_u25, _u24, _u22) | ~organization(_u25, _u21) | ~reorganization_free(_u25, _u22, _u21) | ~complexity(_u25, _u23, _u21) | ~greater(_u21, _u22) )).
% 5.23/5.39 cnf(matrix-17, plain, ( greater(skolem2, skolem3) )).
% 5.23/5.39 cnf(matrix-18, plain, ( greater(skolem5, skolem4) )).
% 5.23/5.39 cnf(matrix-19, plain, ( organization(skolem1, skolem6) )).
% 5.23/5.39 cnf(matrix-20, plain, ( complexity(skolem1, skolem2, skolem6) )).
% 5.23/5.39 cnf(matrix-21, plain, ( size(skolem1, skolem4, skolem6) )).
% 5.23/5.39 cnf(matrix-22, plain, ( organization(skolem1, skolem7) )).
% 5.23/5.39 cnf(matrix-23, plain, ( reorganization_free(skolem1, skolem6, skolem7) )).
% 5.23/5.39 cnf(matrix-24, plain, ( complexity(skolem1, skolem3, skolem7) )).
% 5.23/5.39 cnf(matrix-25, plain, ( size(skolem1, skolem5, skolem7) )).
% 5.23/5.39
% 5.23/5.39 % Proof stack:
% 5.23/5.39 cnf(proof-stack, plain,
% 5.23/5.39 proof_stack(
% 5.23/5.39 start(9),
% 5.23/5.39 left_branch(0, 12, 4, 2),
% 5.23/5.39 left_branch(0, 11, 1, 3),
% 5.23/5.39 left_branch(0, 22, 0, 4),
% 5.23/5.39 right_branch(4),
% 5.23/5.39 right_branch(3),
% 5.23/5.39 left_branch(0, 14, 5, 4),
% 5.23/5.39 left_branch(0, 9, 1, 5),
% 5.23/5.39 left_branch(0, 18, 0, 6),
% 5.23/5.39 right_branch(6),
% 5.23/5.39 right_branch(5),
% 5.23/5.39 left_branch(0, 21, 0, 6),
% 5.23/5.39 right_branch(6),
% 5.23/5.39 left_branch(0, 19, 0, 7),
% 5.23/5.39 right_branch(7),
% 5.23/5.39 left_branch(0, 25, 0, 8),
% 5.23/5.39 right_branch(8),
% 5.23/5.39 left_branch(0, 22, 0, 9),
% 5.23/5.39 right_branch(9),
% 5.23/5.39 right_branch(4),
% 5.23/5.39 left_branch(0, 16, 6, 5),
% 5.23/5.39 left_branch(0, 17, 0, 6),
% 5.23/5.39 right_branch(6),
% 5.23/5.39 left_branch(0, 24, 0, 7),
% 5.23/5.39 right_branch(7),
% 5.23/5.39 left_branch(0, 23, 0, 8),
% 5.23/5.39 right_branch(8),
% 5.23/5.39 left_branch(0, 22, 0, 9),
% 5.23/5.39 right_branch(9),
% 5.23/5.39 left_branch(0, 20, 0, 10),
% 5.23/5.39 right_branch(10),
% 5.23/5.39 left_branch(0, 19, 0, 11),
% 5.23/5.39 right_branch(11),
% 5.23/5.39 right_branch(5),
% 5.23/5.39 left_branch(0, 11, 1, 6),
% 5.23/5.39 left_branch(0, 19, 0, 7),
% 5.23/5.39 right_branch(7),
% 5.23/5.39 right_branch(6),
% 5.23/5.39 right_branch(2),
% 5.23/5.39 left_branch(0, 12, 3, 3),
% 5.23/5.39 left_branch(0, 11, 1, 4),
% 5.23/5.39 left_branch(0, 19, 0, 5),
% 5.23/5.39 right_branch(5),
% 5.23/5.39 right_branch(4),
% 5.23/5.39 left_branch(0, 16, 6, 5),
% 5.23/5.39 left_branch(0, 17, 0, 6),
% 5.23/5.39 right_branch(6),
% 5.23/5.39 left_branch(0, 24, 0, 7),
% 5.23/5.39 right_branch(7),
% 5.23/5.39 left_branch(0, 23, 0, 8),
% 5.23/5.39 right_branch(8),
% 5.23/5.39 left_branch(0, 22, 0, 9),
% 5.23/5.39 right_branch(9),
% 5.23/5.39 left_branch(0, 20, 0, 10),
% 5.23/5.39 right_branch(10),
% 5.23/5.39 left_branch(0, 19, 0, 11),
% 5.23/5.39 right_branch(11),
% 5.23/5.39 right_branch(5),
% 5.23/5.39 left_branch(0, 15, 6, 6),
% 5.23/5.39 left_branch(0, 18, 0, 7),
% 5.23/5.39 right_branch(7),
% 5.23/5.39 left_branch(0, 21, 0, 8),
% 5.23/5.39 right_branch(8),
% 5.23/5.39 left_branch(0, 13, 1, 9),
% 5.23/5.39 left_branch(0, 23, 0, 10),
% 5.23/5.39 right_branch(10),
% 5.23/5.39 right_branch(9),
% 5.23/5.39 left_branch(0, 19, 0, 10),
% 5.23/5.39 right_branch(10),
% 5.23/5.39 left_branch(0, 25, 0, 11),
% 5.23/5.39 right_branch(11),
% 5.23/5.39 left_branch(0, 22, 0, 12),
% 5.23/5.39 right_branch(12),
% 5.23/5.39 right_branch(6),
% 5.23/5.39 left_branch(0, 11, 1, 7),
% 5.23/5.39 left_branch(0, 22, 0, 8),
% 5.23/5.39 right_branch(8),
% 5.23/5.39 right_branch(7),
% 5.23/5.39 right_branch(3)
% 5.23/5.39 )).
% 5.23/5.39 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------