TSTP Solution File: MGT044+1 by ConnectPP---0.2.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : MGT044+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 : n028.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:59 EST 2024

% Result   : Theorem 0.19s 0.43s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : MGT044+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33  % Computer : n028.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:30:49 EST 2024
% 0.12/0.33  % CPUTime  : 
% 0.19/0.43  % SZS status Theorem for theBenchmark
% 0.19/0.43  % SZS output start Proof for theBenchmark
% 0.19/0.43  
% 0.19/0.43  % Formula: definition_smaller_or_equal ( axiom ) converted to clauses:
% 0.19/0.43  cnf(definition_smaller_or_equal-1, axiom, ( ~smaller_or_equal(_u4, _u2) | smaller(_u4, _u2) | ( _u4 = _u2) )).
% 0.19/0.43  cnf(definition_smaller_or_equal-2, axiom, ( smaller_or_equal(_u5, _u3) | ~smaller(_u5, _u3) )).
% 0.19/0.43  cnf(definition_smaller_or_equal-3, axiom, ( smaller_or_equal(_u5, _u3) | ( _u5 != _u3) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: definition_greater_or_equal ( axiom ) converted to clauses:
% 0.19/0.43  cnf(definition_greater_or_equal-1, axiom, ( ~greater_or_equal(_u10, _u8) | greater(_u10, _u8) | ( _u10 = _u8) )).
% 0.19/0.43  cnf(definition_greater_or_equal-2, axiom, ( greater_or_equal(_u11, _u9) | ~greater(_u11, _u9) )).
% 0.19/0.43  cnf(definition_greater_or_equal-3, axiom, ( greater_or_equal(_u11, _u9) | ( _u11 != _u9) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: definition_smaller ( axiom ) converted to clauses:
% 0.19/0.43  cnf(definition_smaller-1, axiom, ( ~smaller(_u16, _u14) | greater(_u14, _u16) )).
% 0.19/0.43  cnf(definition_smaller-2, axiom, ( ~greater(_u15, _u17) | smaller(_u17, _u15) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: meaning_postulate_greater_strict ( axiom ) converted to clauses:
% 0.19/0.43  cnf(meaning_postulate_greater_strict-1, axiom, ( ~greater(_u19, _u18) | ~greater(_u18, _u19) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: meaning_postulate_greater_transitive ( axiom ) converted to clauses:
% 0.19/0.43  cnf(meaning_postulate_greater_transitive-1, axiom, ( ~greater(_u22, _u21) | ~greater(_u21, _u20) | greater(_u22, _u20) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: meaning_postulate_greater_comparable ( axiom ) converted to clauses:
% 0.19/0.43  cnf(meaning_postulate_greater_comparable-1, axiom, ( smaller(_u24, _u23) | ( _u24 = _u23) | greater(_u24, _u23) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: assumption_5 ( axiom ) converted to clauses:
% 0.19/0.43  cnf(assumption_5-1, axiom, ( ~organization(_u27) | ~greater(stock_of_knowledge(_u27, _u28), stock_of_knowledge(_u27, _u31)) | ~smaller_or_equal(internal_friction(_u27, _u28), internal_friction(_u27, _u31)) | greater(capability(_u27, _u28), capability(_u27, _u31)) )).
% 0.19/0.43  cnf(assumption_5-2, axiom, ( ~organization(_u27) | ~smaller_or_equal(stock_of_knowledge(_u27, _u29), stock_of_knowledge(_u27, _u32)) | ~greater(internal_friction(_u27, _u29), internal_friction(_u27, _u32)) | smaller(capability(_u27, _u29), capability(_u27, _u32)) )).
% 0.19/0.43  cnf(assumption_5-3, axiom, ( ~organization(_u27) | ( stock_of_knowledge(_u27, _u30) != stock_of_knowledge(_u27, _u33)) | ( internal_friction(_u27, _u30) != internal_friction(_u27, _u33)) | ( capability(_u27, _u30) = capability(_u27, _u33)) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: assumption_7 ( axiom ) converted to clauses:
% 0.19/0.43  cnf(assumption_7-1, axiom, ( ~organization(_u36) | ~greater(age(_u36, _u34), age(_u36, _u35)) | greater(stock_of_knowledge(_u36, _u34), stock_of_knowledge(_u36, _u35)) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: assumption_9 ( axiom ) converted to clauses:
% 0.19/0.43  cnf(assumption_9-1, axiom, ( ~organization(_u39) | ( internal_friction(_u39, _u37) = internal_friction(_u39, _u38)) )).
% 0.19/0.43  
% 0.19/0.43  % Formula: lemma_3 ( conjecture ) converted to clauses:
% 0.19/0.43  cnf(lemma_3-1, negated_conjecture, ( organization(skolem1) )).
% 0.19/0.43  cnf(lemma_3-2, negated_conjecture, ( greater(age(skolem1, skolem3), age(skolem1, skolem2)) )).
% 0.19/0.43  cnf(lemma_3-3, negated_conjecture, ( ~greater(capability(skolem1, skolem3), capability(skolem1, skolem2)) )).
% 0.19/0.43  
% 0.19/0.43  % Problem matrix:
% 0.19/0.43  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.19/0.43  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.19/0.43  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.19/0.43  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( stock_of_knowledge(__eqx_0, __eqx_1) = stock_of_knowledge(__eqy_0, __eqy_1)) )).
% 0.19/0.43  cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( internal_friction(__eqx_0, __eqx_1) = internal_friction(__eqy_0, __eqy_1)) )).
% 0.19/0.43  cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( capability(__eqx_0, __eqx_1) = capability(__eqy_0, __eqy_1)) )).
% 0.19/0.43  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( age(__eqx_0, __eqx_1) = age(__eqy_0, __eqy_1)) )).
% 0.19/0.43  cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~smaller_or_equal(__eqx_0, __eqx_1) | smaller_or_equal(__eqy_0, __eqy_1) )).
% 0.19/0.43  cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~smaller(__eqx_0, __eqx_1) | smaller(__eqy_0, __eqy_1) )).
% 0.19/0.43  cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater_or_equal(__eqx_0, __eqx_1) | greater_or_equal(__eqy_0, __eqy_1) )).
% 0.19/0.43  cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater(__eqx_0, __eqx_1) | greater(__eqy_0, __eqy_1) )).
% 0.19/0.43  cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ~organization(__eqx_0) | organization(__eqy_0) )).
% 0.19/0.43  cnf(matrix-12, plain, ( ~smaller_or_equal(_u4, _u2) | smaller(_u4, _u2) | ( _u4 = _u2) )).
% 0.19/0.43  cnf(matrix-13, plain, ( smaller_or_equal(_u5, _u3) | ~smaller(_u5, _u3) )).
% 0.19/0.43  cnf(matrix-14, plain, ( smaller_or_equal(_u5, _u3) | ( _u5 != _u3) )).
% 0.19/0.43  cnf(matrix-15, plain, ( ~greater_or_equal(_u10, _u8) | greater(_u10, _u8) | ( _u10 = _u8) )).
% 0.19/0.43  cnf(matrix-16, plain, ( greater_or_equal(_u11, _u9) | ~greater(_u11, _u9) )).
% 0.19/0.43  cnf(matrix-17, plain, ( greater_or_equal(_u11, _u9) | ( _u11 != _u9) )).
% 0.19/0.43  cnf(matrix-18, plain, ( ~smaller(_u16, _u14) | greater(_u14, _u16) )).
% 0.19/0.43  cnf(matrix-19, plain, ( ~greater(_u15, _u17) | smaller(_u17, _u15) )).
% 0.19/0.43  cnf(matrix-20, plain, ( ~greater(_u19, _u18) | ~greater(_u18, _u19) )).
% 0.19/0.43  cnf(matrix-21, plain, ( ~greater(_u22, _u21) | ~greater(_u21, _u20) | greater(_u22, _u20) )).
% 0.19/0.43  cnf(matrix-22, plain, ( smaller(_u24, _u23) | ( _u24 = _u23) | greater(_u24, _u23) )).
% 0.19/0.43  cnf(matrix-23, plain, ( ~organization(_u27) | ~greater(stock_of_knowledge(_u27, _u28), stock_of_knowledge(_u27, _u31)) | ~smaller_or_equal(internal_friction(_u27, _u28), internal_friction(_u27, _u31)) | greater(capability(_u27, _u28), capability(_u27, _u31)) )).
% 0.19/0.43  cnf(matrix-24, plain, ( ~organization(_u27) | ~smaller_or_equal(stock_of_knowledge(_u27, _u29), stock_of_knowledge(_u27, _u32)) | ~greater(internal_friction(_u27, _u29), internal_friction(_u27, _u32)) | smaller(capability(_u27, _u29), capability(_u27, _u32)) )).
% 0.19/0.43  cnf(matrix-25, plain, ( ~organization(_u27) | ( stock_of_knowledge(_u27, _u30) != stock_of_knowledge(_u27, _u33)) | ( internal_friction(_u27, _u30) != internal_friction(_u27, _u33)) | ( capability(_u27, _u30) = capability(_u27, _u33)) )).
% 0.19/0.43  cnf(matrix-26, plain, ( ~organization(_u36) | ~greater(age(_u36, _u34), age(_u36, _u35)) | greater(stock_of_knowledge(_u36, _u34), stock_of_knowledge(_u36, _u35)) )).
% 0.19/0.43  cnf(matrix-27, plain, ( ~organization(_u39) | ( internal_friction(_u39, _u37) = internal_friction(_u39, _u38)) )).
% 0.19/0.43  cnf(matrix-28, plain, ( organization(skolem1) )).
% 0.19/0.43  cnf(matrix-29, plain, ( greater(age(skolem1, skolem3), age(skolem1, skolem2)) )).
% 0.19/0.43  cnf(matrix-30, plain, ( ~greater(capability(skolem1, skolem3), capability(skolem1, skolem2)) )).
% 0.19/0.43  
% 0.19/0.43  % Proof stack:
% 0.19/0.43  cnf(proof-stack, plain, 
% 0.19/0.43  proof_stack(
% 0.19/0.43  start(30), 
% 0.19/0.43  left_branch(0, 23, 3, 2), 
% 0.19/0.43  left_branch(0, 28, 0, 3), 
% 0.19/0.43  right_branch(3), 
% 0.19/0.43  left_branch(0, 14, 0, 4), 
% 0.19/0.43  left_branch(0, 27, 1, 5), 
% 0.19/0.43  lemmata(0, 0), 
% 0.19/0.43  right_branch(5), 
% 0.19/0.43  right_branch(4), 
% 0.19/0.43  left_branch(0, 26, 2, 5), 
% 0.19/0.43  lemmata(0, 0), 
% 0.19/0.43  left_branch(0, 29, 0, 7), 
% 0.19/0.43  right_branch(7), 
% 0.19/0.43  right_branch(5), 
% 0.19/0.43  right_branch(2)
% 0.19/0.43  )).
% 0.19/0.43  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------