%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : SEU163+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 : n008.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 : Mon Mar 25 14:33:23 EDT 2024

% Result   : Theorem 0.13s 0.35s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU163+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34  % Computer : n008.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 : Wed Mar 20 14:09:43 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % SZS status Theorem for theBenchmark
% 0.13/0.35  % SZS output start Proof for theBenchmark
% 0.13/0.35  
% 0.13/0.35  % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.13/0.35  cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u1, _u1) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.13/0.35  cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u3, _u2) | ~in(_u2, _u3) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: dt_k3_tarski ( axiom ) converted to clauses:
% 0.13/0.35  cnf(dt_k3_tarski, axiom, $true).
% 0.13/0.35  
% 0.13/0.35  % Formula: t92_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.35  cnf(t92_zfmisc_1-1, negated_conjecture, ( in(skolem1, skolem2) )).
% 0.13/0.35  cnf(t92_zfmisc_1-2, negated_conjecture, ( ~subset(skolem1, union(skolem2)) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: l50_zfmisc_1 ( axiom ) converted to clauses:
% 0.13/0.35  cnf(l50_zfmisc_1-1, axiom, ( ~in(_u7, _u6) | subset(_u7, union(_u6)) )).
% 0.13/0.35  
% 0.13/0.35  % Problem matrix:
% 0.13/0.35  cnf(matrix-0, plain, ( subset(_u1, _u1) )).
% 0.13/0.35  cnf(matrix-1, plain, ( ~in(_u3, _u2) | ~in(_u2, _u3) )).
% 0.13/0.35  cnf(matrix-2, plain, ( in(skolem1, skolem2) )).
% 0.13/0.35  cnf(matrix-3, plain, ( ~subset(skolem1, union(skolem2)) )).
% 0.13/0.35  cnf(matrix-4, plain, ( ~in(_u7, _u6) | subset(_u7, union(_u6)) )).
% 0.13/0.35  
% 0.13/0.35  % Proof stack:
% 0.13/0.35  cnf(proof-stack, plain, 
% 0.13/0.35  proof_stack(
% 0.13/0.35  start(3), 
% 0.13/0.35  left_branch(0, 4, 1, 2), 
% 0.13/0.35  left_branch(0, 2, 0, 3), 
% 0.13/0.35  right_branch(3), 
% 0.13/0.35  right_branch(2)
% 0.13/0.35  )).
% 0.13/0.35  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------