TSTP Solution File: SET591+3 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SET591+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 : n017.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:19:23 EST 2024
% Result : Theorem 0.19s 0.50s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET591+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 : n017.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 : Sun Mar 3 18:54:43 EST 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% 0.19/0.50
% 0.19/0.50 % Formula: subset_defn ( axiom ) converted to clauses:
% 0.19/0.50 cnf(subset_defn-1, axiom, ( ~subset(_u6, _u4) | ~member(_u0, _u6) | member(_u0, _u4) )).
% 0.19/0.50 cnf(subset_defn-2, axiom, ( subset(_u7, _u5) | member(skolem1(_u7, _u5), _u7) )).
% 0.19/0.50 cnf(subset_defn-3, axiom, ( subset(_u7, _u5) | ~member(skolem1(_u7, _u5), _u5) )).
% 0.19/0.50
% 0.19/0.50 % Formula: difference_defn ( axiom ) converted to clauses:
% 0.19/0.50 cnf(difference_defn-1, axiom, ( ~member(_u11, difference(_u15, _u13)) | member(_u11, _u15) )).
% 0.19/0.50 cnf(difference_defn-2, axiom, ( ~member(_u11, difference(_u15, _u13)) | ~member(_u11, _u13) )).
% 0.19/0.50 cnf(difference_defn-3, axiom, ( ~member(_u12, _u16) | member(_u12, _u14) | member(_u12, difference(_u16, _u14)) )).
% 0.19/0.50
% 0.19/0.50 % Formula: empty_set_defn ( axiom ) converted to clauses:
% 0.19/0.50 cnf(empty_set_defn-1, axiom, ( ~member(_u17, empty_set) )).
% 0.19/0.50
% 0.19/0.50 % Formula: equal_defn ( axiom ) converted to clauses:
% 0.19/0.50 cnf(equal_defn-1, axiom, ( ( _u22 != _u20) | subset(_u22, _u20) )).
% 0.19/0.50 cnf(equal_defn-2, axiom, ( ( _u22 != _u20) | subset(_u20, _u22) )).
% 0.19/0.50 cnf(equal_defn-3, axiom, ( ~subset(_u23, _u21) | ~subset(_u21, _u23) | ( _u23 = _u21) )).
% 0.19/0.50
% 0.19/0.50 % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 0.19/0.50 cnf(reflexivity_of_subset-1, axiom, ( subset(_u24, _u24) )).
% 0.19/0.50
% 0.19/0.50 % Formula: empty_defn ( axiom ) converted to clauses:
% 0.19/0.50 cnf(empty_defn-1, axiom, ( ~empty(_u28) | ~member(_u25, _u28) )).
% 0.19/0.50 cnf(empty_defn-2, axiom, ( member(skolem2(_u29), _u29) | empty(_u29) )).
% 0.19/0.50
% 0.19/0.50 % Formula: prove_th50 ( conjecture ) converted to clauses:
% 0.19/0.50 cnf(prove_th50-1, negated_conjecture, ( ( skolem3 != empty_set) )).
% 0.19/0.50 cnf(prove_th50-2, negated_conjecture, ( subset(skolem3, difference(skolem4, skolem3)) )).
% 0.19/0.50
% 0.19/0.50 % Problem matrix:
% 0.19/0.50 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.19/0.50 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.19/0.50 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.19/0.50 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( difference(__eqx_0, __eqx_1) = difference(__eqy_0, __eqy_1)) )).
% 0.19/0.50 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.19/0.50 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( skolem2(__eqx_0) = skolem2(__eqy_0)) )).
% 0.19/0.50 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.19/0.50 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 0.19/0.50 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.19/0.50 cnf(matrix-9, plain, ( ~subset(_u6, _u4) | ~member(_u0, _u6) | member(_u0, _u4) )).
% 0.19/0.50 cnf(matrix-10, plain, ( subset(_u7, _u5) | member(skolem1(_u7, _u5), _u7) )).
% 0.19/0.50 cnf(matrix-11, plain, ( subset(_u7, _u5) | ~member(skolem1(_u7, _u5), _u5) )).
% 0.19/0.50 cnf(matrix-12, plain, ( ~member(_u11, difference(_u15, _u13)) | member(_u11, _u15) )).
% 0.19/0.50 cnf(matrix-13, plain, ( ~member(_u11, difference(_u15, _u13)) | ~member(_u11, _u13) )).
% 0.19/0.50 cnf(matrix-14, plain, ( ~member(_u12, _u16) | member(_u12, _u14) | member(_u12, difference(_u16, _u14)) )).
% 0.19/0.50 cnf(matrix-15, plain, ( ~member(_u17, empty_set) )).
% 0.19/0.50 cnf(matrix-16, plain, ( ( _u22 != _u20) | subset(_u22, _u20) )).
% 0.19/0.50 cnf(matrix-17, plain, ( ( _u22 != _u20) | subset(_u20, _u22) )).
% 0.19/0.50 cnf(matrix-18, plain, ( ~subset(_u23, _u21) | ~subset(_u21, _u23) | ( _u23 = _u21) )).
% 0.19/0.50 cnf(matrix-19, plain, ( subset(_u24, _u24) )).
% 0.19/0.50 cnf(matrix-20, plain, ( ~empty(_u28) | ~member(_u25, _u28) )).
% 0.19/0.50 cnf(matrix-21, plain, ( member(skolem2(_u29), _u29) | empty(_u29) )).
% 0.19/0.50 cnf(matrix-22, plain, ( ( skolem3 != empty_set) )).
% 0.19/0.50 cnf(matrix-23, plain, ( subset(skolem3, difference(skolem4, skolem3)) )).
% 0.19/0.50
% 0.19/0.50 % Proof stack:
% 0.19/0.50 cnf(proof-stack, plain,
% 0.19/0.50 proof_stack(
% 0.19/0.50 start(13),
% 0.19/0.50 left_branch(0, 14, 2, 2),
% 0.19/0.50 left_branch(0, 10, 1, 3),
% 0.19/0.50 left_branch(0, 18, 0, 4),
% 0.19/0.50 left_branch(0, 22, 0, 5),
% 0.19/0.50 right_branch(5),
% 0.19/0.50 left_branch(0, 10, 0, 6),
% 0.19/0.50 left_branch(0, 15, 0, 7),
% 0.19/0.50 right_branch(7),
% 0.19/0.50 right_branch(6),
% 0.19/0.50 right_branch(4),
% 0.19/0.50 right_branch(3),
% 0.19/0.50 left_branch(0, 20, 1, 4),
% 0.19/0.50 left_branch(0, 21, 1, 5),
% 0.19/0.50 left_branch(0, 15, 0, 6),
% 0.19/0.50 right_branch(6),
% 0.19/0.50 right_branch(5),
% 0.19/0.50 right_branch(4),
% 0.19/0.50 right_branch(2),
% 0.19/0.50 left_branch(0, 14, 1, 3),
% 0.19/0.50 left_branch(0, 10, 1, 4),
% 0.19/0.50 left_branch(0, 18, 1, 5),
% 0.19/0.50 left_branch(0, 10, 0, 6),
% 0.19/0.50 left_branch(0, 15, 0, 7),
% 0.19/0.50 right_branch(7),
% 0.19/0.50 right_branch(6),
% 0.19/0.50 left_branch(0, 1, 0, 7),
% 0.19/0.50 left_branch(0, 22, 0, 8),
% 0.19/0.50 right_branch(8),
% 0.19/0.50 right_branch(7),
% 0.19/0.50 right_branch(5),
% 0.19/0.50 right_branch(4),
% 0.19/0.50 left_branch(0, 12, 0, 5),
% 0.19/0.50 left_branch(0, 13, 1, 6),
% 0.19/0.50 left_branch(0, 9, 2, 7),
% 0.19/0.50 left_branch(0, 23, 0, 8),
% 0.19/0.50 right_branch(8),
% 0.19/0.50 lemmata(0, 1),
% 0.19/0.50 right_branch(7),
% 0.19/0.50 right_branch(6),
% 0.19/0.50 right_branch(5),
% 0.19/0.50 right_branch(3)
% 0.19/0.50 )).
% 0.19/0.50 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------