TSTP Solution File: SEU160+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU160+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 : n003.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 : Mon Mar 25 14:33:22 EDT 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.07/0.12 % Problem : SEU160+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.12/0.33 % Computer : n003.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Mar 20 14:31:49 EDT 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: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.12/0.34 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u1, _u1) )).
% 0.12/0.34
% 0.12/0.34 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 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: t39_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 0.12/0.34 cnf(t39_zfmisc_1-1, negated_conjecture, ( ~_def0 | ~_def1 )).
% 0.12/0.34 cnf(t39_zfmisc_1-2, negated_conjecture, ( _def0 | subset(skolem3, singleton(skolem4)) )).
% 0.12/0.34 cnf(t39_zfmisc_1-3, negated_conjecture, ( _def0 | ( skolem3 != empty_set) )).
% 0.12/0.34 cnf(t39_zfmisc_1-4, negated_conjecture, ( _def0 | ( skolem3 != singleton(skolem4)) )).
% 0.12/0.34 cnf(t39_zfmisc_1-5, negated_conjecture, ( _def1 | ( skolem3 = empty_set) | ( skolem3 = singleton(skolem4)) )).
% 0.12/0.34 cnf(t39_zfmisc_1-6, negated_conjecture, ( _def1 | ~subset(skolem3, singleton(skolem4)) )).
% 0.12/0.34
% 0.12/0.34 % Formula: l4_zfmisc_1 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(l4_zfmisc_1-1, axiom, ( ~subset(_u10, singleton(_u8)) | ( _u10 = empty_set) | ( _u10 = singleton(_u8)) )).
% 0.12/0.34 cnf(l4_zfmisc_1-2, axiom, ( subset(_u11, singleton(_u9)) | ( _u11 != empty_set) )).
% 0.12/0.34 cnf(l4_zfmisc_1-3, axiom, ( subset(_u11, singleton(_u9)) | ( _u11 != singleton(_u9)) )).
% 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) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.12/0.34 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 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, ( subset(_u1, _u1) )).
% 0.12/0.34 cnf(matrix-7, plain, ( empty(empty_set) )).
% 0.12/0.35 cnf(matrix-8, plain, ( empty(skolem1) )).
% 0.12/0.35 cnf(matrix-9, plain, ( ~empty(skolem2) )).
% 0.12/0.35 cnf(matrix-10, plain, ( ~_def0 | ~_def1 )).
% 0.12/0.35 cnf(matrix-11, plain, ( _def0 | subset(skolem3, singleton(skolem4)) )).
% 0.12/0.35 cnf(matrix-12, plain, ( _def0 | ( skolem3 != empty_set) )).
% 0.12/0.35 cnf(matrix-13, plain, ( _def0 | ( skolem3 != singleton(skolem4)) )).
% 0.12/0.35 cnf(matrix-14, plain, ( _def1 | ( skolem3 = empty_set) | ( skolem3 = singleton(skolem4)) )).
% 0.12/0.35 cnf(matrix-15, plain, ( _def1 | ~subset(skolem3, singleton(skolem4)) )).
% 0.12/0.35 cnf(matrix-16, plain, ( ~subset(_u10, singleton(_u8)) | ( _u10 = empty_set) | ( _u10 = singleton(_u8)) )).
% 0.12/0.35 cnf(matrix-17, plain, ( subset(_u11, singleton(_u9)) | ( _u11 != empty_set) )).
% 0.12/0.35 cnf(matrix-18, plain, ( subset(_u11, singleton(_u9)) | ( _u11 != singleton(_u9)) )).
% 0.12/0.35
% 0.12/0.35 % Proof stack:
% 0.12/0.35 cnf(proof-stack, plain,
% 0.12/0.35 proof_stack(
% 0.12/0.35 start(10),
% 0.12/0.35 left_branch(0, 13, 0, 2),
% 0.12/0.35 left_branch(0, 16, 2, 3),
% 0.12/0.35 left_branch(0, 11, 1, 4),
% 0.12/0.35 reduction(0, 0),
% 0.12/0.35 right_branch(4),
% 0.12/0.35 left_branch(0, 12, 1, 5),
% 0.12/0.35 reduction(0, 0),
% 0.12/0.35 right_branch(5),
% 0.12/0.35 right_branch(3),
% 0.12/0.35 right_branch(2),
% 0.12/0.35 left_branch(0, 14, 0, 3),
% 0.12/0.35 left_branch(0, 18, 1, 4),
% 0.12/0.35 left_branch(0, 15, 1, 5),
% 0.12/0.35 reduction(0, 0),
% 0.12/0.35 right_branch(5),
% 0.12/0.35 right_branch(4),
% 0.12/0.35 left_branch(0, 17, 1, 5),
% 0.12/0.35 left_branch(0, 15, 1, 6),
% 0.12/0.35 reduction(0, 0),
% 0.12/0.35 right_branch(6),
% 0.12/0.35 right_branch(5),
% 0.12/0.35 right_branch(3)
% 0.12/0.35 )).
% 0.12/0.35 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------