TSTP Solution File: SET148+3 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SET148+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 : Wed Mar 6 09:18:52 EST 2024
% Result : Theorem 0.13s 0.34s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET148+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.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun Mar 3 18:44:27 EST 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start Proof for theBenchmark
% 0.13/0.34
% 0.13/0.34 % Formula: subset_intersection ( axiom ) converted to clauses:
% 0.13/0.34 cnf(subset_intersection-1, axiom, ( ~subset(_u1, _u0) | ( intersection(_u1, _u0) = _u1) )).
% 0.13/0.34
% 0.13/0.34 % Formula: intersection_defn ( axiom ) converted to clauses:
% 0.13/0.34 cnf(intersection_defn-1, axiom, ( ~member(_u5, intersection(_u9, _u7)) | member(_u5, _u9) )).
% 0.13/0.34 cnf(intersection_defn-2, axiom, ( ~member(_u5, intersection(_u9, _u7)) | member(_u5, _u7) )).
% 0.13/0.34 cnf(intersection_defn-3, axiom, ( ~member(_u6, _u10) | ~member(_u6, _u8) | member(_u6, intersection(_u10, _u8)) )).
% 0.13/0.34
% 0.13/0.34 % Formula: equal_defn ( axiom ) converted to clauses:
% 0.13/0.34 cnf(equal_defn-1, axiom, ( ( _u15 != _u13) | subset(_u15, _u13) )).
% 0.13/0.34 cnf(equal_defn-2, axiom, ( ( _u15 != _u13) | subset(_u13, _u15) )).
% 0.13/0.34 cnf(equal_defn-3, axiom, ( ~subset(_u16, _u14) | ~subset(_u14, _u16) | ( _u16 = _u14) )).
% 0.13/0.34
% 0.13/0.34 % Formula: commutativity_of_intersection ( axiom ) converted to clauses:
% 0.13/0.34 cnf(commutativity_of_intersection-1, axiom, ( ( intersection(_u18, _u17) = intersection(_u17, _u18)) )).
% 0.13/0.34
% 0.13/0.34 % Formula: subset_defn ( axiom ) converted to clauses:
% 0.13/0.34 cnf(subset_defn-1, axiom, ( ~subset(_u25, _u23) | ~member(_u19, _u25) | member(_u19, _u23) )).
% 0.13/0.34 cnf(subset_defn-2, axiom, ( subset(_u26, _u24) | member(skolem1(_u26, _u24), _u26) )).
% 0.13/0.34 cnf(subset_defn-3, axiom, ( subset(_u26, _u24) | ~member(skolem1(_u26, _u24), _u24) )).
% 0.13/0.34
% 0.13/0.34 % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 0.13/0.34 cnf(reflexivity_of_subset-1, axiom, ( subset(_u27, _u27) )).
% 0.13/0.34
% 0.13/0.34 % Formula: equal_member_defn ( axiom ) converted to clauses:
% 0.13/0.34 cnf(equal_member_defn-1, axiom, ( ( _u38 != _u36) | ~member(_u32, _u38) | member(_u32, _u36) )).
% 0.13/0.34 cnf(equal_member_defn-2, axiom, ( ( _u38 != _u36) | ~member(_u33, _u36) | member(_u33, _u38) )).
% 0.13/0.34 cnf(equal_member_defn-3, axiom, ( ( _u39 = _u37) | member(skolem2(_u39, _u37), _u39) | member(skolem3(_u39, _u37), _u37) )).
% 0.13/0.34 cnf(equal_member_defn-4, axiom, ( ( _u39 = _u37) | member(skolem2(_u39, _u37), _u39) | ~member(skolem3(_u39, _u37), _u39) )).
% 0.13/0.34 cnf(equal_member_defn-5, axiom, ( ( _u39 = _u37) | ~member(skolem2(_u39, _u37), _u37) | member(skolem3(_u39, _u37), _u37) )).
% 0.13/0.34 cnf(equal_member_defn-6, axiom, ( ( _u39 = _u37) | ~member(skolem2(_u39, _u37), _u37) | ~member(skolem3(_u39, _u37), _u39) )).
% 0.13/0.34
% 0.13/0.34 % Formula: prove_idempotency_of_intersection ( conjecture ) converted to clauses:
% 0.13/0.34 cnf(prove_idempotency_of_intersection-1, negated_conjecture, ( ( intersection(skolem4, skolem4) != skolem4) )).
% 0.13/0.34
% 0.13/0.34 % Problem matrix:
% 0.13/0.34 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.34 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( intersection(__eqx_0, __eqx_1) = intersection(__eqy_0, __eqy_1)) )).
% 0.13/0.34 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.13/0.34 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 0.13/0.34 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 0.13/0.34 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.13/0.34 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 0.13/0.34 cnf(matrix-9, plain, ( ~subset(_u1, _u0) | ( intersection(_u1, _u0) = _u1) )).
% 0.13/0.34 cnf(matrix-10, plain, ( ~member(_u5, intersection(_u9, _u7)) | member(_u5, _u9) )).
% 0.13/0.34 cnf(matrix-11, plain, ( ~member(_u5, intersection(_u9, _u7)) | member(_u5, _u7) )).
% 0.13/0.34 cnf(matrix-12, plain, ( ~member(_u6, _u10) | ~member(_u6, _u8) | member(_u6, intersection(_u10, _u8)) )).
% 0.13/0.34 cnf(matrix-13, plain, ( ( _u15 != _u13) | subset(_u15, _u13) )).
% 0.13/0.34 cnf(matrix-14, plain, ( ( _u15 != _u13) | subset(_u13, _u15) )).
% 0.13/0.34 cnf(matrix-15, plain, ( ~subset(_u16, _u14) | ~subset(_u14, _u16) | ( _u16 = _u14) )).
% 0.13/0.34 cnf(matrix-16, plain, ( ( intersection(_u18, _u17) = intersection(_u17, _u18)) )).
% 0.13/0.34 cnf(matrix-17, plain, ( ~subset(_u25, _u23) | ~member(_u19, _u25) | member(_u19, _u23) )).
% 0.13/0.34 cnf(matrix-18, plain, ( subset(_u26, _u24) | member(skolem1(_u26, _u24), _u26) )).
% 0.13/0.34 cnf(matrix-19, plain, ( subset(_u26, _u24) | ~member(skolem1(_u26, _u24), _u24) )).
% 0.13/0.34 cnf(matrix-20, plain, ( subset(_u27, _u27) )).
% 0.13/0.34 cnf(matrix-21, plain, ( ( _u38 != _u36) | ~member(_u32, _u38) | member(_u32, _u36) )).
% 0.13/0.34 cnf(matrix-22, plain, ( ( _u38 != _u36) | ~member(_u33, _u36) | member(_u33, _u38) )).
% 0.13/0.34 cnf(matrix-23, plain, ( ( _u39 = _u37) | member(skolem2(_u39, _u37), _u39) | member(skolem3(_u39, _u37), _u37) )).
% 0.13/0.34 cnf(matrix-24, plain, ( ( _u39 = _u37) | member(skolem2(_u39, _u37), _u39) | ~member(skolem3(_u39, _u37), _u39) )).
% 0.13/0.34 cnf(matrix-25, plain, ( ( _u39 = _u37) | ~member(skolem2(_u39, _u37), _u37) | member(skolem3(_u39, _u37), _u37) )).
% 0.13/0.34 cnf(matrix-26, plain, ( ( _u39 = _u37) | ~member(skolem2(_u39, _u37), _u37) | ~member(skolem3(_u39, _u37), _u39) )).
% 0.13/0.34 cnf(matrix-27, plain, ( ( intersection(skolem4, skolem4) != skolem4) )).
% 0.13/0.34
% 0.13/0.34 % Proof stack:
% 0.13/0.34 cnf(proof-stack, plain,
% 0.13/0.34 proof_stack(
% 0.13/0.34 start(27),
% 0.13/0.34 left_branch(0, 9, 1, 2),
% 0.13/0.34 left_branch(0, 20, 0, 3),
% 0.13/0.34 right_branch(3),
% 0.13/0.34 right_branch(2)
% 0.13/0.34 )).
% 0.13/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------