TSTP Solution File: SEU152+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU152+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 : n021.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:19 EDT 2024
% Result : Theorem 0.14s 0.36s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU152+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.14 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Mar 20 14:57:48 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % SZS status Theorem for theBenchmark
% 0.14/0.36 % SZS output start Proof for theBenchmark
% 0.14/0.36
% 0.14/0.36 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.14/0.36 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.14/0.36
% 0.14/0.36 % Formula: commutativity_k2_xboole_0 ( axiom ) converted to clauses:
% 0.14/0.36 cnf(commutativity_k2_xboole_0-1, axiom, ( ( set_union2(_u3, _u2) = set_union2(_u2, _u3)) )).
% 0.14/0.36
% 0.14/0.36 % Formula: dt_k1_tarski ( axiom ) converted to clauses:
% 0.14/0.36 cnf(dt_k1_tarski, axiom, $true).
% 0.14/0.36
% 0.14/0.36 % Formula: dt_k2_xboole_0 ( axiom ) converted to clauses:
% 0.14/0.36 cnf(dt_k2_xboole_0, axiom, $true).
% 0.14/0.36
% 0.14/0.36 % Formula: idempotence_k2_xboole_0 ( axiom ) converted to clauses:
% 0.14/0.36 cnf(idempotence_k2_xboole_0-1, axiom, ( ( set_union2(_u5, _u5) = _u5) )).
% 0.14/0.36
% 0.14/0.36 % Formula: l23_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 0.14/0.36 cnf(l23_zfmisc_1-1, negated_conjecture, ( in(skolem1, skolem2) )).
% 0.14/0.36 cnf(l23_zfmisc_1-2, negated_conjecture, ( ( set_union2(singleton(skolem1), skolem2) != skolem2) )).
% 0.14/0.36
% 0.14/0.36 % Formula: l2_zfmisc_1 ( axiom ) converted to clauses:
% 0.14/0.36 cnf(l2_zfmisc_1-1, axiom, ( ~subset(singleton(_u12), _u10) | in(_u12, _u10) )).
% 0.14/0.36 cnf(l2_zfmisc_1-2, axiom, ( ~in(_u13, _u11) | subset(singleton(_u13), _u11) )).
% 0.14/0.36
% 0.14/0.36 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.14/0.36 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u15, _u15) )).
% 0.14/0.36
% 0.14/0.36 % Formula: t12_xboole_1 ( axiom ) converted to clauses:
% 0.14/0.36 cnf(t12_xboole_1-1, axiom, ( ~subset(_u17, _u16) | ( set_union2(_u17, _u16) = _u16) )).
% 0.14/0.36
% 0.14/0.36 % Problem matrix:
% 0.14/0.36 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.14/0.36 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.14/0.36 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.14/0.36 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_union2(__eqx_0, __eqx_1) = set_union2(__eqy_0, __eqy_1)) )).
% 0.14/0.36 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( singleton(__eqx_0) = singleton(__eqy_0)) )).
% 0.14/0.36 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.14/0.36 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.14/0.36 cnf(matrix-7, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.14/0.36 cnf(matrix-8, plain, ( ( set_union2(_u3, _u2) = set_union2(_u2, _u3)) )).
% 0.14/0.36 cnf(matrix-9, plain, ( ( set_union2(_u5, _u5) = _u5) )).
% 0.14/0.36 cnf(matrix-10, plain, ( in(skolem1, skolem2) )).
% 0.14/0.36 cnf(matrix-11, plain, ( ( set_union2(singleton(skolem1), skolem2) != skolem2) )).
% 0.14/0.36 cnf(matrix-12, plain, ( ~subset(singleton(_u12), _u10) | in(_u12, _u10) )).
% 0.14/0.36 cnf(matrix-13, plain, ( ~in(_u13, _u11) | subset(singleton(_u13), _u11) )).
% 0.14/0.36 cnf(matrix-14, plain, ( subset(_u15, _u15) )).
% 0.14/0.36 cnf(matrix-15, plain, ( ~subset(_u17, _u16) | ( set_union2(_u17, _u16) = _u16) )).
% 0.14/0.36
% 0.14/0.36 % Proof stack:
% 0.14/0.36 cnf(proof-stack, plain,
% 0.14/0.36 proof_stack(
% 0.14/0.36 start(11),
% 0.14/0.36 left_branch(0, 15, 1, 2),
% 0.14/0.36 left_branch(0, 13, 1, 3),
% 0.14/0.36 left_branch(0, 10, 0, 4),
% 0.14/0.36 right_branch(4),
% 0.14/0.36 right_branch(3),
% 0.14/0.36 right_branch(2)
% 0.14/0.36 )).
% 0.14/0.36 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------