TSTP Solution File: SET882+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET882+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 : n006.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:42 EDT 2024
% Result : Theorem 0.19s 0.43s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET882+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n006.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 : Wed Mar 20 22:23:29 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.43 % SZS status Theorem for theBenchmark
% 0.19/0.43 % SZS output start Proof for theBenchmark
% 0.19/0.43
% 0.19/0.43 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.19/0.43 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.19/0.43
% 0.19/0.43 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 0.19/0.43 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 0.19/0.43
% 0.19/0.43 % Formula: d1_tarski ( axiom ) converted to clauses:
% 0.19/0.43 cnf(d1_tarski-1, axiom, ( ( _u12 != singleton(_u14)) | ~in(_u8, _u12) | ( _u8 = _u14) )).
% 0.19/0.43 cnf(d1_tarski-2, axiom, ( ( _u12 != singleton(_u14)) | ( _u9 != _u14) | in(_u9, _u12) )).
% 0.19/0.43 cnf(d1_tarski-3, axiom, ( ( _u13 = singleton(_u15)) | in(skolem1(_u15, _u13), _u13) | ( skolem2(_u15, _u13) = _u15) )).
% 0.19/0.43 cnf(d1_tarski-4, axiom, ( ( _u13 = singleton(_u15)) | in(skolem1(_u15, _u13), _u13) | ~in(skolem2(_u15, _u13), _u13) )).
% 0.19/0.43 cnf(d1_tarski-5, axiom, ( ( _u13 = singleton(_u15)) | ( skolem1(_u15, _u13) != _u15) | ( skolem2(_u15, _u13) = _u15) )).
% 0.19/0.43 cnf(d1_tarski-6, axiom, ( ( _u13 = singleton(_u15)) | ( skolem1(_u15, _u13) != _u15) | ~in(skolem2(_u15, _u13), _u13) )).
% 0.19/0.43
% 0.19/0.43 % Formula: l39_zfmisc_1 ( axiom ) converted to clauses:
% 0.19/0.43 cnf(l39_zfmisc_1-1, axiom, ( ( set_difference(unordered_pair(_u23, _u21), _u19) != singleton(_u23)) | ~in(_u23, _u19) )).
% 0.19/0.43 cnf(l39_zfmisc_1-2, axiom, ( ( set_difference(unordered_pair(_u23, _u21), _u19) != singleton(_u23)) | in(_u21, _u19) | ( _u23 = _u21) )).
% 0.19/0.43 cnf(l39_zfmisc_1-3, axiom, ( ( set_difference(unordered_pair(_u24, _u22), _u20) = singleton(_u24)) | in(_u24, _u20) | ~in(_u22, _u20) )).
% 0.19/0.43 cnf(l39_zfmisc_1-4, axiom, ( ( set_difference(unordered_pair(_u24, _u22), _u20) = singleton(_u24)) | in(_u24, _u20) | ( _u24 != _u22) )).
% 0.19/0.43
% 0.19/0.43 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.43 cnf(rc1_xboole_0-1, axiom, ( empty(skolem3) )).
% 0.19/0.43
% 0.19/0.43 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.43 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem4) )).
% 0.19/0.43
% 0.19/0.43 % Formula: t23_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 0.19/0.43 cnf(t23_zfmisc_1-1, negated_conjecture, ( ( skolem5 != skolem6) )).
% 0.19/0.43 cnf(t23_zfmisc_1-2, negated_conjecture, ( ( set_difference(unordered_pair(skolem5, skolem6), singleton(skolem6)) != singleton(skolem5)) )).
% 0.19/0.43
% 0.19/0.43 % Problem matrix:
% 0.19/0.43 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.19/0.43 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.19/0.43 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.19/0.43 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( unordered_pair(__eqx_0, __eqx_1) = unordered_pair(__eqy_0, __eqy_1)) )).
% 0.19/0.43 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.19/0.43 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_difference(__eqx_0, __eqx_1) = set_difference(__eqy_0, __eqy_1)) )).
% 0.19/0.43 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.19/0.43 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 0.19/0.43 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.19/0.43 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.19/0.43 cnf(matrix-10, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.19/0.43 cnf(matrix-11, plain, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 0.19/0.43 cnf(matrix-12, plain, ( ( _u12 != singleton(_u14)) | ~in(_u8, _u12) | ( _u8 = _u14) )).
% 0.19/0.43 cnf(matrix-13, plain, ( ( _u12 != singleton(_u14)) | ( _u9 != _u14) | in(_u9, _u12) )).
% 0.19/0.43 cnf(matrix-14, plain, ( ( _u13 = singleton(_u15)) | in(skolem1(_u15, _u13), _u13) | ( skolem2(_u15, _u13) = _u15) )).
% 0.19/0.43 cnf(matrix-15, plain, ( ( _u13 = singleton(_u15)) | in(skolem1(_u15, _u13), _u13) | ~in(skolem2(_u15, _u13), _u13) )).
% 0.19/0.43 cnf(matrix-16, plain, ( ( _u13 = singleton(_u15)) | ( skolem1(_u15, _u13) != _u15) | ( skolem2(_u15, _u13) = _u15) )).
% 0.19/0.43 cnf(matrix-17, plain, ( ( _u13 = singleton(_u15)) | ( skolem1(_u15, _u13) != _u15) | ~in(skolem2(_u15, _u13), _u13) )).
% 0.19/0.43 cnf(matrix-18, plain, ( ( set_difference(unordered_pair(_u23, _u21), _u19) != singleton(_u23)) | ~in(_u23, _u19) )).
% 0.19/0.43 cnf(matrix-19, plain, ( ( set_difference(unordered_pair(_u23, _u21), _u19) != singleton(_u23)) | in(_u21, _u19) | ( _u23 = _u21) )).
% 0.19/0.43 cnf(matrix-20, plain, ( ( set_difference(unordered_pair(_u24, _u22), _u20) = singleton(_u24)) | in(_u24, _u20) | ~in(_u22, _u20) )).
% 0.19/0.43 cnf(matrix-21, plain, ( ( set_difference(unordered_pair(_u24, _u22), _u20) = singleton(_u24)) | in(_u24, _u20) | ( _u24 != _u22) )).
% 0.19/0.43 cnf(matrix-22, plain, ( empty(skolem3) )).
% 0.19/0.43 cnf(matrix-23, plain, ( ~empty(skolem4) )).
% 0.19/0.43 cnf(matrix-24, plain, ( ( skolem5 != skolem6) )).
% 0.19/0.43 cnf(matrix-25, plain, ( ( set_difference(unordered_pair(skolem5, skolem6), singleton(skolem6)) != singleton(skolem5)) )).
% 0.19/0.43
% 0.19/0.43 % Proof stack:
% 0.19/0.43 cnf(proof-stack, plain,
% 0.19/0.43 proof_stack(
% 0.19/0.43 start(10),
% 0.19/0.43 left_branch(0, 20, 1, 2),
% 0.19/0.43 left_branch(0, 25, 0, 3),
% 0.19/0.43 right_branch(3),
% 0.19/0.43 left_branch(0, 13, 2, 4),
% 0.19/0.43 left_branch(0, 0, 0, 5),
% 0.19/0.43 right_branch(5),
% 0.19/0.43 left_branch(0, 0, 0, 6),
% 0.19/0.43 right_branch(6),
% 0.19/0.43 right_branch(4),
% 0.19/0.43 right_branch(2),
% 0.19/0.43 left_branch(0, 19, 1, 3),
% 0.19/0.43 left_branch(0, 21, 0, 4),
% 0.19/0.43 left_branch(0, 0, 0, 5),
% 0.19/0.43 right_branch(5),
% 0.19/0.43 reduction(0, 0),
% 0.19/0.43 right_branch(4),
% 0.19/0.43 left_branch(0, 12, 0, 5),
% 0.19/0.43 left_branch(0, 24, 0, 6),
% 0.19/0.43 right_branch(6),
% 0.19/0.43 lemmata(0, 0),
% 0.19/0.43 right_branch(5),
% 0.19/0.43 right_branch(3)
% 0.19/0.43 )).
% 0.19/0.43 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------