TSTP Solution File: SEU323+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU323+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:36:52 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP6400/SEU323+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6400/SEU323+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6400/SEU323+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 6532
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((top_str(X1)&element(X2,powerset(the_carrier(X1))))=>element(interior(X1,X2),powerset(the_carrier(X1)))),file('/tmp/SRASS.s.p', dt_k1_tops_1)).
% fof(6, axiom,![X1]:![X2]:((((topological_space(X1)&top_str(X1))&closed_subset(X2,X1))&element(X2,powerset(the_carrier(X1))))=>open_subset(subset_complement(the_carrier(X1),X2),X1)),file('/tmp/SRASS.s.p', fc3_tops_1)).
% fof(7, axiom,![X1]:![X2]:((top_str(X1)&element(X2,powerset(the_carrier(X1))))=>element(topstr_closure(X1,X2),powerset(the_carrier(X1)))),file('/tmp/SRASS.s.p', dt_k6_pre_topc)).
% fof(9, axiom,![X1]:![X2]:(((topological_space(X1)&top_str(X1))&element(X2,powerset(the_carrier(X1))))=>closed_subset(topstr_closure(X1,X2),X1)),file('/tmp/SRASS.s.p', fc2_tops_1)).
% fof(10, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>element(subset_complement(X1,X2),powerset(X1))),file('/tmp/SRASS.s.p', dt_k3_subset_1)).
% fof(11, axiom,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>interior(X1,X2)=subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))))),file('/tmp/SRASS.s.p', d1_tops_1)).
% fof(16, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,subset_complement(X1,X2))=X2),file('/tmp/SRASS.s.p', involutiveness_k3_subset_1)).
% fof(21, conjecture,![X1]:((topological_space(X1)&top_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>open_subset(interior(X1,X2),X1))),file('/tmp/SRASS.s.p', t51_tops_1)).
% fof(22, negated_conjecture,~(![X1]:((topological_space(X1)&top_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>open_subset(interior(X1,X2),X1)))),inference(assume_negation,[status(cth)],[21])).
% fof(29, plain,![X1]:![X2]:((~(top_str(X1))|~(element(X2,powerset(the_carrier(X1)))))|element(interior(X1,X2),powerset(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(30, plain,![X3]:![X4]:((~(top_str(X3))|~(element(X4,powerset(the_carrier(X3)))))|element(interior(X3,X4),powerset(the_carrier(X3)))),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(element(interior(X1,X2),powerset(the_carrier(X1)))|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(44, plain,![X1]:![X2]:((((~(topological_space(X1))|~(top_str(X1)))|~(closed_subset(X2,X1)))|~(element(X2,powerset(the_carrier(X1)))))|open_subset(subset_complement(the_carrier(X1),X2),X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(45, plain,![X3]:![X4]:((((~(topological_space(X3))|~(top_str(X3)))|~(closed_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3)))))|open_subset(subset_complement(the_carrier(X3),X4),X3)),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(open_subset(subset_complement(the_carrier(X1),X2),X1)|~element(X2,powerset(the_carrier(X1)))|~closed_subset(X2,X1)|~top_str(X1)|~topological_space(X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X1]:![X2]:((~(top_str(X1))|~(element(X2,powerset(the_carrier(X1)))))|element(topstr_closure(X1,X2),powerset(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(48, plain,![X3]:![X4]:((~(top_str(X3))|~(element(X4,powerset(the_carrier(X3)))))|element(topstr_closure(X3,X4),powerset(the_carrier(X3)))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(element(topstr_closure(X1,X2),powerset(the_carrier(X1)))|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(53, plain,![X1]:![X2]:(((~(topological_space(X1))|~(top_str(X1)))|~(element(X2,powerset(the_carrier(X1)))))|closed_subset(topstr_closure(X1,X2),X1)),inference(fof_nnf,[status(thm)],[9])).
% fof(54, plain,![X3]:![X4]:(((~(topological_space(X3))|~(top_str(X3)))|~(element(X4,powerset(the_carrier(X3)))))|closed_subset(topstr_closure(X3,X4),X3)),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(closed_subset(topstr_closure(X1,X2),X1)|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)|~topological_space(X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|element(subset_complement(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(57, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|element(subset_complement(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:(~(top_str(X1))|![X2]:(~(element(X2,powerset(the_carrier(X1))))|interior(X1,X2)=subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))))),inference(fof_nnf,[status(thm)],[11])).
% fof(60, plain,![X3]:(~(top_str(X3))|![X4]:(~(element(X4,powerset(the_carrier(X3))))|interior(X3,X4)=subset_complement(the_carrier(X3),topstr_closure(X3,subset_complement(the_carrier(X3),X4))))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X3]:![X4]:((~(element(X4,powerset(the_carrier(X3))))|interior(X3,X4)=subset_complement(the_carrier(X3),topstr_closure(X3,subset_complement(the_carrier(X3),X4))))|~(top_str(X3))),inference(shift_quantors,[status(thm)],[60])).
% cnf(62,plain,(interior(X1,X2)=subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2)))|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(split_conjunct,[status(thm)],[61])).
% fof(75, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,subset_complement(X1,X2))=X2),inference(fof_nnf,[status(thm)],[16])).
% fof(76, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,subset_complement(X3,X4))=X4),inference(variable_rename,[status(thm)],[75])).
% cnf(77,plain,(subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[76])).
% fof(82, negated_conjecture,?[X1]:((topological_space(X1)&top_str(X1))&?[X2]:(element(X2,powerset(the_carrier(X1)))&~(open_subset(interior(X1,X2),X1)))),inference(fof_nnf,[status(thm)],[22])).
% fof(83, negated_conjecture,?[X3]:((topological_space(X3)&top_str(X3))&?[X4]:(element(X4,powerset(the_carrier(X3)))&~(open_subset(interior(X3,X4),X3)))),inference(variable_rename,[status(thm)],[82])).
% fof(84, negated_conjecture,((topological_space(esk6_0)&top_str(esk6_0))&(element(esk7_0,powerset(the_carrier(esk6_0)))&~(open_subset(interior(esk6_0,esk7_0),esk6_0)))),inference(skolemize,[status(esa)],[83])).
% cnf(85,negated_conjecture,(~open_subset(interior(esk6_0,esk7_0),esk6_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(86,negated_conjecture,(element(esk7_0,powerset(the_carrier(esk6_0)))),inference(split_conjunct,[status(thm)],[84])).
% cnf(87,negated_conjecture,(top_str(esk6_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(88,negated_conjecture,(topological_space(esk6_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(92,plain,(open_subset(X2,X1)|~closed_subset(subset_complement(the_carrier(X1),X2),X1)|~topological_space(X1)|~element(subset_complement(the_carrier(X1),X2),powerset(the_carrier(X1)))|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(spm,[status(thm)],[46,77,theory(equality)])).
% cnf(93,plain,(subset_complement(the_carrier(X1),interior(X1,X2))=topstr_closure(X1,subset_complement(the_carrier(X1),X2))|~element(topstr_closure(X1,subset_complement(the_carrier(X1),X2)),powerset(the_carrier(X1)))|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)),inference(spm,[status(thm)],[77,62,theory(equality)])).
% cnf(105,plain,(open_subset(X2,X1)|~closed_subset(subset_complement(the_carrier(X1),X2),X1)|~topological_space(X1)|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)),inference(csr,[status(thm)],[92,58])).
% cnf(117,plain,(topstr_closure(X1,subset_complement(the_carrier(X1),X2))=subset_complement(the_carrier(X1),interior(X1,X2))|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)|~element(subset_complement(the_carrier(X1),X2),powerset(the_carrier(X1)))),inference(spm,[status(thm)],[93,49,theory(equality)])).
% cnf(121,plain,(topstr_closure(X1,subset_complement(the_carrier(X1),X2))=subset_complement(the_carrier(X1),interior(X1,X2))|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)),inference(csr,[status(thm)],[117,58])).
% cnf(122,plain,(closed_subset(subset_complement(the_carrier(X1),interior(X1,X2)),X1)|~topological_space(X1)|~element(subset_complement(the_carrier(X1),X2),powerset(the_carrier(X1)))|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(spm,[status(thm)],[55,121,theory(equality)])).
% cnf(140,plain,(closed_subset(subset_complement(the_carrier(X1),interior(X1,X2)),X1)|~topological_space(X1)|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)),inference(csr,[status(thm)],[122,58])).
% cnf(141,plain,(open_subset(interior(X1,X2),X1)|~topological_space(X1)|~element(interior(X1,X2),powerset(the_carrier(X1)))|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(spm,[status(thm)],[105,140,theory(equality)])).
% cnf(143,plain,(open_subset(interior(X1,X2),X1)|~topological_space(X1)|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)),inference(csr,[status(thm)],[141,31])).
% cnf(144,negated_conjecture,(~topological_space(esk6_0)|~element(esk7_0,powerset(the_carrier(esk6_0)))|~top_str(esk6_0)),inference(spm,[status(thm)],[85,143,theory(equality)])).
% cnf(146,negated_conjecture,($false|~element(esk7_0,powerset(the_carrier(esk6_0)))|~top_str(esk6_0)),inference(rw,[status(thm)],[144,88,theory(equality)])).
% cnf(147,negated_conjecture,($false|$false|~top_str(esk6_0)),inference(rw,[status(thm)],[146,86,theory(equality)])).
% cnf(148,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[147,87,theory(equality)])).
% cnf(149,negated_conjecture,($false),inference(cn,[status(thm)],[148,theory(equality)])).
% cnf(150,negated_conjecture,($false),149,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 62
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 57
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 44
% # ...of the previous two non-trivial : 38
% # Contextual simplify-reflections : 13
% # Paramodulations : 44
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 33
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 20
% # ...number of literals in the above : 97
% # Clause-clause subsumption calls (NU) : 89
% # Rec. Clause-clause subsumption calls : 75
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 54 leaves, 1.26+/-0.479 terms/leaf
% # Paramod-from index: 28 leaves, 1.04+/-0.186 terms/leaf
% # Paramod-into index: 48 leaves, 1.10+/-0.305 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.003 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP6400/SEU323+1.tptp
%
%------------------------------------------------------------------------------