TSTP Solution File: SET929+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET929+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 : n020.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.13s 0.40s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET929+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.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Mar 20 21:20:28 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.40 % SZS status Theorem for theBenchmark
% 0.13/0.40 % SZS output start Proof for theBenchmark
% 0.13/0.40
% 0.13/0.40 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.13/0.40 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.13/0.40
% 0.13/0.40 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 0.13/0.40 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 0.13/0.40
% 0.13/0.40 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.40 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.13/0.40
% 0.13/0.40 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.40 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 0.13/0.40
% 0.13/0.40 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.40 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 0.13/0.40
% 0.13/0.40 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.13/0.40 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u7, _u7) )).
% 0.13/0.40
% 0.13/0.40 % Formula: t37_xboole_1 ( axiom ) converted to clauses:
% 0.13/0.40 cnf(t37_xboole_1-1, axiom, ( ( set_difference(_u12, _u10) != empty_set) | subset(_u12, _u10) )).
% 0.13/0.40 cnf(t37_xboole_1-2, axiom, ( ~subset(_u13, _u11) | ( set_difference(_u13, _u11) = empty_set) )).
% 0.13/0.40
% 0.13/0.40 % Formula: t38_zfmisc_1 ( axiom ) converted to clauses:
% 0.13/0.40 cnf(t38_zfmisc_1-1, axiom, ( ~subset(unordered_pair(_u21, _u19), _u17) | in(_u21, _u17) )).
% 0.13/0.40 cnf(t38_zfmisc_1-2, axiom, ( ~subset(unordered_pair(_u21, _u19), _u17) | in(_u19, _u17) )).
% 0.13/0.40 cnf(t38_zfmisc_1-3, axiom, ( ~in(_u22, _u18) | ~in(_u20, _u18) | subset(unordered_pair(_u22, _u20), _u18) )).
% 0.13/0.40
% 0.13/0.40 % Formula: t73_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.40 cnf(t73_zfmisc_1-1, negated_conjecture, ( ~_def0 | ~_def1 )).
% 0.13/0.40 cnf(t73_zfmisc_1-2, negated_conjecture, ( _def0 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) = empty_set) )).
% 0.13/0.40 cnf(t73_zfmisc_1-3, negated_conjecture, ( _def0 | ~in(skolem3, skolem5) | ~in(skolem4, skolem5) )).
% 0.13/0.40 cnf(t73_zfmisc_1-4, negated_conjecture, ( _def1 | in(skolem3, skolem5) )).
% 0.13/0.40 cnf(t73_zfmisc_1-5, negated_conjecture, ( _def1 | in(skolem4, skolem5) )).
% 0.13/0.40 cnf(t73_zfmisc_1-6, negated_conjecture, ( _def1 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) != empty_set) )).
% 0.13/0.40
% 0.13/0.40 % Problem matrix:
% 0.13/0.40 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.40 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.40 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.40 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.13/0.40 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_difference(__eqx_0, __eqx_1) = set_difference(__eqy_0, __eqy_1)) )).
% 0.13/0.40 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.13/0.40 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.13/0.40 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.13/0.40 cnf(matrix-8, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.13/0.40 cnf(matrix-9, plain, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 0.13/0.40 cnf(matrix-10, plain, ( empty(empty_set) )).
% 0.13/0.40 cnf(matrix-11, plain, ( empty(skolem1) )).
% 0.13/0.40 cnf(matrix-12, plain, ( ~empty(skolem2) )).
% 0.13/0.40 cnf(matrix-13, plain, ( subset(_u7, _u7) )).
% 0.13/0.40 cnf(matrix-14, plain, ( ( set_difference(_u12, _u10) != empty_set) | subset(_u12, _u10) )).
% 0.13/0.40 cnf(matrix-15, plain, ( ~subset(_u13, _u11) | ( set_difference(_u13, _u11) = empty_set) )).
% 0.13/0.40 cnf(matrix-16, plain, ( ~subset(unordered_pair(_u21, _u19), _u17) | in(_u21, _u17) )).
% 0.13/0.40 cnf(matrix-17, plain, ( ~subset(unordered_pair(_u21, _u19), _u17) | in(_u19, _u17) )).
% 0.13/0.40 cnf(matrix-18, plain, ( ~in(_u22, _u18) | ~in(_u20, _u18) | subset(unordered_pair(_u22, _u20), _u18) )).
% 0.13/0.40 cnf(matrix-19, plain, ( ~_def0 | ~_def1 )).
% 0.13/0.40 cnf(matrix-20, plain, ( _def0 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) = empty_set) )).
% 0.13/0.40 cnf(matrix-21, plain, ( _def0 | ~in(skolem3, skolem5) | ~in(skolem4, skolem5) )).
% 0.13/0.40 cnf(matrix-22, plain, ( _def1 | in(skolem3, skolem5) )).
% 0.13/0.40 cnf(matrix-23, plain, ( _def1 | in(skolem4, skolem5) )).
% 0.13/0.40 cnf(matrix-24, plain, ( _def1 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) != empty_set) )).
% 0.13/0.40
% 0.13/0.40 % Proof stack:
% 0.13/0.40 cnf(proof-stack, plain,
% 0.13/0.40 proof_stack(
% 0.13/0.40 start(19),
% 0.13/0.40 left_branch(0, 21, 0, 2),
% 0.13/0.40 left_branch(0, 17, 1, 3),
% 0.13/0.40 left_branch(0, 14, 1, 4),
% 0.13/0.40 left_branch(0, 20, 1, 5),
% 0.13/0.40 reduction(0, 0),
% 0.13/0.40 right_branch(5),
% 0.13/0.40 right_branch(4),
% 0.13/0.40 right_branch(3),
% 0.13/0.40 left_branch(0, 16, 1, 4),
% 0.13/0.40 left_branch(0, 14, 1, 5),
% 0.13/0.40 left_branch(0, 20, 1, 6),
% 0.13/0.40 reduction(0, 0),
% 0.13/0.40 right_branch(6),
% 0.13/0.40 right_branch(5),
% 0.13/0.40 right_branch(4),
% 0.13/0.40 right_branch(2),
% 0.13/0.40 left_branch(0, 24, 0, 3),
% 0.13/0.40 left_branch(0, 15, 1, 4),
% 0.13/0.40 left_branch(0, 18, 2, 5),
% 0.13/0.40 left_branch(0, 22, 1, 6),
% 0.13/0.40 reduction(0, 0),
% 0.13/0.40 right_branch(6),
% 0.13/0.40 left_branch(0, 23, 1, 7),
% 0.13/0.40 reduction(0, 0),
% 0.13/0.40 right_branch(7),
% 0.13/0.40 right_branch(5),
% 0.13/0.40 right_branch(4),
% 0.13/0.40 right_branch(3)
% 0.13/0.40 )).
% 0.13/0.40 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------