TSTP Solution File: SET603+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET603+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 12.63s 12.84s
% Output : Proof 12.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET603+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Wed Mar 20 21:48:09 EDT 2024
% 0.13/0.34 % CPUTime :
% 12.63/12.84 % SZS status Theorem for theBenchmark
% 12.63/12.84 % SZS output start Proof for theBenchmark
% 12.63/12.84
% 12.63/12.84 % Formula: member_equal ( axiom ) converted to clauses:
% 12.63/12.84 cnf(member_equal-1, axiom, ( ( _u2 = _u1) | member(skolem1(_u2, _u1), _u2) | member(skolem2(_u2, _u1), _u1) )).
% 12.63/12.84 cnf(member_equal-2, axiom, ( ( _u2 = _u1) | member(skolem1(_u2, _u1), _u2) | ~member(skolem2(_u2, _u1), _u2) )).
% 12.63/12.84 cnf(member_equal-3, axiom, ( ( _u2 = _u1) | ~member(skolem1(_u2, _u1), _u1) | member(skolem2(_u2, _u1), _u1) )).
% 12.63/12.84 cnf(member_equal-4, axiom, ( ( _u2 = _u1) | ~member(skolem1(_u2, _u1), _u1) | ~member(skolem2(_u2, _u1), _u2) )).
% 12.63/12.84
% 12.63/12.84 % Formula: difference_defn ( axiom ) converted to clauses:
% 12.63/12.84 cnf(difference_defn-1, axiom, ( ~member(_u8, difference(_u12, _u10)) | member(_u8, _u12) )).
% 12.63/12.84 cnf(difference_defn-2, axiom, ( ~member(_u8, difference(_u12, _u10)) | ~member(_u8, _u10) )).
% 12.63/12.84 cnf(difference_defn-3, axiom, ( ~member(_u9, _u13) | member(_u9, _u11) | member(_u9, difference(_u13, _u11)) )).
% 12.63/12.84
% 12.63/12.84 % Formula: empty_set_defn ( axiom ) converted to clauses:
% 12.63/12.84 cnf(empty_set_defn-1, axiom, ( ~member(_u14, empty_set) )).
% 12.63/12.84
% 12.63/12.84 % Formula: equal_defn ( axiom ) converted to clauses:
% 12.63/12.84 cnf(equal_defn-1, axiom, ( ( _u19 != _u17) | subset(_u19, _u17) )).
% 12.63/12.84 cnf(equal_defn-2, axiom, ( ( _u19 != _u17) | subset(_u17, _u19) )).
% 12.63/12.84 cnf(equal_defn-3, axiom, ( ~subset(_u20, _u18) | ~subset(_u18, _u20) | ( _u20 = _u18) )).
% 12.63/12.84
% 12.63/12.84 % Formula: equal_member_defn ( axiom ) converted to clauses:
% 12.63/12.84 cnf(equal_member_defn-1, axiom, ( ( _u31 != _u29) | ~member(_u25, _u31) | member(_u25, _u29) )).
% 12.63/12.84 cnf(equal_member_defn-2, axiom, ( ( _u31 != _u29) | ~member(_u26, _u29) | member(_u26, _u31) )).
% 12.63/12.84 cnf(equal_member_defn-3, axiom, ( ( _u32 = _u30) | member(skolem3(_u32, _u30), _u32) | member(skolem4(_u32, _u30), _u30) )).
% 12.63/12.84 cnf(equal_member_defn-4, axiom, ( ( _u32 = _u30) | member(skolem3(_u32, _u30), _u32) | ~member(skolem4(_u32, _u30), _u32) )).
% 12.63/12.84 cnf(equal_member_defn-5, axiom, ( ( _u32 = _u30) | ~member(skolem3(_u32, _u30), _u30) | member(skolem4(_u32, _u30), _u30) )).
% 12.63/12.84 cnf(equal_member_defn-6, axiom, ( ( _u32 = _u30) | ~member(skolem3(_u32, _u30), _u30) | ~member(skolem4(_u32, _u30), _u32) )).
% 12.63/12.84
% 12.63/12.84 % Formula: subset_defn ( axiom ) converted to clauses:
% 12.63/12.84 cnf(subset_defn-1, axiom, ( ~subset(_u39, _u37) | ~member(_u33, _u39) | member(_u33, _u37) )).
% 12.63/12.84 cnf(subset_defn-2, axiom, ( subset(_u40, _u38) | member(skolem5(_u40, _u38), _u40) )).
% 12.63/12.84 cnf(subset_defn-3, axiom, ( subset(_u40, _u38) | ~member(skolem5(_u40, _u38), _u38) )).
% 12.63/12.84
% 12.63/12.84 % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 12.63/12.84 cnf(reflexivity_of_subset-1, axiom, ( subset(_u41, _u41) )).
% 12.63/12.84
% 12.63/12.84 % Formula: empty_defn ( axiom ) converted to clauses:
% 12.63/12.84 cnf(empty_defn-1, axiom, ( ~empty(_u45) | ~member(_u42, _u45) )).
% 12.63/12.84 cnf(empty_defn-2, axiom, ( member(skolem6(_u46), _u46) | empty(_u46) )).
% 12.63/12.84
% 12.63/12.84 % Formula: prove_th74 ( conjecture ) (definitionally) converted to clauses:
% 12.63/12.84 cnf(prove_th74-1, negated_conjecture, ( ( difference(skolem7, empty_set) != skolem7) )).
% 12.63/12.84
% 12.63/12.84 % Problem matrix:
% 12.63/12.84 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 12.63/12.84 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 12.63/12.84 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 12.63/12.84 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( difference(__eqx_0, __eqx_1) = difference(__eqy_0, __eqy_1)) )).
% 12.63/12.84 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 12.63/12.84 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 12.63/12.84 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 12.63/12.84 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem4(__eqx_0, __eqx_1) = skolem4(__eqy_0, __eqy_1)) )).
% 12.63/12.84 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem5(__eqx_0, __eqx_1) = skolem5(__eqy_0, __eqy_1)) )).
% 12.63/12.84 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( skolem6(__eqx_0) = skolem6(__eqy_0)) )).
% 12.63/12.84 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 12.63/12.84 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 12.63/12.84 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 12.63/12.84 cnf(matrix-13, plain, ( ( _u2 = _u1) | member(skolem1(_u2, _u1), _u2) | member(skolem2(_u2, _u1), _u1) )).
% 12.63/12.84 cnf(matrix-14, plain, ( ( _u2 = _u1) | member(skolem1(_u2, _u1), _u2) | ~member(skolem2(_u2, _u1), _u2) )).
% 12.63/12.84 cnf(matrix-15, plain, ( ( _u2 = _u1) | ~member(skolem1(_u2, _u1), _u1) | member(skolem2(_u2, _u1), _u1) )).
% 12.63/12.84 cnf(matrix-16, plain, ( ( _u2 = _u1) | ~member(skolem1(_u2, _u1), _u1) | ~member(skolem2(_u2, _u1), _u2) )).
% 12.63/12.84 cnf(matrix-17, plain, ( ~member(_u8, difference(_u12, _u10)) | member(_u8, _u12) )).
% 12.63/12.84 cnf(matrix-18, plain, ( ~member(_u8, difference(_u12, _u10)) | ~member(_u8, _u10) )).
% 12.63/12.84 cnf(matrix-19, plain, ( ~member(_u9, _u13) | member(_u9, _u11) | member(_u9, difference(_u13, _u11)) )).
% 12.63/12.84 cnf(matrix-20, plain, ( ~member(_u14, empty_set) )).
% 12.63/12.84 cnf(matrix-21, plain, ( ( _u19 != _u17) | subset(_u19, _u17) )).
% 12.63/12.84 cnf(matrix-22, plain, ( ( _u19 != _u17) | subset(_u17, _u19) )).
% 12.63/12.84 cnf(matrix-23, plain, ( ~subset(_u20, _u18) | ~subset(_u18, _u20) | ( _u20 = _u18) )).
% 12.63/12.84 cnf(matrix-24, plain, ( ( _u31 != _u29) | ~member(_u25, _u31) | member(_u25, _u29) )).
% 12.63/12.84 cnf(matrix-25, plain, ( ( _u31 != _u29) | ~member(_u26, _u29) | member(_u26, _u31) )).
% 12.63/12.84 cnf(matrix-26, plain, ( ( _u32 = _u30) | member(skolem3(_u32, _u30), _u32) | member(skolem4(_u32, _u30), _u30) )).
% 12.63/12.84 cnf(matrix-27, plain, ( ( _u32 = _u30) | member(skolem3(_u32, _u30), _u32) | ~member(skolem4(_u32, _u30), _u32) )).
% 12.63/12.84 cnf(matrix-28, plain, ( ( _u32 = _u30) | ~member(skolem3(_u32, _u30), _u30) | member(skolem4(_u32, _u30), _u30) )).
% 12.63/12.84 cnf(matrix-29, plain, ( ( _u32 = _u30) | ~member(skolem3(_u32, _u30), _u30) | ~member(skolem4(_u32, _u30), _u32) )).
% 12.63/12.84 cnf(matrix-30, plain, ( ~subset(_u39, _u37) | ~member(_u33, _u39) | member(_u33, _u37) )).
% 12.63/12.84 cnf(matrix-31, plain, ( subset(_u40, _u38) | member(skolem5(_u40, _u38), _u40) )).
% 12.63/12.84 cnf(matrix-32, plain, ( subset(_u40, _u38) | ~member(skolem5(_u40, _u38), _u38) )).
% 12.63/12.84 cnf(matrix-33, plain, ( subset(_u41, _u41) )).
% 12.63/12.84 cnf(matrix-34, plain, ( ~empty(_u45) | ~member(_u42, _u45) )).
% 12.63/12.84 cnf(matrix-35, plain, ( member(skolem6(_u46), _u46) | empty(_u46) )).
% 12.63/12.84 cnf(matrix-36, plain, ( ( difference(skolem7, empty_set) != skolem7) )).
% 12.63/12.84
% 12.63/12.84 % Proof stack:
% 12.63/12.84 cnf(proof-stack, plain,
% 12.63/12.84 proof_stack(
% 12.63/12.84 start(36),
% 12.63/12.84 left_branch(0, 23, 2, 2),
% 12.63/12.84 left_branch(0, 32, 0, 3),
% 12.63/12.84 left_branch(0, 17, 1, 4),
% 12.63/12.84 left_branch(0, 31, 1, 5),
% 12.63/12.84 reduction(0, 1),
% 12.63/12.84 right_branch(5),
% 12.63/12.84 right_branch(4),
% 12.63/12.84 right_branch(3),
% 12.63/12.84 left_branch(0, 32, 0, 4),
% 12.63/12.84 left_branch(0, 19, 2, 5),
% 12.63/12.84 left_branch(0, 31, 1, 6),
% 12.63/12.84 reduction(0, 1),
% 12.63/12.84 right_branch(6),
% 12.63/12.84 left_branch(0, 20, 0, 7),
% 12.63/12.84 right_branch(7),
% 12.63/12.84 right_branch(5),
% 12.63/12.84 right_branch(4),
% 12.63/12.84 right_branch(2)
% 12.63/12.84 )).
% 12.63/12.84 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------