TSTP Solution File: SET954+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SET954+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 : Wed Mar 6 09:20:03 EST 2024
% Result : Theorem 0.13s 0.36s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET954+1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Mar 3 18:36:49 EST 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36 % SZS output start Proof for theBenchmark
% 0.13/0.36
% 0.13/0.36 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.13/0.36 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.13/0.36
% 0.13/0.36 % Formula: commutativity_k2_tarski ( axiom ) converted to clauses:
% 0.13/0.36 cnf(commutativity_k2_tarski-1, axiom, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 0.13/0.36
% 0.13/0.36 % Formula: d5_tarski ( axiom ) converted to clauses:
% 0.13/0.36 cnf(d5_tarski-1, axiom, ( ( ordered_pair(_u5, _u4) = unordered_pair(unordered_pair(_u5, _u4), singleton(_u5))) )).
% 0.13/0.36
% 0.13/0.36 % Formula: fc1_zfmisc_1 ( axiom ) converted to clauses:
% 0.13/0.36 cnf(fc1_zfmisc_1-1, axiom, ( ~empty(ordered_pair(_u7, _u6)) )).
% 0.13/0.36
% 0.13/0.36 % Formula: l55_zfmisc_1 ( axiom ) converted to clauses:
% 0.13/0.36 cnf(l55_zfmisc_1-1, axiom, ( ~in(ordered_pair(_u18, _u16), cartesian_product2(_u14, _u12)) | in(_u18, _u14) )).
% 0.13/0.36 cnf(l55_zfmisc_1-2, axiom, ( ~in(ordered_pair(_u18, _u16), cartesian_product2(_u14, _u12)) | in(_u16, _u12) )).
% 0.13/0.36 cnf(l55_zfmisc_1-3, axiom, ( ~in(_u19, _u15) | ~in(_u17, _u13) | in(ordered_pair(_u19, _u17), cartesian_product2(_u15, _u13)) )).
% 0.13/0.36
% 0.13/0.36 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.36 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 0.13/0.36
% 0.13/0.36 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.36 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 0.13/0.36
% 0.13/0.36 % Formula: t107_zfmisc_1 ( conjecture ) converted to clauses:
% 0.13/0.36 cnf(t107_zfmisc_1-1, negated_conjecture, ( in(ordered_pair(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) )).
% 0.13/0.36 cnf(t107_zfmisc_1-2, negated_conjecture, ( ~in(ordered_pair(skolem4, skolem3), cartesian_product2(skolem6, skolem5)) )).
% 0.13/0.36
% 0.13/0.36 % Problem matrix:
% 0.13/0.36 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.36 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.36 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.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)) )).
% 0.13/0.36 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.13/0.36 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.13/0.36 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.13/0.36 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.13/0.36 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.13/0.36 cnf(matrix-9, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.13/0.36 cnf(matrix-10, plain, ( ( unordered_pair(_u3, _u2) = unordered_pair(_u2, _u3)) )).
% 0.13/0.36 cnf(matrix-11, plain, ( ( ordered_pair(_u5, _u4) = unordered_pair(unordered_pair(_u5, _u4), singleton(_u5))) )).
% 0.13/0.36 cnf(matrix-12, plain, ( ~empty(ordered_pair(_u7, _u6)) )).
% 0.13/0.36 cnf(matrix-13, plain, ( ~in(ordered_pair(_u18, _u16), cartesian_product2(_u14, _u12)) | in(_u18, _u14) )).
% 0.13/0.36 cnf(matrix-14, plain, ( ~in(ordered_pair(_u18, _u16), cartesian_product2(_u14, _u12)) | in(_u16, _u12) )).
% 0.13/0.36 cnf(matrix-15, plain, ( ~in(_u19, _u15) | ~in(_u17, _u13) | in(ordered_pair(_u19, _u17), cartesian_product2(_u15, _u13)) )).
% 0.13/0.36 cnf(matrix-16, plain, ( empty(skolem1) )).
% 0.13/0.36 cnf(matrix-17, plain, ( ~empty(skolem2) )).
% 0.13/0.36 cnf(matrix-18, plain, ( in(ordered_pair(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) )).
% 0.13/0.36 cnf(matrix-19, plain, ( ~in(ordered_pair(skolem4, skolem3), cartesian_product2(skolem6, skolem5)) )).
% 0.13/0.36
% 0.13/0.36 % Proof stack:
% 0.13/0.36 cnf(proof-stack, plain,
% 0.13/0.36 proof_stack(
% 0.13/0.36 start(19),
% 0.13/0.36 left_branch(0, 15, 2, 2),
% 0.13/0.36 left_branch(0, 14, 1, 3),
% 0.13/0.36 left_branch(0, 18, 0, 4),
% 0.13/0.36 right_branch(4),
% 0.13/0.36 right_branch(3),
% 0.13/0.36 left_branch(0, 13, 1, 4),
% 0.13/0.36 left_branch(0, 18, 0, 5),
% 0.13/0.36 right_branch(5),
% 0.13/0.36 right_branch(4),
% 0.13/0.36 right_branch(2)
% 0.13/0.36 )).
% 0.13/0.36 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------