TSTP Solution File: SET062+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SET062+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 : n003.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:30:59 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.06/0.12 % Problem : SET062+3 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n003.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 21:56:19 EDT 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: empty_set_defn ( axiom ) converted to clauses:
% 0.13/0.34 cnf(empty_set_defn-1, axiom, ( ~member(_u0, 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(_u7, _u5) | ~member(_u1, _u7) | member(_u1, _u5) )).
% 0.13/0.34 cnf(subset_defn-2, axiom, ( subset(_u8, _u6) | member(skolem1(_u8, _u6), _u8) )).
% 0.13/0.34 cnf(subset_defn-3, axiom, ( subset(_u8, _u6) | ~member(skolem1(_u8, _u6), _u6) )).
% 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(_u9, _u9) )).
% 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(_u13) | ~member(_u10, _u13) )).
% 0.13/0.34 cnf(empty_defn-2, axiom, ( member(skolem2(_u14), _u14) | empty(_u14) )).
% 0.13/0.34
% 0.13/0.34 % Formula: prove_empty_set_subset ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.34 cnf(prove_empty_set_subset-1, negated_conjecture, ( ~subset(empty_set, skolem3) )).
% 0.13/0.34
% 0.13/0.34 % Problem matrix:
% 0.13/0.34 cnf(matrix-0, plain, ( ~member(_u0, empty_set) )).
% 0.13/0.34 cnf(matrix-1, plain, ( ~subset(_u7, _u5) | ~member(_u1, _u7) | member(_u1, _u5) )).
% 0.13/0.34 cnf(matrix-2, plain, ( subset(_u8, _u6) | member(skolem1(_u8, _u6), _u8) )).
% 0.13/0.34 cnf(matrix-3, plain, ( subset(_u8, _u6) | ~member(skolem1(_u8, _u6), _u6) )).
% 0.13/0.34 cnf(matrix-4, plain, ( subset(_u9, _u9) )).
% 0.13/0.34 cnf(matrix-5, plain, ( ~empty(_u13) | ~member(_u10, _u13) )).
% 0.13/0.34 cnf(matrix-6, plain, ( member(skolem2(_u14), _u14) | empty(_u14) )).
% 0.13/0.34 cnf(matrix-7, plain, ( ~subset(empty_set, skolem3) )).
% 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(0),
% 0.13/0.34 left_branch(0, 2, 1, 2),
% 0.13/0.34 left_branch(0, 7, 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
%------------------------------------------------------------------------------