TSTP Solution File: SEU139+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SEU139+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 : Wed Mar 6 09:20:19 EST 2024
% Result : Theorem 0.13s 0.34s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU139+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n002.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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:40:11 EST 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start Proof for theBenchmark
% 0.13/0.34
% 0.13/0.34 % Formula: antisymmetry_r2_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.34 cnf(antisymmetry_r2_xboole_0-1, axiom, ( ~proper_subset(_u1, _u0) | ~proper_subset(_u0, _u1) )).
% 0.13/0.34
% 0.13/0.34 % Formula: d10_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.34 cnf(d10_xboole_0-1, axiom, ( ( _u6 != _u4) | subset(_u6, _u4) )).
% 0.13/0.34 cnf(d10_xboole_0-2, axiom, ( ( _u6 != _u4) | subset(_u4, _u6) )).
% 0.13/0.34 cnf(d10_xboole_0-3, axiom, ( ~subset(_u7, _u5) | ~subset(_u5, _u7) | ( _u7 = _u5) )).
% 0.13/0.34
% 0.13/0.34 % Formula: d8_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.34 cnf(d8_xboole_0-1, axiom, ( ~proper_subset(_u12, _u10) | subset(_u12, _u10) )).
% 0.13/0.34 cnf(d8_xboole_0-2, axiom, ( ~proper_subset(_u12, _u10) | ( _u12 != _u10) )).
% 0.13/0.34 cnf(d8_xboole_0-3, axiom, ( ~subset(_u13, _u11) | ( _u13 = _u11) | proper_subset(_u13, _u11) )).
% 0.13/0.34
% 0.13/0.34 % Formula: irreflexivity_r2_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.34 cnf(irreflexivity_r2_xboole_0-1, axiom, ( ~proper_subset(_u15, _u15) )).
% 0.13/0.34
% 0.13/0.34 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.13/0.34 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u17, _u17) )).
% 0.13/0.34
% 0.13/0.34 % Formula: t60_xboole_1 ( conjecture ) converted to clauses:
% 0.13/0.34 cnf(t60_xboole_1-1, negated_conjecture, ( subset(skolem1, skolem2) )).
% 0.13/0.34 cnf(t60_xboole_1-2, negated_conjecture, ( proper_subset(skolem2, skolem1) )).
% 0.13/0.34
% 0.13/0.34 % Problem matrix:
% 0.13/0.34 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.34 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~proper_subset(__eqx_0, __eqx_1) | proper_subset(__eqy_0, __eqy_1) )).
% 0.13/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.13/0.34 cnf(matrix-5, plain, ( ~proper_subset(_u1, _u0) | ~proper_subset(_u0, _u1) )).
% 0.13/0.34 cnf(matrix-6, plain, ( ( _u6 != _u4) | subset(_u6, _u4) )).
% 0.13/0.34 cnf(matrix-7, plain, ( ( _u6 != _u4) | subset(_u4, _u6) )).
% 0.13/0.34 cnf(matrix-8, plain, ( ~subset(_u7, _u5) | ~subset(_u5, _u7) | ( _u7 = _u5) )).
% 0.13/0.34 cnf(matrix-9, plain, ( ~proper_subset(_u12, _u10) | subset(_u12, _u10) )).
% 0.13/0.34 cnf(matrix-10, plain, ( ~proper_subset(_u12, _u10) | ( _u12 != _u10) )).
% 0.13/0.34 cnf(matrix-11, plain, ( ~subset(_u13, _u11) | ( _u13 = _u11) | proper_subset(_u13, _u11) )).
% 0.13/0.34 cnf(matrix-12, plain, ( ~proper_subset(_u15, _u15) )).
% 0.13/0.34 cnf(matrix-13, plain, ( subset(_u17, _u17) )).
% 0.13/0.34 cnf(matrix-14, plain, ( subset(skolem1, skolem2) )).
% 0.13/0.34 cnf(matrix-15, plain, ( proper_subset(skolem2, skolem1) )).
% 0.13/0.34
% 0.13/0.34 % Proof stack:
% 0.13/0.34 cnf(proof-stack, plain,
% 0.13/0.34 proof_stack(
% 0.13/0.34 start(10),
% 0.13/0.34 left_branch(0, 15, 0, 2),
% 0.13/0.34 right_branch(2),
% 0.13/0.34 left_branch(0, 8, 2, 3),
% 0.13/0.34 left_branch(0, 9, 1, 4),
% 0.13/0.34 lemmata(0, 0),
% 0.13/0.34 right_branch(4),
% 0.13/0.34 left_branch(0, 14, 0, 5),
% 0.13/0.34 right_branch(5),
% 0.13/0.34 right_branch(3)
% 0.13/0.34 )).
% 0.13/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------