TSTP Solution File: SEU320+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU320+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n002.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:58 EDT 2024
% Result : Theorem 0.13s 0.35s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU320+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n002.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 : Wed Mar 20 15:27:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Theorem for theBenchmark
% 0.13/0.35 % SZS output start Proof for theBenchmark
% 0.13/0.35
% 0.13/0.35 % Formula: dt_k1_zfmisc_1 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(dt_k1_zfmisc_1, axiom, $true).
% 0.13/0.35
% 0.13/0.35 % Formula: dt_k3_subset_1 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(dt_k3_subset_1-1, axiom, ( ~element(_u0, powerset(_u1)) | element(subset_complement(_u1, _u0), powerset(_u1)) )).
% 0.13/0.35
% 0.13/0.35 % Formula: dt_l1_pre_topc ( axiom ) converted to clauses:
% 0.13/0.35 cnf(dt_l1_pre_topc-1, axiom, ( ~top_str(_u2) | one_sorted_str(_u2) )).
% 0.13/0.35
% 0.13/0.35 % Formula: dt_l1_struct_0 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(dt_l1_struct_0, axiom, $true).
% 0.13/0.35
% 0.13/0.35 % Formula: dt_m1_subset_1 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(dt_m1_subset_1, axiom, $true).
% 0.13/0.35
% 0.13/0.35 % Formula: dt_u1_struct_0 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(dt_u1_struct_0, axiom, $true).
% 0.13/0.35
% 0.13/0.35 % Formula: existence_l1_pre_topc ( axiom ) converted to clauses:
% 0.13/0.35 cnf(existence_l1_pre_topc-1, axiom, ( top_str(skolem1) )).
% 0.13/0.35
% 0.13/0.35 % Formula: existence_l1_struct_0 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(existence_l1_struct_0-1, axiom, ( one_sorted_str(skolem2) )).
% 0.13/0.35
% 0.13/0.35 % Formula: existence_m1_subset_1 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(existence_m1_subset_1-1, axiom, ( element(skolem3(_u6), _u6) )).
% 0.13/0.35
% 0.13/0.35 % Formula: involutiveness_k3_subset_1 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(involutiveness_k3_subset_1-1, axiom, ( ~element(_u7, powerset(_u8)) | ( subset_complement(_u8, subset_complement(_u8, _u7)) = _u7) )).
% 0.13/0.35
% 0.13/0.35 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.13/0.35 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u10, _u10) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t29_tops_1 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(t29_tops_1-1, axiom, ( ~top_str(_u12) | ~element(_u11, powerset(the_carrier(_u12))) | ~closed_subset(_u11, _u12) | open_subset(subset_complement(the_carrier(_u12), _u11), _u12) )).
% 0.13/0.35 cnf(t29_tops_1-2, axiom, ( ~top_str(_u12) | ~element(_u11, powerset(the_carrier(_u12))) | ~open_subset(subset_complement(the_carrier(_u12), _u11), _u12) | closed_subset(_u11, _u12) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t30_tops_1 ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.35 cnf(t30_tops_1-1, negated_conjecture, ( top_str(skolem4) )).
% 0.13/0.35 cnf(t30_tops_1-2, negated_conjecture, ( element(skolem5, powerset(the_carrier(skolem4))) )).
% 0.13/0.35 cnf(t30_tops_1-3, negated_conjecture, ( ~_def0 | ~_def1 )).
% 0.13/0.35 cnf(t30_tops_1-4, negated_conjecture, ( _def0 | open_subset(skolem5, skolem4) )).
% 0.13/0.35 cnf(t30_tops_1-5, negated_conjecture, ( _def0 | ~closed_subset(subset_complement(the_carrier(skolem4), skolem5), skolem4) )).
% 0.13/0.35 cnf(t30_tops_1-6, negated_conjecture, ( _def1 | closed_subset(subset_complement(the_carrier(skolem4), skolem5), skolem4) )).
% 0.13/0.35 cnf(t30_tops_1-7, negated_conjecture, ( _def1 | ~open_subset(skolem5, skolem4) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t3_subset ( axiom ) converted to clauses:
% 0.13/0.35 cnf(t3_subset-1, axiom, ( ~element(_u19, powerset(_u17)) | subset(_u19, _u17) )).
% 0.13/0.35 cnf(t3_subset-2, axiom, ( ~subset(_u20, _u18) | element(_u20, powerset(_u18)) )).
% 0.13/0.35
% 0.13/0.35 % Problem matrix:
% 0.13/0.35 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.35 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.35 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.35 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( powerset(__eqx_0) = powerset(__eqy_0)) )).
% 0.13/0.35 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( subset_complement(__eqx_0, __eqx_1) = subset_complement(__eqy_0, __eqy_1)) )).
% 0.13/0.35 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( the_carrier(__eqx_0) = the_carrier(__eqy_0)) )).
% 0.13/0.35 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( skolem3(__eqx_0) = skolem3(__eqy_0)) )).
% 0.13/0.35 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~element(__eqx_0, __eqx_1) | element(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ~top_str(__eqx_0) | top_str(__eqy_0) )).
% 0.13/0.35 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ~one_sorted_str(__eqx_0) | one_sorted_str(__eqy_0) )).
% 0.13/0.35 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~closed_subset(__eqx_0, __eqx_1) | closed_subset(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~open_subset(__eqx_0, __eqx_1) | open_subset(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-13, plain, ( ~element(_u0, powerset(_u1)) | element(subset_complement(_u1, _u0), powerset(_u1)) )).
% 0.13/0.35 cnf(matrix-14, plain, ( ~top_str(_u2) | one_sorted_str(_u2) )).
% 0.13/0.35 cnf(matrix-15, plain, ( top_str(skolem1) )).
% 0.13/0.35 cnf(matrix-16, plain, ( one_sorted_str(skolem2) )).
% 0.13/0.35 cnf(matrix-17, plain, ( element(skolem3(_u6), _u6) )).
% 0.13/0.35 cnf(matrix-18, plain, ( ~element(_u7, powerset(_u8)) | ( subset_complement(_u8, subset_complement(_u8, _u7)) = _u7) )).
% 0.13/0.35 cnf(matrix-19, plain, ( subset(_u10, _u10) )).
% 0.13/0.35 cnf(matrix-20, plain, ( ~top_str(_u12) | ~element(_u11, powerset(the_carrier(_u12))) | ~closed_subset(_u11, _u12) | open_subset(subset_complement(the_carrier(_u12), _u11), _u12) )).
% 0.13/0.35 cnf(matrix-21, plain, ( ~top_str(_u12) | ~element(_u11, powerset(the_carrier(_u12))) | ~open_subset(subset_complement(the_carrier(_u12), _u11), _u12) | closed_subset(_u11, _u12) )).
% 0.13/0.35 cnf(matrix-22, plain, ( top_str(skolem4) )).
% 0.13/0.35 cnf(matrix-23, plain, ( element(skolem5, powerset(the_carrier(skolem4))) )).
% 0.13/0.35 cnf(matrix-24, plain, ( ~_def0 | ~_def1 )).
% 0.13/0.35 cnf(matrix-25, plain, ( _def0 | open_subset(skolem5, skolem4) )).
% 0.13/0.35 cnf(matrix-26, plain, ( _def0 | ~closed_subset(subset_complement(the_carrier(skolem4), skolem5), skolem4) )).
% 0.13/0.35 cnf(matrix-27, plain, ( _def1 | closed_subset(subset_complement(the_carrier(skolem4), skolem5), skolem4) )).
% 0.13/0.35 cnf(matrix-28, plain, ( _def1 | ~open_subset(skolem5, skolem4) )).
% 0.13/0.35 cnf(matrix-29, plain, ( ~element(_u19, powerset(_u17)) | subset(_u19, _u17) )).
% 0.13/0.35 cnf(matrix-30, plain, ( ~subset(_u20, _u18) | element(_u20, powerset(_u18)) )).
% 0.13/0.35
% 0.13/0.35 % Proof stack:
% 0.13/0.35 cnf(proof-stack, plain,
% 0.13/0.35 proof_stack(
% 0.13/0.35 start(24),
% 0.13/0.35 left_branch(0, 25, 0, 2),
% 0.13/0.35 left_branch(0, 12, 2, 3),
% 0.13/0.35 left_branch(0, 1, 1, 4),
% 0.13/0.35 left_branch(0, 18, 1, 5),
% 0.13/0.35 left_branch(0, 23, 0, 6),
% 0.13/0.35 right_branch(6),
% 0.13/0.35 right_branch(5),
% 0.13/0.35 right_branch(4),
% 0.13/0.35 left_branch(0, 21, 2, 5),
% 0.13/0.35 left_branch(0, 22, 0, 6),
% 0.13/0.35 right_branch(6),
% 0.13/0.35 left_branch(0, 26, 1, 7),
% 0.13/0.35 reduction(0, 0),
% 0.13/0.35 right_branch(7),
% 0.13/0.35 left_branch(0, 13, 1, 8),
% 0.13/0.35 left_branch(0, 23, 0, 9),
% 0.13/0.35 right_branch(9),
% 0.13/0.35 right_branch(8),
% 0.13/0.35 right_branch(5),
% 0.13/0.35 left_branch(0, 0, 0, 6),
% 0.13/0.35 right_branch(6),
% 0.13/0.35 right_branch(3),
% 0.13/0.35 right_branch(2),
% 0.13/0.35 left_branch(0, 27, 0, 3),
% 0.13/0.35 left_branch(0, 20, 2, 4),
% 0.13/0.35 left_branch(0, 22, 0, 5),
% 0.13/0.35 right_branch(5),
% 0.13/0.35 left_branch(0, 12, 2, 6),
% 0.13/0.35 left_branch(0, 18, 1, 7),
% 0.13/0.35 left_branch(0, 23, 0, 8),
% 0.13/0.35 right_branch(8),
% 0.13/0.35 right_branch(7),
% 0.13/0.35 left_branch(0, 28, 1, 8),
% 0.13/0.35 reduction(0, 0),
% 0.13/0.35 right_branch(8),
% 0.13/0.35 left_branch(0, 0, 0, 9),
% 0.13/0.35 right_branch(9),
% 0.13/0.35 right_branch(6),
% 0.13/0.35 left_branch(0, 13, 1, 7),
% 0.13/0.35 left_branch(0, 23, 0, 8),
% 0.13/0.35 right_branch(8),
% 0.13/0.35 right_branch(7),
% 0.13/0.35 right_branch(4),
% 0.13/0.35 right_branch(3)
% 0.13/0.35 )).
% 0.13/0.35 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------