TSTP Solution File: SET886+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET886+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 : n014.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:43 EDT 2024
% Result : Theorem 12.19s 12.36s
% Output : Proof 12.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET886+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Mar 20 22:20:30 EDT 2024
% 0.14/0.34 % CPUTime :
% 12.19/12.36 % SZS status Theorem for theBenchmark
% 12.19/12.36 % SZS output start Proof for theBenchmark
% 12.19/12.36
% 12.19/12.36 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 12.19/12.36 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u1, _u0) = unordered_pair(_u0, _u1)) )).
% 12.19/12.36
% 12.19/12.36 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 12.19/12.36 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 12.19/12.36
% 12.19/12.36 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 12.19/12.36 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 12.19/12.36
% 12.19/12.36 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 12.19/12.36 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u5, _u5) )).
% 12.19/12.36
% 12.19/12.36 % Formula: t26_zfmisc_1 ( axiom ) converted to clauses:
% 12.19/12.36 cnf(t26_zfmisc_1-1, axiom, ( ~subset(unordered_pair(_u8, _u7), singleton(_u6)) | ( _u8 = _u6) )).
% 12.19/12.36
% 12.19/12.36 % Formula: t27_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 12.19/12.36 cnf(t27_zfmisc_1-1, negated_conjecture, ( subset(unordered_pair(skolem3, skolem4), singleton(skolem5)) )).
% 12.19/12.36 cnf(t27_zfmisc_1-2, negated_conjecture, ( ( unordered_pair(skolem3, skolem4) != singleton(skolem5)) )).
% 12.19/12.36
% 12.19/12.36 % Formula: t69_enumset1 ( axiom ) converted to clauses:
% 12.19/12.36 cnf(t69_enumset1-1, axiom, ( ( unordered_pair(_u12, _u12) = singleton(_u12)) )).
% 12.19/12.36
% 12.19/12.36 % Problem matrix:
% 12.19/12.36 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 12.19/12.36 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 12.19/12.36 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 12.19/12.36 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( unordered_pair(__eqx_0, __eqx_1) = unordered_pair(__eqy_0, __eqy_1)) )).
% 12.19/12.36 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 12.19/12.36 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 12.19/12.36 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 12.19/12.36 cnf(matrix-7, plain, ( ( unordered_pair(_u1, _u0) = unordered_pair(_u0, _u1)) )).
% 12.19/12.36 cnf(matrix-8, plain, ( empty(skolem1) )).
% 12.19/12.36 cnf(matrix-9, plain, ( ~empty(skolem2) )).
% 12.19/12.36 cnf(matrix-10, plain, ( subset(_u5, _u5) )).
% 12.19/12.36 cnf(matrix-11, plain, ( ~subset(unordered_pair(_u8, _u7), singleton(_u6)) | ( _u8 = _u6) )).
% 12.19/12.36 cnf(matrix-12, plain, ( subset(unordered_pair(skolem3, skolem4), singleton(skolem5)) )).
% 12.19/12.36 cnf(matrix-13, plain, ( ( unordered_pair(skolem3, skolem4) != singleton(skolem5)) )).
% 12.19/12.36 cnf(matrix-14, plain, ( ( unordered_pair(_u12, _u12) = singleton(_u12)) )).
% 12.19/12.36
% 12.19/12.36 % Proof stack:
% 12.19/12.36 cnf(proof-stack, plain,
% 12.19/12.36 proof_stack(
% 12.19/12.36 start(12),
% 12.19/12.36 left_branch(0, 11, 0, 2),
% 12.19/12.36 left_branch(0, 3, 0, 3),
% 12.19/12.36 left_branch(0, 2, 0, 4),
% 12.19/12.36 left_branch(0, 13, 0, 5),
% 12.19/12.36 right_branch(5),
% 12.19/12.36 left_branch(0, 14, 0, 6),
% 12.19/12.36 right_branch(6),
% 12.19/12.36 right_branch(4),
% 12.19/12.36 left_branch(0, 11, 1, 5),
% 12.19/12.36 left_branch(0, 6, 3, 6),
% 12.19/12.36 left_branch(0, 7, 0, 7),
% 12.19/12.36 right_branch(7),
% 12.19/12.36 reduction(0, 0),
% 12.19/12.36 left_branch(0, 0, 0, 9),
% 12.19/12.36 right_branch(9),
% 12.19/12.36 right_branch(6),
% 12.19/12.36 right_branch(5),
% 12.19/12.36 right_branch(3),
% 12.19/12.36 right_branch(2)
% 12.19/12.36 )).
% 12.19/12.36 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------