TSTP Solution File: GEO126+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO126+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 04:38:14 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP18638/GEO126+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18638/GEO126+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18638/GEO126+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 18734
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X5]:?[X6]:(open(X6)&![X3]:(incident_o(X3,X5)<=>incident_c(X3,X6))),file('/tmp/SRASS.s.p', o2)).
% fof(4, axiom,![X5]:?[X3]:start_point(X3,X5),file('/tmp/SRASS.s.p', o4)).
% fof(9, axiom,![X3]:![X5]:(start_point(X3,X5)<=>(incident_o(X3,X5)&![X4]:((~(X3=X4)&incident_o(X4,X5))=>ordered_by(X5,X3,X4)))),file('/tmp/SRASS.s.p', start_point_defn)).
% fof(14, axiom,![X6]:?[X3]:inner_point(X3,X6),file('/tmp/SRASS.s.p', c3)).
% fof(15, axiom,![X3]:![X6]:(end_point(X3,X6)<=>(incident_c(X3,X6)&![X8]:![X9]:((((part_of(X8,X6)&part_of(X9,X6))&incident_c(X3,X8))&incident_c(X3,X9))=>(part_of(X8,X9)|part_of(X9,X8))))),file('/tmp/SRASS.s.p', end_point_defn)).
% fof(20, axiom,![X6]:(open(X6)<=>?[X3]:end_point(X3,X6)),file('/tmp/SRASS.s.p', open_defn)).
% fof(23, axiom,![X3]:![X6]:(inner_point(X3,X6)<=>(incident_c(X3,X6)&~(end_point(X3,X6)))),file('/tmp/SRASS.s.p', inner_point_defn)).
% fof(28, conjecture,![X5]:?[X3]:?[X4]:(ordered_by(X5,X3,X4)&~(X3=X4)),file('/tmp/SRASS.s.p', theorem_4_11)).
% fof(29, negated_conjecture,~(![X5]:?[X3]:?[X4]:(ordered_by(X5,X3,X4)&~(X3=X4))),inference(assume_negation,[status(cth)],[28])).
% fof(30, plain,![X3]:![X6]:(inner_point(X3,X6)<=>(incident_c(X3,X6)&~(end_point(X3,X6)))),inference(fof_simplification,[status(thm)],[23,theory(equality)])).
% fof(42, plain,![X5]:?[X6]:(open(X6)&![X3]:((~(incident_o(X3,X5))|incident_c(X3,X6))&(~(incident_c(X3,X6))|incident_o(X3,X5)))),inference(fof_nnf,[status(thm)],[3])).
% fof(43, plain,![X7]:?[X8]:(open(X8)&![X9]:((~(incident_o(X9,X7))|incident_c(X9,X8))&(~(incident_c(X9,X8))|incident_o(X9,X7)))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X7]:(open(esk3_1(X7))&![X9]:((~(incident_o(X9,X7))|incident_c(X9,esk3_1(X7)))&(~(incident_c(X9,esk3_1(X7)))|incident_o(X9,X7)))),inference(skolemize,[status(esa)],[43])).
% fof(45, plain,![X7]:![X9]:(((~(incident_o(X9,X7))|incident_c(X9,esk3_1(X7)))&(~(incident_c(X9,esk3_1(X7)))|incident_o(X9,X7)))&open(esk3_1(X7))),inference(shift_quantors,[status(thm)],[44])).
% cnf(46,plain,(open(esk3_1(X1))),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,plain,(incident_o(X1,X2)|~incident_c(X1,esk3_1(X2))),inference(split_conjunct,[status(thm)],[45])).
% fof(49, plain,![X6]:?[X7]:start_point(X7,X6),inference(variable_rename,[status(thm)],[4])).
% fof(50, plain,![X6]:start_point(esk4_1(X6),X6),inference(skolemize,[status(esa)],[49])).
% cnf(51,plain,(start_point(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(76, plain,![X3]:![X5]:((~(start_point(X3,X5))|(incident_o(X3,X5)&![X4]:((X3=X4|~(incident_o(X4,X5)))|ordered_by(X5,X3,X4))))&((~(incident_o(X3,X5))|?[X4]:((~(X3=X4)&incident_o(X4,X5))&~(ordered_by(X5,X3,X4))))|start_point(X3,X5))),inference(fof_nnf,[status(thm)],[9])).
% fof(77, plain,![X6]:![X7]:((~(start_point(X6,X7))|(incident_o(X6,X7)&![X8]:((X6=X8|~(incident_o(X8,X7)))|ordered_by(X7,X6,X8))))&((~(incident_o(X6,X7))|?[X9]:((~(X6=X9)&incident_o(X9,X7))&~(ordered_by(X7,X6,X9))))|start_point(X6,X7))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X6]:![X7]:((~(start_point(X6,X7))|(incident_o(X6,X7)&![X8]:((X6=X8|~(incident_o(X8,X7)))|ordered_by(X7,X6,X8))))&((~(incident_o(X6,X7))|((~(X6=esk7_2(X6,X7))&incident_o(esk7_2(X6,X7),X7))&~(ordered_by(X7,X6,esk7_2(X6,X7)))))|start_point(X6,X7))),inference(skolemize,[status(esa)],[77])).
% fof(79, plain,![X6]:![X7]:![X8]:(((((X6=X8|~(incident_o(X8,X7)))|ordered_by(X7,X6,X8))&incident_o(X6,X7))|~(start_point(X6,X7)))&((~(incident_o(X6,X7))|((~(X6=esk7_2(X6,X7))&incident_o(esk7_2(X6,X7),X7))&~(ordered_by(X7,X6,esk7_2(X6,X7)))))|start_point(X6,X7))),inference(shift_quantors,[status(thm)],[78])).
% fof(80, plain,![X6]:![X7]:![X8]:(((((X6=X8|~(incident_o(X8,X7)))|ordered_by(X7,X6,X8))|~(start_point(X6,X7)))&(incident_o(X6,X7)|~(start_point(X6,X7))))&((((~(X6=esk7_2(X6,X7))|~(incident_o(X6,X7)))|start_point(X6,X7))&((incident_o(esk7_2(X6,X7),X7)|~(incident_o(X6,X7)))|start_point(X6,X7)))&((~(ordered_by(X7,X6,esk7_2(X6,X7)))|~(incident_o(X6,X7)))|start_point(X6,X7)))),inference(distribute,[status(thm)],[79])).
% cnf(85,plain,(ordered_by(X2,X1,X3)|X1=X3|~start_point(X1,X2)|~incident_o(X3,X2)),inference(split_conjunct,[status(thm)],[80])).
% fof(118, plain,![X7]:?[X8]:inner_point(X8,X7),inference(variable_rename,[status(thm)],[14])).
% fof(119, plain,![X7]:inner_point(esk11_1(X7),X7),inference(skolemize,[status(esa)],[118])).
% cnf(120,plain,(inner_point(esk11_1(X1),X1)),inference(split_conjunct,[status(thm)],[119])).
% fof(121, plain,![X3]:![X6]:((~(end_point(X3,X6))|(incident_c(X3,X6)&![X8]:![X9]:((((~(part_of(X8,X6))|~(part_of(X9,X6)))|~(incident_c(X3,X8)))|~(incident_c(X3,X9)))|(part_of(X8,X9)|part_of(X9,X8)))))&((~(incident_c(X3,X6))|?[X8]:?[X9]:((((part_of(X8,X6)&part_of(X9,X6))&incident_c(X3,X8))&incident_c(X3,X9))&(~(part_of(X8,X9))&~(part_of(X9,X8)))))|end_point(X3,X6))),inference(fof_nnf,[status(thm)],[15])).
% fof(122, plain,![X10]:![X11]:((~(end_point(X10,X11))|(incident_c(X10,X11)&![X12]:![X13]:((((~(part_of(X12,X11))|~(part_of(X13,X11)))|~(incident_c(X10,X12)))|~(incident_c(X10,X13)))|(part_of(X12,X13)|part_of(X13,X12)))))&((~(incident_c(X10,X11))|?[X14]:?[X15]:((((part_of(X14,X11)&part_of(X15,X11))&incident_c(X10,X14))&incident_c(X10,X15))&(~(part_of(X14,X15))&~(part_of(X15,X14)))))|end_point(X10,X11))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X10]:![X11]:((~(end_point(X10,X11))|(incident_c(X10,X11)&![X12]:![X13]:((((~(part_of(X12,X11))|~(part_of(X13,X11)))|~(incident_c(X10,X12)))|~(incident_c(X10,X13)))|(part_of(X12,X13)|part_of(X13,X12)))))&((~(incident_c(X10,X11))|((((part_of(esk12_2(X10,X11),X11)&part_of(esk13_2(X10,X11),X11))&incident_c(X10,esk12_2(X10,X11)))&incident_c(X10,esk13_2(X10,X11)))&(~(part_of(esk12_2(X10,X11),esk13_2(X10,X11)))&~(part_of(esk13_2(X10,X11),esk12_2(X10,X11))))))|end_point(X10,X11))),inference(skolemize,[status(esa)],[122])).
% fof(124, plain,![X10]:![X11]:![X12]:![X13]:(((((((~(part_of(X12,X11))|~(part_of(X13,X11)))|~(incident_c(X10,X12)))|~(incident_c(X10,X13)))|(part_of(X12,X13)|part_of(X13,X12)))&incident_c(X10,X11))|~(end_point(X10,X11)))&((~(incident_c(X10,X11))|((((part_of(esk12_2(X10,X11),X11)&part_of(esk13_2(X10,X11),X11))&incident_c(X10,esk12_2(X10,X11)))&incident_c(X10,esk13_2(X10,X11)))&(~(part_of(esk12_2(X10,X11),esk13_2(X10,X11)))&~(part_of(esk13_2(X10,X11),esk12_2(X10,X11))))))|end_point(X10,X11))),inference(shift_quantors,[status(thm)],[123])).
% fof(125, plain,![X10]:![X11]:![X12]:![X13]:(((((((~(part_of(X12,X11))|~(part_of(X13,X11)))|~(incident_c(X10,X12)))|~(incident_c(X10,X13)))|(part_of(X12,X13)|part_of(X13,X12)))|~(end_point(X10,X11)))&(incident_c(X10,X11)|~(end_point(X10,X11))))&((((((part_of(esk12_2(X10,X11),X11)|~(incident_c(X10,X11)))|end_point(X10,X11))&((part_of(esk13_2(X10,X11),X11)|~(incident_c(X10,X11)))|end_point(X10,X11)))&((incident_c(X10,esk12_2(X10,X11))|~(incident_c(X10,X11)))|end_point(X10,X11)))&((incident_c(X10,esk13_2(X10,X11))|~(incident_c(X10,X11)))|end_point(X10,X11)))&(((~(part_of(esk12_2(X10,X11),esk13_2(X10,X11)))|~(incident_c(X10,X11)))|end_point(X10,X11))&((~(part_of(esk13_2(X10,X11),esk12_2(X10,X11)))|~(incident_c(X10,X11)))|end_point(X10,X11))))),inference(distribute,[status(thm)],[124])).
% cnf(132,plain,(incident_c(X1,X2)|~end_point(X1,X2)),inference(split_conjunct,[status(thm)],[125])).
% fof(160, plain,![X6]:((~(open(X6))|?[X3]:end_point(X3,X6))&(![X3]:~(end_point(X3,X6))|open(X6))),inference(fof_nnf,[status(thm)],[20])).
% fof(161, plain,![X7]:((~(open(X7))|?[X8]:end_point(X8,X7))&(![X9]:~(end_point(X9,X7))|open(X7))),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,![X7]:((~(open(X7))|end_point(esk17_1(X7),X7))&(![X9]:~(end_point(X9,X7))|open(X7))),inference(skolemize,[status(esa)],[161])).
% fof(163, plain,![X7]:![X9]:((~(end_point(X9,X7))|open(X7))&(~(open(X7))|end_point(esk17_1(X7),X7))),inference(shift_quantors,[status(thm)],[162])).
% cnf(164,plain,(end_point(esk17_1(X1),X1)|~open(X1)),inference(split_conjunct,[status(thm)],[163])).
% fof(182, plain,![X3]:![X6]:((~(inner_point(X3,X6))|(incident_c(X3,X6)&~(end_point(X3,X6))))&((~(incident_c(X3,X6))|end_point(X3,X6))|inner_point(X3,X6))),inference(fof_nnf,[status(thm)],[30])).
% fof(183, plain,![X7]:![X8]:((~(inner_point(X7,X8))|(incident_c(X7,X8)&~(end_point(X7,X8))))&((~(incident_c(X7,X8))|end_point(X7,X8))|inner_point(X7,X8))),inference(variable_rename,[status(thm)],[182])).
% fof(184, plain,![X7]:![X8]:(((incident_c(X7,X8)|~(inner_point(X7,X8)))&(~(end_point(X7,X8))|~(inner_point(X7,X8))))&((~(incident_c(X7,X8))|end_point(X7,X8))|inner_point(X7,X8))),inference(distribute,[status(thm)],[183])).
% cnf(186,plain,(~inner_point(X1,X2)|~end_point(X1,X2)),inference(split_conjunct,[status(thm)],[184])).
% cnf(187,plain,(incident_c(X1,X2)|~inner_point(X1,X2)),inference(split_conjunct,[status(thm)],[184])).
% fof(221, negated_conjecture,?[X5]:![X3]:![X4]:(~(ordered_by(X5,X3,X4))|X3=X4),inference(fof_nnf,[status(thm)],[29])).
% fof(222, negated_conjecture,?[X6]:![X7]:![X8]:(~(ordered_by(X6,X7,X8))|X7=X8),inference(variable_rename,[status(thm)],[221])).
% fof(223, negated_conjecture,![X7]:![X8]:(~(ordered_by(esk25_0,X7,X8))|X7=X8),inference(skolemize,[status(esa)],[222])).
% cnf(224,negated_conjecture,(X1=X2|~ordered_by(esk25_0,X1,X2)),inference(split_conjunct,[status(thm)],[223])).
% cnf(229,plain,(incident_c(esk11_1(X1),X1)),inference(spm,[status(thm)],[187,120,theory(equality)])).
% cnf(234,plain,(incident_c(esk17_1(X1),X1)|~open(X1)),inference(spm,[status(thm)],[132,164,theory(equality)])).
% cnf(240,negated_conjecture,(X1=X2|~start_point(X1,esk25_0)|~incident_o(X2,esk25_0)),inference(spm,[status(thm)],[224,85,theory(equality)])).
% cnf(391,plain,(incident_o(esk11_1(esk3_1(X1)),X1)),inference(spm,[status(thm)],[47,229,theory(equality)])).
% cnf(409,plain,(incident_o(esk17_1(esk3_1(X1)),X1)|~open(esk3_1(X1))),inference(spm,[status(thm)],[47,234,theory(equality)])).
% cnf(411,plain,(incident_o(esk17_1(esk3_1(X1)),X1)|$false),inference(rw,[status(thm)],[409,46,theory(equality)])).
% cnf(412,plain,(incident_o(esk17_1(esk3_1(X1)),X1)),inference(cn,[status(thm)],[411,theory(equality)])).
% cnf(428,negated_conjecture,(esk4_1(esk25_0)=X1|~incident_o(X1,esk25_0)),inference(spm,[status(thm)],[240,51,theory(equality)])).
% cnf(430,negated_conjecture,(esk4_1(esk25_0)=esk17_1(esk3_1(esk25_0))),inference(spm,[status(thm)],[428,412,theory(equality)])).
% cnf(432,negated_conjecture,(esk4_1(esk25_0)=esk11_1(esk3_1(esk25_0))),inference(spm,[status(thm)],[428,391,theory(equality)])).
% cnf(435,negated_conjecture,(end_point(esk4_1(esk25_0),esk3_1(esk25_0))|~open(esk3_1(esk25_0))),inference(spm,[status(thm)],[164,430,theory(equality)])).
% cnf(439,negated_conjecture,(end_point(esk4_1(esk25_0),esk3_1(esk25_0))|$false),inference(rw,[status(thm)],[435,46,theory(equality)])).
% cnf(440,negated_conjecture,(end_point(esk4_1(esk25_0),esk3_1(esk25_0))),inference(cn,[status(thm)],[439,theory(equality)])).
% cnf(446,negated_conjecture,(inner_point(esk4_1(esk25_0),esk3_1(esk25_0))),inference(spm,[status(thm)],[120,432,theory(equality)])).
% cnf(461,negated_conjecture,(~end_point(esk4_1(esk25_0),esk3_1(esk25_0))),inference(spm,[status(thm)],[186,446,theory(equality)])).
% cnf(464,negated_conjecture,($false),inference(rw,[status(thm)],[461,440,theory(equality)])).
% cnf(465,negated_conjecture,($false),inference(cn,[status(thm)],[464,theory(equality)])).
% cnf(466,negated_conjecture,($false),465,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 205
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 202
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 220
% # ...of the previous two non-trivial : 183
% # Contextual simplify-reflections : 2
% # Paramodulations : 203
% # Factorizations : 10
% # Equation resolutions : 7
% # Current number of processed clauses: 115
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 94
% # Current number of unprocessed clauses: 150
% # ...number of literals in the above : 650
% # Clause-clause subsumption calls (NU) : 484
% # Rec. Clause-clause subsumption calls : 286
% # Unit Clause-clause subsumption calls : 171
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 101 leaves, 1.92+/-2.179 terms/leaf
% # Paramod-from index: 46 leaves, 1.15+/-0.415 terms/leaf
% # Paramod-into index: 95 leaves, 1.46+/-1.131 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.003 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP18638/GEO126+1.tptp
%
%------------------------------------------------------------------------------