TSTP Solution File: SET927+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET927+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 : n013.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:50 EDT 2024
% Result : Theorem 1.11s 1.28s
% Output : Proof 1.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET927+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Mar 20 22:15:03 EDT 2024
% 0.12/0.34 % CPUTime :
% 1.11/1.28 % SZS status Theorem for theBenchmark
% 1.11/1.28 % SZS output start Proof for theBenchmark
% 1.11/1.28
% 1.11/1.28 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 1.11/1.28 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u1, _u0) = unordered_pair(_u0, _u1)) )).
% 1.11/1.28
% 1.11/1.28 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 1.11/1.28 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u3, _u2) | ~in(_u2, _u3) )).
% 1.11/1.28
% 1.11/1.28 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 1.11/1.28 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 1.11/1.28
% 1.11/1.28 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 1.11/1.28 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 1.11/1.28
% 1.11/1.28 % Formula: t70_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 1.11/1.28 cnf(t70_zfmisc_1-1, negated_conjecture, ( ~_def1 | ~_def2 )).
% 1.11/1.28 cnf(t70_zfmisc_1-2, negated_conjecture, ( _def1 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) = singleton(skolem3)) )).
% 1.11/1.28 cnf(t70_zfmisc_1-3, negated_conjecture, ( _def1 | in(skolem3, skolem5) | ~_def0 )).
% 1.11/1.28 cnf(t70_zfmisc_1-4, negated_conjecture, ( _def0 | ~in(skolem4, skolem5) )).
% 1.11/1.28 cnf(t70_zfmisc_1-5, negated_conjecture, ( _def0 | ( skolem3 != skolem4) )).
% 1.11/1.28 cnf(t70_zfmisc_1-6, negated_conjecture, ( _def2 | ~in(skolem3, skolem5) )).
% 1.11/1.28 cnf(t70_zfmisc_1-7, negated_conjecture, ( _def2 | in(skolem4, skolem5) | ( skolem3 = skolem4) )).
% 1.11/1.28 cnf(t70_zfmisc_1-8, negated_conjecture, ( _def2 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) != singleton(skolem3)) )).
% 1.11/1.28
% 1.11/1.28 % Formula: l39_zfmisc_1 ( axiom ) converted to clauses:
% 1.11/1.28 cnf(l39_zfmisc_1-1, axiom, ( ( set_difference(unordered_pair(_u16, _u14), _u12) != singleton(_u16)) | ~in(_u16, _u12) )).
% 1.11/1.28 cnf(l39_zfmisc_1-2, axiom, ( ( set_difference(unordered_pair(_u16, _u14), _u12) != singleton(_u16)) | in(_u14, _u12) | ( _u16 = _u14) )).
% 1.11/1.28 cnf(l39_zfmisc_1-3, axiom, ( ( set_difference(unordered_pair(_u17, _u15), _u13) = singleton(_u17)) | in(_u17, _u13) | ~in(_u15, _u13) )).
% 1.11/1.28 cnf(l39_zfmisc_1-4, axiom, ( ( set_difference(unordered_pair(_u17, _u15), _u13) = singleton(_u17)) | in(_u17, _u13) | ( _u17 != _u15) )).
% 1.11/1.28
% 1.11/1.28 % Problem matrix:
% 1.11/1.28 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 1.11/1.28 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 1.11/1.28 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 1.11/1.28 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( unordered_pair(__eqx_0, __eqx_1) = unordered_pair(__eqy_0, __eqy_1)) )).
% 1.11/1.28 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_difference(__eqx_0, __eqx_1) = set_difference(__eqy_0, __eqy_1)) )).
% 1.11/1.28 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 1.11/1.28 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 1.11/1.28 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 1.11/1.28 cnf(matrix-8, plain, ( ( unordered_pair(_u1, _u0) = unordered_pair(_u0, _u1)) )).
% 1.11/1.28 cnf(matrix-9, plain, ( ~in(_u3, _u2) | ~in(_u2, _u3) )).
% 1.11/1.28 cnf(matrix-10, plain, ( empty(skolem1) )).
% 1.11/1.28 cnf(matrix-11, plain, ( ~empty(skolem2) )).
% 1.11/1.28 cnf(matrix-12, plain, ( ~_def1 | ~_def2 )).
% 1.11/1.28 cnf(matrix-13, plain, ( _def1 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) = singleton(skolem3)) )).
% 1.11/1.28 cnf(matrix-14, plain, ( _def1 | in(skolem3, skolem5) | ~_def0 )).
% 1.11/1.28 cnf(matrix-15, plain, ( _def0 | ~in(skolem4, skolem5) )).
% 1.11/1.28 cnf(matrix-16, plain, ( _def0 | ( skolem3 != skolem4) )).
% 1.11/1.28 cnf(matrix-17, plain, ( _def2 | ~in(skolem3, skolem5) )).
% 1.11/1.28 cnf(matrix-18, plain, ( _def2 | in(skolem4, skolem5) | ( skolem3 = skolem4) )).
% 1.11/1.28 cnf(matrix-19, plain, ( _def2 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) != singleton(skolem3)) )).
% 1.11/1.28 cnf(matrix-20, plain, ( ( set_difference(unordered_pair(_u16, _u14), _u12) != singleton(_u16)) | ~in(_u16, _u12) )).
% 1.11/1.28 cnf(matrix-21, plain, ( ( set_difference(unordered_pair(_u16, _u14), _u12) != singleton(_u16)) | in(_u14, _u12) | ( _u16 = _u14) )).
% 1.11/1.28 cnf(matrix-22, plain, ( ( set_difference(unordered_pair(_u17, _u15), _u13) = singleton(_u17)) | in(_u17, _u13) | ~in(_u15, _u13) )).
% 1.11/1.28 cnf(matrix-23, plain, ( ( set_difference(unordered_pair(_u17, _u15), _u13) = singleton(_u17)) | in(_u17, _u13) | ( _u17 != _u15) )).
% 1.11/1.28
% 1.11/1.28 % Proof stack:
% 1.11/1.28 cnf(proof-stack, plain,
% 1.11/1.28 proof_stack(
% 1.11/1.28 start(12),
% 1.11/1.28 left_branch(0, 14, 0, 2),
% 1.11/1.28 left_branch(0, 16, 0, 3),
% 1.11/1.28 left_branch(0, 21, 2, 4),
% 1.11/1.28 left_branch(0, 13, 1, 5),
% 1.11/1.28 reduction(0, 0),
% 1.11/1.28 right_branch(5),
% 1.11/1.28 left_branch(0, 15, 1, 6),
% 1.11/1.28 reduction(0, 1),
% 1.11/1.28 right_branch(6),
% 1.11/1.28 right_branch(4),
% 1.11/1.28 right_branch(3),
% 1.11/1.28 left_branch(0, 20, 1, 4),
% 1.11/1.28 left_branch(0, 13, 1, 5),
% 1.11/1.28 reduction(0, 0),
% 1.11/1.28 right_branch(5),
% 1.11/1.28 right_branch(4),
% 1.11/1.28 right_branch(2),
% 1.11/1.28 left_branch(0, 19, 0, 3),
% 1.11/1.28 left_branch(0, 22, 0, 4),
% 1.11/1.28 left_branch(0, 6, 3, 5),
% 1.11/1.28 left_branch(0, 18, 2, 6),
% 1.11/1.28 reduction(0, 0),
% 1.11/1.28 reduction(0, 2),
% 1.11/1.28 right_branch(6),
% 1.11/1.28 left_branch(0, 23, 1, 7),
% 1.11/1.28 reduction(0, 1),
% 1.11/1.28 lemmata(0, 1),
% 1.11/1.28 right_branch(7),
% 1.11/1.28 left_branch(0, 0, 0, 8),
% 1.11/1.28 right_branch(8),
% 1.11/1.28 right_branch(5),
% 1.11/1.28 left_branch(0, 17, 1, 6),
% 1.11/1.28 reduction(0, 0),
% 1.11/1.28 right_branch(6),
% 1.11/1.28 right_branch(4),
% 1.11/1.28 right_branch(3)
% 1.11/1.28 )).
% 1.11/1.28 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------