TSTP Solution File: SEU121+2 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU121+2 : 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 : n012.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:07 EDT 2024
% Result : Theorem 14.04s 14.23s
% Output : Proof 14.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU121+2 : 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 : n012.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 14:28:15 EDT 2024
% 0.12/0.33 % CPUTime :
% 14.04/14.23 % SZS status Theorem for theBenchmark
% 14.04/14.23 % SZS output start Proof for theBenchmark
% 14.04/14.23
% 14.04/14.23 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 14.04/14.23 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 14.04/14.23
% 14.04/14.23 % Formula: commutativity_k3_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(commutativity_k3_xboole_0-1, axiom, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 14.04/14.23
% 14.04/14.23 % Formula: d1_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(d1_xboole_0-1, axiom, ( ( _u7 != empty_set) | ~in(_u4, _u7) )).
% 14.04/14.23 cnf(d1_xboole_0-2, axiom, ( in(skolem1(_u8), _u8) | ( _u8 = empty_set) )).
% 14.04/14.23
% 14.04/14.23 % Formula: d3_tarski ( axiom ) converted to clauses:
% 14.04/14.23 cnf(d3_tarski-1, axiom, ( ~subset(_u15, _u13) | ~in(_u9, _u15) | in(_u9, _u13) )).
% 14.04/14.23 cnf(d3_tarski-2, axiom, ( subset(_u16, _u14) | in(skolem2(_u16, _u14), _u16) )).
% 14.04/14.23 cnf(d3_tarski-3, axiom, ( subset(_u16, _u14) | ~in(skolem2(_u16, _u14), _u14) )).
% 14.04/14.23
% 14.04/14.23 % Formula: d3_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(d3_xboole_0-1, axiom, ( ( _u26 != set_intersection2(_u30, _u28)) | ~in(_u22, _u26) | in(_u22, _u30) )).
% 14.04/14.23 cnf(d3_xboole_0-2, axiom, ( ( _u26 != set_intersection2(_u30, _u28)) | ~in(_u22, _u26) | in(_u22, _u28) )).
% 14.04/14.23 cnf(d3_xboole_0-3, axiom, ( ( _u26 != set_intersection2(_u30, _u28)) | ~in(_u23, _u30) | ~in(_u23, _u28) | in(_u23, _u26) )).
% 14.04/14.23 cnf(d3_xboole_0-4, axiom, ( ( _u27 = set_intersection2(_u31, _u29)) | in(skolem3(_u31, _u29, _u27), _u27) | in(skolem4(_u31, _u29, _u27), _u31) )).
% 14.04/14.23 cnf(d3_xboole_0-5, axiom, ( ( _u27 = set_intersection2(_u31, _u29)) | in(skolem3(_u31, _u29, _u27), _u27) | in(skolem4(_u31, _u29, _u27), _u29) )).
% 14.04/14.23 cnf(d3_xboole_0-6, axiom, ( ( _u27 = set_intersection2(_u31, _u29)) | in(skolem3(_u31, _u29, _u27), _u27) | ~in(skolem4(_u31, _u29, _u27), _u27) )).
% 14.04/14.23 cnf(d3_xboole_0-7, axiom, ( ( _u27 = set_intersection2(_u31, _u29)) | ~in(skolem3(_u31, _u29, _u27), _u31) | ~in(skolem3(_u31, _u29, _u27), _u29) | in(skolem4(_u31, _u29, _u27), _u31) )).
% 14.04/14.23 cnf(d3_xboole_0-8, axiom, ( ( _u27 = set_intersection2(_u31, _u29)) | ~in(skolem3(_u31, _u29, _u27), _u31) | ~in(skolem3(_u31, _u29, _u27), _u29) | in(skolem4(_u31, _u29, _u27), _u29) )).
% 14.04/14.23 cnf(d3_xboole_0-9, axiom, ( ( _u27 = set_intersection2(_u31, _u29)) | ~in(skolem3(_u31, _u29, _u27), _u31) | ~in(skolem3(_u31, _u29, _u27), _u29) | ~in(skolem4(_u31, _u29, _u27), _u27) )).
% 14.04/14.23
% 14.04/14.23 % Formula: d7_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(d7_xboole_0-1, axiom, ( ~disjoint(_u36, _u34) | ( set_intersection2(_u36, _u34) = empty_set) )).
% 14.04/14.23 cnf(d7_xboole_0-2, axiom, ( ( set_intersection2(_u37, _u35) != empty_set) | disjoint(_u37, _u35) )).
% 14.04/14.23
% 14.04/14.23 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(dt_k1_xboole_0, axiom, $true).
% 14.04/14.23
% 14.04/14.23 % Formula: dt_k3_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(dt_k3_xboole_0, axiom, $true).
% 14.04/14.23
% 14.04/14.23 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 14.04/14.23
% 14.04/14.23 % Formula: idempotence_k3_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(idempotence_k3_xboole_0-1, axiom, ( ( set_intersection2(_u39, _u39) = _u39) )).
% 14.04/14.23
% 14.04/14.23 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(rc1_xboole_0-1, axiom, ( empty(skolem5) )).
% 14.04/14.23
% 14.04/14.23 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem6) )).
% 14.04/14.23
% 14.04/14.23 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 14.04/14.23 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u43, _u43) )).
% 14.04/14.23
% 14.04/14.23 % Formula: symmetry_r1_xboole_0 ( axiom ) converted to clauses:
% 14.04/14.23 cnf(symmetry_r1_xboole_0-1, axiom, ( ~disjoint(_u45, _u44) | disjoint(_u44, _u45) )).
% 14.04/14.23
% 14.04/14.23 % Formula: t1_xboole_1 ( conjecture ) (definitionally) converted to clauses:
% 14.04/14.23 cnf(t1_xboole_1-1, negated_conjecture, ( subset(skolem7, skolem8) )).
% 14.04/14.23 cnf(t1_xboole_1-2, negated_conjecture, ( subset(skolem8, skolem9) )).
% 14.04/14.23 cnf(t1_xboole_1-3, negated_conjecture, ( ~subset(skolem7, skolem9) )).
% 14.04/14.23
% 14.04/14.23 % Formula: t3_xboole_0 ( lemma ) converted to clauses:
% 14.04/14.23 cnf(t3_xboole_0-1, lemma, ( disjoint(_u55, _u53) | in(skolem10(_u55, _u53), _u55) )).
% 14.04/14.23 cnf(t3_xboole_0-2, lemma, ( disjoint(_u55, _u53) | in(skolem10(_u55, _u53), _u53) )).
% 14.04/14.23 cnf(t3_xboole_0-3, lemma, ( ~in(_u50, _u56) | ~in(_u50, _u54) | ~disjoint(_u56, _u54) )).
% 14.04/14.23
% 14.04/14.23 % Formula: t4_xboole_0 ( lemma ) converted to clauses:
% 14.04/14.23 cnf(t4_xboole_0-1, lemma, ( disjoint(_u63, _u61) | in(skolem11(_u63, _u61), set_intersection2(_u63, _u61)) )).
% 14.04/14.23 cnf(t4_xboole_0-2, lemma, ( ~in(_u58, set_intersection2(_u64, _u62)) | ~disjoint(_u64, _u62) )).
% 14.04/14.23
% 14.04/14.23 % Formula: t6_boole ( axiom ) converted to clauses:
% 14.04/14.23 cnf(t6_boole-1, axiom, ( ~empty(_u65) | ( _u65 = empty_set) )).
% 14.04/14.23
% 14.04/14.23 % Formula: t7_boole ( axiom ) converted to clauses:
% 14.04/14.23 cnf(t7_boole-1, axiom, ( ~in(_u67, _u66) | ~empty(_u66) )).
% 14.04/14.23
% 14.04/14.23 % Formula: t8_boole ( axiom ) converted to clauses:
% 14.04/14.23 cnf(t8_boole-1, axiom, ( ~empty(_u69) | ( _u69 = _u68) | ~empty(_u68) )).
% 14.04/14.23
% 14.04/14.23 % Problem matrix:
% 14.04/14.23 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 14.04/14.23 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 14.04/14.23 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 14.04/14.23 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_intersection2(__eqx_0, __eqx_1) = set_intersection2(__eqy_0, __eqy_1)) )).
% 14.04/14.23 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 14.04/14.23 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 14.04/14.23 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)) )).
% 14.04/14.23 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( skolem4(__eqx_0, __eqx_1, __eqx_2) = skolem4(__eqy_0, __eqy_1, __eqy_2)) )).
% 14.04/14.23 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem10(__eqx_0, __eqx_1) = skolem10(__eqy_0, __eqy_1)) )).
% 14.04/14.23 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem11(__eqx_0, __eqx_1) = skolem11(__eqy_0, __eqy_1)) )).
% 14.04/14.23 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 14.04/14.23 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 14.04/14.23 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 14.04/14.23 cnf(matrix-13, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 14.04/14.23 cnf(matrix-14, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 14.04/14.23 cnf(matrix-15, plain, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 14.04/14.23 cnf(matrix-16, plain, ( ( _u7 != empty_set) | ~in(_u4, _u7) )).
% 14.04/14.23 cnf(matrix-17, plain, ( in(skolem1(_u8), _u8) | ( _u8 = empty_set) )).
% 14.04/14.23 cnf(matrix-18, plain, ( ~subset(_u15, _u13) | ~in(_u9, _u15) | in(_u9, _u13) )).
% 14.04/14.23 cnf(matrix-19, plain, ( subset(_u16, _u14) | in(skolem2(_u16, _u14), _u16) )).
% 14.04/14.23 cnf(matrix-20, plain, ( subset(_u16, _u14) | ~in(skolem2(_u16, _u14), _u14) )).
% 14.04/14.23 cnf(matrix-21, plain, ( ( _u26 != set_intersection2(_u30, _u28)) | ~in(_u22, _u26) | in(_u22, _u30) )).
% 14.04/14.23 cnf(matrix-22, plain, ( ( _u26 != set_intersection2(_u30, _u28)) | ~in(_u22, _u26) | in(_u22, _u28) )).
% 14.04/14.23 cnf(matrix-23, plain, ( ( _u26 != set_intersection2(_u30, _u28)) | ~in(_u23, _u30) | ~in(_u23, _u28) | in(_u23, _u26) )).
% 14.04/14.23 cnf(matrix-24, plain, ( ( _u27 = set_intersection2(_u31, _u29)) | in(skolem3(_u31, _u29, _u27), _u27) | in(skolem4(_u31, _u29, _u27), _u31) )).
% 14.04/14.23 cnf(matrix-25, plain, ( ( _u27 = set_intersection2(_u31, _u29)) | in(skolem3(_u31, _u29, _u27), _u27) | in(skolem4(_u31, _u29, _u27), _u29) )).
% 14.04/14.23 cnf(matrix-26, plain, ( ( _u27 = set_intersection2(_u31, _u29)) | in(skolem3(_u31, _u29, _u27), _u27) | ~in(skolem4(_u31, _u29, _u27), _u27) )).
% 14.04/14.23 cnf(matrix-27, plain, ( ( _u27 = set_intersection2(_u31, _u29)) | ~in(skolem3(_u31, _u29, _u27), _u31) | ~in(skolem3(_u31, _u29, _u27), _u29) | in(skolem4(_u31, _u29, _u27), _u31) )).
% 14.04/14.23 cnf(matrix-28, plain, ( ( _u27 = set_intersection2(_u31, _u29)) | ~in(skolem3(_u31, _u29, _u27), _u31) | ~in(skolem3(_u31, _u29, _u27), _u29) | in(skolem4(_u31, _u29, _u27), _u29) )).
% 14.04/14.23 cnf(matrix-29, plain, ( ( _u27 = set_intersection2(_u31, _u29)) | ~in(skolem3(_u31, _u29, _u27), _u31) | ~in(skolem3(_u31, _u29, _u27), _u29) | ~in(skolem4(_u31, _u29, _u27), _u27) )).
% 14.04/14.23 cnf(matrix-30, plain, ( ~disjoint(_u36, _u34) | ( set_intersection2(_u36, _u34) = empty_set) )).
% 14.04/14.23 cnf(matrix-31, plain, ( ( set_intersection2(_u37, _u35) != empty_set) | disjoint(_u37, _u35) )).
% 14.04/14.23 cnf(matrix-32, plain, ( empty(empty_set) )).
% 14.04/14.23 cnf(matrix-33, plain, ( ( set_intersection2(_u39, _u39) = _u39) )).
% 14.04/14.23 cnf(matrix-34, plain, ( empty(skolem5) )).
% 14.04/14.23 cnf(matrix-35, plain, ( ~empty(skolem6) )).
% 14.04/14.23 cnf(matrix-36, plain, ( subset(_u43, _u43) )).
% 14.04/14.23 cnf(matrix-37, plain, ( ~disjoint(_u45, _u44) | disjoint(_u44, _u45) )).
% 14.04/14.23 cnf(matrix-38, plain, ( subset(skolem7, skolem8) )).
% 14.04/14.23 cnf(matrix-39, plain, ( subset(skolem8, skolem9) )).
% 14.04/14.23 cnf(matrix-40, plain, ( ~subset(skolem7, skolem9) )).
% 14.04/14.23 cnf(matrix-41, plain, ( disjoint(_u55, _u53) | in(skolem10(_u55, _u53), _u55) )).
% 14.04/14.23 cnf(matrix-42, plain, ( disjoint(_u55, _u53) | in(skolem10(_u55, _u53), _u53) )).
% 14.04/14.23 cnf(matrix-43, plain, ( ~in(_u50, _u56) | ~in(_u50, _u54) | ~disjoint(_u56, _u54) )).
% 14.04/14.23 cnf(matrix-44, plain, ( disjoint(_u63, _u61) | in(skolem11(_u63, _u61), set_intersection2(_u63, _u61)) )).
% 14.04/14.23 cnf(matrix-45, plain, ( ~in(_u58, set_intersection2(_u64, _u62)) | ~disjoint(_u64, _u62) )).
% 14.04/14.23 cnf(matrix-46, plain, ( ~empty(_u65) | ( _u65 = empty_set) )).
% 14.04/14.23 cnf(matrix-47, plain, ( ~in(_u67, _u66) | ~empty(_u66) )).
% 14.04/14.23 cnf(matrix-48, plain, ( ~empty(_u69) | ( _u69 = _u68) | ~empty(_u68) )).
% 14.04/14.23
% 14.04/14.23 % Proof stack:
% 14.04/14.23 cnf(proof-stack, plain,
% 14.04/14.23 proof_stack(
% 14.04/14.23 start(40),
% 14.04/14.23 left_branch(0, 20, 0, 2),
% 14.04/14.23 left_branch(0, 18, 2, 3),
% 14.04/14.23 left_branch(0, 39, 0, 4),
% 14.04/14.23 right_branch(4),
% 14.04/14.23 left_branch(0, 18, 2, 5),
% 14.04/14.23 left_branch(0, 38, 0, 6),
% 14.04/14.23 right_branch(6),
% 14.04/14.23 left_branch(0, 19, 1, 7),
% 14.04/14.23 reduction(0, 0),
% 14.04/14.23 right_branch(7),
% 14.04/14.23 right_branch(5),
% 14.04/14.23 right_branch(3),
% 14.04/14.23 right_branch(2)
% 14.04/14.23 )).
% 14.04/14.23 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------