TSTP Solution File: SEU121+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SEU121+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 : n026.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:15 EST 2024
% Result : Theorem 0.12s 0.35s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n026.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Mar 3 11:18:22 EST 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % SZS status Theorem for theBenchmark
% 0.12/0.35 % SZS output start Proof for theBenchmark
% 0.12/0.35
% 0.12/0.35 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.12/0.35 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.12/0.35
% 0.12/0.35 % Formula: d3_tarski ( axiom ) converted to clauses:
% 0.12/0.35 cnf(d3_tarski-1, axiom, ( ~subset(_u8, _u6) | ~in(_u2, _u8) | in(_u2, _u6) )).
% 0.12/0.35 cnf(d3_tarski-2, axiom, ( subset(_u9, _u7) | in(skolem1(_u9, _u7), _u9) )).
% 0.12/0.35 cnf(d3_tarski-3, axiom, ( subset(_u9, _u7) | ~in(skolem1(_u9, _u7), _u7) )).
% 0.12/0.35
% 0.12/0.35 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.35
% 0.12/0.35 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.35 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.12/0.35
% 0.12/0.35 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.35 cnf(rc1_xboole_0-1, axiom, ( empty(skolem2) )).
% 0.12/0.35
% 0.12/0.35 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.12/0.35 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem3) )).
% 0.12/0.35
% 0.12/0.35 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.12/0.35 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u13, _u13) )).
% 0.12/0.35
% 0.12/0.35 % Formula: t1_xboole_1 ( conjecture ) converted to clauses:
% 0.12/0.35 cnf(t1_xboole_1-1, negated_conjecture, ( subset(skolem4, skolem5) )).
% 0.12/0.35 cnf(t1_xboole_1-2, negated_conjecture, ( subset(skolem5, skolem6) )).
% 0.12/0.35 cnf(t1_xboole_1-3, negated_conjecture, ( ~subset(skolem4, skolem6) )).
% 0.12/0.35
% 0.12/0.35 % Formula: t6_boole ( axiom ) converted to clauses:
% 0.12/0.35 cnf(t6_boole-1, axiom, ( ~empty(_u17) | ( _u17 = empty_set) )).
% 0.12/0.35
% 0.12/0.35 % Formula: t7_boole ( axiom ) converted to clauses:
% 0.12/0.35 cnf(t7_boole-1, axiom, ( ~in(_u19, _u18) | ~empty(_u18) )).
% 0.12/0.35
% 0.12/0.35 % Formula: t8_boole ( axiom ) converted to clauses:
% 0.12/0.35 cnf(t8_boole-1, axiom, ( ~empty(_u21) | ( _u21 = _u20) | ~empty(_u20) )).
% 0.12/0.35
% 0.12/0.35 % Problem matrix:
% 0.12/0.35 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.12/0.35 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.12/0.35 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.12/0.35 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.12/0.35 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.12/0.35 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.12/0.35 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.12/0.35 cnf(matrix-7, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.12/0.35 cnf(matrix-8, plain, ( ~subset(_u8, _u6) | ~in(_u2, _u8) | in(_u2, _u6) )).
% 0.12/0.35 cnf(matrix-9, plain, ( subset(_u9, _u7) | in(skolem1(_u9, _u7), _u9) )).
% 0.12/0.35 cnf(matrix-10, plain, ( subset(_u9, _u7) | ~in(skolem1(_u9, _u7), _u7) )).
% 0.12/0.35 cnf(matrix-11, plain, ( empty(empty_set) )).
% 0.12/0.35 cnf(matrix-12, plain, ( empty(skolem2) )).
% 0.12/0.35 cnf(matrix-13, plain, ( ~empty(skolem3) )).
% 0.12/0.35 cnf(matrix-14, plain, ( subset(_u13, _u13) )).
% 0.12/0.35 cnf(matrix-15, plain, ( subset(skolem4, skolem5) )).
% 0.12/0.35 cnf(matrix-16, plain, ( subset(skolem5, skolem6) )).
% 0.12/0.35 cnf(matrix-17, plain, ( ~subset(skolem4, skolem6) )).
% 0.12/0.35 cnf(matrix-18, plain, ( ~empty(_u17) | ( _u17 = empty_set) )).
% 0.12/0.35 cnf(matrix-19, plain, ( ~in(_u19, _u18) | ~empty(_u18) )).
% 0.12/0.35 cnf(matrix-20, plain, ( ~empty(_u21) | ( _u21 = _u20) | ~empty(_u20) )).
% 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(17),
% 0.12/0.35 left_branch(0, 10, 0, 2),
% 0.12/0.35 left_branch(0, 8, 2, 3),
% 0.12/0.35 left_branch(0, 16, 0, 4),
% 0.12/0.35 right_branch(4),
% 0.12/0.35 left_branch(0, 8, 2, 5),
% 0.12/0.35 left_branch(0, 15, 0, 6),
% 0.12/0.35 right_branch(6),
% 0.12/0.35 left_branch(0, 9, 1, 7),
% 0.12/0.35 reduction(0, 0),
% 0.12/0.35 right_branch(7),
% 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 )).
% 0.12/0.35 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------