TSTP Solution File: SEU127+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU127+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 : n016.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:14 EDT 2024
% Result : Theorem 0.19s 0.57s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU127+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n016.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 : Wed Mar 20 15:05:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.57 % SZS status Theorem for theBenchmark
% 0.19/0.57 % SZS output start Proof for theBenchmark
% 0.19/0.57
% 0.19/0.57 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.19/0.57 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.19/0.57
% 0.19/0.57 % Formula: commutativity_k3_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.57 cnf(commutativity_k3_xboole_0-1, axiom, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 0.19/0.57
% 0.19/0.57 % Formula: d3_tarski ( axiom ) converted to clauses:
% 0.19/0.57 cnf(d3_tarski-1, axiom, ( ~subset(_u10, _u8) | ~in(_u4, _u10) | in(_u4, _u8) )).
% 0.19/0.57 cnf(d3_tarski-2, axiom, ( subset(_u11, _u9) | in(skolem1(_u11, _u9), _u11) )).
% 0.19/0.57 cnf(d3_tarski-3, axiom, ( subset(_u11, _u9) | ~in(skolem1(_u11, _u9), _u9) )).
% 0.19/0.57
% 0.19/0.57 % Formula: d3_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.57 cnf(d3_xboole_0-1, axiom, ( ( _u21 != set_intersection2(_u25, _u23)) | ~in(_u17, _u21) | in(_u17, _u25) )).
% 0.19/0.57 cnf(d3_xboole_0-2, axiom, ( ( _u21 != set_intersection2(_u25, _u23)) | ~in(_u17, _u21) | in(_u17, _u23) )).
% 0.19/0.57 cnf(d3_xboole_0-3, axiom, ( ( _u21 != set_intersection2(_u25, _u23)) | ~in(_u18, _u25) | ~in(_u18, _u23) | in(_u18, _u21) )).
% 0.19/0.57 cnf(d3_xboole_0-4, axiom, ( ( _u22 = set_intersection2(_u26, _u24)) | in(skolem2(_u26, _u24, _u22), _u22) | in(skolem3(_u26, _u24, _u22), _u26) )).
% 0.19/0.57 cnf(d3_xboole_0-5, axiom, ( ( _u22 = set_intersection2(_u26, _u24)) | in(skolem2(_u26, _u24, _u22), _u22) | in(skolem3(_u26, _u24, _u22), _u24) )).
% 0.19/0.57 cnf(d3_xboole_0-6, axiom, ( ( _u22 = set_intersection2(_u26, _u24)) | in(skolem2(_u26, _u24, _u22), _u22) | ~in(skolem3(_u26, _u24, _u22), _u22) )).
% 0.19/0.57 cnf(d3_xboole_0-7, axiom, ( ( _u22 = set_intersection2(_u26, _u24)) | ~in(skolem2(_u26, _u24, _u22), _u26) | ~in(skolem2(_u26, _u24, _u22), _u24) | in(skolem3(_u26, _u24, _u22), _u26) )).
% 0.19/0.57 cnf(d3_xboole_0-8, axiom, ( ( _u22 = set_intersection2(_u26, _u24)) | ~in(skolem2(_u26, _u24, _u22), _u26) | ~in(skolem2(_u26, _u24, _u22), _u24) | in(skolem3(_u26, _u24, _u22), _u24) )).
% 0.19/0.57 cnf(d3_xboole_0-9, axiom, ( ( _u22 = set_intersection2(_u26, _u24)) | ~in(skolem2(_u26, _u24, _u22), _u26) | ~in(skolem2(_u26, _u24, _u22), _u24) | ~in(skolem3(_u26, _u24, _u22), _u22) )).
% 0.19/0.57
% 0.19/0.57 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.57 cnf(dt_k1_xboole_0, axiom, $true).
% 0.19/0.57
% 0.19/0.57 % Formula: dt_k3_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.57 cnf(dt_k3_xboole_0, axiom, $true).
% 0.19/0.57
% 0.19/0.57 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.57 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.19/0.57
% 0.19/0.57 % Formula: idempotence_k3_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.57 cnf(idempotence_k3_xboole_0-1, axiom, ( ( set_intersection2(_u28, _u28) = _u28) )).
% 0.19/0.57
% 0.19/0.57 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.57 cnf(rc1_xboole_0-1, axiom, ( empty(skolem4) )).
% 0.19/0.57
% 0.19/0.57 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.19/0.57 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem5) )).
% 0.19/0.57
% 0.19/0.57 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.19/0.57 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u32, _u32) )).
% 0.19/0.57
% 0.19/0.57 % Formula: t17_xboole_1 ( conjecture ) (definitionally) converted to clauses:
% 0.19/0.57 cnf(t17_xboole_1-1, negated_conjecture, ( ~subset(set_intersection2(skolem6, skolem7), skolem6) )).
% 0.19/0.57
% 0.19/0.57 % Formula: t2_boole ( axiom ) converted to clauses:
% 0.19/0.57 cnf(t2_boole-1, axiom, ( ( set_intersection2(_u35, empty_set) = empty_set) )).
% 0.19/0.57
% 0.19/0.57 % Formula: t6_boole ( axiom ) converted to clauses:
% 0.19/0.57 cnf(t6_boole-1, axiom, ( ~empty(_u36) | ( _u36 = empty_set) )).
% 0.19/0.57
% 0.19/0.57 % Formula: t7_boole ( axiom ) converted to clauses:
% 0.19/0.57 cnf(t7_boole-1, axiom, ( ~in(_u38, _u37) | ~empty(_u37) )).
% 0.19/0.57
% 0.19/0.57 % Formula: t8_boole ( axiom ) converted to clauses:
% 0.19/0.57 cnf(t8_boole-1, axiom, ( ~empty(_u40) | ( _u40 = _u39) | ~empty(_u39) )).
% 0.19/0.57
% 0.19/0.57 % Problem matrix:
% 0.19/0.57 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.19/0.57 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.19/0.57 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.19/0.57 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_intersection2(__eqx_0, __eqx_1) = set_intersection2(__eqy_0, __eqy_1)) )).
% 0.19/0.57 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.19/0.57 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem2(__eqx_0, __eqx_1, __eqx_2) = skolem2(__eqy_0, __eqy_1, __eqy_2)) )).
% 0.19/0.57 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem3(__eqx_0, __eqx_1, __eqx_2) = skolem3(__eqy_0, __eqy_1, __eqy_2)) )).
% 0.19/0.57 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.19/0.57 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.19/0.57 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.19/0.57 cnf(matrix-10, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.19/0.57 cnf(matrix-11, plain, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 0.19/0.57 cnf(matrix-12, plain, ( ~subset(_u10, _u8) | ~in(_u4, _u10) | in(_u4, _u8) )).
% 0.19/0.57 cnf(matrix-13, plain, ( subset(_u11, _u9) | in(skolem1(_u11, _u9), _u11) )).
% 0.19/0.57 cnf(matrix-14, plain, ( subset(_u11, _u9) | ~in(skolem1(_u11, _u9), _u9) )).
% 0.19/0.57 cnf(matrix-15, plain, ( ( _u21 != set_intersection2(_u25, _u23)) | ~in(_u17, _u21) | in(_u17, _u25) )).
% 0.19/0.57 cnf(matrix-16, plain, ( ( _u21 != set_intersection2(_u25, _u23)) | ~in(_u17, _u21) | in(_u17, _u23) )).
% 0.19/0.57 cnf(matrix-17, plain, ( ( _u21 != set_intersection2(_u25, _u23)) | ~in(_u18, _u25) | ~in(_u18, _u23) | in(_u18, _u21) )).
% 0.19/0.57 cnf(matrix-18, plain, ( ( _u22 = set_intersection2(_u26, _u24)) | in(skolem2(_u26, _u24, _u22), _u22) | in(skolem3(_u26, _u24, _u22), _u26) )).
% 0.19/0.57 cnf(matrix-19, plain, ( ( _u22 = set_intersection2(_u26, _u24)) | in(skolem2(_u26, _u24, _u22), _u22) | in(skolem3(_u26, _u24, _u22), _u24) )).
% 0.19/0.57 cnf(matrix-20, plain, ( ( _u22 = set_intersection2(_u26, _u24)) | in(skolem2(_u26, _u24, _u22), _u22) | ~in(skolem3(_u26, _u24, _u22), _u22) )).
% 0.19/0.57 cnf(matrix-21, plain, ( ( _u22 = set_intersection2(_u26, _u24)) | ~in(skolem2(_u26, _u24, _u22), _u26) | ~in(skolem2(_u26, _u24, _u22), _u24) | in(skolem3(_u26, _u24, _u22), _u26) )).
% 0.19/0.57 cnf(matrix-22, plain, ( ( _u22 = set_intersection2(_u26, _u24)) | ~in(skolem2(_u26, _u24, _u22), _u26) | ~in(skolem2(_u26, _u24, _u22), _u24) | in(skolem3(_u26, _u24, _u22), _u24) )).
% 0.19/0.57 cnf(matrix-23, plain, ( ( _u22 = set_intersection2(_u26, _u24)) | ~in(skolem2(_u26, _u24, _u22), _u26) | ~in(skolem2(_u26, _u24, _u22), _u24) | ~in(skolem3(_u26, _u24, _u22), _u22) )).
% 0.19/0.57 cnf(matrix-24, plain, ( empty(empty_set) )).
% 0.19/0.57 cnf(matrix-25, plain, ( ( set_intersection2(_u28, _u28) = _u28) )).
% 0.19/0.57 cnf(matrix-26, plain, ( empty(skolem4) )).
% 0.19/0.57 cnf(matrix-27, plain, ( ~empty(skolem5) )).
% 0.19/0.57 cnf(matrix-28, plain, ( subset(_u32, _u32) )).
% 0.19/0.57 cnf(matrix-29, plain, ( ~subset(set_intersection2(skolem6, skolem7), skolem6) )).
% 0.19/0.57 cnf(matrix-30, plain, ( ( set_intersection2(_u35, empty_set) = empty_set) )).
% 0.19/0.57 cnf(matrix-31, plain, ( ~empty(_u36) | ( _u36 = empty_set) )).
% 0.19/0.57 cnf(matrix-32, plain, ( ~in(_u38, _u37) | ~empty(_u37) )).
% 0.19/0.57 cnf(matrix-33, plain, ( ~empty(_u40) | ( _u40 = _u39) | ~empty(_u39) )).
% 0.19/0.57
% 0.19/0.57 % Proof stack:
% 0.19/0.57 cnf(proof-stack, plain,
% 0.19/0.57 proof_stack(
% 0.19/0.57 start(29),
% 0.19/0.57 left_branch(0, 13, 0, 2),
% 0.19/0.57 left_branch(0, 16, 1, 3),
% 0.19/0.57 left_branch(0, 11, 0, 4),
% 0.19/0.57 right_branch(4),
% 0.19/0.57 left_branch(0, 14, 1, 5),
% 0.19/0.57 reduction(0, 0),
% 0.19/0.57 right_branch(5),
% 0.19/0.57 right_branch(3),
% 0.19/0.57 right_branch(2)
% 0.19/0.57 )).
% 0.19/0.57 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------