TSTP Solution File: SEU165+3 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SEU165+3 : 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 : n029.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 : Wed Mar 6 09:20:25 EST 2024
% Result : Theorem 0.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU165+3 : 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 : n029.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 : Sun Mar 3 11:21:20 EST 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% 0.20/0.53
% 0.20/0.53 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 0.20/0.53 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u1, _u0) = unordered_pair(_u0, _u1)) )).
% 0.20/0.53
% 0.20/0.53 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.20/0.53 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u3, _u2) | ~in(_u2, _u3) )).
% 0.20/0.53
% 0.20/0.53 % Formula: fc1_zfmisc_1 ( axiom ) converted to clauses:
% 0.20/0.53 cnf(fc1_zfmisc_1-1, axiom, ( ~empty(ordered_pair(_u5, _u4)) )).
% 0.20/0.53
% 0.20/0.53 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.53 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 0.20/0.53
% 0.20/0.53 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.53 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 0.20/0.53
% 0.20/0.53 % Formula: d5_tarski ( axiom ) converted to clauses:
% 0.20/0.53 cnf(d5_tarski-1, axiom, ( ( ordered_pair(_u9, _u8) = unordered_pair(unordered_pair(_u9, _u8), singleton(_u9))) )).
% 0.20/0.53
% 0.20/0.53 % Formula: t106_zfmisc_1 ( conjecture ) converted to clauses:
% 0.20/0.53 cnf(t106_zfmisc_1-1, negated_conjecture, ( in(ordered_pair(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) | in(skolem7, skolem9) )).
% 0.20/0.53 cnf(t106_zfmisc_1-2, negated_conjecture, ( in(ordered_pair(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) | in(skolem8, skolem10) )).
% 0.20/0.53 cnf(t106_zfmisc_1-3, negated_conjecture, ( in(ordered_pair(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) | ~in(ordered_pair(skolem7, skolem8), cartesian_product2(skolem9, skolem10)) )).
% 0.20/0.53 cnf(t106_zfmisc_1-4, negated_conjecture, ( ~in(skolem3, skolem5) | ~in(skolem4, skolem6) | in(skolem7, skolem9) )).
% 0.20/0.53 cnf(t106_zfmisc_1-5, negated_conjecture, ( ~in(skolem3, skolem5) | ~in(skolem4, skolem6) | in(skolem8, skolem10) )).
% 0.20/0.53 cnf(t106_zfmisc_1-6, negated_conjecture, ( ~in(skolem3, skolem5) | ~in(skolem4, skolem6) | ~in(ordered_pair(skolem7, skolem8), cartesian_product2(skolem9, skolem10)) )).
% 0.20/0.53
% 0.20/0.53 % Formula: l55_zfmisc_1 ( axiom ) converted to clauses:
% 0.20/0.53 cnf(l55_zfmisc_1-1, axiom, ( ~in(ordered_pair(_u32, _u30), cartesian_product2(_u28, _u26)) | in(_u32, _u28) )).
% 0.20/0.53 cnf(l55_zfmisc_1-2, axiom, ( ~in(ordered_pair(_u32, _u30), cartesian_product2(_u28, _u26)) | in(_u30, _u26) )).
% 0.20/0.53 cnf(l55_zfmisc_1-3, axiom, ( ~in(_u33, _u29) | ~in(_u31, _u27) | in(ordered_pair(_u33, _u31), cartesian_product2(_u29, _u27)) )).
% 0.20/0.53
% 0.20/0.53 % Problem matrix:
% 0.20/0.53 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.20/0.53 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.20/0.53 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.20/0.53 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.20/0.53 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( ordered_pair(__eqx_0, __eqx_1) = ordered_pair(__eqy_0, __eqy_1)) )).
% 0.20/0.53 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.20/0.53 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( cartesian_product2(__eqx_0, __eqx_1) = cartesian_product2(__eqy_0, __eqy_1)) )).
% 0.20/0.53 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.20/0.53 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.20/0.53 cnf(matrix-9, plain, ( ( unordered_pair(_u1, _u0) = unordered_pair(_u0, _u1)) )).
% 0.20/0.53 cnf(matrix-10, plain, ( ~in(_u3, _u2) | ~in(_u2, _u3) )).
% 0.20/0.53 cnf(matrix-11, plain, ( ~empty(ordered_pair(_u5, _u4)) )).
% 0.20/0.53 cnf(matrix-12, plain, ( empty(skolem1) )).
% 0.20/0.53 cnf(matrix-13, plain, ( ~empty(skolem2) )).
% 0.20/0.53 cnf(matrix-14, plain, ( ( ordered_pair(_u9, _u8) = unordered_pair(unordered_pair(_u9, _u8), singleton(_u9))) )).
% 0.20/0.53 cnf(matrix-15, plain, ( in(ordered_pair(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) | in(skolem7, skolem9) )).
% 0.20/0.53 cnf(matrix-16, plain, ( in(ordered_pair(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) | in(skolem8, skolem10) )).
% 0.20/0.53 cnf(matrix-17, plain, ( in(ordered_pair(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) | ~in(ordered_pair(skolem7, skolem8), cartesian_product2(skolem9, skolem10)) )).
% 0.20/0.53 cnf(matrix-18, plain, ( ~in(skolem3, skolem5) | ~in(skolem4, skolem6) | in(skolem7, skolem9) )).
% 0.20/0.53 cnf(matrix-19, plain, ( ~in(skolem3, skolem5) | ~in(skolem4, skolem6) | in(skolem8, skolem10) )).
% 0.20/0.53 cnf(matrix-20, plain, ( ~in(skolem3, skolem5) | ~in(skolem4, skolem6) | ~in(ordered_pair(skolem7, skolem8), cartesian_product2(skolem9, skolem10)) )).
% 0.20/0.53 cnf(matrix-21, plain, ( ~in(ordered_pair(_u32, _u30), cartesian_product2(_u28, _u26)) | in(_u32, _u28) )).
% 0.20/0.53 cnf(matrix-22, plain, ( ~in(ordered_pair(_u32, _u30), cartesian_product2(_u28, _u26)) | in(_u30, _u26) )).
% 0.20/0.53 cnf(matrix-23, plain, ( ~in(_u33, _u29) | ~in(_u31, _u27) | in(ordered_pair(_u33, _u31), cartesian_product2(_u29, _u27)) )).
% 0.20/0.53
% 0.20/0.53 % Proof stack:
% 0.20/0.53 cnf(proof-stack, plain,
% 0.20/0.53 proof_stack(
% 0.20/0.53 start(20),
% 0.20/0.53 left_branch(0, 21, 1, 2),
% 0.20/0.53 left_branch(0, 17, 0, 3),
% 0.20/0.53 left_branch(0, 23, 2, 4),
% 0.20/0.53 left_branch(0, 15, 1, 5),
% 0.20/0.53 reduction(0, 1),
% 0.20/0.53 right_branch(5),
% 0.20/0.53 left_branch(0, 16, 1, 6),
% 0.20/0.53 reduction(0, 1),
% 0.20/0.53 right_branch(6),
% 0.20/0.53 right_branch(4),
% 0.20/0.53 right_branch(3),
% 0.20/0.53 right_branch(2),
% 0.20/0.53 left_branch(0, 23, 2, 3),
% 0.20/0.53 left_branch(0, 18, 2, 4),
% 0.20/0.53 lemmata(0, 0),
% 0.20/0.53 left_branch(0, 22, 1, 6),
% 0.20/0.53 left_branch(0, 15, 0, 7),
% 0.20/0.53 reduction(0, 1),
% 0.20/0.53 right_branch(7),
% 0.20/0.53 right_branch(6),
% 0.20/0.53 right_branch(4),
% 0.20/0.53 left_branch(0, 19, 2, 5),
% 0.20/0.53 lemmata(0, 0),
% 0.20/0.53 left_branch(0, 22, 1, 7),
% 0.20/0.53 left_branch(0, 16, 0, 8),
% 0.20/0.53 reduction(0, 1),
% 0.20/0.53 right_branch(8),
% 0.20/0.53 right_branch(7),
% 0.20/0.53 right_branch(5),
% 0.20/0.53 right_branch(3),
% 0.20/0.53 left_branch(0, 22, 1, 4),
% 0.20/0.53 left_branch(0, 17, 0, 5),
% 0.20/0.53 lemmata(0, 1),
% 0.20/0.53 right_branch(5),
% 0.20/0.53 right_branch(4)
% 0.20/0.53 )).
% 0.20/0.53 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------