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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SET924+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 : n026.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:00 EST 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET924+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33  % Computer : n026.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:50:07 EST 2024
% 0.13/0.34  % CPUTime  : 
% 0.19/0.44  % SZS status Theorem for theBenchmark
% 0.19/0.44  % SZS output start Proof for theBenchmark
% 0.19/0.44  
% 0.19/0.44  % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.19/0.44  cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.19/0.44  
% 0.19/0.44  % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.44  cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 0.19/0.44  
% 0.19/0.44  % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.44  cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 0.19/0.44  
% 0.19/0.44  % Formula: t67_zfmisc_1 ( conjecture ) converted to clauses:
% 0.19/0.44  cnf(t67_zfmisc_1-1, negated_conjecture, ( ( set_difference(singleton(skolem3), skolem4) = singleton(skolem3)) | ~in(skolem5, skolem6) )).
% 0.19/0.44  cnf(t67_zfmisc_1-2, negated_conjecture, ( ( set_difference(singleton(skolem3), skolem4) = singleton(skolem3)) | ( set_difference(singleton(skolem5), skolem6) != singleton(skolem5)) )).
% 0.19/0.44  cnf(t67_zfmisc_1-3, negated_conjecture, ( in(skolem3, skolem4) | ~in(skolem5, skolem6) )).
% 0.19/0.44  cnf(t67_zfmisc_1-4, negated_conjecture, ( in(skolem3, skolem4) | ( set_difference(singleton(skolem5), skolem6) != singleton(skolem5)) )).
% 0.19/0.44  
% 0.19/0.44  % Formula: l34_zfmisc_1 ( axiom ) converted to clauses:
% 0.19/0.44  cnf(l34_zfmisc_1-1, axiom, ( ( set_difference(singleton(_u14), _u12) != singleton(_u14)) | ~in(_u14, _u12) )).
% 0.19/0.44  cnf(l34_zfmisc_1-2, axiom, ( in(_u15, _u13) | ( set_difference(singleton(_u15), _u13) = singleton(_u15)) )).
% 0.19/0.44  
% 0.19/0.44  % Problem matrix:
% 0.19/0.44  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.19/0.44  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.19/0.44  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.19/0.44  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.19/0.44  cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_difference(__eqx_0, __eqx_1) = set_difference(__eqy_0, __eqy_1)) )).
% 0.19/0.44  cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.19/0.44  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.19/0.44  cnf(matrix-7, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.19/0.44  cnf(matrix-8, plain, ( empty(skolem1) )).
% 0.19/0.44  cnf(matrix-9, plain, ( ~empty(skolem2) )).
% 0.19/0.44  cnf(matrix-10, plain, ( ( set_difference(singleton(skolem3), skolem4) = singleton(skolem3)) | ~in(skolem5, skolem6) )).
% 0.19/0.44  cnf(matrix-11, plain, ( ( set_difference(singleton(skolem3), skolem4) = singleton(skolem3)) | ( set_difference(singleton(skolem5), skolem6) != singleton(skolem5)) )).
% 0.19/0.44  cnf(matrix-12, plain, ( in(skolem3, skolem4) | ~in(skolem5, skolem6) )).
% 0.19/0.44  cnf(matrix-13, plain, ( in(skolem3, skolem4) | ( set_difference(singleton(skolem5), skolem6) != singleton(skolem5)) )).
% 0.19/0.44  cnf(matrix-14, plain, ( ( set_difference(singleton(_u14), _u12) != singleton(_u14)) | ~in(_u14, _u12) )).
% 0.19/0.44  cnf(matrix-15, plain, ( in(_u15, _u13) | ( set_difference(singleton(_u15), _u13) = singleton(_u15)) )).
% 0.19/0.44  
% 0.19/0.44  % Proof stack:
% 0.19/0.44  cnf(proof-stack, plain, 
% 0.19/0.44  proof_stack(
% 0.19/0.44  start(14), 
% 0.19/0.44  left_branch(0, 15, 1, 2), 
% 0.19/0.44  left_branch(0, 12, 1, 3), 
% 0.19/0.44  left_branch(0, 14, 1, 4), 
% 0.19/0.44  left_branch(0, 10, 0, 5), 
% 0.19/0.44  reduction(0, 1), 
% 0.19/0.44  right_branch(5), 
% 0.19/0.44  right_branch(4), 
% 0.19/0.44  right_branch(3), 
% 0.19/0.44  right_branch(2), 
% 0.19/0.44  left_branch(0, 15, 0, 3), 
% 0.19/0.44  left_branch(0, 13, 1, 4), 
% 0.19/0.44  left_branch(0, 14, 1, 5), 
% 0.19/0.44  left_branch(0, 11, 0, 6), 
% 0.19/0.44  lemmata(0, 0), 
% 0.19/0.44  right_branch(6), 
% 0.19/0.44  right_branch(5), 
% 0.19/0.44  right_branch(4), 
% 0.19/0.44  right_branch(3)
% 0.19/0.44  )).
% 0.19/0.44  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------