TSTP Solution File: SEU148+3 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SEU148+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 : n022.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:21 EST 2024
% Result : Theorem 0.19s 0.41s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU148+3 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n022.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 10:17:34 EST 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.41 % SZS status Theorem for theBenchmark
% 0.19/0.41 % SZS output start Proof for theBenchmark
% 0.19/0.41
% 0.19/0.41 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.19/0.41 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.19/0.41
% 0.19/0.41 % Formula: d1_tarski ( axiom ) converted to clauses:
% 0.19/0.41 cnf(d1_tarski-1, axiom, ( ( _u10 != singleton(_u12)) | ~in(_u6, _u10) | ( _u6 = _u12) )).
% 0.19/0.41 cnf(d1_tarski-2, axiom, ( ( _u10 != singleton(_u12)) | ( _u7 != _u12) | in(_u7, _u10) )).
% 0.19/0.41 cnf(d1_tarski-3, axiom, ( ( _u11 = singleton(_u13)) | in(skolem1(_u13, _u11), _u11) | ( skolem2(_u13, _u11) = _u13) )).
% 0.19/0.41 cnf(d1_tarski-4, axiom, ( ( _u11 = singleton(_u13)) | in(skolem1(_u13, _u11), _u11) | ~in(skolem2(_u13, _u11), _u11) )).
% 0.19/0.41 cnf(d1_tarski-5, axiom, ( ( _u11 = singleton(_u13)) | ( skolem1(_u13, _u11) != _u13) | ( skolem2(_u13, _u11) = _u13) )).
% 0.19/0.41 cnf(d1_tarski-6, axiom, ( ( _u11 = singleton(_u13)) | ( skolem1(_u13, _u11) != _u13) | ~in(skolem2(_u13, _u11), _u11) )).
% 0.19/0.41
% 0.19/0.41 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.41 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.19/0.41
% 0.19/0.41 % Formula: l1_zfmisc_1 ( axiom ) converted to clauses:
% 0.19/0.41 cnf(l1_zfmisc_1-1, axiom, ( ( singleton(_u14) != empty_set) )).
% 0.19/0.41
% 0.19/0.41 % Formula: l4_zfmisc_1 ( axiom ) converted to clauses:
% 0.19/0.41 cnf(l4_zfmisc_1-1, axiom, ( ~subset(_u19, singleton(_u17)) | ( _u19 = empty_set) | ( _u19 = singleton(_u17)) )).
% 0.19/0.41 cnf(l4_zfmisc_1-2, axiom, ( subset(_u20, singleton(_u18)) | ( _u20 != empty_set) )).
% 0.19/0.41 cnf(l4_zfmisc_1-3, axiom, ( subset(_u20, singleton(_u18)) | ( _u20 != singleton(_u18)) )).
% 0.19/0.41
% 0.19/0.41 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.41 cnf(rc1_xboole_0-1, axiom, ( empty(skolem3) )).
% 0.19/0.41
% 0.19/0.41 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.41 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem4) )).
% 0.19/0.41
% 0.19/0.41 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.19/0.41 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u24, _u24) )).
% 0.19/0.41
% 0.19/0.41 % Formula: t6_zfmisc_1 ( conjecture ) converted to clauses:
% 0.19/0.41 cnf(t6_zfmisc_1-1, negated_conjecture, ( subset(singleton(skolem5), singleton(skolem6)) )).
% 0.19/0.41 cnf(t6_zfmisc_1-2, negated_conjecture, ( ( skolem5 != skolem6) )).
% 0.19/0.41
% 0.19/0.41 % Problem matrix:
% 0.19/0.41 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.19/0.41 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.19/0.41 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.19/0.41 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.19/0.41 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.19/0.41 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 0.19/0.41 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.19/0.41 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.19/0.41 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.19/0.41 cnf(matrix-9, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.19/0.41 cnf(matrix-10, plain, ( ( _u10 != singleton(_u12)) | ~in(_u6, _u10) | ( _u6 = _u12) )).
% 0.19/0.41 cnf(matrix-11, plain, ( ( _u10 != singleton(_u12)) | ( _u7 != _u12) | in(_u7, _u10) )).
% 0.19/0.41 cnf(matrix-12, plain, ( ( _u11 = singleton(_u13)) | in(skolem1(_u13, _u11), _u11) | ( skolem2(_u13, _u11) = _u13) )).
% 0.19/0.41 cnf(matrix-13, plain, ( ( _u11 = singleton(_u13)) | in(skolem1(_u13, _u11), _u11) | ~in(skolem2(_u13, _u11), _u11) )).
% 0.19/0.41 cnf(matrix-14, plain, ( ( _u11 = singleton(_u13)) | ( skolem1(_u13, _u11) != _u13) | ( skolem2(_u13, _u11) = _u13) )).
% 0.19/0.41 cnf(matrix-15, plain, ( ( _u11 = singleton(_u13)) | ( skolem1(_u13, _u11) != _u13) | ~in(skolem2(_u13, _u11), _u11) )).
% 0.19/0.41 cnf(matrix-16, plain, ( empty(empty_set) )).
% 0.19/0.41 cnf(matrix-17, plain, ( ( singleton(_u14) != empty_set) )).
% 0.19/0.41 cnf(matrix-18, plain, ( ~subset(_u19, singleton(_u17)) | ( _u19 = empty_set) | ( _u19 = singleton(_u17)) )).
% 0.19/0.41 cnf(matrix-19, plain, ( subset(_u20, singleton(_u18)) | ( _u20 != empty_set) )).
% 0.19/0.41 cnf(matrix-20, plain, ( subset(_u20, singleton(_u18)) | ( _u20 != singleton(_u18)) )).
% 0.19/0.41 cnf(matrix-21, plain, ( empty(skolem3) )).
% 0.19/0.41 cnf(matrix-22, plain, ( ~empty(skolem4) )).
% 0.19/0.41 cnf(matrix-23, plain, ( subset(_u24, _u24) )).
% 0.19/0.41 cnf(matrix-24, plain, ( subset(singleton(skolem5), singleton(skolem6)) )).
% 0.19/0.41 cnf(matrix-25, plain, ( ( skolem5 != skolem6) )).
% 0.19/0.41
% 0.19/0.41 % Proof stack:
% 0.19/0.41 cnf(proof-stack, plain,
% 0.19/0.41 proof_stack(
% 0.19/0.41 start(25),
% 0.19/0.41 left_branch(0, 10, 2, 2),
% 0.19/0.41 left_branch(0, 18, 2, 3),
% 0.19/0.41 left_branch(0, 24, 0, 4),
% 0.19/0.41 right_branch(4),
% 0.19/0.41 left_branch(0, 17, 0, 5),
% 0.19/0.41 right_branch(5),
% 0.19/0.41 right_branch(3),
% 0.19/0.41 left_branch(0, 11, 2, 4),
% 0.19/0.41 left_branch(0, 0, 0, 5),
% 0.19/0.41 right_branch(5),
% 0.19/0.41 left_branch(0, 0, 0, 6),
% 0.19/0.41 right_branch(6),
% 0.19/0.41 right_branch(4),
% 0.19/0.41 right_branch(2)
% 0.19/0.41 )).
% 0.19/0.41 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------