%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SET573+3 : TPTP v8.1.2. Released v2.2.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:19:20 EST 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET573+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33  % Computer : n016.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:42:59 EST 2024
% 0.13/0.33  % CPUTime  : 
% 0.13/0.34  % SZS status Theorem for theBenchmark
% 0.13/0.34  % SZS output start Proof for theBenchmark
% 0.13/0.34  
% 0.13/0.34  % Formula: intersect_defn ( axiom ) converted to clauses:
% 0.13/0.34  cnf(intersect_defn-1, axiom, ( ~intersect(_u6, _u4) | member(skolem1(_u6, _u4), _u6) )).
% 0.13/0.34  cnf(intersect_defn-2, axiom, ( ~intersect(_u6, _u4) | member(skolem1(_u6, _u4), _u4) )).
% 0.13/0.34  cnf(intersect_defn-3, axiom, ( ~member(_u1, _u7) | ~member(_u1, _u5) | intersect(_u7, _u5) )).
% 0.13/0.34  
% 0.13/0.34  % Formula: disjoint_defn ( axiom ) converted to clauses:
% 0.13/0.34  cnf(disjoint_defn-1, axiom, ( ~disjoint(_u12, _u10) | ~intersect(_u12, _u10) )).
% 0.13/0.34  cnf(disjoint_defn-2, axiom, ( intersect(_u13, _u11) | disjoint(_u13, _u11) )).
% 0.13/0.34  
% 0.13/0.34  % Formula: symmetry_of_intersect ( axiom ) converted to clauses:
% 0.13/0.34  cnf(symmetry_of_intersect-1, axiom, ( ~intersect(_u15, _u14) | intersect(_u14, _u15) )).
% 0.13/0.34  
% 0.13/0.34  % Formula: prove_th12 ( conjecture ) converted to clauses:
% 0.13/0.34  cnf(prove_th12-1, negated_conjecture, ( member(skolem2, skolem3) )).
% 0.13/0.34  cnf(prove_th12-2, negated_conjecture, ( disjoint(skolem3, skolem4) )).
% 0.13/0.34  cnf(prove_th12-3, negated_conjecture, ( member(skolem2, skolem4) )).
% 0.13/0.34  
% 0.13/0.34  % Problem matrix:
% 0.13/0.34  cnf(matrix-0, plain, ( ~intersect(_u6, _u4) | member(skolem1(_u6, _u4), _u6) )).
% 0.13/0.34  cnf(matrix-1, plain, ( ~intersect(_u6, _u4) | member(skolem1(_u6, _u4), _u4) )).
% 0.13/0.34  cnf(matrix-2, plain, ( ~member(_u1, _u7) | ~member(_u1, _u5) | intersect(_u7, _u5) )).
% 0.13/0.34  cnf(matrix-3, plain, ( ~disjoint(_u12, _u10) | ~intersect(_u12, _u10) )).
% 0.13/0.34  cnf(matrix-4, plain, ( intersect(_u13, _u11) | disjoint(_u13, _u11) )).
% 0.13/0.34  cnf(matrix-5, plain, ( ~intersect(_u15, _u14) | intersect(_u14, _u15) )).
% 0.13/0.34  cnf(matrix-6, plain, ( member(skolem2, skolem3) )).
% 0.13/0.34  cnf(matrix-7, plain, ( disjoint(skolem3, skolem4) )).
% 0.13/0.34  cnf(matrix-8, plain, ( member(skolem2, skolem4) )).
% 0.13/0.34  
% 0.13/0.34  % Proof stack:
% 0.13/0.34  cnf(proof-stack, plain, 
% 0.13/0.34  proof_stack(
% 0.13/0.34  start(3), 
% 0.13/0.34  left_branch(0, 7, 0, 2), 
% 0.13/0.34  right_branch(2), 
% 0.13/0.34  left_branch(0, 2, 2, 3), 
% 0.13/0.34  left_branch(0, 6, 0, 4), 
% 0.13/0.34  right_branch(4), 
% 0.13/0.34  left_branch(0, 8, 0, 5), 
% 0.13/0.34  right_branch(5), 
% 0.13/0.34  right_branch(3)
% 0.13/0.34  )).
% 0.13/0.34  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------