TSTP Solution File: SET578+3 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SET578+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 : n019.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:21 EST 2024
% Result : Theorem 3.02s 3.17s
% Output : Proof 3.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET578+3 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.14 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Mar 3 19:07:36 EST 2024
% 0.14/0.35 % CPUTime :
% 3.02/3.17 % SZS status Theorem for theBenchmark
% 3.02/3.17 % SZS output start Proof for theBenchmark
% 3.02/3.17
% 3.02/3.17 % Formula: intersection_defn ( axiom ) converted to clauses:
% 3.02/3.17 cnf(intersection_defn-1, axiom, ( ~member(_u3, intersection(_u7, _u5)) | member(_u3, _u7) )).
% 3.02/3.17 cnf(intersection_defn-2, axiom, ( ~member(_u3, intersection(_u7, _u5)) | member(_u3, _u5) )).
% 3.02/3.17 cnf(intersection_defn-3, axiom, ( ~member(_u4, _u8) | ~member(_u4, _u6) | member(_u4, intersection(_u8, _u6)) )).
% 3.02/3.17
% 3.02/3.17 % Formula: equal_defn ( axiom ) converted to clauses:
% 3.02/3.17 cnf(equal_defn-1, axiom, ( ( _u13 != _u11) | subset(_u13, _u11) )).
% 3.02/3.17 cnf(equal_defn-2, axiom, ( ( _u13 != _u11) | subset(_u11, _u13) )).
% 3.02/3.17 cnf(equal_defn-3, axiom, ( ~subset(_u14, _u12) | ~subset(_u12, _u14) | ( _u14 = _u12) )).
% 3.02/3.17
% 3.02/3.17 % Formula: commutativity_of_intersection ( axiom ) converted to clauses:
% 3.02/3.17 cnf(commutativity_of_intersection-1, axiom, ( ( intersection(_u16, _u15) = intersection(_u15, _u16)) )).
% 3.02/3.17
% 3.02/3.17 % Formula: subset_defn ( axiom ) converted to clauses:
% 3.02/3.17 cnf(subset_defn-1, axiom, ( ~subset(_u23, _u21) | ~member(_u17, _u23) | member(_u17, _u21) )).
% 3.02/3.17 cnf(subset_defn-2, axiom, ( subset(_u24, _u22) | member(skolem1(_u24, _u22), _u24) )).
% 3.02/3.17 cnf(subset_defn-3, axiom, ( subset(_u24, _u22) | ~member(skolem1(_u24, _u22), _u22) )).
% 3.02/3.17
% 3.02/3.17 % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 3.02/3.17 cnf(reflexivity_of_subset-1, axiom, ( subset(_u25, _u25) )).
% 3.02/3.17
% 3.02/3.17 % Formula: equal_member_defn ( axiom ) converted to clauses:
% 3.02/3.17 cnf(equal_member_defn-1, axiom, ( ( _u36 != _u34) | ~member(_u30, _u36) | member(_u30, _u34) )).
% 3.02/3.17 cnf(equal_member_defn-2, axiom, ( ( _u36 != _u34) | ~member(_u31, _u34) | member(_u31, _u36) )).
% 3.02/3.17 cnf(equal_member_defn-3, axiom, ( ( _u37 = _u35) | member(skolem2(_u37, _u35), _u37) | member(skolem3(_u37, _u35), _u35) )).
% 3.02/3.17 cnf(equal_member_defn-4, axiom, ( ( _u37 = _u35) | member(skolem2(_u37, _u35), _u37) | ~member(skolem3(_u37, _u35), _u37) )).
% 3.02/3.17 cnf(equal_member_defn-5, axiom, ( ( _u37 = _u35) | ~member(skolem2(_u37, _u35), _u35) | member(skolem3(_u37, _u35), _u35) )).
% 3.02/3.17 cnf(equal_member_defn-6, axiom, ( ( _u37 = _u35) | ~member(skolem2(_u37, _u35), _u35) | ~member(skolem3(_u37, _u35), _u37) )).
% 3.02/3.17
% 3.02/3.17 % Formula: prove_th19 ( conjecture ) converted to clauses:
% 3.02/3.17 cnf(prove_th19-1, negated_conjecture, ( ~member(_u42, skolem4) | member(_u42, skolem5) )).
% 3.02/3.17 cnf(prove_th19-2, negated_conjecture, ( ~member(_u42, skolem4) | member(_u42, skolem6) )).
% 3.02/3.17 cnf(prove_th19-3, negated_conjecture, ( ~member(_u43, skolem5) | ~member(_u43, skolem6) | member(_u43, skolem4) )).
% 3.02/3.17 cnf(prove_th19-4, negated_conjecture, ( ( skolem4 != intersection(skolem5, skolem6)) )).
% 3.02/3.17
% 3.02/3.17 % Problem matrix:
% 3.02/3.17 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 3.02/3.17 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 3.02/3.17 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 3.02/3.17 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( intersection(__eqx_0, __eqx_1) = intersection(__eqy_0, __eqy_1)) )).
% 3.02/3.17 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 3.02/3.17 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 3.02/3.17 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 3.02/3.17 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 3.02/3.17 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 3.02/3.17 cnf(matrix-9, plain, ( ~member(_u3, intersection(_u7, _u5)) | member(_u3, _u7) )).
% 3.02/3.17 cnf(matrix-10, plain, ( ~member(_u3, intersection(_u7, _u5)) | member(_u3, _u5) )).
% 3.02/3.17 cnf(matrix-11, plain, ( ~member(_u4, _u8) | ~member(_u4, _u6) | member(_u4, intersection(_u8, _u6)) )).
% 3.02/3.17 cnf(matrix-12, plain, ( ( _u13 != _u11) | subset(_u13, _u11) )).
% 3.02/3.17 cnf(matrix-13, plain, ( ( _u13 != _u11) | subset(_u11, _u13) )).
% 3.02/3.17 cnf(matrix-14, plain, ( ~subset(_u14, _u12) | ~subset(_u12, _u14) | ( _u14 = _u12) )).
% 3.02/3.17 cnf(matrix-15, plain, ( ( intersection(_u16, _u15) = intersection(_u15, _u16)) )).
% 3.02/3.17 cnf(matrix-16, plain, ( ~subset(_u23, _u21) | ~member(_u17, _u23) | member(_u17, _u21) )).
% 3.02/3.17 cnf(matrix-17, plain, ( subset(_u24, _u22) | member(skolem1(_u24, _u22), _u24) )).
% 3.02/3.17 cnf(matrix-18, plain, ( subset(_u24, _u22) | ~member(skolem1(_u24, _u22), _u22) )).
% 3.02/3.17 cnf(matrix-19, plain, ( subset(_u25, _u25) )).
% 3.02/3.17 cnf(matrix-20, plain, ( ( _u36 != _u34) | ~member(_u30, _u36) | member(_u30, _u34) )).
% 3.02/3.17 cnf(matrix-21, plain, ( ( _u36 != _u34) | ~member(_u31, _u34) | member(_u31, _u36) )).
% 3.02/3.17 cnf(matrix-22, plain, ( ( _u37 = _u35) | member(skolem2(_u37, _u35), _u37) | member(skolem3(_u37, _u35), _u35) )).
% 3.02/3.17 cnf(matrix-23, plain, ( ( _u37 = _u35) | member(skolem2(_u37, _u35), _u37) | ~member(skolem3(_u37, _u35), _u37) )).
% 3.02/3.17 cnf(matrix-24, plain, ( ( _u37 = _u35) | ~member(skolem2(_u37, _u35), _u35) | member(skolem3(_u37, _u35), _u35) )).
% 3.02/3.17 cnf(matrix-25, plain, ( ( _u37 = _u35) | ~member(skolem2(_u37, _u35), _u35) | ~member(skolem3(_u37, _u35), _u37) )).
% 3.02/3.17 cnf(matrix-26, plain, ( ~member(_u42, skolem4) | member(_u42, skolem5) )).
% 3.02/3.17 cnf(matrix-27, plain, ( ~member(_u42, skolem4) | member(_u42, skolem6) )).
% 3.02/3.17 cnf(matrix-28, plain, ( ~member(_u43, skolem5) | ~member(_u43, skolem6) | member(_u43, skolem4) )).
% 3.02/3.17 cnf(matrix-29, plain, ( ( skolem4 != intersection(skolem5, skolem6)) )).
% 3.02/3.17
% 3.02/3.17 % Proof stack:
% 3.02/3.17 cnf(proof-stack, plain,
% 3.02/3.17 proof_stack(
% 3.02/3.17 start(29),
% 3.02/3.17 left_branch(0, 14, 2, 2),
% 3.02/3.17 left_branch(0, 18, 0, 3),
% 3.02/3.17 left_branch(0, 11, 2, 4),
% 3.02/3.17 left_branch(0, 26, 1, 5),
% 3.02/3.17 left_branch(0, 17, 1, 6),
% 3.02/3.17 reduction(0, 1),
% 3.02/3.17 right_branch(6),
% 3.02/3.17 right_branch(5),
% 3.02/3.17 left_branch(0, 27, 1, 6),
% 3.02/3.17 left_branch(0, 17, 1, 7),
% 3.02/3.17 reduction(0, 1),
% 3.02/3.17 right_branch(7),
% 3.02/3.17 right_branch(6),
% 3.02/3.17 right_branch(4),
% 3.02/3.17 right_branch(3),
% 3.02/3.17 left_branch(0, 18, 0, 4),
% 3.02/3.17 left_branch(0, 28, 2, 5),
% 3.02/3.17 left_branch(0, 9, 1, 6),
% 3.02/3.17 left_branch(0, 17, 1, 7),
% 3.02/3.17 reduction(0, 1),
% 3.02/3.17 right_branch(7),
% 3.02/3.17 right_branch(6),
% 3.02/3.17 left_branch(0, 10, 1, 7),
% 3.02/3.17 left_branch(0, 17, 1, 8),
% 3.02/3.17 reduction(0, 1),
% 3.02/3.17 right_branch(8),
% 3.02/3.17 right_branch(7),
% 3.02/3.17 right_branch(5),
% 3.02/3.17 right_branch(4),
% 3.02/3.17 right_branch(2)
% 3.02/3.17 )).
% 3.02/3.17 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------