TSTP Solution File: SET618+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET618+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 : n024.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:07 EDT 2024
% Result : Theorem 10.88s 11.13s
% Output : Proof 10.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET618+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n024.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 : Wed Mar 20 21:38:31 EDT 2024
% 0.12/0.33 % CPUTime :
% 10.88/11.13 % SZS status Theorem for theBenchmark
% 10.88/11.13 % SZS output start Proof for theBenchmark
% 10.88/11.13
% 10.88/11.13 % Formula: symmetric_difference_defn ( axiom ) converted to clauses:
% 10.88/11.13 cnf(symmetric_difference_defn-1, axiom, ( ( symmetric_difference(_u1, _u0) = union(difference(_u1, _u0), difference(_u0, _u1))) )).
% 10.88/11.13
% 10.88/11.13 % Formula: idempotency_of_union ( axiom ) converted to clauses:
% 10.88/11.13 cnf(idempotency_of_union-1, axiom, ( ( union(_u2, _u2) = _u2) )).
% 10.88/11.13
% 10.88/11.13 % Formula: self_difference_is_empty_set ( axiom ) converted to clauses:
% 10.88/11.13 cnf(self_difference_is_empty_set-1, axiom, ( ( difference(_u3, _u3) = empty_set) )).
% 10.88/11.13
% 10.88/11.13 % Formula: empty_set_defn ( axiom ) converted to clauses:
% 10.88/11.13 cnf(empty_set_defn-1, axiom, ( ~member(_u4, empty_set) )).
% 10.88/11.13
% 10.88/11.13 % Formula: equal_defn ( axiom ) converted to clauses:
% 10.88/11.13 cnf(equal_defn-1, axiom, ( ( _u9 != _u7) | subset(_u9, _u7) )).
% 10.88/11.13 cnf(equal_defn-2, axiom, ( ( _u9 != _u7) | subset(_u7, _u9) )).
% 10.88/11.13 cnf(equal_defn-3, axiom, ( ~subset(_u10, _u8) | ~subset(_u8, _u10) | ( _u10 = _u8) )).
% 10.88/11.13
% 10.88/11.13 % Formula: commutativity_of_union ( axiom ) converted to clauses:
% 10.88/11.13 cnf(commutativity_of_union-1, axiom, ( ( union(_u12, _u11) = union(_u11, _u12)) )).
% 10.88/11.13
% 10.88/11.13 % Formula: commutativity_of_symmetric_difference ( axiom ) converted to clauses:
% 10.88/11.13 cnf(commutativity_of_symmetric_difference-1, axiom, ( ( symmetric_difference(_u14, _u13) = symmetric_difference(_u13, _u14)) )).
% 10.88/11.13
% 10.88/11.13 % Formula: equal_member_defn ( axiom ) converted to clauses:
% 10.88/11.13 cnf(equal_member_defn-1, axiom, ( ( _u25 != _u23) | ~member(_u19, _u25) | member(_u19, _u23) )).
% 10.88/11.13 cnf(equal_member_defn-2, axiom, ( ( _u25 != _u23) | ~member(_u20, _u23) | member(_u20, _u25) )).
% 10.88/11.13 cnf(equal_member_defn-3, axiom, ( ( _u26 = _u24) | member(skolem1(_u26, _u24), _u26) | member(skolem2(_u26, _u24), _u24) )).
% 10.88/11.13 cnf(equal_member_defn-4, axiom, ( ( _u26 = _u24) | member(skolem1(_u26, _u24), _u26) | ~member(skolem2(_u26, _u24), _u26) )).
% 10.88/11.13 cnf(equal_member_defn-5, axiom, ( ( _u26 = _u24) | ~member(skolem1(_u26, _u24), _u24) | member(skolem2(_u26, _u24), _u24) )).
% 10.88/11.13 cnf(equal_member_defn-6, axiom, ( ( _u26 = _u24) | ~member(skolem1(_u26, _u24), _u24) | ~member(skolem2(_u26, _u24), _u26) )).
% 10.88/11.13
% 10.88/11.13 % Formula: subset_defn ( axiom ) converted to clauses:
% 10.88/11.13 cnf(subset_defn-1, axiom, ( ~subset(_u33, _u31) | ~member(_u27, _u33) | member(_u27, _u31) )).
% 10.88/11.13 cnf(subset_defn-2, axiom, ( subset(_u34, _u32) | member(skolem3(_u34, _u32), _u34) )).
% 10.88/11.13 cnf(subset_defn-3, axiom, ( subset(_u34, _u32) | ~member(skolem3(_u34, _u32), _u32) )).
% 10.88/11.13
% 10.88/11.13 % Formula: reflexivity_of_subset ( axiom ) converted to clauses:
% 10.88/11.13 cnf(reflexivity_of_subset-1, axiom, ( subset(_u35, _u35) )).
% 10.88/11.13
% 10.88/11.13 % Formula: empty_defn ( axiom ) converted to clauses:
% 10.88/11.13 cnf(empty_defn-1, axiom, ( ~empty(_u39) | ~member(_u36, _u39) )).
% 10.88/11.13 cnf(empty_defn-2, axiom, ( member(skolem4(_u40), _u40) | empty(_u40) )).
% 10.88/11.13
% 10.88/11.13 % Formula: prove_th93 ( conjecture ) (definitionally) converted to clauses:
% 10.88/11.13 cnf(prove_th93-1, negated_conjecture, ( ( symmetric_difference(skolem5, skolem5) != empty_set) )).
% 10.88/11.13
% 10.88/11.13 % Problem matrix:
% 10.88/11.13 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 10.88/11.13 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 10.88/11.13 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 10.88/11.13 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( symmetric_difference(__eqx_0, __eqx_1) = symmetric_difference(__eqy_0, __eqy_1)) )).
% 10.88/11.13 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( difference(__eqx_0, __eqx_1) = difference(__eqy_0, __eqy_1)) )).
% 10.88/11.13 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( union(__eqx_0, __eqx_1) = union(__eqy_0, __eqy_1)) )).
% 10.88/11.13 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 10.88/11.13 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 10.88/11.13 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 10.88/11.13 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( skolem4(__eqx_0) = skolem4(__eqy_0)) )).
% 10.88/11.13 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~member(__eqx_0, __eqx_1) | member(__eqy_0, __eqy_1) )).
% 10.88/11.13 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 10.88/11.13 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 10.88/11.13 cnf(matrix-13, plain, ( ( symmetric_difference(_u1, _u0) = union(difference(_u1, _u0), difference(_u0, _u1))) )).
% 10.88/11.13 cnf(matrix-14, plain, ( ( union(_u2, _u2) = _u2) )).
% 10.88/11.13 cnf(matrix-15, plain, ( ( difference(_u3, _u3) = empty_set) )).
% 10.88/11.13 cnf(matrix-16, plain, ( ~member(_u4, empty_set) )).
% 10.88/11.13 cnf(matrix-17, plain, ( ( _u9 != _u7) | subset(_u9, _u7) )).
% 10.88/11.13 cnf(matrix-18, plain, ( ( _u9 != _u7) | subset(_u7, _u9) )).
% 10.88/11.13 cnf(matrix-19, plain, ( ~subset(_u10, _u8) | ~subset(_u8, _u10) | ( _u10 = _u8) )).
% 10.88/11.13 cnf(matrix-20, plain, ( ( union(_u12, _u11) = union(_u11, _u12)) )).
% 10.88/11.13 cnf(matrix-21, plain, ( ( symmetric_difference(_u14, _u13) = symmetric_difference(_u13, _u14)) )).
% 10.88/11.13 cnf(matrix-22, plain, ( ( _u25 != _u23) | ~member(_u19, _u25) | member(_u19, _u23) )).
% 10.88/11.13 cnf(matrix-23, plain, ( ( _u25 != _u23) | ~member(_u20, _u23) | member(_u20, _u25) )).
% 10.88/11.13 cnf(matrix-24, plain, ( ( _u26 = _u24) | member(skolem1(_u26, _u24), _u26) | member(skolem2(_u26, _u24), _u24) )).
% 10.88/11.13 cnf(matrix-25, plain, ( ( _u26 = _u24) | member(skolem1(_u26, _u24), _u26) | ~member(skolem2(_u26, _u24), _u26) )).
% 10.88/11.13 cnf(matrix-26, plain, ( ( _u26 = _u24) | ~member(skolem1(_u26, _u24), _u24) | member(skolem2(_u26, _u24), _u24) )).
% 10.88/11.13 cnf(matrix-27, plain, ( ( _u26 = _u24) | ~member(skolem1(_u26, _u24), _u24) | ~member(skolem2(_u26, _u24), _u26) )).
% 10.88/11.13 cnf(matrix-28, plain, ( ~subset(_u33, _u31) | ~member(_u27, _u33) | member(_u27, _u31) )).
% 10.88/11.13 cnf(matrix-29, plain, ( subset(_u34, _u32) | member(skolem3(_u34, _u32), _u34) )).
% 10.88/11.13 cnf(matrix-30, plain, ( subset(_u34, _u32) | ~member(skolem3(_u34, _u32), _u32) )).
% 10.88/11.13 cnf(matrix-31, plain, ( subset(_u35, _u35) )).
% 10.88/11.13 cnf(matrix-32, plain, ( ~empty(_u39) | ~member(_u36, _u39) )).
% 10.88/11.13 cnf(matrix-33, plain, ( member(skolem4(_u40), _u40) | empty(_u40) )).
% 10.88/11.13 cnf(matrix-34, plain, ( ( symmetric_difference(skolem5, skolem5) != empty_set) )).
% 10.88/11.13
% 10.88/11.13 % Proof stack:
% 10.88/11.13 cnf(proof-stack, plain,
% 10.88/11.13 proof_stack(
% 10.88/11.13 start(32),
% 10.88/11.13 left_branch(0, 33, 1, 2),
% 10.88/11.13 left_branch(0, 22, 1, 3),
% 10.88/11.13 left_branch(0, 15, 0, 4),
% 10.88/11.13 right_branch(4),
% 10.88/11.13 left_branch(0, 16, 0, 5),
% 10.88/11.13 right_branch(5),
% 10.88/11.13 right_branch(3),
% 10.88/11.13 right_branch(2),
% 10.88/11.13 left_branch(0, 22, 2, 3),
% 10.88/11.13 left_branch(0, 2, 2, 4),
% 10.88/11.13 left_branch(0, 13, 0, 5),
% 10.88/11.13 right_branch(5),
% 10.88/11.13 left_branch(0, 14, 0, 6),
% 10.88/11.13 right_branch(6),
% 10.88/11.13 right_branch(4),
% 10.88/11.13 left_branch(0, 24, 1, 5),
% 10.88/11.13 left_branch(0, 34, 0, 6),
% 10.88/11.13 right_branch(6),
% 10.88/11.13 left_branch(0, 16, 0, 7),
% 10.88/11.13 right_branch(7),
% 10.88/11.13 right_branch(5),
% 10.88/11.13 right_branch(3)
% 10.88/11.13 )).
% 10.88/11.13 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------