TPTP Problem File: TOP005-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : TOP005-1 : TPTP v8.2.0. Released v1.0.0.
% Domain : Topology
% Problem : Topology generated by a basis forms a topological space, part 5
% Version : [WM89] axioms : Incomplete.
% English :
% Refs : [WM89] Wick & McCune (1989), Automated Reasoning about Elemen
% Source : [WM89]
% Names : Lemma 1e [WM89]
% Status : Satisfiable
% Rating : 0.00 v6.3.0, 0.33 v6.2.0, 0.20 v6.1.0, 0.00 v5.5.0, 0.25 v5.4.0, 0.89 v5.3.0, 0.86 v5.2.0, 0.71 v5.0.0, 0.75 v4.1.0, 0.71 v4.0.0, 0.75 v3.7.0, 0.62 v3.5.0, 0.71 v3.4.0, 0.83 v3.2.0, 0.80 v3.1.0, 0.86 v2.7.0, 0.80 v2.6.0, 0.75 v2.5.0, 1.00 v2.0.0
% Syntax : Number of clauses : 112 ( 3 unt; 23 nHn; 107 RR)
% Number of literals : 339 ( 0 equ; 206 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 22 ( 22 usr; 0 prp; 1-4 aty)
% Number of functors : 38 ( 38 usr; 4 con; 0-5 aty)
% Number of variables : 357 ( 56 sgn)
% SPC : CNF_SAT_RFO_NEQ
% Comments : The axioms in this version are known to be incomplete. To
% obtain a proof of this theorem it may be necessary to add
% appropriate set theory axioms.
%--------------------------------------------------------------------------
%----Include Point-set topology axioms
include('Axioms/TOP001-0.ax').
%--------------------------------------------------------------------------
cnf(lemma_1e_1,negated_conjecture,
basis(cx,f) ).
cnf(lemma_1e_2,negated_conjecture,
subset_collections(g,top_of_basis(f)) ).
cnf(lemma_1e_3,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)) ).
%--------------------------------------------------------------------------