TSTP Solution File: SEU341+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU341+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 03:52:04 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP22287/SEU341+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22287/SEU341+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22287/SEU341+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 22419
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:((((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))&element(X2,the_carrier(X1)))=>![X3]:(point_neighbourhood(X3,X1,X2)=>element(X3,powerset(the_carrier(X1))))),file('/tmp/SRASS.s.p', dt_m1_connsp_2)).
% fof(4, axiom,![X1]:![X2]:((((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))&element(X2,the_carrier(X1)))=>?[X3]:point_neighbourhood(X3,X1,X2)),file('/tmp/SRASS.s.p', existence_m1_connsp_2)).
% fof(8, axiom,![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,powerset(the_carrier(X1)))=>(point_neighbourhood(X3,X1,X2)<=>in(X2,interior(X1,X3)))))),file('/tmp/SRASS.s.p', d1_connsp_2)).
% fof(10, axiom,![X1]:((topological_space(X1)&top_str(X1))=>![X2]:(top_str(X2)=>![X3]:(element(X3,powerset(the_carrier(X1)))=>![X4]:(element(X4,powerset(the_carrier(X2)))=>((open_subset(X4,X2)=>interior(X2,X4)=X4)&(interior(X1,X3)=X3=>open_subset(X3,X1))))))),file('/tmp/SRASS.s.p', t55_tops_1)).
% fof(45, conjecture,![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>((open_subset(X2,X1)&in(X3,X2))=>point_neighbourhood(X2,X1,X3))))),file('/tmp/SRASS.s.p', t5_connsp_2)).
% fof(46, negated_conjecture,~(![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>((open_subset(X2,X1)&in(X3,X2))=>point_neighbourhood(X2,X1,X3)))))),inference(assume_negation,[status(cth)],[45])).
% fof(48, plain,![X1]:![X2]:((((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))&element(X2,the_carrier(X1)))=>![X3]:(point_neighbourhood(X3,X1,X2)=>element(X3,powerset(the_carrier(X1))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(49, plain,![X1]:![X2]:((((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))&element(X2,the_carrier(X1)))=>?[X3]:point_neighbourhood(X3,X1,X2)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(50, plain,![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,powerset(the_carrier(X1)))=>(point_neighbourhood(X3,X1,X2)<=>in(X2,interior(X1,X3)))))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(54, negated_conjecture,~(![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>((open_subset(X2,X1)&in(X3,X2))=>point_neighbourhood(X2,X1,X3)))))),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(58, plain,![X1]:![X2]:((((empty_carrier(X1)|~(topological_space(X1)))|~(top_str(X1)))|~(element(X2,the_carrier(X1))))|![X3]:(~(point_neighbourhood(X3,X1,X2))|element(X3,powerset(the_carrier(X1))))),inference(fof_nnf,[status(thm)],[48])).
% fof(59, plain,![X4]:![X5]:((((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4)))|~(element(X5,the_carrier(X4))))|![X6]:(~(point_neighbourhood(X6,X4,X5))|element(X6,powerset(the_carrier(X4))))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X4]:![X5]:![X6]:((~(point_neighbourhood(X6,X4,X5))|element(X6,powerset(the_carrier(X4))))|(((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4)))|~(element(X5,the_carrier(X4))))),inference(shift_quantors,[status(thm)],[59])).
% cnf(61,plain,(empty_carrier(X2)|element(X3,powerset(the_carrier(X2)))|~element(X1,the_carrier(X2))|~top_str(X2)|~topological_space(X2)|~point_neighbourhood(X3,X2,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(65, plain,![X1]:![X2]:((((empty_carrier(X1)|~(topological_space(X1)))|~(top_str(X1)))|~(element(X2,the_carrier(X1))))|?[X3]:point_neighbourhood(X3,X1,X2)),inference(fof_nnf,[status(thm)],[49])).
% fof(66, plain,![X4]:![X5]:((((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4)))|~(element(X5,the_carrier(X4))))|?[X6]:point_neighbourhood(X6,X4,X5)),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X4]:![X5]:((((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4)))|~(element(X5,the_carrier(X4))))|point_neighbourhood(esk2_2(X4,X5),X4,X5)),inference(skolemize,[status(esa)],[66])).
% cnf(68,plain,(point_neighbourhood(esk2_2(X1,X2),X1,X2)|empty_carrier(X1)|~element(X2,the_carrier(X1))|~top_str(X1)|~topological_space(X1)),inference(split_conjunct,[status(thm)],[67])).
% fof(78, plain,![X1]:(((empty_carrier(X1)|~(topological_space(X1)))|~(top_str(X1)))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(~(element(X3,powerset(the_carrier(X1))))|((~(point_neighbourhood(X3,X1,X2))|in(X2,interior(X1,X3)))&(~(in(X2,interior(X1,X3)))|point_neighbourhood(X3,X1,X2)))))),inference(fof_nnf,[status(thm)],[50])).
% fof(79, plain,![X4]:(((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4)))|![X5]:(~(element(X5,the_carrier(X4)))|![X6]:(~(element(X6,powerset(the_carrier(X4))))|((~(point_neighbourhood(X6,X4,X5))|in(X5,interior(X4,X6)))&(~(in(X5,interior(X4,X6)))|point_neighbourhood(X6,X4,X5)))))),inference(variable_rename,[status(thm)],[78])).
% fof(80, plain,![X4]:![X5]:![X6]:(((~(element(X6,powerset(the_carrier(X4))))|((~(point_neighbourhood(X6,X4,X5))|in(X5,interior(X4,X6)))&(~(in(X5,interior(X4,X6)))|point_neighbourhood(X6,X4,X5))))|~(element(X5,the_carrier(X4))))|((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4)))),inference(shift_quantors,[status(thm)],[79])).
% fof(81, plain,![X4]:![X5]:![X6]:(((((~(point_neighbourhood(X6,X4,X5))|in(X5,interior(X4,X6)))|~(element(X6,powerset(the_carrier(X4)))))|~(element(X5,the_carrier(X4))))|((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4))))&((((~(in(X5,interior(X4,X6)))|point_neighbourhood(X6,X4,X5))|~(element(X6,powerset(the_carrier(X4)))))|~(element(X5,the_carrier(X4))))|((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4))))),inference(distribute,[status(thm)],[80])).
% cnf(82,plain,(empty_carrier(X1)|point_neighbourhood(X3,X1,X2)|~top_str(X1)|~topological_space(X1)|~element(X2,the_carrier(X1))|~element(X3,powerset(the_carrier(X1)))|~in(X2,interior(X1,X3))),inference(split_conjunct,[status(thm)],[81])).
% fof(87, plain,![X1]:((~(topological_space(X1))|~(top_str(X1)))|![X2]:(~(top_str(X2))|![X3]:(~(element(X3,powerset(the_carrier(X1))))|![X4]:(~(element(X4,powerset(the_carrier(X2))))|((~(open_subset(X4,X2))|interior(X2,X4)=X4)&(~(interior(X1,X3)=X3)|open_subset(X3,X1))))))),inference(fof_nnf,[status(thm)],[10])).
% fof(88, plain,![X5]:((~(topological_space(X5))|~(top_str(X5)))|![X6]:(~(top_str(X6))|![X7]:(~(element(X7,powerset(the_carrier(X5))))|![X8]:(~(element(X8,powerset(the_carrier(X6))))|((~(open_subset(X8,X6))|interior(X6,X8)=X8)&(~(interior(X5,X7)=X7)|open_subset(X7,X5))))))),inference(variable_rename,[status(thm)],[87])).
% fof(89, plain,![X5]:![X6]:![X7]:![X8]:((((~(element(X8,powerset(the_carrier(X6))))|((~(open_subset(X8,X6))|interior(X6,X8)=X8)&(~(interior(X5,X7)=X7)|open_subset(X7,X5))))|~(element(X7,powerset(the_carrier(X5)))))|~(top_str(X6)))|(~(topological_space(X5))|~(top_str(X5)))),inference(shift_quantors,[status(thm)],[88])).
% fof(90, plain,![X5]:![X6]:![X7]:![X8]:((((((~(open_subset(X8,X6))|interior(X6,X8)=X8)|~(element(X8,powerset(the_carrier(X6)))))|~(element(X7,powerset(the_carrier(X5)))))|~(top_str(X6)))|(~(topological_space(X5))|~(top_str(X5))))&(((((~(interior(X5,X7)=X7)|open_subset(X7,X5))|~(element(X8,powerset(the_carrier(X6)))))|~(element(X7,powerset(the_carrier(X5)))))|~(top_str(X6)))|(~(topological_space(X5))|~(top_str(X5))))),inference(distribute,[status(thm)],[89])).
% cnf(92,plain,(interior(X2,X4)=X4|~top_str(X1)|~topological_space(X1)|~top_str(X2)|~element(X3,powerset(the_carrier(X1)))|~element(X4,powerset(the_carrier(X2)))|~open_subset(X4,X2)),inference(split_conjunct,[status(thm)],[90])).
% fof(239, negated_conjecture,?[X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))&?[X2]:(element(X2,powerset(the_carrier(X1)))&?[X3]:(element(X3,the_carrier(X1))&((open_subset(X2,X1)&in(X3,X2))&~(point_neighbourhood(X2,X1,X3)))))),inference(fof_nnf,[status(thm)],[54])).
% fof(240, negated_conjecture,?[X4]:(((~(empty_carrier(X4))&topological_space(X4))&top_str(X4))&?[X5]:(element(X5,powerset(the_carrier(X4)))&?[X6]:(element(X6,the_carrier(X4))&((open_subset(X5,X4)&in(X6,X5))&~(point_neighbourhood(X5,X4,X6)))))),inference(variable_rename,[status(thm)],[239])).
% fof(241, negated_conjecture,(((~(empty_carrier(esk8_0))&topological_space(esk8_0))&top_str(esk8_0))&(element(esk9_0,powerset(the_carrier(esk8_0)))&(element(esk10_0,the_carrier(esk8_0))&((open_subset(esk9_0,esk8_0)&in(esk10_0,esk9_0))&~(point_neighbourhood(esk9_0,esk8_0,esk10_0)))))),inference(skolemize,[status(esa)],[240])).
% cnf(242,negated_conjecture,(~point_neighbourhood(esk9_0,esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[241])).
% cnf(243,negated_conjecture,(in(esk10_0,esk9_0)),inference(split_conjunct,[status(thm)],[241])).
% cnf(244,negated_conjecture,(open_subset(esk9_0,esk8_0)),inference(split_conjunct,[status(thm)],[241])).
% cnf(245,negated_conjecture,(element(esk10_0,the_carrier(esk8_0))),inference(split_conjunct,[status(thm)],[241])).
% cnf(246,negated_conjecture,(element(esk9_0,powerset(the_carrier(esk8_0)))),inference(split_conjunct,[status(thm)],[241])).
% cnf(247,negated_conjecture,(top_str(esk8_0)),inference(split_conjunct,[status(thm)],[241])).
% cnf(248,negated_conjecture,(topological_space(esk8_0)),inference(split_conjunct,[status(thm)],[241])).
% cnf(249,negated_conjecture,(~empty_carrier(esk8_0)),inference(split_conjunct,[status(thm)],[241])).
% cnf(451,negated_conjecture,(element(X1,powerset(the_carrier(esk8_0)))|empty_carrier(esk8_0)|~point_neighbourhood(X1,esk8_0,esk10_0)|~top_str(esk8_0)|~topological_space(esk8_0)),inference(pm,[status(thm)],[61,245,theory(equality)])).
% cnf(453,negated_conjecture,(element(X1,powerset(the_carrier(esk8_0)))|empty_carrier(esk8_0)|~point_neighbourhood(X1,esk8_0,esk10_0)|$false|~topological_space(esk8_0)),inference(rw,[status(thm)],[451,247,theory(equality)])).
% cnf(454,negated_conjecture,(element(X1,powerset(the_carrier(esk8_0)))|empty_carrier(esk8_0)|~point_neighbourhood(X1,esk8_0,esk10_0)|$false|$false),inference(rw,[status(thm)],[453,248,theory(equality)])).
% cnf(455,negated_conjecture,(element(X1,powerset(the_carrier(esk8_0)))|empty_carrier(esk8_0)|~point_neighbourhood(X1,esk8_0,esk10_0)),inference(cn,[status(thm)],[454,theory(equality)])).
% cnf(456,negated_conjecture,(element(X1,powerset(the_carrier(esk8_0)))|~point_neighbourhood(X1,esk8_0,esk10_0)),inference(sr,[status(thm)],[455,249,theory(equality)])).
% cnf(457,negated_conjecture,(point_neighbourhood(esk2_2(esk8_0,esk10_0),esk8_0,esk10_0)|empty_carrier(esk8_0)|~top_str(esk8_0)|~topological_space(esk8_0)),inference(pm,[status(thm)],[68,245,theory(equality)])).
% cnf(459,negated_conjecture,(point_neighbourhood(esk2_2(esk8_0,esk10_0),esk8_0,esk10_0)|empty_carrier(esk8_0)|$false|~topological_space(esk8_0)),inference(rw,[status(thm)],[457,247,theory(equality)])).
% cnf(460,negated_conjecture,(point_neighbourhood(esk2_2(esk8_0,esk10_0),esk8_0,esk10_0)|empty_carrier(esk8_0)|$false|$false),inference(rw,[status(thm)],[459,248,theory(equality)])).
% cnf(461,negated_conjecture,(point_neighbourhood(esk2_2(esk8_0,esk10_0),esk8_0,esk10_0)|empty_carrier(esk8_0)),inference(cn,[status(thm)],[460,theory(equality)])).
% cnf(462,negated_conjecture,(point_neighbourhood(esk2_2(esk8_0,esk10_0),esk8_0,esk10_0)),inference(sr,[status(thm)],[461,249,theory(equality)])).
% cnf(469,negated_conjecture,(interior(esk8_0,esk9_0)=esk9_0|~open_subset(esk9_0,esk8_0)|~element(X1,powerset(the_carrier(X2)))|~top_str(esk8_0)|~top_str(X2)|~topological_space(X2)),inference(pm,[status(thm)],[92,246,theory(equality)])).
% cnf(473,negated_conjecture,(interior(esk8_0,esk9_0)=esk9_0|$false|~element(X1,powerset(the_carrier(X2)))|~top_str(esk8_0)|~top_str(X2)|~topological_space(X2)),inference(rw,[status(thm)],[469,244,theory(equality)])).
% cnf(474,negated_conjecture,(interior(esk8_0,esk9_0)=esk9_0|$false|~element(X1,powerset(the_carrier(X2)))|$false|~top_str(X2)|~topological_space(X2)),inference(rw,[status(thm)],[473,247,theory(equality)])).
% cnf(475,negated_conjecture,(interior(esk8_0,esk9_0)=esk9_0|~element(X1,powerset(the_carrier(X2)))|~top_str(X2)|~topological_space(X2)),inference(cn,[status(thm)],[474,theory(equality)])).
% cnf(476,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,X1)|empty_carrier(esk8_0)|~element(X1,the_carrier(esk8_0))|~top_str(esk8_0)|~topological_space(esk8_0)|~in(X1,interior(esk8_0,esk9_0))),inference(pm,[status(thm)],[82,246,theory(equality)])).
% cnf(480,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,X1)|empty_carrier(esk8_0)|~element(X1,the_carrier(esk8_0))|$false|~topological_space(esk8_0)|~in(X1,interior(esk8_0,esk9_0))),inference(rw,[status(thm)],[476,247,theory(equality)])).
% cnf(481,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,X1)|empty_carrier(esk8_0)|~element(X1,the_carrier(esk8_0))|$false|$false|~in(X1,interior(esk8_0,esk9_0))),inference(rw,[status(thm)],[480,248,theory(equality)])).
% cnf(482,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,X1)|empty_carrier(esk8_0)|~element(X1,the_carrier(esk8_0))|~in(X1,interior(esk8_0,esk9_0))),inference(cn,[status(thm)],[481,theory(equality)])).
% cnf(483,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,X1)|~element(X1,the_carrier(esk8_0))|~in(X1,interior(esk8_0,esk9_0))),inference(sr,[status(thm)],[482,249,theory(equality)])).
% cnf(635,negated_conjecture,(element(esk2_2(esk8_0,esk10_0),powerset(the_carrier(esk8_0)))),inference(pm,[status(thm)],[456,462,theory(equality)])).
% cnf(1498,negated_conjecture,(interior(esk8_0,esk9_0)=esk9_0|~top_str(esk8_0)|~topological_space(esk8_0)),inference(pm,[status(thm)],[475,635,theory(equality)])).
% cnf(1506,negated_conjecture,(interior(esk8_0,esk9_0)=esk9_0|$false|~topological_space(esk8_0)),inference(rw,[status(thm)],[1498,247,theory(equality)])).
% cnf(1507,negated_conjecture,(interior(esk8_0,esk9_0)=esk9_0|$false|$false),inference(rw,[status(thm)],[1506,248,theory(equality)])).
% cnf(1508,negated_conjecture,(interior(esk8_0,esk9_0)=esk9_0),inference(cn,[status(thm)],[1507,theory(equality)])).
% cnf(1530,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,X1)|~element(X1,the_carrier(esk8_0))|~in(X1,esk9_0)),inference(rw,[status(thm)],[483,1508,theory(equality)])).
% cnf(1536,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,esk10_0)|~in(esk10_0,esk9_0)),inference(pm,[status(thm)],[1530,245,theory(equality)])).
% cnf(1539,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,esk10_0)|$false),inference(rw,[status(thm)],[1536,243,theory(equality)])).
% cnf(1540,negated_conjecture,(point_neighbourhood(esk9_0,esk8_0,esk10_0)),inference(cn,[status(thm)],[1539,theory(equality)])).
% cnf(1541,negated_conjecture,($false),inference(sr,[status(thm)],[1540,242,theory(equality)])).
% cnf(1542,negated_conjecture,($false),1541,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 549
% # ...of these trivial : 31
% # ...subsumed : 43
% # ...remaining for further processing: 475
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 29
% # Generated clauses : 920
% # ...of the previous two non-trivial : 739
% # Contextual simplify-reflections : 0
% # Paramodulations : 917
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 445
% # Positive orientable unit clauses: 88
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 343
% # Current number of unprocessed clauses: 159
% # ...number of literals in the above : 360
% # Clause-clause subsumption calls (NU) : 814
% # Rec. Clause-clause subsumption calls : 790
% # Unit Clause-clause subsumption calls : 168
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 64
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 265 leaves, 1.25+/-0.676 terms/leaf
% # Paramod-from index: 86 leaves, 1.16+/-0.568 terms/leaf
% # Paramod-into index: 185 leaves, 1.20+/-0.548 terms/leaf
% # -------------------------------------------------
% # User time : 0.051 s
% # System time : 0.007 s
% # Total time : 0.058 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.24 WC
% FINAL PrfWatch: 0.17 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP22287/SEU341+1.tptp
%
%------------------------------------------------------------------------------