TSTP Solution File: SET632+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET632+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n031.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:32:09 EDT 2024
% Result : Theorem 0.69s 0.87s
% Output : Proof 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET632+3 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n031.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 22:25:48 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.69/0.87 % SZS status Theorem for theBenchmark
% 0.69/0.87 % SZS output start Proof for theBenchmark
% 0.69/0.87
% 0.69/0.87 % Formula: subset_defn ( axiom ) converted to clauses:
% 0.69/0.87 cnf(subset_defn-1, axiom, ( ~subset(_u6, _u4) | ~member(_u0, _u6) | member(_u0, _u4) )).
% 0.69/0.87 cnf(subset_defn-2, axiom, ( subset(_u7, _u5) | member(skolem1(_u7, _u5), _u7) )).
% 0.69/0.87 cnf(subset_defn-3, axiom, ( subset(_u7, _u5) | ~member(skolem1(_u7, _u5), _u5) )).
% 0.69/0.87
% 0.69/0.87 % Formula: intersect_defn ( axiom ) converted to clauses:
% 0.69/0.87 cnf(intersect_defn-1, axiom, ( ~intersect(_u14, _u12) | member(skolem2(_u14, _u12), _u14) )).
% 0.69/0.87 cnf(intersect_defn-2, axiom, ( ~intersect(_u14, _u12) | member(skolem2(_u14, _u12), _u12) )).
% 0.69/0.87 cnf(intersect_defn-3, axiom, ( ~member(_u9, _u15) | ~member(_u9, _u13) | intersect(_u15, _u13) )).
% 0.69/0.87
% 0.69/0.87 % Formula: empty_set_defn ( axiom ) converted to clauses:
% 0.69/0.87 cnf(empty_set_defn-1, axiom, ( ~member(_u16, empty_set) )).
% 0.69/0.87
% 0.69/0.87 % Formula: disjoint_defn ( axiom ) converted to clauses:
% 0.69/0.87 cnf(disjoint_defn-1, axiom, ( ~disjoint(_u21, _u19) | ~intersect(_u21, _u19) )).
% 0.69/0.87 cnf(disjoint_defn-2, axiom, ( intersect(_u22, _u20) | disjoint(_u22, _u20) )).
% 0.69/0.87
% 0.69/0.87 % Formula: equal_defn ( axiom ) converted to clauses:
% 0.69/0.87 cnf(equal_defn-1, axiom, ( ( _u27 != _u25) | subset(_u27, _u25) )).
% 0.69/0.87 cnf(equal_defn-2, axiom, ( ( _u27 != _u25) | subset(_u25, _u27) )).
% 0.69/0.87 cnf(equal_defn-3, axiom, ( ~subset(_u28, _u26) | ~subset(_u26, _u28) | ( _u28 = _u26) )).
% 0.69/0.87
% 0.69/0.87 % Formula: symmetry_of_intersect ( axiom ) converted to clauses:
% 0.69/0.87 cnf(symmetry_of_intersect-1, axiom, ( ~intersect(_u30, _u29) | intersect(_u29, _u30) )).
% 0.69/0.87
% 0.69/0.87 % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 0.69/0.87 cnf(reflexivity_of_subset-1, axiom, ( subset(_u31, _u31) )).
% 0.69/0.87
% 0.69/0.87 % Formula: empty_defn ( axiom ) converted to clauses:
% 0.69/0.87 cnf(empty_defn-1, axiom, ( ~empty(_u35) | ~member(_u32, _u35) )).
% 0.69/0.87 cnf(empty_defn-2, axiom, ( member(skolem3(_u36), _u36) | empty(_u36) )).
% 0.69/0.87
% 0.69/0.87 % Formula: prove_th114 ( conjecture ) (definitionally) converted to clauses:
% 0.69/0.87 cnf(prove_th114-1, negated_conjecture, ( subset(skolem4, skolem5) )).
% 0.69/0.87 cnf(prove_th114-2, negated_conjecture, ( subset(skolem4, skolem6) )).
% 0.69/0.87 cnf(prove_th114-3, negated_conjecture, ( disjoint(skolem5, skolem6) )).
% 0.69/0.87 cnf(prove_th114-4, negated_conjecture, ( ( skolem4 != empty_set) )).
% 0.69/0.87
% 0.69/0.87 % Problem matrix:
% 0.69/0.87 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.69/0.87 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.69/0.87 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.69/0.87 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.69/0.87 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 0.69/0.87 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( skolem3(__eqx_0) = skolem3(__eqy_0)) )).
% 0.69/0.87 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.69/0.87 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 0.69/0.87 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~intersect(__eqx_0, __eqx_1) | intersect(__eqy_0, __eqy_1) )).
% 0.69/0.87 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 0.69/0.87 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.69/0.87 cnf(matrix-11, plain, ( ~subset(_u6, _u4) | ~member(_u0, _u6) | member(_u0, _u4) )).
% 0.69/0.87 cnf(matrix-12, plain, ( subset(_u7, _u5) | member(skolem1(_u7, _u5), _u7) )).
% 0.69/0.87 cnf(matrix-13, plain, ( subset(_u7, _u5) | ~member(skolem1(_u7, _u5), _u5) )).
% 0.69/0.87 cnf(matrix-14, plain, ( ~intersect(_u14, _u12) | member(skolem2(_u14, _u12), _u14) )).
% 0.69/0.87 cnf(matrix-15, plain, ( ~intersect(_u14, _u12) | member(skolem2(_u14, _u12), _u12) )).
% 0.69/0.87 cnf(matrix-16, plain, ( ~member(_u9, _u15) | ~member(_u9, _u13) | intersect(_u15, _u13) )).
% 0.69/0.87 cnf(matrix-17, plain, ( ~member(_u16, empty_set) )).
% 0.69/0.87 cnf(matrix-18, plain, ( ~disjoint(_u21, _u19) | ~intersect(_u21, _u19) )).
% 0.69/0.87 cnf(matrix-19, plain, ( intersect(_u22, _u20) | disjoint(_u22, _u20) )).
% 0.69/0.87 cnf(matrix-20, plain, ( ( _u27 != _u25) | subset(_u27, _u25) )).
% 0.69/0.87 cnf(matrix-21, plain, ( ( _u27 != _u25) | subset(_u25, _u27) )).
% 0.69/0.87 cnf(matrix-22, plain, ( ~subset(_u28, _u26) | ~subset(_u26, _u28) | ( _u28 = _u26) )).
% 0.69/0.87 cnf(matrix-23, plain, ( ~intersect(_u30, _u29) | intersect(_u29, _u30) )).
% 0.69/0.87 cnf(matrix-24, plain, ( subset(_u31, _u31) )).
% 0.69/0.87 cnf(matrix-25, plain, ( ~empty(_u35) | ~member(_u32, _u35) )).
% 0.69/0.87 cnf(matrix-26, plain, ( member(skolem3(_u36), _u36) | empty(_u36) )).
% 0.69/0.87 cnf(matrix-27, plain, ( subset(skolem4, skolem5) )).
% 0.69/0.87 cnf(matrix-28, plain, ( subset(skolem4, skolem6) )).
% 0.69/0.87 cnf(matrix-29, plain, ( disjoint(skolem5, skolem6) )).
% 0.69/0.87 cnf(matrix-30, plain, ( ( skolem4 != empty_set) )).
% 0.69/0.87
% 0.69/0.87 % Proof stack:
% 0.69/0.87 cnf(proof-stack, plain,
% 0.69/0.87 proof_stack(
% 0.69/0.87 start(18),
% 0.69/0.87 left_branch(0, 29, 0, 2),
% 0.69/0.87 right_branch(2),
% 0.69/0.87 left_branch(0, 16, 2, 3),
% 0.69/0.87 left_branch(0, 11, 2, 4),
% 0.69/0.87 left_branch(0, 27, 0, 5),
% 0.69/0.87 right_branch(5),
% 0.69/0.87 left_branch(0, 12, 1, 6),
% 0.69/0.87 left_branch(0, 22, 0, 7),
% 0.69/0.87 left_branch(0, 30, 0, 8),
% 0.69/0.87 right_branch(8),
% 0.69/0.87 left_branch(0, 12, 0, 9),
% 0.69/0.87 left_branch(0, 17, 0, 10),
% 0.69/0.87 right_branch(10),
% 0.69/0.87 right_branch(9),
% 0.69/0.87 right_branch(7),
% 0.69/0.87 right_branch(6),
% 0.69/0.87 right_branch(4),
% 0.69/0.87 left_branch(0, 11, 2, 5),
% 0.69/0.87 left_branch(0, 28, 0, 6),
% 0.69/0.87 right_branch(6),
% 0.69/0.87 left_branch(0, 12, 1, 7),
% 0.69/0.87 left_branch(0, 22, 1, 8),
% 0.69/0.87 left_branch(0, 12, 0, 9),
% 0.69/0.87 left_branch(0, 17, 0, 10),
% 0.69/0.87 right_branch(10),
% 0.69/0.87 right_branch(9),
% 0.69/0.87 left_branch(0, 1, 0, 10),
% 0.69/0.87 left_branch(0, 30, 0, 11),
% 0.69/0.87 right_branch(11),
% 0.69/0.87 right_branch(10),
% 0.69/0.87 right_branch(8),
% 0.69/0.87 right_branch(7),
% 0.69/0.87 right_branch(5),
% 0.69/0.87 right_branch(3)
% 0.69/0.87 )).
% 0.69/0.87 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------