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

View Problem - Process Solution

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

% Computer : n004.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:19:58 EST 2024

% Result   : Theorem 1.89s 2.05s
% Output   : Proof 1.89s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET906+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33  % Computer : n004.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 : Sun Mar  3 19:42:42 EST 2024
% 0.13/0.34  % CPUTime  : 
% 1.89/2.05  % SZS status Theorem for theBenchmark
% 1.89/2.05  % SZS output start Proof for theBenchmark
% 1.89/2.05  
% 1.89/2.05  % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 1.89/2.05  cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 1.89/2.05  cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: commutativity_k2_xboole_0 ( axiom ) converted to clauses:
% 1.89/2.05  cnf(commutativity_k2_xboole_0-1, axiom, ( ( set_union2(_u5, _u4) = set_union2(_u4, _u5)) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: d2_tarski ( axiom ) converted to clauses:
% 1.89/2.05  cnf(d2_tarski-1, axiom, ( ( _u15 != unordered_pair(_u19, _u17)) | ~in(_u11, _u15) | ( _u11 = _u19) | ( _u11 = _u17) )).
% 1.89/2.05  cnf(d2_tarski-2, axiom, ( ( _u15 != unordered_pair(_u19, _u17)) | in(_u12, _u15) | ( _u12 != _u19) )).
% 1.89/2.05  cnf(d2_tarski-3, axiom, ( ( _u15 != unordered_pair(_u19, _u17)) | in(_u12, _u15) | ( _u12 != _u17) )).
% 1.89/2.05  cnf(d2_tarski-4, axiom, ( ( _u16 = unordered_pair(_u20, _u18)) | in(skolem1(_u20, _u18, _u16), _u16) | ( skolem2(_u20, _u18, _u16) = _u20) | ( skolem2(_u20, _u18, _u16) = _u18) )).
% 1.89/2.05  cnf(d2_tarski-5, axiom, ( ( _u16 = unordered_pair(_u20, _u18)) | in(skolem1(_u20, _u18, _u16), _u16) | ~in(skolem2(_u20, _u18, _u16), _u16) )).
% 1.89/2.05  cnf(d2_tarski-6, axiom, ( ( _u16 = unordered_pair(_u20, _u18)) | ( skolem2(_u20, _u18, _u16) = _u20) | ( skolem2(_u20, _u18, _u16) = _u18) | ( skolem1(_u20, _u18, _u16) != _u20) )).
% 1.89/2.05  cnf(d2_tarski-7, axiom, ( ( _u16 = unordered_pair(_u20, _u18)) | ( skolem2(_u20, _u18, _u16) = _u20) | ( skolem2(_u20, _u18, _u16) = _u18) | ( skolem1(_u20, _u18, _u16) != _u18) )).
% 1.89/2.05  cnf(d2_tarski-8, axiom, ( ( _u16 = unordered_pair(_u20, _u18)) | ~in(skolem2(_u20, _u18, _u16), _u16) | ( skolem1(_u20, _u18, _u16) != _u20) )).
% 1.89/2.05  cnf(d2_tarski-9, axiom, ( ( _u16 = unordered_pair(_u20, _u18)) | ~in(skolem2(_u20, _u18, _u16), _u16) | ( skolem1(_u20, _u18, _u16) != _u18) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: d2_xboole_0 ( axiom ) converted to clauses:
% 1.89/2.05  cnf(d2_xboole_0-1, axiom, ( ( _u30 != set_union2(_u34, _u32)) | ~in(_u26, _u30) | in(_u26, _u34) | in(_u26, _u32) )).
% 1.89/2.05  cnf(d2_xboole_0-2, axiom, ( ( _u30 != set_union2(_u34, _u32)) | in(_u27, _u30) | ~in(_u27, _u34) )).
% 1.89/2.05  cnf(d2_xboole_0-3, axiom, ( ( _u30 != set_union2(_u34, _u32)) | in(_u27, _u30) | ~in(_u27, _u32) )).
% 1.89/2.05  cnf(d2_xboole_0-4, axiom, ( ( _u31 = set_union2(_u35, _u33)) | in(skolem3(_u35, _u33, _u31), _u31) | in(skolem4(_u35, _u33, _u31), _u35) | in(skolem4(_u35, _u33, _u31), _u33) )).
% 1.89/2.05  cnf(d2_xboole_0-5, axiom, ( ( _u31 = set_union2(_u35, _u33)) | in(skolem3(_u35, _u33, _u31), _u31) | ~in(skolem4(_u35, _u33, _u31), _u31) )).
% 1.89/2.05  cnf(d2_xboole_0-6, axiom, ( ( _u31 = set_union2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u35) | in(skolem4(_u35, _u33, _u31), _u33) | ~in(skolem3(_u35, _u33, _u31), _u35) )).
% 1.89/2.05  cnf(d2_xboole_0-7, axiom, ( ( _u31 = set_union2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u35) | in(skolem4(_u35, _u33, _u31), _u33) | ~in(skolem3(_u35, _u33, _u31), _u33) )).
% 1.89/2.05  cnf(d2_xboole_0-8, axiom, ( ( _u31 = set_union2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u31) | ~in(skolem3(_u35, _u33, _u31), _u35) )).
% 1.89/2.05  cnf(d2_xboole_0-9, axiom, ( ( _u31 = set_union2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u31) | ~in(skolem3(_u35, _u33, _u31), _u33) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: d3_tarski ( axiom ) converted to clauses:
% 1.89/2.05  cnf(d3_tarski-1, axiom, ( ~subset(_u42, _u40) | ~in(_u36, _u42) | in(_u36, _u40) )).
% 1.89/2.05  cnf(d3_tarski-2, axiom, ( subset(_u43, _u41) | in(skolem5(_u43, _u41), _u43) )).
% 1.89/2.05  cnf(d3_tarski-3, axiom, ( subset(_u43, _u41) | ~in(skolem5(_u43, _u41), _u41) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: fc2_xboole_0 ( axiom ) converted to clauses:
% 1.89/2.05  cnf(fc2_xboole_0-1, axiom, ( empty(_u45) | ~empty(set_union2(_u45, _u44)) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: fc3_xboole_0 ( axiom ) converted to clauses:
% 1.89/2.05  cnf(fc3_xboole_0-1, axiom, ( empty(_u47) | ~empty(set_union2(_u46, _u47)) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: idempotence_k2_xboole_0 ( axiom ) converted to clauses:
% 1.89/2.05  cnf(idempotence_k2_xboole_0-1, axiom, ( ( set_union2(_u49, _u49) = _u49) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 1.89/2.05  cnf(rc1_xboole_0-1, axiom, ( empty(skolem6) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 1.89/2.05  cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem7) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 1.89/2.05  cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u53, _u53) )).
% 1.89/2.05  
% 1.89/2.05  % Formula: t47_zfmisc_1 ( conjecture ) converted to clauses:
% 1.89/2.05  cnf(t47_zfmisc_1-1, negated_conjecture, ( subset(set_union2(unordered_pair(skolem8, skolem9), skolem10), skolem10) )).
% 1.89/2.05  cnf(t47_zfmisc_1-2, negated_conjecture, ( ~in(skolem8, skolem10) )).
% 1.89/2.05  
% 1.89/2.05  % Problem matrix:
% 1.89/2.05  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 1.89/2.05  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 1.89/2.05  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 1.89/2.05  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( unordered_pair(__eqx_0, __eqx_1) = unordered_pair(__eqy_0, __eqy_1)) )).
% 1.89/2.05  cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_union2(__eqx_0, __eqx_1) = set_union2(__eqy_0, __eqy_1)) )).
% 1.89/2.05  cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem1(__eqx_0, __eqx_1, __eqx_2) = skolem1(__eqy_0, __eqy_1, __eqy_2)) )).
% 1.89/2.05  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem2(__eqx_0, __eqx_1, __eqx_2) = skolem2(__eqy_0, __eqy_1, __eqy_2)) )).
% 1.89/2.05  cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem3(__eqx_0, __eqx_1, __eqx_2) = skolem3(__eqy_0, __eqy_1, __eqy_2)) )).
% 1.89/2.05  cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem4(__eqx_0, __eqx_1, __eqx_2) = skolem4(__eqy_0, __eqy_1, __eqy_2)) )).
% 1.89/2.05  cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem5(__eqx_0, __eqx_1) = skolem5(__eqy_0, __eqy_1)) )).
% 1.89/2.05  cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 1.89/2.05  cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 1.89/2.05  cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 1.89/2.05  cnf(matrix-13, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 1.89/2.05  cnf(matrix-14, plain, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 1.89/2.05  cnf(matrix-15, plain, ( ( set_union2(_u5, _u4) = set_union2(_u4, _u5)) )).
% 1.89/2.05  cnf(matrix-16, plain, ( ( _u15 != unordered_pair(_u19, _u17)) | ~in(_u11, _u15) | ( _u11 = _u19) | ( _u11 = _u17) )).
% 1.89/2.05  cnf(matrix-17, plain, ( ( _u15 != unordered_pair(_u19, _u17)) | in(_u12, _u15) | ( _u12 != _u19) )).
% 1.89/2.05  cnf(matrix-18, plain, ( ( _u15 != unordered_pair(_u19, _u17)) | in(_u12, _u15) | ( _u12 != _u17) )).
% 1.89/2.05  cnf(matrix-19, plain, ( ( _u16 = unordered_pair(_u20, _u18)) | in(skolem1(_u20, _u18, _u16), _u16) | ( skolem2(_u20, _u18, _u16) = _u20) | ( skolem2(_u20, _u18, _u16) = _u18) )).
% 1.89/2.05  cnf(matrix-20, plain, ( ( _u16 = unordered_pair(_u20, _u18)) | in(skolem1(_u20, _u18, _u16), _u16) | ~in(skolem2(_u20, _u18, _u16), _u16) )).
% 1.89/2.05  cnf(matrix-21, plain, ( ( _u16 = unordered_pair(_u20, _u18)) | ( skolem2(_u20, _u18, _u16) = _u20) | ( skolem2(_u20, _u18, _u16) = _u18) | ( skolem1(_u20, _u18, _u16) != _u20) )).
% 1.89/2.05  cnf(matrix-22, plain, ( ( _u16 = unordered_pair(_u20, _u18)) | ( skolem2(_u20, _u18, _u16) = _u20) | ( skolem2(_u20, _u18, _u16) = _u18) | ( skolem1(_u20, _u18, _u16) != _u18) )).
% 1.89/2.05  cnf(matrix-23, plain, ( ( _u16 = unordered_pair(_u20, _u18)) | ~in(skolem2(_u20, _u18, _u16), _u16) | ( skolem1(_u20, _u18, _u16) != _u20) )).
% 1.89/2.05  cnf(matrix-24, plain, ( ( _u16 = unordered_pair(_u20, _u18)) | ~in(skolem2(_u20, _u18, _u16), _u16) | ( skolem1(_u20, _u18, _u16) != _u18) )).
% 1.89/2.05  cnf(matrix-25, plain, ( ( _u30 != set_union2(_u34, _u32)) | ~in(_u26, _u30) | in(_u26, _u34) | in(_u26, _u32) )).
% 1.89/2.05  cnf(matrix-26, plain, ( ( _u30 != set_union2(_u34, _u32)) | in(_u27, _u30) | ~in(_u27, _u34) )).
% 1.89/2.05  cnf(matrix-27, plain, ( ( _u30 != set_union2(_u34, _u32)) | in(_u27, _u30) | ~in(_u27, _u32) )).
% 1.89/2.05  cnf(matrix-28, plain, ( ( _u31 = set_union2(_u35, _u33)) | in(skolem3(_u35, _u33, _u31), _u31) | in(skolem4(_u35, _u33, _u31), _u35) | in(skolem4(_u35, _u33, _u31), _u33) )).
% 1.89/2.05  cnf(matrix-29, plain, ( ( _u31 = set_union2(_u35, _u33)) | in(skolem3(_u35, _u33, _u31), _u31) | ~in(skolem4(_u35, _u33, _u31), _u31) )).
% 1.89/2.05  cnf(matrix-30, plain, ( ( _u31 = set_union2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u35) | in(skolem4(_u35, _u33, _u31), _u33) | ~in(skolem3(_u35, _u33, _u31), _u35) )).
% 1.89/2.05  cnf(matrix-31, plain, ( ( _u31 = set_union2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u35) | in(skolem4(_u35, _u33, _u31), _u33) | ~in(skolem3(_u35, _u33, _u31), _u33) )).
% 1.89/2.05  cnf(matrix-32, plain, ( ( _u31 = set_union2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u31) | ~in(skolem3(_u35, _u33, _u31), _u35) )).
% 1.89/2.05  cnf(matrix-33, plain, ( ( _u31 = set_union2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u31) | ~in(skolem3(_u35, _u33, _u31), _u33) )).
% 1.89/2.05  cnf(matrix-34, plain, ( ~subset(_u42, _u40) | ~in(_u36, _u42) | in(_u36, _u40) )).
% 1.89/2.05  cnf(matrix-35, plain, ( subset(_u43, _u41) | in(skolem5(_u43, _u41), _u43) )).
% 1.89/2.05  cnf(matrix-36, plain, ( subset(_u43, _u41) | ~in(skolem5(_u43, _u41), _u41) )).
% 1.89/2.05  cnf(matrix-37, plain, ( empty(_u45) | ~empty(set_union2(_u45, _u44)) )).
% 1.89/2.05  cnf(matrix-38, plain, ( empty(_u47) | ~empty(set_union2(_u46, _u47)) )).
% 1.89/2.05  cnf(matrix-39, plain, ( ( set_union2(_u49, _u49) = _u49) )).
% 1.89/2.05  cnf(matrix-40, plain, ( empty(skolem6) )).
% 1.89/2.05  cnf(matrix-41, plain, ( ~empty(skolem7) )).
% 1.89/2.05  cnf(matrix-42, plain, ( subset(_u53, _u53) )).
% 1.89/2.05  cnf(matrix-43, plain, ( subset(set_union2(unordered_pair(skolem8, skolem9), skolem10), skolem10) )).
% 1.89/2.05  cnf(matrix-44, plain, ( ~in(skolem8, skolem10) )).
% 1.89/2.05  
% 1.89/2.05  % Proof stack:
% 1.89/2.05  cnf(proof-stack, plain, 
% 1.89/2.05  proof_stack(
% 1.89/2.05  start(44), 
% 1.89/2.05  left_branch(0, 34, 2, 2), 
% 1.89/2.05  left_branch(0, 43, 0, 3), 
% 1.89/2.05  right_branch(3), 
% 1.89/2.05  left_branch(0, 27, 1, 4), 
% 1.89/2.05  left_branch(0, 15, 0, 5), 
% 1.89/2.05  right_branch(5), 
% 1.89/2.05  left_branch(0, 18, 1, 6), 
% 1.89/2.05  left_branch(0, 14, 0, 7), 
% 1.89/2.05  right_branch(7), 
% 1.89/2.05  left_branch(0, 0, 0, 8), 
% 1.89/2.05  right_branch(8), 
% 1.89/2.05  right_branch(6), 
% 1.89/2.05  right_branch(4), 
% 1.89/2.05  right_branch(2)
% 1.89/2.05  )).
% 1.89/2.05  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------