TSTP Solution File: SET931+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET931+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 : n025.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:51 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET931+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n025.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:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% 0.19/0.48
% 0.19/0.48 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 0.19/0.48 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u1, _u0) = unordered_pair(_u0, _u1)) )).
% 0.19/0.48
% 0.19/0.48 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.48 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.19/0.48
% 0.19/0.48 % Formula: l46_zfmisc_1 ( axiom ) converted to clauses:
% 0.19/0.48 cnf(l46_zfmisc_1-1, axiom, ( ~subset(_u9, unordered_pair(_u7, _u5)) | ( _u9 = empty_set) | ( _u9 = singleton(_u7)) | ( _u9 = singleton(_u5)) | ( _u9 = unordered_pair(_u7, _u5)) )).
% 0.19/0.48 cnf(l46_zfmisc_1-2, axiom, ( subset(_u10, unordered_pair(_u8, _u6)) | ( _u10 != empty_set) )).
% 0.19/0.48 cnf(l46_zfmisc_1-3, axiom, ( subset(_u10, unordered_pair(_u8, _u6)) | ( _u10 != singleton(_u8)) )).
% 0.19/0.48 cnf(l46_zfmisc_1-4, axiom, ( subset(_u10, unordered_pair(_u8, _u6)) | ( _u10 != singleton(_u6)) )).
% 0.19/0.48 cnf(l46_zfmisc_1-5, axiom, ( subset(_u10, unordered_pair(_u8, _u6)) | ( _u10 != unordered_pair(_u8, _u6)) )).
% 0.19/0.48
% 0.19/0.48 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.48 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 0.19/0.48
% 0.19/0.48 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.48 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 0.19/0.48
% 0.19/0.48 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.19/0.48 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u14, _u14) )).
% 0.19/0.48
% 0.19/0.48 % Formula: t37_xboole_1 ( axiom ) converted to clauses:
% 0.19/0.48 cnf(t37_xboole_1-1, axiom, ( ( set_difference(_u19, _u17) != empty_set) | subset(_u19, _u17) )).
% 0.19/0.48 cnf(t37_xboole_1-2, axiom, ( ~subset(_u20, _u18) | ( set_difference(_u20, _u18) = empty_set) )).
% 0.19/0.48
% 0.19/0.48 % Formula: t75_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 0.19/0.48 cnf(t75_zfmisc_1-1, negated_conjecture, ( ~_def0 | ~_def1 )).
% 0.19/0.48 cnf(t75_zfmisc_1-2, negated_conjecture, ( _def0 | ( set_difference(skolem3, unordered_pair(skolem4, skolem5)) = empty_set) )).
% 0.19/0.48 cnf(t75_zfmisc_1-3, negated_conjecture, ( _def0 | ( skolem3 != empty_set) )).
% 0.19/0.48 cnf(t75_zfmisc_1-4, negated_conjecture, ( _def0 | ( skolem3 != singleton(skolem4)) )).
% 0.19/0.48 cnf(t75_zfmisc_1-5, negated_conjecture, ( _def0 | ( skolem3 != singleton(skolem5)) )).
% 0.19/0.48 cnf(t75_zfmisc_1-6, negated_conjecture, ( _def0 | ( skolem3 != unordered_pair(skolem4, skolem5)) )).
% 0.19/0.48 cnf(t75_zfmisc_1-7, negated_conjecture, ( _def1 | ( skolem3 = empty_set) | ( skolem3 = singleton(skolem4)) | ( skolem3 = singleton(skolem5)) | ( skolem3 = unordered_pair(skolem4, skolem5)) )).
% 0.19/0.48 cnf(t75_zfmisc_1-8, negated_conjecture, ( _def1 | ( set_difference(skolem3, unordered_pair(skolem4, skolem5)) != empty_set) )).
% 0.19/0.48
% 0.19/0.48 % Problem matrix:
% 0.19/0.48 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.19/0.48 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.19/0.48 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.19/0.48 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.48 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.19/0.48 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.48 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.19/0.48 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.19/0.48 cnf(matrix-8, plain, ( ( unordered_pair(_u1, _u0) = unordered_pair(_u0, _u1)) )).
% 0.19/0.48 cnf(matrix-9, plain, ( empty(empty_set) )).
% 0.19/0.48 cnf(matrix-10, plain, ( ~subset(_u9, unordered_pair(_u7, _u5)) | ( _u9 = empty_set) | ( _u9 = singleton(_u7)) | ( _u9 = singleton(_u5)) | ( _u9 = unordered_pair(_u7, _u5)) )).
% 0.19/0.48 cnf(matrix-11, plain, ( subset(_u10, unordered_pair(_u8, _u6)) | ( _u10 != empty_set) )).
% 0.19/0.48 cnf(matrix-12, plain, ( subset(_u10, unordered_pair(_u8, _u6)) | ( _u10 != singleton(_u8)) )).
% 0.19/0.48 cnf(matrix-13, plain, ( subset(_u10, unordered_pair(_u8, _u6)) | ( _u10 != singleton(_u6)) )).
% 0.19/0.48 cnf(matrix-14, plain, ( subset(_u10, unordered_pair(_u8, _u6)) | ( _u10 != unordered_pair(_u8, _u6)) )).
% 0.19/0.48 cnf(matrix-15, plain, ( empty(skolem1) )).
% 0.19/0.48 cnf(matrix-16, plain, ( ~empty(skolem2) )).
% 0.19/0.48 cnf(matrix-17, plain, ( subset(_u14, _u14) )).
% 0.19/0.48 cnf(matrix-18, plain, ( ( set_difference(_u19, _u17) != empty_set) | subset(_u19, _u17) )).
% 0.19/0.48 cnf(matrix-19, plain, ( ~subset(_u20, _u18) | ( set_difference(_u20, _u18) = empty_set) )).
% 0.19/0.48 cnf(matrix-20, plain, ( ~_def0 | ~_def1 )).
% 0.19/0.48 cnf(matrix-21, plain, ( _def0 | ( set_difference(skolem3, unordered_pair(skolem4, skolem5)) = empty_set) )).
% 0.19/0.48 cnf(matrix-22, plain, ( _def0 | ( skolem3 != empty_set) )).
% 0.19/0.48 cnf(matrix-23, plain, ( _def0 | ( skolem3 != singleton(skolem4)) )).
% 0.19/0.48 cnf(matrix-24, plain, ( _def0 | ( skolem3 != singleton(skolem5)) )).
% 0.19/0.48 cnf(matrix-25, plain, ( _def0 | ( skolem3 != unordered_pair(skolem4, skolem5)) )).
% 0.19/0.48 cnf(matrix-26, plain, ( _def1 | ( skolem3 = empty_set) | ( skolem3 = singleton(skolem4)) | ( skolem3 = singleton(skolem5)) | ( skolem3 = unordered_pair(skolem4, skolem5)) )).
% 0.19/0.48 cnf(matrix-27, plain, ( _def1 | ( set_difference(skolem3, unordered_pair(skolem4, skolem5)) != empty_set) )).
% 0.19/0.48
% 0.19/0.48 % Proof stack:
% 0.19/0.48 cnf(proof-stack, plain,
% 0.19/0.48 proof_stack(
% 0.19/0.48 start(20),
% 0.19/0.48 left_branch(0, 25, 0, 2),
% 0.19/0.48 left_branch(0, 10, 4, 3),
% 0.19/0.48 left_branch(0, 18, 1, 4),
% 0.19/0.48 left_branch(0, 21, 1, 5),
% 0.19/0.48 reduction(0, 0),
% 0.19/0.48 right_branch(5),
% 0.19/0.48 right_branch(4),
% 0.19/0.48 left_branch(0, 24, 1, 5),
% 0.19/0.48 reduction(0, 0),
% 0.19/0.48 right_branch(5),
% 0.19/0.48 left_branch(0, 23, 1, 6),
% 0.19/0.48 reduction(0, 0),
% 0.19/0.48 right_branch(6),
% 0.19/0.48 left_branch(0, 22, 1, 7),
% 0.19/0.48 reduction(0, 0),
% 0.19/0.48 right_branch(7),
% 0.19/0.48 right_branch(3),
% 0.19/0.48 right_branch(2),
% 0.19/0.48 left_branch(0, 26, 0, 3),
% 0.19/0.48 left_branch(0, 14, 1, 4),
% 0.19/0.48 left_branch(0, 19, 0, 5),
% 0.19/0.48 left_branch(0, 27, 1, 6),
% 0.19/0.48 reduction(0, 0),
% 0.19/0.48 right_branch(6),
% 0.19/0.48 right_branch(5),
% 0.19/0.48 right_branch(4),
% 0.19/0.48 left_branch(0, 13, 1, 5),
% 0.19/0.48 left_branch(0, 19, 0, 6),
% 0.19/0.48 left_branch(0, 27, 1, 7),
% 0.19/0.48 reduction(0, 0),
% 0.19/0.48 right_branch(7),
% 0.19/0.48 right_branch(6),
% 0.19/0.48 right_branch(5),
% 0.19/0.48 left_branch(0, 12, 1, 6),
% 0.19/0.48 left_branch(0, 19, 0, 7),
% 0.19/0.48 left_branch(0, 27, 1, 8),
% 0.19/0.48 reduction(0, 0),
% 0.19/0.48 right_branch(8),
% 0.19/0.48 right_branch(7),
% 0.19/0.48 right_branch(6),
% 0.19/0.48 left_branch(0, 11, 1, 7),
% 0.19/0.48 left_branch(0, 19, 0, 8),
% 0.19/0.48 left_branch(0, 27, 1, 9),
% 0.19/0.48 reduction(0, 0),
% 0.19/0.48 right_branch(9),
% 0.19/0.48 right_branch(8),
% 0.19/0.48 right_branch(7),
% 0.19/0.48 right_branch(3)
% 0.19/0.48 )).
% 0.19/0.48 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------