TSTP Solution File: MGT049+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : MGT049+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n017.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:11:01 EST 2024
% Result : Theorem 0.13s 0.35s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT049+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Mar 4 03:41:43 EST 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Theorem for theBenchmark
% 0.13/0.35 % SZS output start Proof for theBenchmark
% 0.13/0.35
% 0.13/0.35 % Formula: definition_smaller_or_equal ( axiom ) converted to clauses:
% 0.13/0.35 cnf(definition_smaller_or_equal-1, axiom, ( ~smaller_or_equal(_u4, _u2) | smaller(_u4, _u2) | ( _u4 = _u2) )).
% 0.13/0.35 cnf(definition_smaller_or_equal-2, axiom, ( smaller_or_equal(_u5, _u3) | ~smaller(_u5, _u3) )).
% 0.13/0.35 cnf(definition_smaller_or_equal-3, axiom, ( smaller_or_equal(_u5, _u3) | ( _u5 != _u3) )).
% 0.13/0.35
% 0.13/0.35 % Formula: definition_greater_or_equal ( axiom ) converted to clauses:
% 0.13/0.35 cnf(definition_greater_or_equal-1, axiom, ( ~greater_or_equal(_u10, _u8) | greater(_u10, _u8) | ( _u10 = _u8) )).
% 0.13/0.35 cnf(definition_greater_or_equal-2, axiom, ( greater_or_equal(_u11, _u9) | ~greater(_u11, _u9) )).
% 0.13/0.35 cnf(definition_greater_or_equal-3, axiom, ( greater_or_equal(_u11, _u9) | ( _u11 != _u9) )).
% 0.13/0.35
% 0.13/0.35 % Formula: definition_smaller ( axiom ) converted to clauses:
% 0.13/0.35 cnf(definition_smaller-1, axiom, ( ~smaller(_u16, _u14) | greater(_u14, _u16) )).
% 0.13/0.35 cnf(definition_smaller-2, axiom, ( ~greater(_u15, _u17) | smaller(_u17, _u15) )).
% 0.13/0.35
% 0.13/0.35 % Formula: meaning_postulate_greater_strict ( axiom ) converted to clauses:
% 0.13/0.35 cnf(meaning_postulate_greater_strict-1, axiom, ( ~greater(_u19, _u18) | ~greater(_u18, _u19) )).
% 0.13/0.35
% 0.13/0.35 % Formula: meaning_postulate_greater_transitive ( axiom ) converted to clauses:
% 0.13/0.35 cnf(meaning_postulate_greater_transitive-1, axiom, ( ~greater(_u22, _u21) | ~greater(_u21, _u20) | greater(_u22, _u20) )).
% 0.13/0.35
% 0.13/0.35 % Formula: meaning_postulate_greater_comparable ( axiom ) converted to clauses:
% 0.13/0.35 cnf(meaning_postulate_greater_comparable-1, axiom, ( smaller(_u24, _u23) | ( _u24 = _u23) | greater(_u24, _u23) )).
% 0.13/0.35
% 0.13/0.35 % Formula: assumption_6 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(assumption_6-1, axiom, ( ~organization(_u27) | ~greater(external_ties(_u27, _u28), external_ties(_u27, _u30)) | greater(position(_u27, _u28), position(_u27, _u30)) )).
% 0.13/0.35 cnf(assumption_6-2, axiom, ( ~organization(_u27) | ( external_ties(_u27, _u29) != external_ties(_u27, _u31)) | ( position(_u27, _u29) = position(_u27, _u31)) )).
% 0.13/0.35
% 0.13/0.35 % Formula: assumption_11 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(assumption_11-1, axiom, ( ~organization(_u34) | ( external_ties(_u34, _u32) = external_ties(_u34, _u33)) )).
% 0.13/0.35
% 0.13/0.35 % Formula: lemma_6 ( conjecture ) converted to clauses:
% 0.13/0.35 cnf(lemma_6-1, negated_conjecture, ( organization(skolem1) )).
% 0.13/0.35 cnf(lemma_6-2, negated_conjecture, ( greater(age(skolem1, skolem3), age(skolem1, skolem2)) )).
% 0.13/0.35 cnf(lemma_6-3, negated_conjecture, ( ( position(skolem1, skolem3) != position(skolem1, skolem2)) )).
% 0.13/0.35
% 0.13/0.35 % Problem matrix:
% 0.13/0.35 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.35 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.35 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.35 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( external_ties(__eqx_0, __eqx_1) = external_ties(__eqy_0, __eqy_1)) )).
% 0.13/0.35 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( position(__eqx_0, __eqx_1) = position(__eqy_0, __eqy_1)) )).
% 0.13/0.35 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( age(__eqx_0, __eqx_1) = age(__eqy_0, __eqy_1)) )).
% 0.13/0.35 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~smaller_or_equal(__eqx_0, __eqx_1) | smaller_or_equal(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~smaller(__eqx_0, __eqx_1) | smaller(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater_or_equal(__eqx_0, __eqx_1) | greater_or_equal(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater(__eqx_0, __eqx_1) | greater(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ~organization(__eqx_0) | organization(__eqy_0) )).
% 0.13/0.35 cnf(matrix-11, plain, ( ~smaller_or_equal(_u4, _u2) | smaller(_u4, _u2) | ( _u4 = _u2) )).
% 0.13/0.35 cnf(matrix-12, plain, ( smaller_or_equal(_u5, _u3) | ~smaller(_u5, _u3) )).
% 0.13/0.35 cnf(matrix-13, plain, ( smaller_or_equal(_u5, _u3) | ( _u5 != _u3) )).
% 0.13/0.35 cnf(matrix-14, plain, ( ~greater_or_equal(_u10, _u8) | greater(_u10, _u8) | ( _u10 = _u8) )).
% 0.13/0.35 cnf(matrix-15, plain, ( greater_or_equal(_u11, _u9) | ~greater(_u11, _u9) )).
% 0.13/0.35 cnf(matrix-16, plain, ( greater_or_equal(_u11, _u9) | ( _u11 != _u9) )).
% 0.13/0.35 cnf(matrix-17, plain, ( ~smaller(_u16, _u14) | greater(_u14, _u16) )).
% 0.13/0.35 cnf(matrix-18, plain, ( ~greater(_u15, _u17) | smaller(_u17, _u15) )).
% 0.13/0.35 cnf(matrix-19, plain, ( ~greater(_u19, _u18) | ~greater(_u18, _u19) )).
% 0.13/0.35 cnf(matrix-20, plain, ( ~greater(_u22, _u21) | ~greater(_u21, _u20) | greater(_u22, _u20) )).
% 0.13/0.35 cnf(matrix-21, plain, ( smaller(_u24, _u23) | ( _u24 = _u23) | greater(_u24, _u23) )).
% 0.13/0.35 cnf(matrix-22, plain, ( ~organization(_u27) | ~greater(external_ties(_u27, _u28), external_ties(_u27, _u30)) | greater(position(_u27, _u28), position(_u27, _u30)) )).
% 0.13/0.35 cnf(matrix-23, plain, ( ~organization(_u27) | ( external_ties(_u27, _u29) != external_ties(_u27, _u31)) | ( position(_u27, _u29) = position(_u27, _u31)) )).
% 0.13/0.35 cnf(matrix-24, plain, ( ~organization(_u34) | ( external_ties(_u34, _u32) = external_ties(_u34, _u33)) )).
% 0.13/0.35 cnf(matrix-25, plain, ( organization(skolem1) )).
% 0.13/0.35 cnf(matrix-26, plain, ( greater(age(skolem1, skolem3), age(skolem1, skolem2)) )).
% 0.13/0.35 cnf(matrix-27, plain, ( ( position(skolem1, skolem3) != position(skolem1, skolem2)) )).
% 0.13/0.35
% 0.13/0.35 % Proof stack:
% 0.13/0.35 cnf(proof-stack, plain,
% 0.13/0.35 proof_stack(
% 0.13/0.35 start(27),
% 0.13/0.35 left_branch(0, 23, 2, 2),
% 0.13/0.35 left_branch(0, 25, 0, 3),
% 0.13/0.35 right_branch(3),
% 0.13/0.35 left_branch(0, 24, 1, 4),
% 0.13/0.35 lemmata(0, 0),
% 0.13/0.35 right_branch(4),
% 0.13/0.35 right_branch(2)
% 0.13/0.35 )).
% 0.13/0.35 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------