%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SET899+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 : n024.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:57 EST 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET899+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33  % Computer : n024.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 18:53:21 EST 2024
% 0.12/0.33  % CPUTime  : 
% 0.12/0.33  % SZS status Theorem for theBenchmark
% 0.12/0.33  % SZS output start Proof for theBenchmark
% 0.12/0.33  
% 0.12/0.33  % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.12/0.33  cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u1, _u1) )).
% 0.12/0.33  
% 0.12/0.33  % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.12/0.33  cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u3, _u2) | ~in(_u2, _u3) )).
% 0.12/0.33  
% 0.12/0.33  % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.33  cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 0.12/0.33  
% 0.12/0.33  % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.33  cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 0.12/0.33  
% 0.12/0.33  % Formula: t40_zfmisc_1 ( conjecture ) converted to clauses:
% 0.12/0.33  cnf(t40_zfmisc_1-1, negated_conjecture, ( subset(skolem3, skolem4) )).
% 0.12/0.33  cnf(t40_zfmisc_1-2, negated_conjecture, ( ~in(skolem5, skolem3) )).
% 0.12/0.33  cnf(t40_zfmisc_1-3, negated_conjecture, ( ~subset(skolem3, set_difference(skolem4, singleton(skolem5))) )).
% 0.12/0.33  
% 0.12/0.33  % Formula: l3_zfmisc_1 ( axiom ) converted to clauses:
% 0.12/0.33  cnf(l3_zfmisc_1-1, axiom, ( ~subset(_u11, _u10) | in(_u9, _u11) | subset(_u11, set_difference(_u10, singleton(_u9))) )).
% 0.12/0.33  
% 0.12/0.33  % Problem matrix:
% 0.12/0.33  cnf(matrix-0, plain, ( subset(_u1, _u1) )).
% 0.12/0.33  cnf(matrix-1, plain, ( ~in(_u3, _u2) | ~in(_u2, _u3) )).
% 0.12/0.33  cnf(matrix-2, plain, ( empty(skolem1) )).
% 0.12/0.33  cnf(matrix-3, plain, ( ~empty(skolem2) )).
% 0.12/0.33  cnf(matrix-4, plain, ( subset(skolem3, skolem4) )).
% 0.12/0.33  cnf(matrix-5, plain, ( ~in(skolem5, skolem3) )).
% 0.12/0.33  cnf(matrix-6, plain, ( ~subset(skolem3, set_difference(skolem4, singleton(skolem5))) )).
% 0.12/0.33  cnf(matrix-7, plain, ( ~subset(_u11, _u10) | in(_u9, _u11) | subset(_u11, set_difference(_u10, singleton(_u9))) )).
% 0.12/0.33  
% 0.12/0.33  % Proof stack:
% 0.12/0.33  cnf(proof-stack, plain, 
% 0.12/0.33  proof_stack(
% 0.12/0.33  start(5), 
% 0.12/0.33  left_branch(0, 7, 1, 2), 
% 0.12/0.33  left_branch(0, 4, 0, 3), 
% 0.12/0.33  right_branch(3), 
% 0.12/0.33  left_branch(0, 6, 0, 4), 
% 0.12/0.33  right_branch(4), 
% 0.12/0.33  right_branch(2)
% 0.12/0.33  )).
% 0.12/0.33  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------