TSTP Solution File: SET592+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET592+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 : n007.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:31:57 EDT 2024
% Result : Theorem 1.38s 1.55s
% Output : Proof 1.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET592+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Mar 20 21:36:44 EDT 2024
% 0.14/0.34 % CPUTime :
% 1.38/1.55 % SZS status Theorem for theBenchmark
% 1.38/1.55 % SZS output start Proof for theBenchmark
% 1.38/1.55
% 1.38/1.55 % Formula: subset_of_empty_set_is_empty_set ( axiom ) converted to clauses:
% 1.38/1.55 cnf(subset_of_empty_set_is_empty_set-1, axiom, ( ~subset(_u0, empty_set) | ( _u0 = empty_set) )).
% 1.38/1.55
% 1.38/1.55 % Formula: intersection_of_subsets ( axiom ) converted to clauses:
% 1.38/1.55 cnf(intersection_of_subsets-1, axiom, ( ~subset(_u3, _u2) | ~subset(_u3, _u1) | subset(_u3, intersection(_u2, _u1)) )).
% 1.38/1.55
% 1.38/1.55 % Formula: empty_set_defn ( axiom ) converted to clauses:
% 1.38/1.55 cnf(empty_set_defn-1, axiom, ( ~member(_u4, empty_set) )).
% 1.38/1.55
% 1.38/1.55 % Formula: intersection_defn ( axiom ) converted to clauses:
% 1.38/1.55 cnf(intersection_defn-1, axiom, ( ~member(_u8, intersection(_u12, _u10)) | member(_u8, _u12) )).
% 1.38/1.55 cnf(intersection_defn-2, axiom, ( ~member(_u8, intersection(_u12, _u10)) | member(_u8, _u10) )).
% 1.38/1.55 cnf(intersection_defn-3, axiom, ( ~member(_u9, _u13) | ~member(_u9, _u11) | member(_u9, intersection(_u13, _u11)) )).
% 1.38/1.55
% 1.38/1.55 % Formula: subset_defn ( axiom ) converted to clauses:
% 1.38/1.55 cnf(subset_defn-1, axiom, ( ~subset(_u20, _u18) | ~member(_u14, _u20) | member(_u14, _u18) )).
% 1.38/1.55 cnf(subset_defn-2, axiom, ( subset(_u21, _u19) | member(skolem1(_u21, _u19), _u21) )).
% 1.38/1.55 cnf(subset_defn-3, axiom, ( subset(_u21, _u19) | ~member(skolem1(_u21, _u19), _u19) )).
% 1.38/1.55
% 1.38/1.55 % Formula: equal_defn ( axiom ) converted to clauses:
% 1.38/1.55 cnf(equal_defn-1, axiom, ( ( _u26 != _u24) | subset(_u26, _u24) )).
% 1.38/1.55 cnf(equal_defn-2, axiom, ( ( _u26 != _u24) | subset(_u24, _u26) )).
% 1.38/1.55 cnf(equal_defn-3, axiom, ( ~subset(_u27, _u25) | ~subset(_u25, _u27) | ( _u27 = _u25) )).
% 1.38/1.55
% 1.38/1.55 % Formula: commutativity_of_intersection ( axiom ) converted to clauses:
% 1.38/1.55 cnf(commutativity_of_intersection-1, axiom, ( ( intersection(_u29, _u28) = intersection(_u28, _u29)) )).
% 1.38/1.55
% 1.38/1.55 % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 1.38/1.55 cnf(reflexivity_of_subset-1, axiom, ( subset(_u30, _u30) )).
% 1.38/1.55
% 1.38/1.55 % Formula: empty_defn ( axiom ) converted to clauses:
% 1.38/1.55 cnf(empty_defn-1, axiom, ( ~empty(_u34) | ~member(_u31, _u34) )).
% 1.38/1.55 cnf(empty_defn-2, axiom, ( member(skolem2(_u35), _u35) | empty(_u35) )).
% 1.38/1.55
% 1.38/1.55 % Formula: equal_member_defn ( axiom ) converted to clauses:
% 1.38/1.55 cnf(equal_member_defn-1, axiom, ( ( _u46 != _u44) | ~member(_u40, _u46) | member(_u40, _u44) )).
% 1.38/1.55 cnf(equal_member_defn-2, axiom, ( ( _u46 != _u44) | ~member(_u41, _u44) | member(_u41, _u46) )).
% 1.38/1.55 cnf(equal_member_defn-3, axiom, ( ( _u47 = _u45) | member(skolem3(_u47, _u45), _u47) | member(skolem4(_u47, _u45), _u45) )).
% 1.38/1.55 cnf(equal_member_defn-4, axiom, ( ( _u47 = _u45) | member(skolem3(_u47, _u45), _u47) | ~member(skolem4(_u47, _u45), _u47) )).
% 1.38/1.55 cnf(equal_member_defn-5, axiom, ( ( _u47 = _u45) | ~member(skolem3(_u47, _u45), _u45) | member(skolem4(_u47, _u45), _u45) )).
% 1.38/1.55 cnf(equal_member_defn-6, axiom, ( ( _u47 = _u45) | ~member(skolem3(_u47, _u45), _u45) | ~member(skolem4(_u47, _u45), _u47) )).
% 1.38/1.55
% 1.38/1.55 % Formula: prove_th51 ( conjecture ) (definitionally) converted to clauses:
% 1.38/1.55 cnf(prove_th51-1, negated_conjecture, ( subset(skolem5, skolem6) )).
% 1.38/1.55 cnf(prove_th51-2, negated_conjecture, ( subset(skolem5, skolem7) )).
% 1.38/1.55 cnf(prove_th51-3, negated_conjecture, ( ( intersection(skolem6, skolem7) = empty_set) )).
% 1.38/1.55 cnf(prove_th51-4, negated_conjecture, ( ( skolem5 != empty_set) )).
% 1.38/1.55
% 1.38/1.55 % Problem matrix:
% 1.38/1.55 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 1.38/1.55 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 1.38/1.55 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 1.38/1.55 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( intersection(__eqx_0, __eqx_1) = intersection(__eqy_0, __eqy_1)) )).
% 1.38/1.55 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 1.38/1.55 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( skolem2(__eqx_0) = skolem2(__eqy_0)) )).
% 1.38/1.55 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 1.38/1.55 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem4(__eqx_0, __eqx_1) = skolem4(__eqy_0, __eqy_1)) )).
% 1.38/1.55 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 1.38/1.55 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 1.38/1.55 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 1.38/1.55 cnf(matrix-11, plain, ( ~subset(_u0, empty_set) | ( _u0 = empty_set) )).
% 1.38/1.55 cnf(matrix-12, plain, ( ~subset(_u3, _u2) | ~subset(_u3, _u1) | subset(_u3, intersection(_u2, _u1)) )).
% 1.38/1.55 cnf(matrix-13, plain, ( ~member(_u4, empty_set) )).
% 1.38/1.55 cnf(matrix-14, plain, ( ~member(_u8, intersection(_u12, _u10)) | member(_u8, _u12) )).
% 1.38/1.55 cnf(matrix-15, plain, ( ~member(_u8, intersection(_u12, _u10)) | member(_u8, _u10) )).
% 1.38/1.55 cnf(matrix-16, plain, ( ~member(_u9, _u13) | ~member(_u9, _u11) | member(_u9, intersection(_u13, _u11)) )).
% 1.38/1.55 cnf(matrix-17, plain, ( ~subset(_u20, _u18) | ~member(_u14, _u20) | member(_u14, _u18) )).
% 1.38/1.55 cnf(matrix-18, plain, ( subset(_u21, _u19) | member(skolem1(_u21, _u19), _u21) )).
% 1.38/1.55 cnf(matrix-19, plain, ( subset(_u21, _u19) | ~member(skolem1(_u21, _u19), _u19) )).
% 1.38/1.55 cnf(matrix-20, plain, ( ( _u26 != _u24) | subset(_u26, _u24) )).
% 1.38/1.55 cnf(matrix-21, plain, ( ( _u26 != _u24) | subset(_u24, _u26) )).
% 1.38/1.55 cnf(matrix-22, plain, ( ~subset(_u27, _u25) | ~subset(_u25, _u27) | ( _u27 = _u25) )).
% 1.38/1.55 cnf(matrix-23, plain, ( ( intersection(_u29, _u28) = intersection(_u28, _u29)) )).
% 1.38/1.55 cnf(matrix-24, plain, ( subset(_u30, _u30) )).
% 1.38/1.55 cnf(matrix-25, plain, ( ~empty(_u34) | ~member(_u31, _u34) )).
% 1.38/1.55 cnf(matrix-26, plain, ( member(skolem2(_u35), _u35) | empty(_u35) )).
% 1.38/1.55 cnf(matrix-27, plain, ( ( _u46 != _u44) | ~member(_u40, _u46) | member(_u40, _u44) )).
% 1.38/1.55 cnf(matrix-28, plain, ( ( _u46 != _u44) | ~member(_u41, _u44) | member(_u41, _u46) )).
% 1.38/1.55 cnf(matrix-29, plain, ( ( _u47 = _u45) | member(skolem3(_u47, _u45), _u47) | member(skolem4(_u47, _u45), _u45) )).
% 1.38/1.55 cnf(matrix-30, plain, ( ( _u47 = _u45) | member(skolem3(_u47, _u45), _u47) | ~member(skolem4(_u47, _u45), _u47) )).
% 1.38/1.55 cnf(matrix-31, plain, ( ( _u47 = _u45) | ~member(skolem3(_u47, _u45), _u45) | member(skolem4(_u47, _u45), _u45) )).
% 1.38/1.55 cnf(matrix-32, plain, ( ( _u47 = _u45) | ~member(skolem3(_u47, _u45), _u45) | ~member(skolem4(_u47, _u45), _u47) )).
% 1.38/1.55 cnf(matrix-33, plain, ( subset(skolem5, skolem6) )).
% 1.38/1.55 cnf(matrix-34, plain, ( subset(skolem5, skolem7) )).
% 1.38/1.55 cnf(matrix-35, plain, ( ( intersection(skolem6, skolem7) = empty_set) )).
% 1.38/1.55 cnf(matrix-36, plain, ( ( skolem5 != empty_set) )).
% 1.38/1.55
% 1.38/1.55 % Proof stack:
% 1.38/1.55 cnf(proof-stack, plain,
% 1.38/1.55 proof_stack(
% 1.38/1.55 start(13),
% 1.38/1.55 left_branch(0, 27, 2, 2),
% 1.38/1.55 left_branch(0, 35, 0, 3),
% 1.38/1.55 right_branch(3),
% 1.38/1.55 left_branch(0, 16, 2, 4),
% 1.38/1.55 left_branch(0, 17, 2, 5),
% 1.38/1.55 left_branch(0, 33, 0, 6),
% 1.38/1.55 right_branch(6),
% 1.38/1.55 left_branch(0, 29, 1, 7),
% 1.38/1.55 left_branch(0, 36, 0, 8),
% 1.38/1.55 right_branch(8),
% 1.38/1.55 left_branch(0, 13, 0, 9),
% 1.38/1.55 right_branch(9),
% 1.38/1.55 right_branch(7),
% 1.38/1.55 right_branch(5),
% 1.38/1.55 left_branch(0, 17, 2, 6),
% 1.38/1.55 left_branch(0, 34, 0, 7),
% 1.38/1.55 right_branch(7),
% 1.38/1.55 left_branch(0, 29, 1, 8),
% 1.38/1.55 left_branch(0, 36, 0, 9),
% 1.38/1.55 right_branch(9),
% 1.38/1.55 left_branch(0, 13, 0, 10),
% 1.38/1.55 right_branch(10),
% 1.38/1.55 right_branch(8),
% 1.38/1.55 right_branch(6),
% 1.38/1.55 right_branch(4),
% 1.38/1.55 right_branch(2)
% 1.38/1.55 )).
% 1.38/1.55 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------