TSTP Solution File: SEU153+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU153+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 : n032.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:19 EDT 2024
% Result : Theorem 19.64s 19.88s
% Output : Proof 19.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU153+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.08 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Wed Mar 20 14:18:54 EDT 2024
% 0.08/0.27 % CPUTime :
% 19.64/19.88 % SZS status Theorem for theBenchmark
% 19.64/19.88 % SZS output start Proof for theBenchmark
% 19.64/19.88
% 19.64/19.88 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 19.64/19.88 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 19.64/19.88
% 19.64/19.88 % Formula: commutativity_k3_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(commutativity_k3_xboole_0-1, axiom, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 19.64/19.88
% 19.64/19.88 % Formula: d1_tarski ( axiom ) converted to clauses:
% 19.64/19.88 cnf(d1_tarski-1, axiom, ( ( _u12 != singleton(_u14)) | ~in(_u8, _u12) | ( _u8 = _u14) )).
% 19.64/19.88 cnf(d1_tarski-2, axiom, ( ( _u12 != singleton(_u14)) | ( _u9 != _u14) | in(_u9, _u12) )).
% 19.64/19.88 cnf(d1_tarski-3, axiom, ( ( _u13 = singleton(_u15)) | in(skolem1(_u15, _u13), _u13) | ( skolem2(_u15, _u13) = _u15) )).
% 19.64/19.88 cnf(d1_tarski-4, axiom, ( ( _u13 = singleton(_u15)) | in(skolem1(_u15, _u13), _u13) | ~in(skolem2(_u15, _u13), _u13) )).
% 19.64/19.88 cnf(d1_tarski-5, axiom, ( ( _u13 = singleton(_u15)) | ( skolem1(_u15, _u13) != _u15) | ( skolem2(_u15, _u13) = _u15) )).
% 19.64/19.88 cnf(d1_tarski-6, axiom, ( ( _u13 = singleton(_u15)) | ( skolem1(_u15, _u13) != _u15) | ~in(skolem2(_u15, _u13), _u13) )).
% 19.64/19.88
% 19.64/19.88 % Formula: d1_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(d1_xboole_0-1, axiom, ( ( _u19 != empty_set) | ~in(_u16, _u19) )).
% 19.64/19.88 cnf(d1_xboole_0-2, axiom, ( in(skolem3(_u20), _u20) | ( _u20 = empty_set) )).
% 19.64/19.88
% 19.64/19.88 % Formula: d3_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(d3_xboole_0-1, axiom, ( ( _u30 != set_intersection2(_u34, _u32)) | ~in(_u26, _u30) | in(_u26, _u34) )).
% 19.64/19.88 cnf(d3_xboole_0-2, axiom, ( ( _u30 != set_intersection2(_u34, _u32)) | ~in(_u26, _u30) | in(_u26, _u32) )).
% 19.64/19.88 cnf(d3_xboole_0-3, axiom, ( ( _u30 != set_intersection2(_u34, _u32)) | ~in(_u27, _u34) | ~in(_u27, _u32) | in(_u27, _u30) )).
% 19.64/19.88 cnf(d3_xboole_0-4, axiom, ( ( _u31 = set_intersection2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u31) | in(skolem5(_u35, _u33, _u31), _u35) )).
% 19.64/19.88 cnf(d3_xboole_0-5, axiom, ( ( _u31 = set_intersection2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u31) | in(skolem5(_u35, _u33, _u31), _u33) )).
% 19.64/19.88 cnf(d3_xboole_0-6, axiom, ( ( _u31 = set_intersection2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u31) | ~in(skolem5(_u35, _u33, _u31), _u31) )).
% 19.64/19.88 cnf(d3_xboole_0-7, axiom, ( ( _u31 = set_intersection2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u35) | ~in(skolem4(_u35, _u33, _u31), _u33) | in(skolem5(_u35, _u33, _u31), _u35) )).
% 19.64/19.88 cnf(d3_xboole_0-8, axiom, ( ( _u31 = set_intersection2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u35) | ~in(skolem4(_u35, _u33, _u31), _u33) | in(skolem5(_u35, _u33, _u31), _u33) )).
% 19.64/19.88 cnf(d3_xboole_0-9, axiom, ( ( _u31 = set_intersection2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u35) | ~in(skolem4(_u35, _u33, _u31), _u33) | ~in(skolem5(_u35, _u33, _u31), _u31) )).
% 19.64/19.88
% 19.64/19.88 % Formula: d7_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(d7_xboole_0-1, axiom, ( ~disjoint(_u40, _u38) | ( set_intersection2(_u40, _u38) = empty_set) )).
% 19.64/19.88 cnf(d7_xboole_0-2, axiom, ( ( set_intersection2(_u41, _u39) != empty_set) | disjoint(_u41, _u39) )).
% 19.64/19.88
% 19.64/19.88 % Formula: dt_k1_tarski ( axiom ) converted to clauses:
% 19.64/19.88 cnf(dt_k1_tarski, axiom, $true).
% 19.64/19.88
% 19.64/19.88 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(dt_k1_xboole_0, axiom, $true).
% 19.64/19.88
% 19.64/19.88 % Formula: dt_k3_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(dt_k3_xboole_0, axiom, $true).
% 19.64/19.88
% 19.64/19.88 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 19.64/19.88
% 19.64/19.88 % Formula: idempotence_k3_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(idempotence_k3_xboole_0-1, axiom, ( ( set_intersection2(_u43, _u43) = _u43) )).
% 19.64/19.88
% 19.64/19.88 % Formula: l25_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 19.64/19.88 cnf(l25_zfmisc_1-1, negated_conjecture, ( disjoint(singleton(skolem6), skolem7) )).
% 19.64/19.88 cnf(l25_zfmisc_1-2, negated_conjecture, ( in(skolem6, skolem7) )).
% 19.64/19.88
% 19.64/19.88 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(rc1_xboole_0-1, axiom, ( empty(skolem8) )).
% 19.64/19.88
% 19.64/19.88 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem9) )).
% 19.64/19.88
% 19.64/19.88 % Formula: symmetry_r1_xboole_0 ( axiom ) converted to clauses:
% 19.64/19.88 cnf(symmetry_r1_xboole_0-1, axiom, ( ~disjoint(_u49, _u48) | disjoint(_u48, _u49) )).
% 19.64/19.88
% 19.64/19.88 % Problem matrix:
% 19.64/19.88 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 19.64/19.88 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 19.64/19.88 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 19.64/19.88 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_intersection2(__eqx_0, __eqx_1) = set_intersection2(__eqy_0, __eqy_1)) )).
% 19.64/19.88 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 19.64/19.88 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 19.64/19.88 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 19.64/19.88 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( skolem3(__eqx_0) = skolem3(__eqy_0)) )).
% 19.64/19.88 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)) )).
% 19.64/19.88 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)) )).
% 19.64/19.88 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 19.64/19.88 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 19.64/19.88 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 19.64/19.88 cnf(matrix-13, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 19.64/19.88 cnf(matrix-14, plain, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 19.64/19.88 cnf(matrix-15, plain, ( ( _u12 != singleton(_u14)) | ~in(_u8, _u12) | ( _u8 = _u14) )).
% 19.64/19.88 cnf(matrix-16, plain, ( ( _u12 != singleton(_u14)) | ( _u9 != _u14) | in(_u9, _u12) )).
% 19.64/19.88 cnf(matrix-17, plain, ( ( _u13 = singleton(_u15)) | in(skolem1(_u15, _u13), _u13) | ( skolem2(_u15, _u13) = _u15) )).
% 19.64/19.88 cnf(matrix-18, plain, ( ( _u13 = singleton(_u15)) | in(skolem1(_u15, _u13), _u13) | ~in(skolem2(_u15, _u13), _u13) )).
% 19.64/19.88 cnf(matrix-19, plain, ( ( _u13 = singleton(_u15)) | ( skolem1(_u15, _u13) != _u15) | ( skolem2(_u15, _u13) = _u15) )).
% 19.64/19.88 cnf(matrix-20, plain, ( ( _u13 = singleton(_u15)) | ( skolem1(_u15, _u13) != _u15) | ~in(skolem2(_u15, _u13), _u13) )).
% 19.64/19.88 cnf(matrix-21, plain, ( ( _u19 != empty_set) | ~in(_u16, _u19) )).
% 19.64/19.88 cnf(matrix-22, plain, ( in(skolem3(_u20), _u20) | ( _u20 = empty_set) )).
% 19.64/19.88 cnf(matrix-23, plain, ( ( _u30 != set_intersection2(_u34, _u32)) | ~in(_u26, _u30) | in(_u26, _u34) )).
% 19.64/19.88 cnf(matrix-24, plain, ( ( _u30 != set_intersection2(_u34, _u32)) | ~in(_u26, _u30) | in(_u26, _u32) )).
% 19.64/19.88 cnf(matrix-25, plain, ( ( _u30 != set_intersection2(_u34, _u32)) | ~in(_u27, _u34) | ~in(_u27, _u32) | in(_u27, _u30) )).
% 19.64/19.88 cnf(matrix-26, plain, ( ( _u31 = set_intersection2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u31) | in(skolem5(_u35, _u33, _u31), _u35) )).
% 19.64/19.88 cnf(matrix-27, plain, ( ( _u31 = set_intersection2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u31) | in(skolem5(_u35, _u33, _u31), _u33) )).
% 19.64/19.88 cnf(matrix-28, plain, ( ( _u31 = set_intersection2(_u35, _u33)) | in(skolem4(_u35, _u33, _u31), _u31) | ~in(skolem5(_u35, _u33, _u31), _u31) )).
% 19.64/19.88 cnf(matrix-29, plain, ( ( _u31 = set_intersection2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u35) | ~in(skolem4(_u35, _u33, _u31), _u33) | in(skolem5(_u35, _u33, _u31), _u35) )).
% 19.64/19.88 cnf(matrix-30, plain, ( ( _u31 = set_intersection2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u35) | ~in(skolem4(_u35, _u33, _u31), _u33) | in(skolem5(_u35, _u33, _u31), _u33) )).
% 19.64/19.88 cnf(matrix-31, plain, ( ( _u31 = set_intersection2(_u35, _u33)) | ~in(skolem4(_u35, _u33, _u31), _u35) | ~in(skolem4(_u35, _u33, _u31), _u33) | ~in(skolem5(_u35, _u33, _u31), _u31) )).
% 19.64/19.88 cnf(matrix-32, plain, ( ~disjoint(_u40, _u38) | ( set_intersection2(_u40, _u38) = empty_set) )).
% 19.64/19.88 cnf(matrix-33, plain, ( ( set_intersection2(_u41, _u39) != empty_set) | disjoint(_u41, _u39) )).
% 19.64/19.88 cnf(matrix-34, plain, ( empty(empty_set) )).
% 19.64/19.88 cnf(matrix-35, plain, ( ( set_intersection2(_u43, _u43) = _u43) )).
% 19.64/19.88 cnf(matrix-36, plain, ( disjoint(singleton(skolem6), skolem7) )).
% 19.64/19.88 cnf(matrix-37, plain, ( in(skolem6, skolem7) )).
% 19.64/19.88 cnf(matrix-38, plain, ( empty(skolem8) )).
% 19.64/19.88 cnf(matrix-39, plain, ( ~empty(skolem9) )).
% 19.64/19.88 cnf(matrix-40, plain, ( ~disjoint(_u49, _u48) | disjoint(_u48, _u49) )).
% 19.64/19.88
% 19.64/19.88 % Proof stack:
% 19.64/19.88 cnf(proof-stack, plain,
% 19.64/19.88 proof_stack(
% 19.64/19.88 start(36),
% 19.64/19.88 left_branch(0, 32, 0, 2),
% 19.64/19.88 left_branch(0, 1, 0, 3),
% 19.64/19.88 left_branch(0, 25, 0, 4),
% 19.64/19.88 left_branch(0, 21, 1, 5),
% 19.64/19.88 left_branch(0, 0, 0, 6),
% 19.64/19.88 right_branch(6),
% 19.64/19.88 right_branch(5),
% 19.64/19.88 left_branch(0, 37, 0, 6),
% 19.64/19.88 right_branch(6),
% 19.64/19.88 left_branch(0, 16, 2, 7),
% 19.64/19.88 left_branch(0, 0, 0, 8),
% 19.64/19.88 right_branch(8),
% 19.64/19.88 left_branch(0, 0, 0, 9),
% 19.64/19.88 right_branch(9),
% 19.64/19.88 right_branch(7),
% 19.64/19.88 right_branch(4),
% 19.64/19.88 right_branch(3),
% 19.64/19.88 right_branch(2)
% 19.64/19.88 )).
% 19.64/19.88 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------