TSTP Solution File: SEU123+2 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SEU123+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 : n005.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:16 EST 2024
% Result : Theorem 0.13s 0.41s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU123+2 : 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.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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:57:33 EST 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.41 % SZS status Theorem for theBenchmark
% 0.13/0.41 % SZS output start Proof for theBenchmark
% 0.13/0.41
% 0.13/0.41 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.13/0.41 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.13/0.41
% 0.13/0.41 % Formula: commutativity_k3_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(commutativity_k3_xboole_0-1, axiom, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 0.13/0.41
% 0.13/0.41 % Formula: d10_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(d10_xboole_0-1, axiom, ( ( _u8 != _u6) | subset(_u8, _u6) )).
% 0.13/0.41 cnf(d10_xboole_0-2, axiom, ( ( _u8 != _u6) | subset(_u6, _u8) )).
% 0.13/0.41 cnf(d10_xboole_0-3, axiom, ( ~subset(_u9, _u7) | ~subset(_u7, _u9) | ( _u9 = _u7) )).
% 0.13/0.41
% 0.13/0.41 % Formula: d1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(d1_xboole_0-1, axiom, ( ( _u13 != empty_set) | ~in(_u10, _u13) )).
% 0.13/0.41 cnf(d1_xboole_0-2, axiom, ( in(skolem1(_u14), _u14) | ( _u14 = empty_set) )).
% 0.13/0.41
% 0.13/0.41 % Formula: d3_tarski ( axiom ) converted to clauses:
% 0.13/0.41 cnf(d3_tarski-1, axiom, ( ~subset(_u21, _u19) | ~in(_u15, _u21) | in(_u15, _u19) )).
% 0.13/0.41 cnf(d3_tarski-2, axiom, ( subset(_u22, _u20) | in(skolem2(_u22, _u20), _u22) )).
% 0.13/0.41 cnf(d3_tarski-3, axiom, ( subset(_u22, _u20) | ~in(skolem2(_u22, _u20), _u20) )).
% 0.13/0.41
% 0.13/0.41 % Formula: d3_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(d3_xboole_0-1, axiom, ( ( _u32 != set_intersection2(_u36, _u34)) | ~in(_u28, _u32) | in(_u28, _u36) )).
% 0.13/0.41 cnf(d3_xboole_0-2, axiom, ( ( _u32 != set_intersection2(_u36, _u34)) | ~in(_u28, _u32) | in(_u28, _u34) )).
% 0.13/0.41 cnf(d3_xboole_0-3, axiom, ( ( _u32 != set_intersection2(_u36, _u34)) | ~in(_u29, _u36) | ~in(_u29, _u34) | in(_u29, _u32) )).
% 0.13/0.41 cnf(d3_xboole_0-4, axiom, ( ( _u33 = set_intersection2(_u37, _u35)) | in(skolem3(_u37, _u35, _u33), _u33) | in(skolem4(_u37, _u35, _u33), _u37) )).
% 0.13/0.41 cnf(d3_xboole_0-5, axiom, ( ( _u33 = set_intersection2(_u37, _u35)) | in(skolem3(_u37, _u35, _u33), _u33) | in(skolem4(_u37, _u35, _u33), _u35) )).
% 0.13/0.41 cnf(d3_xboole_0-6, axiom, ( ( _u33 = set_intersection2(_u37, _u35)) | in(skolem3(_u37, _u35, _u33), _u33) | ~in(skolem4(_u37, _u35, _u33), _u33) )).
% 0.13/0.41 cnf(d3_xboole_0-7, axiom, ( ( _u33 = set_intersection2(_u37, _u35)) | ~in(skolem3(_u37, _u35, _u33), _u37) | ~in(skolem3(_u37, _u35, _u33), _u35) | in(skolem4(_u37, _u35, _u33), _u37) )).
% 0.13/0.41 cnf(d3_xboole_0-8, axiom, ( ( _u33 = set_intersection2(_u37, _u35)) | ~in(skolem3(_u37, _u35, _u33), _u37) | ~in(skolem3(_u37, _u35, _u33), _u35) | in(skolem4(_u37, _u35, _u33), _u35) )).
% 0.13/0.41 cnf(d3_xboole_0-9, axiom, ( ( _u33 = set_intersection2(_u37, _u35)) | ~in(skolem3(_u37, _u35, _u33), _u37) | ~in(skolem3(_u37, _u35, _u33), _u35) | ~in(skolem4(_u37, _u35, _u33), _u33) )).
% 0.13/0.41
% 0.13/0.41 % Formula: d7_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(d7_xboole_0-1, axiom, ( ~disjoint(_u42, _u40) | ( set_intersection2(_u42, _u40) = empty_set) )).
% 0.13/0.41 cnf(d7_xboole_0-2, axiom, ( ( set_intersection2(_u43, _u41) != empty_set) | disjoint(_u43, _u41) )).
% 0.13/0.41
% 0.13/0.41 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41
% 0.13/0.41 % Formula: dt_k3_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41
% 0.13/0.41 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.13/0.41
% 0.13/0.41 % Formula: idempotence_k3_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(idempotence_k3_xboole_0-1, axiom, ( ( set_intersection2(_u45, _u45) = _u45) )).
% 0.13/0.41
% 0.13/0.41 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(rc1_xboole_0-1, axiom, ( empty(skolem5) )).
% 0.13/0.41
% 0.13/0.41 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem6) )).
% 0.13/0.41
% 0.13/0.41 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.13/0.41 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u49, _u49) )).
% 0.13/0.41
% 0.13/0.41 % Formula: symmetry_r1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.41 cnf(symmetry_r1_xboole_0-1, axiom, ( ~disjoint(_u51, _u50) | disjoint(_u50, _u51) )).
% 0.13/0.41
% 0.13/0.41 % Formula: t1_xboole_1 ( lemma ) converted to clauses:
% 0.13/0.41 cnf(t1_xboole_1-1, lemma, ( ~subset(_u54, _u53) | ~subset(_u53, _u52) | subset(_u54, _u52) )).
% 0.13/0.41
% 0.13/0.41 % Formula: t2_xboole_1 ( lemma ) converted to clauses:
% 0.13/0.41 cnf(t2_xboole_1-1, lemma, ( subset(empty_set, _u55) )).
% 0.13/0.41
% 0.13/0.41 % Formula: t3_xboole_0 ( lemma ) converted to clauses:
% 0.13/0.41 cnf(t3_xboole_0-1, lemma, ( disjoint(_u62, _u60) | in(skolem7(_u62, _u60), _u62) )).
% 0.13/0.41 cnf(t3_xboole_0-2, lemma, ( disjoint(_u62, _u60) | in(skolem7(_u62, _u60), _u60) )).
% 0.13/0.41 cnf(t3_xboole_0-3, lemma, ( ~in(_u57, _u63) | ~in(_u57, _u61) | ~disjoint(_u63, _u61) )).
% 0.13/0.41
% 0.13/0.41 % Formula: t3_xboole_1 ( conjecture ) converted to clauses:
% 0.13/0.41 cnf(t3_xboole_1-1, negated_conjecture, ( subset(skolem8, empty_set) )).
% 0.13/0.41 cnf(t3_xboole_1-2, negated_conjecture, ( ( skolem8 != empty_set) )).
% 0.13/0.41
% 0.13/0.41 % Formula: t4_xboole_0 ( lemma ) converted to clauses:
% 0.13/0.41 cnf(t4_xboole_0-1, lemma, ( disjoint(_u71, _u69) | in(skolem9(_u71, _u69), set_intersection2(_u71, _u69)) )).
% 0.13/0.41 cnf(t4_xboole_0-2, lemma, ( ~in(_u66, set_intersection2(_u72, _u70)) | ~disjoint(_u72, _u70) )).
% 0.13/0.41
% 0.13/0.41 % Formula: t6_boole ( axiom ) converted to clauses:
% 0.13/0.41 cnf(t6_boole-1, axiom, ( ~empty(_u73) | ( _u73 = empty_set) )).
% 0.13/0.41
% 0.13/0.41 % Formula: t7_boole ( axiom ) converted to clauses:
% 0.13/0.41 cnf(t7_boole-1, axiom, ( ~in(_u75, _u74) | ~empty(_u74) )).
% 0.13/0.41
% 0.13/0.41 % Formula: t8_boole ( axiom ) converted to clauses:
% 0.13/0.41 cnf(t8_boole-1, axiom, ( ~empty(_u77) | ( _u77 = _u76) | ~empty(_u76) )).
% 0.13/0.41
% 0.13/0.41 % Problem matrix:
% 0.13/0.41 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.41 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.41 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.41 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.13/0.41 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 0.13/0.41 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 0.13/0.41 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.13/0.41 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)) )).
% 0.13/0.41 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem7(__eqx_0, __eqx_1) = skolem7(__eqy_0, __eqy_1)) )).
% 0.13/0.41 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem9(__eqx_0, __eqx_1) = skolem9(__eqy_0, __eqy_1)) )).
% 0.13/0.41 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.13/0.41 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.13/0.41 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 0.13/0.41 cnf(matrix-13, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.13/0.41 cnf(matrix-14, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.13/0.41 cnf(matrix-15, plain, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 0.13/0.41 cnf(matrix-16, plain, ( ( _u8 != _u6) | subset(_u8, _u6) )).
% 0.13/0.41 cnf(matrix-17, plain, ( ( _u8 != _u6) | subset(_u6, _u8) )).
% 0.13/0.41 cnf(matrix-18, plain, ( ~subset(_u9, _u7) | ~subset(_u7, _u9) | ( _u9 = _u7) )).
% 0.13/0.41 cnf(matrix-19, plain, ( ( _u13 != empty_set) | ~in(_u10, _u13) )).
% 0.13/0.41 cnf(matrix-20, plain, ( in(skolem1(_u14), _u14) | ( _u14 = empty_set) )).
% 0.13/0.41 cnf(matrix-21, plain, ( ~subset(_u21, _u19) | ~in(_u15, _u21) | in(_u15, _u19) )).
% 0.13/0.41 cnf(matrix-22, plain, ( subset(_u22, _u20) | in(skolem2(_u22, _u20), _u22) )).
% 0.13/0.41 cnf(matrix-23, plain, ( subset(_u22, _u20) | ~in(skolem2(_u22, _u20), _u20) )).
% 0.13/0.41 cnf(matrix-24, plain, ( ( _u32 != set_intersection2(_u36, _u34)) | ~in(_u28, _u32) | in(_u28, _u36) )).
% 0.13/0.41 cnf(matrix-25, plain, ( ( _u32 != set_intersection2(_u36, _u34)) | ~in(_u28, _u32) | in(_u28, _u34) )).
% 0.13/0.41 cnf(matrix-26, plain, ( ( _u32 != set_intersection2(_u36, _u34)) | ~in(_u29, _u36) | ~in(_u29, _u34) | in(_u29, _u32) )).
% 0.13/0.41 cnf(matrix-27, plain, ( ( _u33 = set_intersection2(_u37, _u35)) | in(skolem3(_u37, _u35, _u33), _u33) | in(skolem4(_u37, _u35, _u33), _u37) )).
% 0.13/0.41 cnf(matrix-28, plain, ( ( _u33 = set_intersection2(_u37, _u35)) | in(skolem3(_u37, _u35, _u33), _u33) | in(skolem4(_u37, _u35, _u33), _u35) )).
% 0.13/0.41 cnf(matrix-29, plain, ( ( _u33 = set_intersection2(_u37, _u35)) | in(skolem3(_u37, _u35, _u33), _u33) | ~in(skolem4(_u37, _u35, _u33), _u33) )).
% 0.13/0.41 cnf(matrix-30, plain, ( ( _u33 = set_intersection2(_u37, _u35)) | ~in(skolem3(_u37, _u35, _u33), _u37) | ~in(skolem3(_u37, _u35, _u33), _u35) | in(skolem4(_u37, _u35, _u33), _u37) )).
% 0.13/0.41 cnf(matrix-31, plain, ( ( _u33 = set_intersection2(_u37, _u35)) | ~in(skolem3(_u37, _u35, _u33), _u37) | ~in(skolem3(_u37, _u35, _u33), _u35) | in(skolem4(_u37, _u35, _u33), _u35) )).
% 0.13/0.41 cnf(matrix-32, plain, ( ( _u33 = set_intersection2(_u37, _u35)) | ~in(skolem3(_u37, _u35, _u33), _u37) | ~in(skolem3(_u37, _u35, _u33), _u35) | ~in(skolem4(_u37, _u35, _u33), _u33) )).
% 0.13/0.41 cnf(matrix-33, plain, ( ~disjoint(_u42, _u40) | ( set_intersection2(_u42, _u40) = empty_set) )).
% 0.13/0.41 cnf(matrix-34, plain, ( ( set_intersection2(_u43, _u41) != empty_set) | disjoint(_u43, _u41) )).
% 0.13/0.41 cnf(matrix-35, plain, ( empty(empty_set) )).
% 0.13/0.41 cnf(matrix-36, plain, ( ( set_intersection2(_u45, _u45) = _u45) )).
% 0.13/0.41 cnf(matrix-37, plain, ( empty(skolem5) )).
% 0.13/0.41 cnf(matrix-38, plain, ( ~empty(skolem6) )).
% 0.13/0.41 cnf(matrix-39, plain, ( subset(_u49, _u49) )).
% 0.13/0.41 cnf(matrix-40, plain, ( ~disjoint(_u51, _u50) | disjoint(_u50, _u51) )).
% 0.13/0.41 cnf(matrix-41, plain, ( ~subset(_u54, _u53) | ~subset(_u53, _u52) | subset(_u54, _u52) )).
% 0.13/0.41 cnf(matrix-42, plain, ( subset(empty_set, _u55) )).
% 0.13/0.41 cnf(matrix-43, plain, ( disjoint(_u62, _u60) | in(skolem7(_u62, _u60), _u62) )).
% 0.13/0.41 cnf(matrix-44, plain, ( disjoint(_u62, _u60) | in(skolem7(_u62, _u60), _u60) )).
% 0.13/0.41 cnf(matrix-45, plain, ( ~in(_u57, _u63) | ~in(_u57, _u61) | ~disjoint(_u63, _u61) )).
% 0.13/0.41 cnf(matrix-46, plain, ( subset(skolem8, empty_set) )).
% 0.13/0.41 cnf(matrix-47, plain, ( ( skolem8 != empty_set) )).
% 0.13/0.41 cnf(matrix-48, plain, ( disjoint(_u71, _u69) | in(skolem9(_u71, _u69), set_intersection2(_u71, _u69)) )).
% 0.13/0.41 cnf(matrix-49, plain, ( ~in(_u66, set_intersection2(_u72, _u70)) | ~disjoint(_u72, _u70) )).
% 0.13/0.41 cnf(matrix-50, plain, ( ~empty(_u73) | ( _u73 = empty_set) )).
% 0.13/0.41 cnf(matrix-51, plain, ( ~in(_u75, _u74) | ~empty(_u74) )).
% 0.13/0.41 cnf(matrix-52, plain, ( ~empty(_u77) | ( _u77 = _u76) | ~empty(_u76) )).
% 0.13/0.41
% 0.13/0.41 % Proof stack:
% 0.13/0.41 cnf(proof-stack, plain,
% 0.13/0.41 proof_stack(
% 0.13/0.41 start(47),
% 0.13/0.41 left_branch(0, 18, 2, 2),
% 0.13/0.41 left_branch(0, 46, 0, 3),
% 0.13/0.41 right_branch(3),
% 0.13/0.41 left_branch(0, 42, 0, 4),
% 0.13/0.41 right_branch(4),
% 0.13/0.41 right_branch(2)
% 0.13/0.41 )).
% 0.13/0.41 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------