TSTP Solution File: SET978+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SET978+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 : n016.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 0.12s 0.34s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET978+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n016.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 : Sun Mar 3 19:08:59 EST 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % SZS status Theorem for theBenchmark
% 0.12/0.34 % SZS output start Proof for theBenchmark
% 0.12/0.34
% 0.12/0.34 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 0.12/0.34
% 0.12/0.34 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 0.12/0.34
% 0.12/0.34 % Formula: symmetry_r1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(symmetry_r1_xboole_0-1, axiom, ( ~disjoint(_u3, _u2) | disjoint(_u2, _u3) )).
% 0.12/0.34
% 0.12/0.34 % Formula: t127_zfmisc_1 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(t127_zfmisc_1-1, axiom, ( disjoint(cartesian_product2(_u7, _u5), cartesian_product2(_u6, _u4)) | ~disjoint(_u7, _u6) )).
% 0.12/0.34 cnf(t127_zfmisc_1-2, axiom, ( disjoint(cartesian_product2(_u7, _u5), cartesian_product2(_u6, _u4)) | ~disjoint(_u5, _u4) )).
% 0.12/0.34
% 0.12/0.34 % Formula: t131_zfmisc_1 ( conjecture ) converted to clauses:
% 0.12/0.34 cnf(t131_zfmisc_1-1, negated_conjecture, ( ( skolem3 != skolem4) )).
% 0.12/0.34 cnf(t131_zfmisc_1-2, negated_conjecture, ( ~disjoint(cartesian_product2(singleton(skolem3), skolem5), cartesian_product2(singleton(skolem4), skolem6)) | ~disjoint(cartesian_product2(skolem7, singleton(skolem3)), cartesian_product2(skolem8, singleton(skolem4))) )).
% 0.12/0.34
% 0.12/0.34 % Formula: t17_zfmisc_1 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(t17_zfmisc_1-1, axiom, ( ( _u17 = _u16) | disjoint(singleton(_u17), singleton(_u16)) )).
% 0.12/0.34
% 0.12/0.34 % Problem matrix:
% 0.12/0.34 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.12/0.34 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.12/0.34 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.12/0.34 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( cartesian_product2(__eqx_0, __eqx_1) = cartesian_product2(__eqy_0, __eqy_1)) )).
% 0.12/0.34 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.12/0.34 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.12/0.34 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 0.12/0.34 cnf(matrix-7, plain, ( empty(skolem1) )).
% 0.12/0.34 cnf(matrix-8, plain, ( ~empty(skolem2) )).
% 0.12/0.34 cnf(matrix-9, plain, ( ~disjoint(_u3, _u2) | disjoint(_u2, _u3) )).
% 0.12/0.34 cnf(matrix-10, plain, ( disjoint(cartesian_product2(_u7, _u5), cartesian_product2(_u6, _u4)) | ~disjoint(_u7, _u6) )).
% 0.12/0.34 cnf(matrix-11, plain, ( disjoint(cartesian_product2(_u7, _u5), cartesian_product2(_u6, _u4)) | ~disjoint(_u5, _u4) )).
% 0.12/0.34 cnf(matrix-12, plain, ( ( skolem3 != skolem4) )).
% 0.12/0.34 cnf(matrix-13, plain, ( ~disjoint(cartesian_product2(singleton(skolem3), skolem5), cartesian_product2(singleton(skolem4), skolem6)) | ~disjoint(cartesian_product2(skolem7, singleton(skolem3)), cartesian_product2(skolem8, singleton(skolem4))) )).
% 0.12/0.34 cnf(matrix-14, plain, ( ( _u17 = _u16) | disjoint(singleton(_u17), singleton(_u16)) )).
% 0.12/0.34
% 0.12/0.34 % Proof stack:
% 0.12/0.34 cnf(proof-stack, plain,
% 0.12/0.34 proof_stack(
% 0.12/0.34 start(13),
% 0.12/0.34 left_branch(0, 10, 0, 2),
% 0.12/0.34 left_branch(0, 14, 1, 3),
% 0.12/0.34 left_branch(0, 12, 0, 4),
% 0.12/0.34 right_branch(4),
% 0.12/0.34 right_branch(3),
% 0.12/0.34 right_branch(2),
% 0.12/0.34 left_branch(0, 11, 0, 3),
% 0.12/0.34 left_branch(0, 14, 1, 4),
% 0.12/0.34 left_branch(0, 12, 0, 5),
% 0.12/0.34 right_branch(5),
% 0.12/0.34 right_branch(4),
% 0.12/0.34 right_branch(3)
% 0.12/0.34 )).
% 0.12/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------