TSTP Solution File: SET063+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET063+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 : n023.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:31:00 EDT 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.07/0.12 % Problem : SET063+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.13/0.33 % Computer : n023.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 : Wed Mar 20 22:23:57 EDT 2024
% 0.13/0.33 % 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: empty_set_subset ( axiom ) converted to clauses:
% 0.13/0.34 cnf(empty_set_subset-1, axiom, ( subset(empty_set, _u0) )).
% 0.13/0.34
% 0.13/0.34 % Formula: empty_set_defn ( axiom ) converted to clauses:
% 0.13/0.34 cnf(empty_set_defn-1, axiom, ( ~member(_u1, empty_set) )).
% 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(_u8, _u6) | ~member(_u2, _u8) | member(_u2, _u6) )).
% 0.13/0.34 cnf(subset_defn-2, axiom, ( subset(_u9, _u7) | member(skolem1(_u9, _u7), _u9) )).
% 0.13/0.34 cnf(subset_defn-3, axiom, ( subset(_u9, _u7) | ~member(skolem1(_u9, _u7), _u7) )).
% 0.13/0.34
% 0.13/0.34 % Formula: equal_defn ( axiom ) converted to clauses:
% 0.13/0.34 cnf(equal_defn-1, axiom, ( ( _u14 != _u12) | subset(_u14, _u12) )).
% 0.13/0.34 cnf(equal_defn-2, axiom, ( ( _u14 != _u12) | subset(_u12, _u14) )).
% 0.13/0.34 cnf(equal_defn-3, axiom, ( ~subset(_u15, _u13) | ~subset(_u13, _u15) | ( _u15 = _u13) )).
% 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(_u16, _u16) )).
% 0.13/0.34
% 0.13/0.34 % Formula: empty_defn ( axiom ) converted to clauses:
% 0.13/0.34 cnf(empty_defn-1, axiom, ( ~empty(_u20) | ~member(_u17, _u20) )).
% 0.13/0.34 cnf(empty_defn-2, axiom, ( member(skolem2(_u21), _u21) | empty(_u21) )).
% 0.13/0.34
% 0.13/0.34 % Formula: prove_subset_of_empty_set_is_empty_set ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.34 cnf(prove_subset_of_empty_set_is_empty_set-1, negated_conjecture, ( subset(skolem3, empty_set) )).
% 0.13/0.34 cnf(prove_subset_of_empty_set_is_empty_set-2, negated_conjecture, ( ( skolem3 != empty_set) )).
% 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) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.13/0.34 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( skolem2(__eqx_0) = skolem2(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-5, 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-6, 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-7, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.13/0.34 cnf(matrix-8, plain, ( subset(empty_set, _u0) )).
% 0.13/0.34 cnf(matrix-9, plain, ( ~member(_u1, empty_set) )).
% 0.13/0.34 cnf(matrix-10, plain, ( ~subset(_u8, _u6) | ~member(_u2, _u8) | member(_u2, _u6) )).
% 0.13/0.34 cnf(matrix-11, plain, ( subset(_u9, _u7) | member(skolem1(_u9, _u7), _u9) )).
% 0.13/0.34 cnf(matrix-12, plain, ( subset(_u9, _u7) | ~member(skolem1(_u9, _u7), _u7) )).
% 0.13/0.34 cnf(matrix-13, plain, ( ( _u14 != _u12) | subset(_u14, _u12) )).
% 0.13/0.34 cnf(matrix-14, plain, ( ( _u14 != _u12) | subset(_u12, _u14) )).
% 0.13/0.34 cnf(matrix-15, plain, ( ~subset(_u15, _u13) | ~subset(_u13, _u15) | ( _u15 = _u13) )).
% 0.13/0.34 cnf(matrix-16, plain, ( subset(_u16, _u16) )).
% 0.13/0.34 cnf(matrix-17, plain, ( ~empty(_u20) | ~member(_u17, _u20) )).
% 0.13/0.34 cnf(matrix-18, plain, ( member(skolem2(_u21), _u21) | empty(_u21) )).
% 0.13/0.34 cnf(matrix-19, plain, ( subset(skolem3, empty_set) )).
% 0.13/0.34 cnf(matrix-20, plain, ( ( skolem3 != empty_set) )).
% 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(20),
% 0.13/0.34 left_branch(0, 15, 2, 2),
% 0.13/0.34 left_branch(0, 19, 0, 3),
% 0.13/0.34 right_branch(3),
% 0.13/0.34 left_branch(0, 8, 0, 4),
% 0.13/0.34 right_branch(4),
% 0.13/0.34 right_branch(2)
% 0.13/0.34 )).
% 0.13/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------