TSTP Solution File: SET985+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SET985+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 : n018.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:05 EST 2024
% Result : Theorem 12.18s 12.43s
% Output : Proof 12.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET985+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Mar 3 20:18:11 EST 2024
% 0.12/0.34 % CPUTime :
% 12.18/12.43 % SZS status Theorem for theBenchmark
% 12.18/12.43 % SZS output start Proof for theBenchmark
% 12.18/12.43
% 12.18/12.43 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 12.18/12.43 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 12.18/12.43
% 12.18/12.43 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 12.18/12.43 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 12.18/12.43
% 12.18/12.43 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 12.18/12.43 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 12.18/12.43
% 12.18/12.43 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 12.18/12.43 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u3, _u3) )).
% 12.18/12.43
% 12.18/12.43 % Formula: t113_zfmisc_1 ( axiom ) converted to clauses:
% 12.18/12.43 cnf(t113_zfmisc_1-1, axiom, ( ( cartesian_product2(_u8, _u6) != empty_set) | ( _u8 = empty_set) | ( _u6 = empty_set) )).
% 12.18/12.43 cnf(t113_zfmisc_1-2, axiom, ( ( cartesian_product2(_u9, _u7) = empty_set) | ( _u9 != empty_set) )).
% 12.18/12.43 cnf(t113_zfmisc_1-3, axiom, ( ( cartesian_product2(_u9, _u7) = empty_set) | ( _u7 != empty_set) )).
% 12.18/12.43
% 12.18/12.43 % Formula: t138_zfmisc_1 ( axiom ) converted to clauses:
% 12.18/12.43 cnf(t138_zfmisc_1-1, axiom, ( ~subset(cartesian_product2(_u13, _u12), cartesian_product2(_u11, _u10)) | ( cartesian_product2(_u13, _u12) = empty_set) | subset(_u13, _u11) )).
% 12.18/12.43 cnf(t138_zfmisc_1-2, axiom, ( ~subset(cartesian_product2(_u13, _u12), cartesian_product2(_u11, _u10)) | ( cartesian_product2(_u13, _u12) = empty_set) | subset(_u12, _u10) )).
% 12.18/12.43
% 12.18/12.43 % Formula: t139_zfmisc_1 ( conjecture ) converted to clauses:
% 12.18/12.43 cnf(t139_zfmisc_1-1, negated_conjecture, ( ~empty(skolem3) )).
% 12.18/12.43 cnf(t139_zfmisc_1-2, negated_conjecture, ( subset(cartesian_product2(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) | subset(cartesian_product2(skolem4, skolem3), cartesian_product2(skolem6, skolem5)) )).
% 12.18/12.43 cnf(t139_zfmisc_1-3, negated_conjecture, ( ~subset(skolem4, skolem6) )).
% 12.18/12.43
% 12.18/12.43 % Formula: t2_xboole_1 ( axiom ) converted to clauses:
% 12.18/12.43 cnf(t2_xboole_1-1, axiom, ( subset(empty_set, _u18) )).
% 12.18/12.43
% 12.18/12.43 % Problem matrix:
% 12.18/12.43 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 12.18/12.43 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 12.18/12.43 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 12.18/12.43 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( cartesian_product2(__eqx_0, __eqx_1) = cartesian_product2(__eqy_0, __eqy_1)) )).
% 12.18/12.43 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 12.18/12.43 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 12.18/12.43 cnf(matrix-6, plain, ( empty(empty_set) )).
% 12.18/12.43 cnf(matrix-7, plain, ( empty(skolem1) )).
% 12.18/12.43 cnf(matrix-8, plain, ( ~empty(skolem2) )).
% 12.18/12.43 cnf(matrix-9, plain, ( subset(_u3, _u3) )).
% 12.18/12.43 cnf(matrix-10, plain, ( ( cartesian_product2(_u8, _u6) != empty_set) | ( _u8 = empty_set) | ( _u6 = empty_set) )).
% 12.18/12.43 cnf(matrix-11, plain, ( ( cartesian_product2(_u9, _u7) = empty_set) | ( _u9 != empty_set) )).
% 12.18/12.43 cnf(matrix-12, plain, ( ( cartesian_product2(_u9, _u7) = empty_set) | ( _u7 != empty_set) )).
% 12.18/12.43 cnf(matrix-13, plain, ( ~subset(cartesian_product2(_u13, _u12), cartesian_product2(_u11, _u10)) | ( cartesian_product2(_u13, _u12) = empty_set) | subset(_u13, _u11) )).
% 12.18/12.43 cnf(matrix-14, plain, ( ~subset(cartesian_product2(_u13, _u12), cartesian_product2(_u11, _u10)) | ( cartesian_product2(_u13, _u12) = empty_set) | subset(_u12, _u10) )).
% 12.18/12.43 cnf(matrix-15, plain, ( ~empty(skolem3) )).
% 12.18/12.43 cnf(matrix-16, plain, ( subset(cartesian_product2(skolem3, skolem4), cartesian_product2(skolem5, skolem6)) | subset(cartesian_product2(skolem4, skolem3), cartesian_product2(skolem6, skolem5)) )).
% 12.18/12.43 cnf(matrix-17, plain, ( ~subset(skolem4, skolem6) )).
% 12.18/12.43 cnf(matrix-18, plain, ( subset(empty_set, _u18) )).
% 12.18/12.43
% 12.18/12.43 % Proof stack:
% 12.18/12.43 cnf(proof-stack, plain,
% 12.18/12.43 proof_stack(
% 12.18/12.43 start(16),
% 12.18/12.43 left_branch(0, 14, 0, 2),
% 12.18/12.43 left_branch(0, 17, 0, 3),
% 12.18/12.43 right_branch(3),
% 12.18/12.43 left_branch(0, 10, 0, 4),
% 12.18/12.43 left_branch(0, 1, 0, 5),
% 12.18/12.43 left_branch(0, 5, 0, 6),
% 12.18/12.43 left_branch(0, 17, 0, 7),
% 12.18/12.43 right_branch(7),
% 12.18/12.43 left_branch(0, 18, 0, 8),
% 12.18/12.43 right_branch(8),
% 12.18/12.43 left_branch(0, 0, 0, 9),
% 12.18/12.43 right_branch(9),
% 12.18/12.43 right_branch(6),
% 12.18/12.43 right_branch(5),
% 12.18/12.43 left_branch(0, 1, 0, 6),
% 12.18/12.43 left_branch(0, 4, 0, 7),
% 12.18/12.43 left_branch(0, 15, 0, 8),
% 12.18/12.43 right_branch(8),
% 12.18/12.43 left_branch(0, 6, 0, 9),
% 12.18/12.43 right_branch(9),
% 12.18/12.43 right_branch(7),
% 12.18/12.43 right_branch(6),
% 12.18/12.43 right_branch(4),
% 12.18/12.43 right_branch(2),
% 12.18/12.43 left_branch(0, 13, 0, 3),
% 12.18/12.43 left_branch(0, 17, 0, 4),
% 12.18/12.43 right_branch(4),
% 12.18/12.43 left_branch(0, 10, 0, 5),
% 12.18/12.43 left_branch(0, 1, 0, 6),
% 12.18/12.43 left_branch(0, 4, 0, 7),
% 12.18/12.43 left_branch(0, 15, 0, 8),
% 12.18/12.43 right_branch(8),
% 12.18/12.43 left_branch(0, 6, 0, 9),
% 12.18/12.43 right_branch(9),
% 12.18/12.43 right_branch(7),
% 12.18/12.43 right_branch(6),
% 12.18/12.43 left_branch(0, 1, 0, 7),
% 12.18/12.43 left_branch(0, 5, 0, 8),
% 12.18/12.43 left_branch(0, 17, 0, 9),
% 12.18/12.43 right_branch(9),
% 12.18/12.43 left_branch(0, 18, 0, 10),
% 12.18/12.43 right_branch(10),
% 12.18/12.43 left_branch(0, 0, 0, 11),
% 12.18/12.43 right_branch(11),
% 12.18/12.43 right_branch(8),
% 12.18/12.43 right_branch(7),
% 12.18/12.43 right_branch(5),
% 12.18/12.43 right_branch(3)
% 12.18/12.43 )).
% 12.18/12.43 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------