TSTP Solution File: SET585+3 by ConnectPP---0.2.2

View Problem - Process Solution

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

% Result   : Theorem 0.52s 0.67s
% Output   : Proof 0.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET585+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.12/0.33  % Computer : n009.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 19:22:17 EST 2024
% 0.12/0.33  % CPUTime  : 
% 0.52/0.67  % SZS status Theorem for theBenchmark
% 0.52/0.67  % SZS output start Proof for theBenchmark
% 0.52/0.67  
% 0.52/0.67  % Formula: transitivity_of_subset ( axiom ) converted to clauses:
% 0.52/0.67  cnf(transitivity_of_subset-1, axiom, ( ~subset(_u2, _u1) | ~subset(_u1, _u0) | subset(_u2, _u0) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: subset_of_union ( axiom ) converted to clauses:
% 0.52/0.67  cnf(subset_of_union-1, axiom, ( subset(_u4, union(_u4, _u3)) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: intersection_is_subset ( axiom ) converted to clauses:
% 0.52/0.67  cnf(intersection_is_subset-1, axiom, ( subset(intersection(_u6, _u5), _u6) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: union_defn ( axiom ) converted to clauses:
% 0.52/0.67  cnf(union_defn-1, axiom, ( ~member(_u10, union(_u14, _u12)) | member(_u10, _u14) | member(_u10, _u12) )).
% 0.52/0.67  cnf(union_defn-2, axiom, ( member(_u11, union(_u15, _u13)) | ~member(_u11, _u15) )).
% 0.52/0.67  cnf(union_defn-3, axiom, ( member(_u11, union(_u15, _u13)) | ~member(_u11, _u13) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: intersection_defn ( axiom ) converted to clauses:
% 0.52/0.67  cnf(intersection_defn-1, axiom, ( ~member(_u19, intersection(_u23, _u21)) | member(_u19, _u23) )).
% 0.52/0.67  cnf(intersection_defn-2, axiom, ( ~member(_u19, intersection(_u23, _u21)) | member(_u19, _u21) )).
% 0.52/0.67  cnf(intersection_defn-3, axiom, ( ~member(_u20, _u24) | ~member(_u20, _u22) | member(_u20, intersection(_u24, _u22)) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: subset_defn ( axiom ) converted to clauses:
% 0.52/0.67  cnf(subset_defn-1, axiom, ( ~subset(_u31, _u29) | ~member(_u25, _u31) | member(_u25, _u29) )).
% 0.52/0.67  cnf(subset_defn-2, axiom, ( subset(_u32, _u30) | member(skolem1(_u32, _u30), _u32) )).
% 0.52/0.67  cnf(subset_defn-3, axiom, ( subset(_u32, _u30) | ~member(skolem1(_u32, _u30), _u30) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: commutativity_of_union ( axiom ) converted to clauses:
% 0.52/0.67  cnf(commutativity_of_union-1, axiom, ( ( union(_u34, _u33) = union(_u33, _u34)) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: commutativity_of_intersection ( axiom ) converted to clauses:
% 0.52/0.67  cnf(commutativity_of_intersection-1, axiom, ( ( intersection(_u36, _u35) = intersection(_u35, _u36)) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 0.52/0.67  cnf(reflexivity_of_subset-1, axiom, ( subset(_u37, _u37) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: equal_member_defn ( axiom ) converted to clauses:
% 0.52/0.67  cnf(equal_member_defn-1, axiom, ( ( _u48 != _u46) | ~member(_u42, _u48) | member(_u42, _u46) )).
% 0.52/0.67  cnf(equal_member_defn-2, axiom, ( ( _u48 != _u46) | ~member(_u43, _u46) | member(_u43, _u48) )).
% 0.52/0.67  cnf(equal_member_defn-3, axiom, ( ( _u49 = _u47) | member(skolem2(_u49, _u47), _u49) | member(skolem3(_u49, _u47), _u47) )).
% 0.52/0.67  cnf(equal_member_defn-4, axiom, ( ( _u49 = _u47) | member(skolem2(_u49, _u47), _u49) | ~member(skolem3(_u49, _u47), _u49) )).
% 0.52/0.67  cnf(equal_member_defn-5, axiom, ( ( _u49 = _u47) | ~member(skolem2(_u49, _u47), _u47) | member(skolem3(_u49, _u47), _u47) )).
% 0.52/0.67  cnf(equal_member_defn-6, axiom, ( ( _u49 = _u47) | ~member(skolem2(_u49, _u47), _u47) | ~member(skolem3(_u49, _u47), _u49) )).
% 0.52/0.67  
% 0.52/0.67  % Formula: prove_intersection_subset_of_union ( conjecture ) converted to clauses:
% 0.52/0.67  cnf(prove_intersection_subset_of_union-1, negated_conjecture, ( ~subset(intersection(skolem4, skolem5), union(skolem4, skolem6)) )).
% 0.52/0.67  
% 0.52/0.67  % Problem matrix:
% 0.52/0.67  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.52/0.67  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.52/0.67  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.52/0.67  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( union(__eqx_0, __eqx_1) = union(__eqy_0, __eqy_1)) )).
% 0.52/0.67  cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( intersection(__eqx_0, __eqx_1) = intersection(__eqy_0, __eqy_1)) )).
% 0.52/0.67  cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.52/0.67  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 0.52/0.67  cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 0.52/0.67  cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.52/0.67  cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 0.52/0.67  cnf(matrix-10, plain, ( ~subset(_u2, _u1) | ~subset(_u1, _u0) | subset(_u2, _u0) )).
% 0.52/0.67  cnf(matrix-11, plain, ( subset(_u4, union(_u4, _u3)) )).
% 0.52/0.67  cnf(matrix-12, plain, ( subset(intersection(_u6, _u5), _u6) )).
% 0.52/0.67  cnf(matrix-13, plain, ( ~member(_u10, union(_u14, _u12)) | member(_u10, _u14) | member(_u10, _u12) )).
% 0.52/0.67  cnf(matrix-14, plain, ( member(_u11, union(_u15, _u13)) | ~member(_u11, _u15) )).
% 0.52/0.67  cnf(matrix-15, plain, ( member(_u11, union(_u15, _u13)) | ~member(_u11, _u13) )).
% 0.52/0.67  cnf(matrix-16, plain, ( ~member(_u19, intersection(_u23, _u21)) | member(_u19, _u23) )).
% 0.52/0.67  cnf(matrix-17, plain, ( ~member(_u19, intersection(_u23, _u21)) | member(_u19, _u21) )).
% 0.52/0.67  cnf(matrix-18, plain, ( ~member(_u20, _u24) | ~member(_u20, _u22) | member(_u20, intersection(_u24, _u22)) )).
% 0.52/0.67  cnf(matrix-19, plain, ( ~subset(_u31, _u29) | ~member(_u25, _u31) | member(_u25, _u29) )).
% 0.52/0.67  cnf(matrix-20, plain, ( subset(_u32, _u30) | member(skolem1(_u32, _u30), _u32) )).
% 0.52/0.67  cnf(matrix-21, plain, ( subset(_u32, _u30) | ~member(skolem1(_u32, _u30), _u30) )).
% 0.52/0.67  cnf(matrix-22, plain, ( ( union(_u34, _u33) = union(_u33, _u34)) )).
% 0.52/0.67  cnf(matrix-23, plain, ( ( intersection(_u36, _u35) = intersection(_u35, _u36)) )).
% 0.52/0.67  cnf(matrix-24, plain, ( subset(_u37, _u37) )).
% 0.52/0.67  cnf(matrix-25, plain, ( ( _u48 != _u46) | ~member(_u42, _u48) | member(_u42, _u46) )).
% 0.52/0.67  cnf(matrix-26, plain, ( ( _u48 != _u46) | ~member(_u43, _u46) | member(_u43, _u48) )).
% 0.52/0.67  cnf(matrix-27, plain, ( ( _u49 = _u47) | member(skolem2(_u49, _u47), _u49) | member(skolem3(_u49, _u47), _u47) )).
% 0.52/0.67  cnf(matrix-28, plain, ( ( _u49 = _u47) | member(skolem2(_u49, _u47), _u49) | ~member(skolem3(_u49, _u47), _u49) )).
% 0.52/0.67  cnf(matrix-29, plain, ( ( _u49 = _u47) | ~member(skolem2(_u49, _u47), _u47) | member(skolem3(_u49, _u47), _u47) )).
% 0.52/0.67  cnf(matrix-30, plain, ( ( _u49 = _u47) | ~member(skolem2(_u49, _u47), _u47) | ~member(skolem3(_u49, _u47), _u49) )).
% 0.52/0.67  cnf(matrix-31, plain, ( ~subset(intersection(skolem4, skolem5), union(skolem4, skolem6)) )).
% 0.52/0.67  
% 0.52/0.67  % Proof stack:
% 0.52/0.67  cnf(proof-stack, plain, 
% 0.52/0.67  proof_stack(
% 0.52/0.67  start(31), 
% 0.52/0.67  left_branch(0, 21, 0, 2), 
% 0.52/0.67  left_branch(0, 14, 0, 3), 
% 0.52/0.67  left_branch(0, 16, 1, 4), 
% 0.52/0.67  left_branch(0, 20, 1, 5), 
% 0.52/0.67  reduction(0, 0), 
% 0.52/0.67  right_branch(5), 
% 0.52/0.67  right_branch(4), 
% 0.52/0.67  right_branch(3), 
% 0.52/0.67  right_branch(2)
% 0.52/0.67  )).
% 0.52/0.67  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------