TSTP Solution File: SEU267+1 by ConnectPP---0.3.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : SEU267+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s

% Computer : n015.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:33:48 EDT 2024

% Result   : Theorem 0.12s 0.35s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU267+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.34  % Computer : n015.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Mar 20 14:50:33 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % SZS status Theorem for theBenchmark
% 0.12/0.35  % SZS output start Proof for theBenchmark
% 0.12/0.35  
% 0.12/0.35  % Formula: existence_m1_subset_1 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(existence_m1_subset_1-1, axiom, ( element(skolem1(_u1), _u1) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: dt_m1_subset_1 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(dt_m1_subset_1, axiom, $true).
% 0.12/0.35  
% 0.12/0.35  % Formula: t2_subset ( axiom ) converted to clauses:
% 0.12/0.35  cnf(t2_subset-1, axiom, ( ~element(_u3, _u2) | empty(_u2) | in(_u3, _u2) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.12/0.35  cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u5, _u4) | ~in(_u4, _u5) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(dt_k1_xboole_0, axiom, $true).
% 0.12/0.35  
% 0.12/0.35  % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: t1_subset ( axiom ) converted to clauses:
% 0.12/0.35  cnf(t1_subset-1, axiom, ( ~in(_u7, _u6) | element(_u7, _u6) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(rc1_xboole_0-1, axiom, ( empty(skolem2) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem3) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: t6_boole ( axiom ) converted to clauses:
% 0.12/0.35  cnf(t6_boole-1, axiom, ( ~empty(_u10) | ( _u10 = empty_set) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: t7_boole ( axiom ) converted to clauses:
% 0.12/0.35  cnf(t7_boole-1, axiom, ( ~in(_u12, _u11) | ~empty(_u11) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: t8_boole ( axiom ) converted to clauses:
% 0.12/0.35  cnf(t8_boole-1, axiom, ( ~empty(_u14) | ( _u14 = _u13) | ~empty(_u13) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: dt_k1_mcart_1 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(dt_k1_mcart_1, axiom, $true).
% 0.12/0.35  
% 0.12/0.35  % Formula: dt_k2_mcart_1 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(dt_k2_mcart_1, axiom, $true).
% 0.12/0.35  
% 0.12/0.35  % Formula: dt_k4_tarski ( axiom ) converted to clauses:
% 0.12/0.35  cnf(dt_k4_tarski, axiom, $true).
% 0.12/0.35  
% 0.12/0.35  % Formula: fc1_zfmisc_1 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(fc1_zfmisc_1-1, axiom, ( ~empty(ordered_pair(_u16, _u15)) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: t7_mcart_1 ( conjecture ) (definitionally) converted to clauses:
% 0.12/0.35  cnf(t7_mcart_1-1, negated_conjecture, ( ( pair_first(ordered_pair(skolem4, skolem5)) != skolem4) | ( pair_second(ordered_pair(skolem4, skolem5)) != skolem5) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: d1_mcart_1 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(d1_mcart_1-1, axiom, ( ( _u26 != ordered_pair(_u20, _u19)) | ( _u27 != pair_first(_u26)) | ( _u27 = _u22) | ( _u26 != ordered_pair(_u22, _u21)) )).
% 0.12/0.35  cnf(d1_mcart_1-2, axiom, ( ( _u26 != ordered_pair(_u20, _u19)) | ( _u28 = pair_first(_u26)) | ( _u28 != skolem6(_u26, _u28)) )).
% 0.12/0.35  cnf(d1_mcart_1-3, axiom, ( ( _u26 != ordered_pair(_u20, _u19)) | ( _u28 = pair_first(_u26)) | ( _u26 = ordered_pair(skolem6(_u26, _u28), skolem7(_u26, _u28))) )).
% 0.12/0.35  
% 0.12/0.35  % Formula: d2_mcart_1 ( axiom ) converted to clauses:
% 0.12/0.35  cnf(d2_mcart_1-1, axiom, ( ( _u36 != ordered_pair(_u30, _u29)) | ( _u37 != pair_second(_u36)) | ( _u36 != ordered_pair(_u32, _u31)) | ( _u37 = _u31) )).
% 0.12/0.35  cnf(d2_mcart_1-2, axiom, ( ( _u36 != ordered_pair(_u30, _u29)) | ( _u38 = pair_second(_u36)) | ( _u36 = ordered_pair(skolem8(_u36, _u38), skolem9(_u36, _u38))) )).
% 0.12/0.35  cnf(d2_mcart_1-3, axiom, ( ( _u36 != ordered_pair(_u30, _u29)) | ( _u38 = pair_second(_u36)) | ( _u38 != skolem9(_u36, _u38)) )).
% 0.12/0.35  
% 0.12/0.35  % Problem matrix:
% 0.12/0.35  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.12/0.35  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.12/0.35  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.12/0.35  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( ordered_pair(__eqx_0, __eqx_1) = ordered_pair(__eqy_0, __eqy_1)) )).
% 0.12/0.35  cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( pair_first(__eqx_0) = pair_first(__eqy_0)) )).
% 0.12/0.35  cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( pair_second(__eqx_0) = pair_second(__eqy_0)) )).
% 0.12/0.35  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 0.12/0.35  cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem6(__eqx_0, __eqx_1) = skolem6(__eqy_0, __eqy_1)) )).
% 0.12/0.35  cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem7(__eqx_0, __eqx_1) = skolem7(__eqy_0, __eqy_1)) )).
% 0.12/0.35  cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem8(__eqx_0, __eqx_1) = skolem8(__eqy_0, __eqy_1)) )).
% 0.12/0.35  cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem9(__eqx_0, __eqx_1) = skolem9(__eqy_0, __eqy_1)) )).
% 0.12/0.35  cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~element(__eqx_0, __eqx_1) | element(__eqy_0, __eqy_1) )).
% 0.12/0.35  cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.12/0.35  cnf(matrix-13, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.12/0.35  cnf(matrix-14, plain, ( element(skolem1(_u1), _u1) )).
% 0.12/0.35  cnf(matrix-15, plain, ( ~element(_u3, _u2) | empty(_u2) | in(_u3, _u2) )).
% 0.12/0.35  cnf(matrix-16, plain, ( ~in(_u5, _u4) | ~in(_u4, _u5) )).
% 0.12/0.35  cnf(matrix-17, plain, ( empty(empty_set) )).
% 0.12/0.35  cnf(matrix-18, plain, ( ~in(_u7, _u6) | element(_u7, _u6) )).
% 0.12/0.35  cnf(matrix-19, plain, ( empty(skolem2) )).
% 0.12/0.35  cnf(matrix-20, plain, ( ~empty(skolem3) )).
% 0.12/0.35  cnf(matrix-21, plain, ( ~empty(_u10) | ( _u10 = empty_set) )).
% 0.12/0.35  cnf(matrix-22, plain, ( ~in(_u12, _u11) | ~empty(_u11) )).
% 0.12/0.35  cnf(matrix-23, plain, ( ~empty(_u14) | ( _u14 = _u13) | ~empty(_u13) )).
% 0.12/0.35  cnf(matrix-24, plain, ( ~empty(ordered_pair(_u16, _u15)) )).
% 0.12/0.35  cnf(matrix-25, plain, ( ( pair_first(ordered_pair(skolem4, skolem5)) != skolem4) | ( pair_second(ordered_pair(skolem4, skolem5)) != skolem5) )).
% 0.12/0.35  cnf(matrix-26, plain, ( ( _u26 != ordered_pair(_u20, _u19)) | ( _u27 != pair_first(_u26)) | ( _u27 = _u22) | ( _u26 != ordered_pair(_u22, _u21)) )).
% 0.12/0.35  cnf(matrix-27, plain, ( ( _u26 != ordered_pair(_u20, _u19)) | ( _u28 = pair_first(_u26)) | ( _u28 != skolem6(_u26, _u28)) )).
% 0.12/0.35  cnf(matrix-28, plain, ( ( _u26 != ordered_pair(_u20, _u19)) | ( _u28 = pair_first(_u26)) | ( _u26 = ordered_pair(skolem6(_u26, _u28), skolem7(_u26, _u28))) )).
% 0.12/0.35  cnf(matrix-29, plain, ( ( _u36 != ordered_pair(_u30, _u29)) | ( _u37 != pair_second(_u36)) | ( _u36 != ordered_pair(_u32, _u31)) | ( _u37 = _u31) )).
% 0.12/0.35  cnf(matrix-30, plain, ( ( _u36 != ordered_pair(_u30, _u29)) | ( _u38 = pair_second(_u36)) | ( _u36 = ordered_pair(skolem8(_u36, _u38), skolem9(_u36, _u38))) )).
% 0.12/0.35  cnf(matrix-31, plain, ( ( _u36 != ordered_pair(_u30, _u29)) | ( _u38 = pair_second(_u36)) | ( _u38 != skolem9(_u36, _u38)) )).
% 0.12/0.35  
% 0.12/0.35  % Proof stack:
% 0.12/0.35  cnf(proof-stack, plain, 
% 0.12/0.35  proof_stack(
% 0.12/0.35  start(25), 
% 0.12/0.35  left_branch(0, 26, 2, 2), 
% 0.12/0.35  left_branch(0, 0, 0, 3), 
% 0.12/0.35  right_branch(3), 
% 0.12/0.35  left_branch(0, 0, 0, 4), 
% 0.12/0.35  right_branch(4), 
% 0.12/0.35  left_branch(0, 0, 0, 5), 
% 0.12/0.35  right_branch(5), 
% 0.12/0.35  right_branch(2), 
% 0.12/0.35  left_branch(0, 29, 3, 3), 
% 0.12/0.35  left_branch(0, 0, 0, 4), 
% 0.12/0.35  right_branch(4), 
% 0.12/0.35  left_branch(0, 0, 0, 5), 
% 0.12/0.35  right_branch(5), 
% 0.12/0.35  left_branch(0, 0, 0, 6), 
% 0.12/0.35  right_branch(6), 
% 0.12/0.35  right_branch(3)
% 0.12/0.35  )).
% 0.12/0.35  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------