TSTP Solution File: SET605+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET605+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 : n004.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:04 EDT 2024
% Result : Theorem 0.12s 0.38s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET605+3 : TPTP v8.1.2. Released v2.2.0.
% 0.10/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n004.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Mar 20 22:10:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.38 % SZS status Theorem for theBenchmark
% 0.12/0.38 % SZS output start Proof for theBenchmark
% 0.12/0.38
% 0.12/0.38 % Formula: subset_of_union ( axiom ) converted to clauses:
% 0.12/0.38 cnf(subset_of_union-1, axiom, ( subset(_u1, union(_u1, _u0)) )).
% 0.12/0.38
% 0.12/0.38 % Formula: difference_empty_set ( axiom ) converted to clauses:
% 0.12/0.38 cnf(difference_empty_set-1, axiom, ( ( difference(_u6, _u4) != empty_set) | subset(_u6, _u4) )).
% 0.12/0.38 cnf(difference_empty_set-2, axiom, ( ~subset(_u7, _u5) | ( difference(_u7, _u5) = empty_set) )).
% 0.12/0.38
% 0.12/0.38 % Formula: union_defn ( axiom ) converted to clauses:
% 0.12/0.38 cnf(union_defn-1, axiom, ( ~member(_u11, union(_u15, _u13)) | member(_u11, _u15) | member(_u11, _u13) )).
% 0.12/0.38 cnf(union_defn-2, axiom, ( member(_u12, union(_u16, _u14)) | ~member(_u12, _u16) )).
% 0.12/0.38 cnf(union_defn-3, axiom, ( member(_u12, union(_u16, _u14)) | ~member(_u12, _u14) )).
% 0.12/0.38
% 0.12/0.38 % Formula: empty_set_defn ( axiom ) converted to clauses:
% 0.12/0.38 cnf(empty_set_defn-1, axiom, ( ~member(_u17, empty_set) )).
% 0.12/0.38
% 0.12/0.38 % Formula: difference_defn ( axiom ) converted to clauses:
% 0.12/0.38 cnf(difference_defn-1, axiom, ( ~member(_u21, difference(_u25, _u23)) | member(_u21, _u25) )).
% 0.12/0.38 cnf(difference_defn-2, axiom, ( ~member(_u21, difference(_u25, _u23)) | ~member(_u21, _u23) )).
% 0.12/0.38 cnf(difference_defn-3, axiom, ( ~member(_u22, _u26) | member(_u22, _u24) | member(_u22, difference(_u26, _u24)) )).
% 0.12/0.38
% 0.12/0.38 % Formula: equal_defn ( axiom ) converted to clauses:
% 0.12/0.38 cnf(equal_defn-1, axiom, ( ( _u31 != _u29) | subset(_u31, _u29) )).
% 0.12/0.38 cnf(equal_defn-2, axiom, ( ( _u31 != _u29) | subset(_u29, _u31) )).
% 0.12/0.38 cnf(equal_defn-3, axiom, ( ~subset(_u32, _u30) | ~subset(_u30, _u32) | ( _u32 = _u30) )).
% 0.12/0.38
% 0.12/0.38 % Formula: commutativity_of_union ( axiom ) converted to clauses:
% 0.12/0.38 cnf(commutativity_of_union-1, axiom, ( ( union(_u34, _u33) = union(_u33, _u34)) )).
% 0.12/0.38
% 0.12/0.38 % Formula: subset_defn ( axiom ) converted to clauses:
% 0.12/0.38 cnf(subset_defn-1, axiom, ( ~subset(_u41, _u39) | ~member(_u35, _u41) | member(_u35, _u39) )).
% 0.12/0.38 cnf(subset_defn-2, axiom, ( subset(_u42, _u40) | member(skolem1(_u42, _u40), _u42) )).
% 0.12/0.38 cnf(subset_defn-3, axiom, ( subset(_u42, _u40) | ~member(skolem1(_u42, _u40), _u40) )).
% 0.12/0.38
% 0.12/0.38 % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 0.12/0.38 cnf(reflexivity_of_subset-1, axiom, ( subset(_u43, _u43) )).
% 0.12/0.38
% 0.12/0.38 % Formula: empty_defn ( axiom ) converted to clauses:
% 0.12/0.38 cnf(empty_defn-1, axiom, ( ~empty(_u47) | ~member(_u44, _u47) )).
% 0.12/0.38 cnf(empty_defn-2, axiom, ( member(skolem2(_u48), _u48) | empty(_u48) )).
% 0.12/0.38
% 0.12/0.38 % Formula: equal_member_defn ( axiom ) converted to clauses:
% 0.12/0.38 cnf(equal_member_defn-1, axiom, ( ( _u59 != _u57) | ~member(_u53, _u59) | member(_u53, _u57) )).
% 0.12/0.38 cnf(equal_member_defn-2, axiom, ( ( _u59 != _u57) | ~member(_u54, _u57) | member(_u54, _u59) )).
% 0.12/0.38 cnf(equal_member_defn-3, axiom, ( ( _u60 = _u58) | member(skolem3(_u60, _u58), _u60) | member(skolem4(_u60, _u58), _u58) )).
% 0.12/0.38 cnf(equal_member_defn-4, axiom, ( ( _u60 = _u58) | member(skolem3(_u60, _u58), _u60) | ~member(skolem4(_u60, _u58), _u60) )).
% 0.12/0.38 cnf(equal_member_defn-5, axiom, ( ( _u60 = _u58) | ~member(skolem3(_u60, _u58), _u58) | member(skolem4(_u60, _u58), _u58) )).
% 0.12/0.38 cnf(equal_member_defn-6, axiom, ( ( _u60 = _u58) | ~member(skolem3(_u60, _u58), _u58) | ~member(skolem4(_u60, _u58), _u60) )).
% 0.12/0.38
% 0.12/0.38 % Formula: prove_th76 ( conjecture ) (definitionally) converted to clauses:
% 0.12/0.38 cnf(prove_th76-1, negated_conjecture, ( ( difference(skolem5, union(skolem5, skolem6)) != empty_set) )).
% 0.12/0.38
% 0.12/0.38 % Problem matrix:
% 0.12/0.38 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.12/0.38 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.12/0.38 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.12/0.38 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( union(__eqx_0, __eqx_1) = union(__eqy_0, __eqy_1)) )).
% 0.12/0.38 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( difference(__eqx_0, __eqx_1) = difference(__eqy_0, __eqy_1)) )).
% 0.12/0.38 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.12/0.38 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( skolem2(__eqx_0) = skolem2(__eqy_0)) )).
% 0.12/0.38 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 0.12/0.38 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem4(__eqx_0, __eqx_1) = skolem4(__eqy_0, __eqy_1)) )).
% 0.12/0.38 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.12/0.38 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 0.12/0.38 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.12/0.38 cnf(matrix-12, plain, ( subset(_u1, union(_u1, _u0)) )).
% 0.12/0.38 cnf(matrix-13, plain, ( ( difference(_u6, _u4) != empty_set) | subset(_u6, _u4) )).
% 0.12/0.38 cnf(matrix-14, plain, ( ~subset(_u7, _u5) | ( difference(_u7, _u5) = empty_set) )).
% 0.12/0.38 cnf(matrix-15, plain, ( ~member(_u11, union(_u15, _u13)) | member(_u11, _u15) | member(_u11, _u13) )).
% 0.12/0.38 cnf(matrix-16, plain, ( member(_u12, union(_u16, _u14)) | ~member(_u12, _u16) )).
% 0.12/0.38 cnf(matrix-17, plain, ( member(_u12, union(_u16, _u14)) | ~member(_u12, _u14) )).
% 0.12/0.38 cnf(matrix-18, plain, ( ~member(_u17, empty_set) )).
% 0.12/0.38 cnf(matrix-19, plain, ( ~member(_u21, difference(_u25, _u23)) | member(_u21, _u25) )).
% 0.12/0.38 cnf(matrix-20, plain, ( ~member(_u21, difference(_u25, _u23)) | ~member(_u21, _u23) )).
% 0.12/0.38 cnf(matrix-21, plain, ( ~member(_u22, _u26) | member(_u22, _u24) | member(_u22, difference(_u26, _u24)) )).
% 0.12/0.38 cnf(matrix-22, plain, ( ( _u31 != _u29) | subset(_u31, _u29) )).
% 0.12/0.38 cnf(matrix-23, plain, ( ( _u31 != _u29) | subset(_u29, _u31) )).
% 0.12/0.38 cnf(matrix-24, plain, ( ~subset(_u32, _u30) | ~subset(_u30, _u32) | ( _u32 = _u30) )).
% 0.12/0.38 cnf(matrix-25, plain, ( ( union(_u34, _u33) = union(_u33, _u34)) )).
% 0.12/0.38 cnf(matrix-26, plain, ( ~subset(_u41, _u39) | ~member(_u35, _u41) | member(_u35, _u39) )).
% 0.12/0.38 cnf(matrix-27, plain, ( subset(_u42, _u40) | member(skolem1(_u42, _u40), _u42) )).
% 0.12/0.38 cnf(matrix-28, plain, ( subset(_u42, _u40) | ~member(skolem1(_u42, _u40), _u40) )).
% 0.12/0.38 cnf(matrix-29, plain, ( subset(_u43, _u43) )).
% 0.12/0.38 cnf(matrix-30, plain, ( ~empty(_u47) | ~member(_u44, _u47) )).
% 0.12/0.38 cnf(matrix-31, plain, ( member(skolem2(_u48), _u48) | empty(_u48) )).
% 0.12/0.38 cnf(matrix-32, plain, ( ( _u59 != _u57) | ~member(_u53, _u59) | member(_u53, _u57) )).
% 0.12/0.38 cnf(matrix-33, plain, ( ( _u59 != _u57) | ~member(_u54, _u57) | member(_u54, _u59) )).
% 0.12/0.38 cnf(matrix-34, plain, ( ( _u60 = _u58) | member(skolem3(_u60, _u58), _u60) | member(skolem4(_u60, _u58), _u58) )).
% 0.12/0.38 cnf(matrix-35, plain, ( ( _u60 = _u58) | member(skolem3(_u60, _u58), _u60) | ~member(skolem4(_u60, _u58), _u60) )).
% 0.12/0.38 cnf(matrix-36, plain, ( ( _u60 = _u58) | ~member(skolem3(_u60, _u58), _u58) | member(skolem4(_u60, _u58), _u58) )).
% 0.12/0.38 cnf(matrix-37, plain, ( ( _u60 = _u58) | ~member(skolem3(_u60, _u58), _u58) | ~member(skolem4(_u60, _u58), _u60) )).
% 0.12/0.38 cnf(matrix-38, plain, ( ( difference(skolem5, union(skolem5, skolem6)) != empty_set) )).
% 0.12/0.38
% 0.12/0.38 % Proof stack:
% 0.12/0.38 cnf(proof-stack, plain,
% 0.12/0.38 proof_stack(
% 0.12/0.38 start(38),
% 0.12/0.38 left_branch(0, 14, 1, 2),
% 0.12/0.38 left_branch(0, 12, 0, 3),
% 0.12/0.38 right_branch(3),
% 0.12/0.38 right_branch(2)
% 0.12/0.38 )).
% 0.12/0.38 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------