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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SEU155+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 : n022.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:22 EST 2024

% Result   : Theorem 0.20s 0.40s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU155+1 : TPTP v8.1.2. Released v3.3.0.
% 0.04/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sun Mar  3 11:05:49 EST 2024
% 0.13/0.34  % CPUTime  : 
% 0.20/0.40  % SZS status Theorem for theBenchmark
% 0.20/0.40  % SZS output start Proof for theBenchmark
% 0.20/0.40  
% 0.20/0.40  % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.20/0.40  cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.20/0.40  
% 0.20/0.40  % Formula: d3_tarski ( axiom ) converted to clauses:
% 0.20/0.40  cnf(d3_tarski-1, axiom, ( ~subset(_u8, _u6) | ~in(_u2, _u8) | in(_u2, _u6) )).
% 0.20/0.40  cnf(d3_tarski-2, axiom, ( subset(_u9, _u7) | in(skolem1(_u9, _u7), _u9) )).
% 0.20/0.40  cnf(d3_tarski-3, axiom, ( subset(_u9, _u7) | ~in(skolem1(_u9, _u7), _u7) )).
% 0.20/0.40  
% 0.20/0.40  % Formula: d4_tarski ( axiom ) converted to clauses:
% 0.20/0.40  cnf(d4_tarski-1, axiom, ( ( _u22 != union(_u24)) | ~in(_u18, _u22) | in(_u18, skolem2(_u24, _u22, _u18)) )).
% 0.20/0.40  cnf(d4_tarski-2, axiom, ( ( _u22 != union(_u24)) | ~in(_u18, _u22) | in(skolem2(_u24, _u22, _u18), _u24) )).
% 0.20/0.40  cnf(d4_tarski-3, axiom, ( ( _u22 != union(_u24)) | ~in(_u19, _u11) | ~in(_u11, _u24) | in(_u19, _u22) )).
% 0.20/0.40  cnf(d4_tarski-4, axiom, ( ( _u23 = union(_u25)) | in(skolem3(_u25, _u23), _u23) | in(skolem4(_u25, _u23), skolem5(_u25, _u23)) )).
% 0.20/0.40  cnf(d4_tarski-5, axiom, ( ( _u23 = union(_u25)) | in(skolem3(_u25, _u23), _u23) | in(skolem5(_u25, _u23), _u25) )).
% 0.20/0.40  cnf(d4_tarski-6, axiom, ( ( _u23 = union(_u25)) | in(skolem3(_u25, _u23), _u23) | ~in(skolem4(_u25, _u23), _u23) )).
% 0.20/0.40  cnf(d4_tarski-7, axiom, ( ( _u23 = union(_u25)) | ~in(skolem3(_u25, _u23), _u13) | ~in(_u13, _u25) | in(skolem4(_u25, _u23), skolem5(_u25, _u23)) )).
% 0.20/0.40  cnf(d4_tarski-8, axiom, ( ( _u23 = union(_u25)) | ~in(skolem3(_u25, _u23), _u13) | ~in(_u13, _u25) | in(skolem5(_u25, _u23), _u25) )).
% 0.20/0.40  cnf(d4_tarski-9, axiom, ( ( _u23 = union(_u25)) | ~in(skolem3(_u25, _u23), _u13) | ~in(_u13, _u25) | ~in(skolem4(_u25, _u23), _u23) )).
% 0.20/0.40  
% 0.20/0.40  % Formula: dt_k3_tarski ( axiom ) converted to clauses:
% 0.20/0.40  
% 0.20/0.40  % Formula: l50_zfmisc_1 ( conjecture ) converted to clauses:
% 0.20/0.40  cnf(l50_zfmisc_1-1, negated_conjecture, ( in(skolem6, skolem7) )).
% 0.20/0.40  cnf(l50_zfmisc_1-2, negated_conjecture, ( ~subset(skolem6, union(skolem7)) )).
% 0.20/0.40  
% 0.20/0.40  % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.20/0.40  cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u29, _u29) )).
% 0.20/0.40  
% 0.20/0.40  % Problem matrix:
% 0.20/0.40  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.20/0.40  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.20/0.40  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.20/0.40  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( union(__eqx_0) = union(__eqy_0)) )).
% 0.20/0.40  cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.20/0.40  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)) )).
% 0.20/0.40  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 0.20/0.40  cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem4(__eqx_0, __eqx_1) = skolem4(__eqy_0, __eqy_1)) )).
% 0.20/0.40  cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem5(__eqx_0, __eqx_1) = skolem5(__eqy_0, __eqy_1)) )).
% 0.20/0.40  cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.20/0.40  cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.20/0.40  cnf(matrix-11, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.20/0.40  cnf(matrix-12, plain, ( ~subset(_u8, _u6) | ~in(_u2, _u8) | in(_u2, _u6) )).
% 0.20/0.40  cnf(matrix-13, plain, ( subset(_u9, _u7) | in(skolem1(_u9, _u7), _u9) )).
% 0.20/0.40  cnf(matrix-14, plain, ( subset(_u9, _u7) | ~in(skolem1(_u9, _u7), _u7) )).
% 0.20/0.40  cnf(matrix-15, plain, ( ( _u22 != union(_u24)) | ~in(_u18, _u22) | in(_u18, skolem2(_u24, _u22, _u18)) )).
% 0.20/0.40  cnf(matrix-16, plain, ( ( _u22 != union(_u24)) | ~in(_u18, _u22) | in(skolem2(_u24, _u22, _u18), _u24) )).
% 0.20/0.40  cnf(matrix-17, plain, ( ( _u22 != union(_u24)) | ~in(_u19, _u11) | ~in(_u11, _u24) | in(_u19, _u22) )).
% 0.20/0.40  cnf(matrix-18, plain, ( ( _u23 = union(_u25)) | in(skolem3(_u25, _u23), _u23) | in(skolem4(_u25, _u23), skolem5(_u25, _u23)) )).
% 0.20/0.40  cnf(matrix-19, plain, ( ( _u23 = union(_u25)) | in(skolem3(_u25, _u23), _u23) | in(skolem5(_u25, _u23), _u25) )).
% 0.20/0.40  cnf(matrix-20, plain, ( ( _u23 = union(_u25)) | in(skolem3(_u25, _u23), _u23) | ~in(skolem4(_u25, _u23), _u23) )).
% 0.20/0.40  cnf(matrix-21, plain, ( ( _u23 = union(_u25)) | ~in(skolem3(_u25, _u23), _u13) | ~in(_u13, _u25) | in(skolem4(_u25, _u23), skolem5(_u25, _u23)) )).
% 0.20/0.40  cnf(matrix-22, plain, ( ( _u23 = union(_u25)) | ~in(skolem3(_u25, _u23), _u13) | ~in(_u13, _u25) | in(skolem5(_u25, _u23), _u25) )).
% 0.20/0.40  cnf(matrix-23, plain, ( ( _u23 = union(_u25)) | ~in(skolem3(_u25, _u23), _u13) | ~in(_u13, _u25) | ~in(skolem4(_u25, _u23), _u23) )).
% 0.20/0.40  cnf(matrix-24, plain, ( in(skolem6, skolem7) )).
% 0.20/0.40  cnf(matrix-25, plain, ( ~subset(skolem6, union(skolem7)) )).
% 0.20/0.40  cnf(matrix-26, plain, ( subset(_u29, _u29) )).
% 0.20/0.40  
% 0.20/0.40  % Proof stack:
% 0.20/0.40  cnf(proof-stack, plain, 
% 0.20/0.40  proof_stack(
% 0.20/0.40  start(25), 
% 0.20/0.40  left_branch(0, 14, 0, 2), 
% 0.20/0.40  left_branch(0, 17, 3, 3), 
% 0.20/0.40  left_branch(0, 3, 1, 4), 
% 0.20/0.40  left_branch(0, 0, 0, 5), 
% 0.20/0.40  right_branch(5), 
% 0.20/0.40  right_branch(4), 
% 0.20/0.40  left_branch(0, 24, 0, 5), 
% 0.20/0.40  right_branch(5), 
% 0.20/0.40  left_branch(0, 13, 1, 6), 
% 0.20/0.40  reduction(0, 0), 
% 0.20/0.40  right_branch(6), 
% 0.20/0.40  right_branch(3), 
% 0.20/0.40  right_branch(2)
% 0.20/0.40  )).
% 0.20/0.40  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------