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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SEU126+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 : n016.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:20:16 EST 2024

% Result   : Theorem 2.06s 2.24s
% Output   : Proof 2.06s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU126+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33  % Computer : n016.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 : Sun Mar  3 11:15:58 EST 2024
% 0.12/0.33  % CPUTime  : 
% 2.06/2.24  % SZS status Theorem for theBenchmark
% 2.06/2.24  % SZS output start Proof for theBenchmark
% 2.06/2.24  
% 2.06/2.24  % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 2.06/2.24  cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: commutativity_k2_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(commutativity_k2_xboole_0-1, axiom, ( ( set_union2(_u3, _u2) = set_union2(_u2, _u3)) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: d10_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(d10_xboole_0-1, axiom, ( ( _u8 != _u6) | subset(_u8, _u6) )).
% 2.06/2.24  cnf(d10_xboole_0-2, axiom, ( ( _u8 != _u6) | subset(_u6, _u8) )).
% 2.06/2.24  cnf(d10_xboole_0-3, axiom, ( ~subset(_u9, _u7) | ~subset(_u7, _u9) | ( _u9 = _u7) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: d2_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(d2_xboole_0-1, axiom, ( ( _u19 != set_union2(_u23, _u21)) | ~in(_u15, _u19) | in(_u15, _u23) | in(_u15, _u21) )).
% 2.06/2.24  cnf(d2_xboole_0-2, axiom, ( ( _u19 != set_union2(_u23, _u21)) | in(_u16, _u19) | ~in(_u16, _u23) )).
% 2.06/2.24  cnf(d2_xboole_0-3, axiom, ( ( _u19 != set_union2(_u23, _u21)) | in(_u16, _u19) | ~in(_u16, _u21) )).
% 2.06/2.24  cnf(d2_xboole_0-4, axiom, ( ( _u20 = set_union2(_u24, _u22)) | in(skolem1(_u24, _u22, _u20), _u20) | in(skolem2(_u24, _u22, _u20), _u24) | in(skolem2(_u24, _u22, _u20), _u22) )).
% 2.06/2.24  cnf(d2_xboole_0-5, axiom, ( ( _u20 = set_union2(_u24, _u22)) | in(skolem1(_u24, _u22, _u20), _u20) | ~in(skolem2(_u24, _u22, _u20), _u20) )).
% 2.06/2.24  cnf(d2_xboole_0-6, axiom, ( ( _u20 = set_union2(_u24, _u22)) | in(skolem2(_u24, _u22, _u20), _u24) | in(skolem2(_u24, _u22, _u20), _u22) | ~in(skolem1(_u24, _u22, _u20), _u24) )).
% 2.06/2.24  cnf(d2_xboole_0-7, axiom, ( ( _u20 = set_union2(_u24, _u22)) | in(skolem2(_u24, _u22, _u20), _u24) | in(skolem2(_u24, _u22, _u20), _u22) | ~in(skolem1(_u24, _u22, _u20), _u22) )).
% 2.06/2.24  cnf(d2_xboole_0-8, axiom, ( ( _u20 = set_union2(_u24, _u22)) | ~in(skolem2(_u24, _u22, _u20), _u20) | ~in(skolem1(_u24, _u22, _u20), _u24) )).
% 2.06/2.24  cnf(d2_xboole_0-9, axiom, ( ( _u20 = set_union2(_u24, _u22)) | ~in(skolem2(_u24, _u22, _u20), _u20) | ~in(skolem1(_u24, _u22, _u20), _u22) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: d3_tarski ( axiom ) converted to clauses:
% 2.06/2.24  cnf(d3_tarski-1, axiom, ( ~subset(_u31, _u29) | ~in(_u25, _u31) | in(_u25, _u29) )).
% 2.06/2.24  cnf(d3_tarski-2, axiom, ( subset(_u32, _u30) | in(skolem3(_u32, _u30), _u32) )).
% 2.06/2.24  cnf(d3_tarski-3, axiom, ( subset(_u32, _u30) | ~in(skolem3(_u32, _u30), _u30) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  
% 2.06/2.24  % Formula: dt_k2_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  
% 2.06/2.24  % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: fc2_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(fc2_xboole_0-1, axiom, ( empty(_u34) | ~empty(set_union2(_u34, _u33)) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: fc3_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(fc3_xboole_0-1, axiom, ( empty(_u36) | ~empty(set_union2(_u35, _u36)) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: idempotence_k2_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(idempotence_k2_xboole_0-1, axiom, ( ( set_union2(_u38, _u38) = _u38) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(rc1_xboole_0-1, axiom, ( empty(skolem4) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 2.06/2.24  cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem5) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 2.06/2.24  cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u42, _u42) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: t12_xboole_1 ( conjecture ) converted to clauses:
% 2.06/2.24  cnf(t12_xboole_1-1, negated_conjecture, ( subset(skolem6, skolem7) )).
% 2.06/2.24  cnf(t12_xboole_1-2, negated_conjecture, ( ( set_union2(skolem6, skolem7) != skolem7) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: t1_boole ( axiom ) converted to clauses:
% 2.06/2.24  cnf(t1_boole-1, axiom, ( ( set_union2(_u45, empty_set) = _u45) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: t6_boole ( axiom ) converted to clauses:
% 2.06/2.24  cnf(t6_boole-1, axiom, ( ~empty(_u46) | ( _u46 = empty_set) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: t7_boole ( axiom ) converted to clauses:
% 2.06/2.24  cnf(t7_boole-1, axiom, ( ~in(_u48, _u47) | ~empty(_u47) )).
% 2.06/2.24  
% 2.06/2.24  % Formula: t8_boole ( axiom ) converted to clauses:
% 2.06/2.24  cnf(t8_boole-1, axiom, ( ~empty(_u50) | ( _u50 = _u49) | ~empty(_u49) )).
% 2.06/2.24  
% 2.06/2.24  % Problem matrix:
% 2.06/2.24  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 2.06/2.24  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 2.06/2.24  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 2.06/2.24  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_union2(__eqx_0, __eqx_1) = set_union2(__eqy_0, __eqy_1)) )).
% 2.06/2.24  cnf(matrix-4, 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)) )).
% 2.06/2.24  cnf(matrix-5, 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)) )).
% 2.06/2.24  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 2.06/2.24  cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 2.06/2.24  cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 2.06/2.24  cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 2.06/2.24  cnf(matrix-10, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 2.06/2.24  cnf(matrix-11, plain, ( ( set_union2(_u3, _u2) = set_union2(_u2, _u3)) )).
% 2.06/2.24  cnf(matrix-12, plain, ( ( _u8 != _u6) | subset(_u8, _u6) )).
% 2.06/2.24  cnf(matrix-13, plain, ( ( _u8 != _u6) | subset(_u6, _u8) )).
% 2.06/2.24  cnf(matrix-14, plain, ( ~subset(_u9, _u7) | ~subset(_u7, _u9) | ( _u9 = _u7) )).
% 2.06/2.24  cnf(matrix-15, plain, ( ( _u19 != set_union2(_u23, _u21)) | ~in(_u15, _u19) | in(_u15, _u23) | in(_u15, _u21) )).
% 2.06/2.24  cnf(matrix-16, plain, ( ( _u19 != set_union2(_u23, _u21)) | in(_u16, _u19) | ~in(_u16, _u23) )).
% 2.06/2.24  cnf(matrix-17, plain, ( ( _u19 != set_union2(_u23, _u21)) | in(_u16, _u19) | ~in(_u16, _u21) )).
% 2.06/2.24  cnf(matrix-18, plain, ( ( _u20 = set_union2(_u24, _u22)) | in(skolem1(_u24, _u22, _u20), _u20) | in(skolem2(_u24, _u22, _u20), _u24) | in(skolem2(_u24, _u22, _u20), _u22) )).
% 2.06/2.24  cnf(matrix-19, plain, ( ( _u20 = set_union2(_u24, _u22)) | in(skolem1(_u24, _u22, _u20), _u20) | ~in(skolem2(_u24, _u22, _u20), _u20) )).
% 2.06/2.24  cnf(matrix-20, plain, ( ( _u20 = set_union2(_u24, _u22)) | in(skolem2(_u24, _u22, _u20), _u24) | in(skolem2(_u24, _u22, _u20), _u22) | ~in(skolem1(_u24, _u22, _u20), _u24) )).
% 2.06/2.24  cnf(matrix-21, plain, ( ( _u20 = set_union2(_u24, _u22)) | in(skolem2(_u24, _u22, _u20), _u24) | in(skolem2(_u24, _u22, _u20), _u22) | ~in(skolem1(_u24, _u22, _u20), _u22) )).
% 2.06/2.24  cnf(matrix-22, plain, ( ( _u20 = set_union2(_u24, _u22)) | ~in(skolem2(_u24, _u22, _u20), _u20) | ~in(skolem1(_u24, _u22, _u20), _u24) )).
% 2.06/2.24  cnf(matrix-23, plain, ( ( _u20 = set_union2(_u24, _u22)) | ~in(skolem2(_u24, _u22, _u20), _u20) | ~in(skolem1(_u24, _u22, _u20), _u22) )).
% 2.06/2.24  cnf(matrix-24, plain, ( ~subset(_u31, _u29) | ~in(_u25, _u31) | in(_u25, _u29) )).
% 2.06/2.24  cnf(matrix-25, plain, ( subset(_u32, _u30) | in(skolem3(_u32, _u30), _u32) )).
% 2.06/2.24  cnf(matrix-26, plain, ( subset(_u32, _u30) | ~in(skolem3(_u32, _u30), _u30) )).
% 2.06/2.24  cnf(matrix-27, plain, ( empty(empty_set) )).
% 2.06/2.24  cnf(matrix-28, plain, ( empty(_u34) | ~empty(set_union2(_u34, _u33)) )).
% 2.06/2.24  cnf(matrix-29, plain, ( empty(_u36) | ~empty(set_union2(_u35, _u36)) )).
% 2.06/2.24  cnf(matrix-30, plain, ( ( set_union2(_u38, _u38) = _u38) )).
% 2.06/2.24  cnf(matrix-31, plain, ( empty(skolem4) )).
% 2.06/2.24  cnf(matrix-32, plain, ( ~empty(skolem5) )).
% 2.06/2.24  cnf(matrix-33, plain, ( subset(_u42, _u42) )).
% 2.06/2.24  cnf(matrix-34, plain, ( subset(skolem6, skolem7) )).
% 2.06/2.24  cnf(matrix-35, plain, ( ( set_union2(skolem6, skolem7) != skolem7) )).
% 2.06/2.24  cnf(matrix-36, plain, ( ( set_union2(_u45, empty_set) = _u45) )).
% 2.06/2.24  cnf(matrix-37, plain, ( ~empty(_u46) | ( _u46 = empty_set) )).
% 2.06/2.24  cnf(matrix-38, plain, ( ~in(_u48, _u47) | ~empty(_u47) )).
% 2.06/2.24  cnf(matrix-39, plain, ( ~empty(_u50) | ( _u50 = _u49) | ~empty(_u49) )).
% 2.06/2.24  
% 2.06/2.24  % Proof stack:
% 2.06/2.24  cnf(proof-stack, plain, 
% 2.06/2.24  proof_stack(
% 2.06/2.24  start(35), 
% 2.06/2.24  left_branch(0, 1, 1, 2), 
% 2.06/2.24  left_branch(0, 19, 0, 3), 
% 2.06/2.24  left_branch(0, 18, 3, 4), 
% 2.06/2.24  reduction(0, 1), 
% 2.06/2.24  left_branch(0, 24, 1, 6), 
% 2.06/2.24  left_branch(0, 34, 0, 7), 
% 2.06/2.24  right_branch(7), 
% 2.06/2.24  reduction(0, 2), 
% 2.06/2.24  right_branch(6), 
% 2.06/2.24  left_branch(0, 21, 3, 7), 
% 2.06/2.24  lemmata(0, 0), 
% 2.06/2.24  reduction(0, 2), 
% 2.06/2.24  lemmata(0, 1), 
% 2.06/2.24  right_branch(7), 
% 2.06/2.24  right_branch(4), 
% 2.06/2.24  left_branch(0, 23, 2, 5), 
% 2.06/2.24  reduction(0, 1), 
% 2.06/2.24  lemmata(0, 0), 
% 2.06/2.24  right_branch(5), 
% 2.06/2.24  right_branch(3), 
% 2.06/2.24  right_branch(2)
% 2.06/2.24  )).
% 2.06/2.24  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------