TSTP Solution File: SET914+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET914+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 : n002.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:32:47 EDT 2024
% Result : Theorem 31.65s 31.84s
% Output : Proof 31.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET914+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.14 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Mar 20 22:13:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 31.65/31.84 % SZS status Theorem for theBenchmark
% 31.65/31.84 % SZS output start Proof for theBenchmark
% 31.65/31.84
% 31.65/31.84 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 31.65/31.84 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 31.65/31.84
% 31.65/31.84 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 31.65/31.84 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 31.65/31.84
% 31.65/31.84 % Formula: commutativity_k3_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(commutativity_k3_xboole_0-1, axiom, ( ( set_intersection2(_u5, _u4) = set_intersection2(_u4, _u5)) )).
% 31.65/31.84
% 31.65/31.84 % Formula: d1_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(d1_xboole_0-1, axiom, ( ( _u9 != empty_set) | ~in(_u6, _u9) )).
% 31.65/31.84 cnf(d1_xboole_0-2, axiom, ( in(skolem1(_u10), _u10) | ( _u10 = empty_set) )).
% 31.65/31.84
% 31.65/31.84 % Formula: d2_tarski ( axiom ) converted to clauses:
% 31.65/31.84 cnf(d2_tarski-1, axiom, ( ( _u20 != unordered_pair(_u24, _u22)) | ~in(_u16, _u20) | ( _u16 = _u24) | ( _u16 = _u22) )).
% 31.65/31.84 cnf(d2_tarski-2, axiom, ( ( _u20 != unordered_pair(_u24, _u22)) | in(_u17, _u20) | ( _u17 != _u24) )).
% 31.65/31.84 cnf(d2_tarski-3, axiom, ( ( _u20 != unordered_pair(_u24, _u22)) | in(_u17, _u20) | ( _u17 != _u22) )).
% 31.65/31.84 cnf(d2_tarski-4, axiom, ( ( _u21 = unordered_pair(_u25, _u23)) | in(skolem2(_u25, _u23, _u21), _u21) | ( skolem3(_u25, _u23, _u21) = _u25) | ( skolem3(_u25, _u23, _u21) = _u23) )).
% 31.65/31.84 cnf(d2_tarski-5, axiom, ( ( _u21 = unordered_pair(_u25, _u23)) | in(skolem2(_u25, _u23, _u21), _u21) | ~in(skolem3(_u25, _u23, _u21), _u21) )).
% 31.65/31.84 cnf(d2_tarski-6, axiom, ( ( _u21 = unordered_pair(_u25, _u23)) | ( skolem3(_u25, _u23, _u21) = _u25) | ( skolem3(_u25, _u23, _u21) = _u23) | ( skolem2(_u25, _u23, _u21) != _u25) )).
% 31.65/31.84 cnf(d2_tarski-7, axiom, ( ( _u21 = unordered_pair(_u25, _u23)) | ( skolem3(_u25, _u23, _u21) = _u25) | ( skolem3(_u25, _u23, _u21) = _u23) | ( skolem2(_u25, _u23, _u21) != _u23) )).
% 31.65/31.84 cnf(d2_tarski-8, axiom, ( ( _u21 = unordered_pair(_u25, _u23)) | ~in(skolem3(_u25, _u23, _u21), _u21) | ( skolem2(_u25, _u23, _u21) != _u25) )).
% 31.65/31.84 cnf(d2_tarski-9, axiom, ( ( _u21 = unordered_pair(_u25, _u23)) | ~in(skolem3(_u25, _u23, _u21), _u21) | ( skolem2(_u25, _u23, _u21) != _u23) )).
% 31.65/31.84
% 31.65/31.84 % Formula: d3_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(d3_xboole_0-1, axiom, ( ( _u35 != set_intersection2(_u39, _u37)) | ~in(_u31, _u35) | in(_u31, _u39) )).
% 31.65/31.84 cnf(d3_xboole_0-2, axiom, ( ( _u35 != set_intersection2(_u39, _u37)) | ~in(_u31, _u35) | in(_u31, _u37) )).
% 31.65/31.84 cnf(d3_xboole_0-3, axiom, ( ( _u35 != set_intersection2(_u39, _u37)) | ~in(_u32, _u39) | ~in(_u32, _u37) | in(_u32, _u35) )).
% 31.65/31.84 cnf(d3_xboole_0-4, axiom, ( ( _u36 = set_intersection2(_u40, _u38)) | in(skolem4(_u40, _u38, _u36), _u36) | in(skolem5(_u40, _u38, _u36), _u40) )).
% 31.65/31.84 cnf(d3_xboole_0-5, axiom, ( ( _u36 = set_intersection2(_u40, _u38)) | in(skolem4(_u40, _u38, _u36), _u36) | in(skolem5(_u40, _u38, _u36), _u38) )).
% 31.65/31.84 cnf(d3_xboole_0-6, axiom, ( ( _u36 = set_intersection2(_u40, _u38)) | in(skolem4(_u40, _u38, _u36), _u36) | ~in(skolem5(_u40, _u38, _u36), _u36) )).
% 31.65/31.84 cnf(d3_xboole_0-7, axiom, ( ( _u36 = set_intersection2(_u40, _u38)) | ~in(skolem4(_u40, _u38, _u36), _u40) | ~in(skolem4(_u40, _u38, _u36), _u38) | in(skolem5(_u40, _u38, _u36), _u40) )).
% 31.65/31.84 cnf(d3_xboole_0-8, axiom, ( ( _u36 = set_intersection2(_u40, _u38)) | ~in(skolem4(_u40, _u38, _u36), _u40) | ~in(skolem4(_u40, _u38, _u36), _u38) | in(skolem5(_u40, _u38, _u36), _u38) )).
% 31.65/31.84 cnf(d3_xboole_0-9, axiom, ( ( _u36 = set_intersection2(_u40, _u38)) | ~in(skolem4(_u40, _u38, _u36), _u40) | ~in(skolem4(_u40, _u38, _u36), _u38) | ~in(skolem5(_u40, _u38, _u36), _u36) )).
% 31.65/31.84
% 31.65/31.84 % Formula: d7_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(d7_xboole_0-1, axiom, ( ~disjoint(_u45, _u43) | ( set_intersection2(_u45, _u43) = empty_set) )).
% 31.65/31.84 cnf(d7_xboole_0-2, axiom, ( ( set_intersection2(_u46, _u44) != empty_set) | disjoint(_u46, _u44) )).
% 31.65/31.84
% 31.65/31.84 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 31.65/31.84
% 31.65/31.84 % Formula: idempotence_k3_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(idempotence_k3_xboole_0-1, axiom, ( ( set_intersection2(_u48, _u48) = _u48) )).
% 31.65/31.84
% 31.65/31.84 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(rc1_xboole_0-1, axiom, ( empty(skolem6) )).
% 31.65/31.84
% 31.65/31.84 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem7) )).
% 31.65/31.84
% 31.65/31.84 % Formula: symmetry_r1_xboole_0 ( axiom ) converted to clauses:
% 31.65/31.84 cnf(symmetry_r1_xboole_0-1, axiom, ( ~disjoint(_u52, _u51) | disjoint(_u51, _u52) )).
% 31.65/31.84
% 31.65/31.84 % Formula: t55_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 31.65/31.84 cnf(t55_zfmisc_1-1, negated_conjecture, ( disjoint(unordered_pair(skolem8, skolem9), skolem10) )).
% 31.65/31.84 cnf(t55_zfmisc_1-2, negated_conjecture, ( in(skolem8, skolem10) )).
% 31.65/31.84
% 31.65/31.84 % Problem matrix:
% 31.65/31.84 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 31.65/31.84 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 31.65/31.84 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 31.65/31.84 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( unordered_pair(__eqx_0, __eqx_1) = unordered_pair(__eqy_0, __eqy_1)) )).
% 31.65/31.84 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_intersection2(__eqx_0, __eqx_1) = set_intersection2(__eqy_0, __eqy_1)) )).
% 31.65/31.84 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 31.65/31.84 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem2(__eqx_0, __eqx_1, __eqx_2) = skolem2(__eqy_0, __eqy_1, __eqy_2)) )).
% 31.65/31.84 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem3(__eqx_0, __eqx_1, __eqx_2) = skolem3(__eqy_0, __eqy_1, __eqy_2)) )).
% 31.65/31.84 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem4(__eqx_0, __eqx_1, __eqx_2) = skolem4(__eqy_0, __eqy_1, __eqy_2)) )).
% 31.65/31.84 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem5(__eqx_0, __eqx_1, __eqx_2) = skolem5(__eqy_0, __eqy_1, __eqy_2)) )).
% 31.65/31.84 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 31.65/31.84 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 31.65/31.84 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 31.65/31.84 cnf(matrix-13, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 31.65/31.84 cnf(matrix-14, plain, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 31.65/31.84 cnf(matrix-15, plain, ( ( set_intersection2(_u5, _u4) = set_intersection2(_u4, _u5)) )).
% 31.65/31.84 cnf(matrix-16, plain, ( ( _u9 != empty_set) | ~in(_u6, _u9) )).
% 31.65/31.84 cnf(matrix-17, plain, ( in(skolem1(_u10), _u10) | ( _u10 = empty_set) )).
% 31.65/31.84 cnf(matrix-18, plain, ( ( _u20 != unordered_pair(_u24, _u22)) | ~in(_u16, _u20) | ( _u16 = _u24) | ( _u16 = _u22) )).
% 31.65/31.84 cnf(matrix-19, plain, ( ( _u20 != unordered_pair(_u24, _u22)) | in(_u17, _u20) | ( _u17 != _u24) )).
% 31.65/31.84 cnf(matrix-20, plain, ( ( _u20 != unordered_pair(_u24, _u22)) | in(_u17, _u20) | ( _u17 != _u22) )).
% 31.65/31.84 cnf(matrix-21, plain, ( ( _u21 = unordered_pair(_u25, _u23)) | in(skolem2(_u25, _u23, _u21), _u21) | ( skolem3(_u25, _u23, _u21) = _u25) | ( skolem3(_u25, _u23, _u21) = _u23) )).
% 31.65/31.84 cnf(matrix-22, plain, ( ( _u21 = unordered_pair(_u25, _u23)) | in(skolem2(_u25, _u23, _u21), _u21) | ~in(skolem3(_u25, _u23, _u21), _u21) )).
% 31.65/31.84 cnf(matrix-23, plain, ( ( _u21 = unordered_pair(_u25, _u23)) | ( skolem3(_u25, _u23, _u21) = _u25) | ( skolem3(_u25, _u23, _u21) = _u23) | ( skolem2(_u25, _u23, _u21) != _u25) )).
% 31.65/31.84 cnf(matrix-24, plain, ( ( _u21 = unordered_pair(_u25, _u23)) | ( skolem3(_u25, _u23, _u21) = _u25) | ( skolem3(_u25, _u23, _u21) = _u23) | ( skolem2(_u25, _u23, _u21) != _u23) )).
% 31.65/31.84 cnf(matrix-25, plain, ( ( _u21 = unordered_pair(_u25, _u23)) | ~in(skolem3(_u25, _u23, _u21), _u21) | ( skolem2(_u25, _u23, _u21) != _u25) )).
% 31.65/31.84 cnf(matrix-26, plain, ( ( _u21 = unordered_pair(_u25, _u23)) | ~in(skolem3(_u25, _u23, _u21), _u21) | ( skolem2(_u25, _u23, _u21) != _u23) )).
% 31.65/31.84 cnf(matrix-27, plain, ( ( _u35 != set_intersection2(_u39, _u37)) | ~in(_u31, _u35) | in(_u31, _u39) )).
% 31.65/31.84 cnf(matrix-28, plain, ( ( _u35 != set_intersection2(_u39, _u37)) | ~in(_u31, _u35) | in(_u31, _u37) )).
% 31.65/31.84 cnf(matrix-29, plain, ( ( _u35 != set_intersection2(_u39, _u37)) | ~in(_u32, _u39) | ~in(_u32, _u37) | in(_u32, _u35) )).
% 31.65/31.84 cnf(matrix-30, plain, ( ( _u36 = set_intersection2(_u40, _u38)) | in(skolem4(_u40, _u38, _u36), _u36) | in(skolem5(_u40, _u38, _u36), _u40) )).
% 31.65/31.84 cnf(matrix-31, plain, ( ( _u36 = set_intersection2(_u40, _u38)) | in(skolem4(_u40, _u38, _u36), _u36) | in(skolem5(_u40, _u38, _u36), _u38) )).
% 31.65/31.84 cnf(matrix-32, plain, ( ( _u36 = set_intersection2(_u40, _u38)) | in(skolem4(_u40, _u38, _u36), _u36) | ~in(skolem5(_u40, _u38, _u36), _u36) )).
% 31.65/31.84 cnf(matrix-33, plain, ( ( _u36 = set_intersection2(_u40, _u38)) | ~in(skolem4(_u40, _u38, _u36), _u40) | ~in(skolem4(_u40, _u38, _u36), _u38) | in(skolem5(_u40, _u38, _u36), _u40) )).
% 31.65/31.84 cnf(matrix-34, plain, ( ( _u36 = set_intersection2(_u40, _u38)) | ~in(skolem4(_u40, _u38, _u36), _u40) | ~in(skolem4(_u40, _u38, _u36), _u38) | in(skolem5(_u40, _u38, _u36), _u38) )).
% 31.65/31.84 cnf(matrix-35, plain, ( ( _u36 = set_intersection2(_u40, _u38)) | ~in(skolem4(_u40, _u38, _u36), _u40) | ~in(skolem4(_u40, _u38, _u36), _u38) | ~in(skolem5(_u40, _u38, _u36), _u36) )).
% 31.65/31.84 cnf(matrix-36, plain, ( ~disjoint(_u45, _u43) | ( set_intersection2(_u45, _u43) = empty_set) )).
% 31.65/31.84 cnf(matrix-37, plain, ( ( set_intersection2(_u46, _u44) != empty_set) | disjoint(_u46, _u44) )).
% 31.65/31.84 cnf(matrix-38, plain, ( empty(empty_set) )).
% 31.65/31.84 cnf(matrix-39, plain, ( ( set_intersection2(_u48, _u48) = _u48) )).
% 31.65/31.84 cnf(matrix-40, plain, ( empty(skolem6) )).
% 31.65/31.84 cnf(matrix-41, plain, ( ~empty(skolem7) )).
% 31.65/31.84 cnf(matrix-42, plain, ( ~disjoint(_u52, _u51) | disjoint(_u51, _u52) )).
% 31.65/31.84 cnf(matrix-43, plain, ( disjoint(unordered_pair(skolem8, skolem9), skolem10) )).
% 31.65/31.84 cnf(matrix-44, plain, ( in(skolem8, skolem10) )).
% 31.65/31.84
% 31.65/31.84 % Proof stack:
% 31.65/31.84 cnf(proof-stack, plain,
% 31.65/31.84 proof_stack(
% 31.65/31.84 start(43),
% 31.65/31.84 left_branch(0, 36, 0, 2),
% 31.65/31.84 left_branch(0, 1, 0, 3),
% 31.65/31.84 left_branch(0, 29, 0, 4),
% 31.65/31.84 left_branch(0, 16, 1, 5),
% 31.65/31.84 left_branch(0, 0, 0, 6),
% 31.65/31.84 right_branch(6),
% 31.65/31.84 right_branch(5),
% 31.65/31.84 left_branch(0, 44, 0, 6),
% 31.65/31.84 right_branch(6),
% 31.65/31.84 left_branch(0, 20, 1, 7),
% 31.65/31.84 left_branch(0, 14, 0, 8),
% 31.65/31.84 right_branch(8),
% 31.65/31.84 left_branch(0, 0, 0, 9),
% 31.65/31.84 right_branch(9),
% 31.65/31.84 right_branch(7),
% 31.65/31.84 right_branch(4),
% 31.65/31.84 right_branch(3),
% 31.65/31.84 right_branch(2)
% 31.65/31.84 )).
% 31.65/31.84 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------