TSTP Solution File: SET928+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET928+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 : n031.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 1.07s 1.25s
% Output : Proof 1.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET928+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n031.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:35:48 EDT 2024
% 0.12/0.33 % CPUTime :
% 1.07/1.25 % SZS status Theorem for theBenchmark
% 1.07/1.25 % SZS output start Proof for theBenchmark
% 1.07/1.25
% 1.07/1.25 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 1.07/1.25 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 1.07/1.25
% 1.07/1.25 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 1.07/1.25 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 1.07/1.25
% 1.07/1.25 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 1.07/1.25 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 1.07/1.25
% 1.07/1.25 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 1.07/1.25 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 1.07/1.25
% 1.07/1.25 % Formula: symmetry_r1_xboole_0 ( axiom ) converted to clauses:
% 1.07/1.25 cnf(symmetry_r1_xboole_0-1, axiom, ( ~disjoint(_u7, _u6) | disjoint(_u6, _u7) )).
% 1.07/1.25
% 1.07/1.25 % Formula: t55_zfmisc_1 ( axiom ) converted to clauses:
% 1.07/1.25 cnf(t55_zfmisc_1-1, axiom, ( ~disjoint(unordered_pair(_u10, _u9), _u8) | ~in(_u10, _u8) )).
% 1.07/1.25
% 1.07/1.25 % Formula: t57_zfmisc_1 ( axiom ) converted to clauses:
% 1.07/1.25 cnf(t57_zfmisc_1-1, axiom, ( in(_u13, _u12) | in(_u11, _u12) | disjoint(unordered_pair(_u13, _u11), _u12) )).
% 1.07/1.25
% 1.07/1.25 % Formula: t72_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 1.07/1.25 cnf(t72_zfmisc_1-1, negated_conjecture, ( ~_def0 | ~_def1 )).
% 1.07/1.25 cnf(t72_zfmisc_1-2, negated_conjecture, ( _def0 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) = unordered_pair(skolem3, skolem4)) )).
% 1.07/1.25 cnf(t72_zfmisc_1-3, negated_conjecture, ( _def0 | in(skolem3, skolem5) | in(skolem4, skolem5) )).
% 1.07/1.25 cnf(t72_zfmisc_1-4, negated_conjecture, ( _def1 | ~in(skolem3, skolem5) )).
% 1.07/1.25 cnf(t72_zfmisc_1-5, negated_conjecture, ( _def1 | ~in(skolem4, skolem5) )).
% 1.07/1.25 cnf(t72_zfmisc_1-6, negated_conjecture, ( _def1 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) != unordered_pair(skolem3, skolem4)) )).
% 1.07/1.25
% 1.07/1.25 % Formula: t83_xboole_1 ( axiom ) converted to clauses:
% 1.07/1.25 cnf(t83_xboole_1-1, axiom, ( ~disjoint(_u21, _u19) | ( set_difference(_u21, _u19) = _u21) )).
% 1.07/1.25 cnf(t83_xboole_1-2, axiom, ( ( set_difference(_u22, _u20) != _u22) | disjoint(_u22, _u20) )).
% 1.07/1.25
% 1.07/1.25 % Problem matrix:
% 1.07/1.25 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 1.07/1.25 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 1.07/1.25 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 1.07/1.25 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.07/1.25 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.07/1.25 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 1.07/1.25 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 1.07/1.25 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 1.07/1.25 cnf(matrix-8, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 1.07/1.25 cnf(matrix-9, plain, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 1.07/1.25 cnf(matrix-10, plain, ( empty(skolem1) )).
% 1.07/1.25 cnf(matrix-11, plain, ( ~empty(skolem2) )).
% 1.07/1.25 cnf(matrix-12, plain, ( ~disjoint(_u7, _u6) | disjoint(_u6, _u7) )).
% 1.07/1.25 cnf(matrix-13, plain, ( ~disjoint(unordered_pair(_u10, _u9), _u8) | ~in(_u10, _u8) )).
% 1.07/1.25 cnf(matrix-14, plain, ( in(_u13, _u12) | in(_u11, _u12) | disjoint(unordered_pair(_u13, _u11), _u12) )).
% 1.07/1.25 cnf(matrix-15, plain, ( ~_def0 | ~_def1 )).
% 1.07/1.25 cnf(matrix-16, plain, ( _def0 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) = unordered_pair(skolem3, skolem4)) )).
% 1.07/1.25 cnf(matrix-17, plain, ( _def0 | in(skolem3, skolem5) | in(skolem4, skolem5) )).
% 1.07/1.25 cnf(matrix-18, plain, ( _def1 | ~in(skolem3, skolem5) )).
% 1.07/1.25 cnf(matrix-19, plain, ( _def1 | ~in(skolem4, skolem5) )).
% 1.07/1.25 cnf(matrix-20, plain, ( _def1 | ( set_difference(unordered_pair(skolem3, skolem4), skolem5) != unordered_pair(skolem3, skolem4)) )).
% 1.07/1.25 cnf(matrix-21, plain, ( ~disjoint(_u21, _u19) | ( set_difference(_u21, _u19) = _u21) )).
% 1.07/1.25 cnf(matrix-22, plain, ( ( set_difference(_u22, _u20) != _u22) | disjoint(_u22, _u20) )).
% 1.07/1.25
% 1.07/1.25 % Proof stack:
% 1.07/1.25 cnf(proof-stack, plain,
% 1.07/1.25 proof_stack(
% 1.07/1.25 start(15),
% 1.07/1.25 left_branch(0, 17, 0, 2),
% 1.07/1.25 left_branch(0, 13, 1, 3),
% 1.07/1.25 left_branch(0, 7, 3, 4),
% 1.07/1.25 left_branch(0, 9, 0, 5),
% 1.07/1.25 right_branch(5),
% 1.07/1.25 left_branch(0, 22, 1, 6),
% 1.07/1.25 left_branch(0, 16, 1, 7),
% 1.07/1.25 reduction(0, 0),
% 1.07/1.25 right_branch(7),
% 1.07/1.25 right_branch(6),
% 1.07/1.25 left_branch(0, 0, 0, 7),
% 1.07/1.25 right_branch(7),
% 1.07/1.25 right_branch(4),
% 1.07/1.25 right_branch(3),
% 1.07/1.25 left_branch(0, 13, 1, 4),
% 1.07/1.25 left_branch(0, 22, 1, 5),
% 1.07/1.25 left_branch(0, 16, 1, 6),
% 1.07/1.25 reduction(0, 0),
% 1.07/1.25 right_branch(6),
% 1.07/1.25 right_branch(5),
% 1.07/1.25 right_branch(4),
% 1.07/1.25 right_branch(2),
% 1.07/1.25 left_branch(0, 20, 0, 3),
% 1.07/1.25 left_branch(0, 21, 1, 4),
% 1.07/1.25 left_branch(0, 14, 2, 5),
% 1.07/1.25 left_branch(0, 18, 1, 6),
% 1.07/1.25 reduction(0, 0),
% 1.07/1.25 right_branch(6),
% 1.07/1.25 left_branch(0, 19, 1, 7),
% 1.07/1.25 reduction(0, 0),
% 1.07/1.25 right_branch(7),
% 1.07/1.25 right_branch(5),
% 1.07/1.25 right_branch(4),
% 1.07/1.25 right_branch(3)
% 1.07/1.25 )).
% 1.07/1.25 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------