TSTP Solution File: GEO111+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO111+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 : art05.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:32:31 EST 2010

% Result   : Theorem 0.92s
% Output   : Solution 0.92s
% 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/SystemOnTPTP20298/GEO111+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP20298/GEO111+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20298/GEO111+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 20394
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:![X2]:(part_of(X2,X1)<=>![X3]:(incident_c(X3,X2)=>incident_c(X3,X1))),file('/tmp/SRASS.s.p', part_of_defn)).
% fof(7, axiom,![X1]:![X3]:![X5]:![X6]:(between_c(X1,X3,X5,X6)<=>(~(X3=X6)&?[X7]:(((part_of(X7,X1)&end_point(X3,X7))&end_point(X6,X7))&inner_point(X5,X7)))),file('/tmp/SRASS.s.p', between_c_defn)).
% fof(8, axiom,![X3]:![X1]:(end_point(X3,X1)<=>(incident_c(X3,X1)&![X2]:![X4]:((((part_of(X2,X1)&part_of(X4,X1))&incident_c(X3,X2))&incident_c(X3,X4))=>(part_of(X2,X4)|part_of(X4,X2))))),file('/tmp/SRASS.s.p', end_point_defn)).
% fof(9, axiom,![X3]:![X1]:(inner_point(X3,X1)<=>(incident_c(X3,X1)&~(end_point(X3,X1)))),file('/tmp/SRASS.s.p', inner_point_defn)).
% fof(18, conjecture,![X1]:![X3]:![X5]:![X6]:(between_c(X1,X3,X5,X6)=>(((((incident_c(X3,X1)&incident_c(X5,X1))&incident_c(X6,X1))&~(X3=X5))&~(X5=X6))&~(X3=X6))),file('/tmp/SRASS.s.p', theorem_3_8_1)).
% fof(19, negated_conjecture,~(![X1]:![X3]:![X5]:![X6]:(between_c(X1,X3,X5,X6)=>(((((incident_c(X3,X1)&incident_c(X5,X1))&incident_c(X6,X1))&~(X3=X5))&~(X5=X6))&~(X3=X6)))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X3]:![X1]:(inner_point(X3,X1)<=>(incident_c(X3,X1)&~(end_point(X3,X1)))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(50, plain,![X1]:![X2]:((~(part_of(X2,X1))|![X3]:(~(incident_c(X3,X2))|incident_c(X3,X1)))&(?[X3]:(incident_c(X3,X2)&~(incident_c(X3,X1)))|part_of(X2,X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(51, plain,![X4]:![X5]:((~(part_of(X5,X4))|![X6]:(~(incident_c(X6,X5))|incident_c(X6,X4)))&(?[X7]:(incident_c(X7,X5)&~(incident_c(X7,X4)))|part_of(X5,X4))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:((~(part_of(X5,X4))|![X6]:(~(incident_c(X6,X5))|incident_c(X6,X4)))&((incident_c(esk5_2(X4,X5),X5)&~(incident_c(esk5_2(X4,X5),X4)))|part_of(X5,X4))),inference(skolemize,[status(esa)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:(((~(incident_c(X6,X5))|incident_c(X6,X4))|~(part_of(X5,X4)))&((incident_c(esk5_2(X4,X5),X5)&~(incident_c(esk5_2(X4,X5),X4)))|part_of(X5,X4))),inference(shift_quantors,[status(thm)],[52])).
% fof(54, plain,![X4]:![X5]:![X6]:(((~(incident_c(X6,X5))|incident_c(X6,X4))|~(part_of(X5,X4)))&((incident_c(esk5_2(X4,X5),X5)|part_of(X5,X4))&(~(incident_c(esk5_2(X4,X5),X4))|part_of(X5,X4)))),inference(distribute,[status(thm)],[53])).
% cnf(57,plain,(incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(58, plain,![X1]:![X3]:![X5]:![X6]:((~(between_c(X1,X3,X5,X6))|(~(X3=X6)&?[X7]:(((part_of(X7,X1)&end_point(X3,X7))&end_point(X6,X7))&inner_point(X5,X7))))&((X3=X6|![X7]:(((~(part_of(X7,X1))|~(end_point(X3,X7)))|~(end_point(X6,X7)))|~(inner_point(X5,X7))))|between_c(X1,X3,X5,X6))),inference(fof_nnf,[status(thm)],[7])).
% fof(59, plain,![X8]:![X9]:![X10]:![X11]:((~(between_c(X8,X9,X10,X11))|(~(X9=X11)&?[X12]:(((part_of(X12,X8)&end_point(X9,X12))&end_point(X11,X12))&inner_point(X10,X12))))&((X9=X11|![X13]:(((~(part_of(X13,X8))|~(end_point(X9,X13)))|~(end_point(X11,X13)))|~(inner_point(X10,X13))))|between_c(X8,X9,X10,X11))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X8]:![X9]:![X10]:![X11]:((~(between_c(X8,X9,X10,X11))|(~(X9=X11)&(((part_of(esk6_4(X8,X9,X10,X11),X8)&end_point(X9,esk6_4(X8,X9,X10,X11)))&end_point(X11,esk6_4(X8,X9,X10,X11)))&inner_point(X10,esk6_4(X8,X9,X10,X11)))))&((X9=X11|![X13]:(((~(part_of(X13,X8))|~(end_point(X9,X13)))|~(end_point(X11,X13)))|~(inner_point(X10,X13))))|between_c(X8,X9,X10,X11))),inference(skolemize,[status(esa)],[59])).
% fof(61, plain,![X8]:![X9]:![X10]:![X11]:![X13]:((((((~(part_of(X13,X8))|~(end_point(X9,X13)))|~(end_point(X11,X13)))|~(inner_point(X10,X13)))|X9=X11)|between_c(X8,X9,X10,X11))&(~(between_c(X8,X9,X10,X11))|(~(X9=X11)&(((part_of(esk6_4(X8,X9,X10,X11),X8)&end_point(X9,esk6_4(X8,X9,X10,X11)))&end_point(X11,esk6_4(X8,X9,X10,X11)))&inner_point(X10,esk6_4(X8,X9,X10,X11)))))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X8]:![X9]:![X10]:![X11]:![X13]:((((((~(part_of(X13,X8))|~(end_point(X9,X13)))|~(end_point(X11,X13)))|~(inner_point(X10,X13)))|X9=X11)|between_c(X8,X9,X10,X11))&((~(X9=X11)|~(between_c(X8,X9,X10,X11)))&((((part_of(esk6_4(X8,X9,X10,X11),X8)|~(between_c(X8,X9,X10,X11)))&(end_point(X9,esk6_4(X8,X9,X10,X11))|~(between_c(X8,X9,X10,X11))))&(end_point(X11,esk6_4(X8,X9,X10,X11))|~(between_c(X8,X9,X10,X11))))&(inner_point(X10,esk6_4(X8,X9,X10,X11))|~(between_c(X8,X9,X10,X11)))))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(inner_point(X3,esk6_4(X1,X2,X3,X4))|~between_c(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(end_point(X4,esk6_4(X1,X2,X3,X4))|~between_c(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,(end_point(X2,esk6_4(X1,X2,X3,X4))|~between_c(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,plain,(part_of(esk6_4(X1,X2,X3,X4),X1)|~between_c(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[62])).
% cnf(67,plain,(~between_c(X1,X2,X3,X4)|X2!=X4),inference(split_conjunct,[status(thm)],[62])).
% fof(69, plain,![X3]:![X1]:((~(end_point(X3,X1))|(incident_c(X3,X1)&![X2]:![X4]:((((~(part_of(X2,X1))|~(part_of(X4,X1)))|~(incident_c(X3,X2)))|~(incident_c(X3,X4)))|(part_of(X2,X4)|part_of(X4,X2)))))&((~(incident_c(X3,X1))|?[X2]:?[X4]:((((part_of(X2,X1)&part_of(X4,X1))&incident_c(X3,X2))&incident_c(X3,X4))&(~(part_of(X2,X4))&~(part_of(X4,X2)))))|end_point(X3,X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(70, plain,![X5]:![X6]:((~(end_point(X5,X6))|(incident_c(X5,X6)&![X7]:![X8]:((((~(part_of(X7,X6))|~(part_of(X8,X6)))|~(incident_c(X5,X7)))|~(incident_c(X5,X8)))|(part_of(X7,X8)|part_of(X8,X7)))))&((~(incident_c(X5,X6))|?[X9]:?[X10]:((((part_of(X9,X6)&part_of(X10,X6))&incident_c(X5,X9))&incident_c(X5,X10))&(~(part_of(X9,X10))&~(part_of(X10,X9)))))|end_point(X5,X6))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X5]:![X6]:((~(end_point(X5,X6))|(incident_c(X5,X6)&![X7]:![X8]:((((~(part_of(X7,X6))|~(part_of(X8,X6)))|~(incident_c(X5,X7)))|~(incident_c(X5,X8)))|(part_of(X7,X8)|part_of(X8,X7)))))&((~(incident_c(X5,X6))|((((part_of(esk7_2(X5,X6),X6)&part_of(esk8_2(X5,X6),X6))&incident_c(X5,esk7_2(X5,X6)))&incident_c(X5,esk8_2(X5,X6)))&(~(part_of(esk7_2(X5,X6),esk8_2(X5,X6)))&~(part_of(esk8_2(X5,X6),esk7_2(X5,X6))))))|end_point(X5,X6))),inference(skolemize,[status(esa)],[70])).
% fof(72, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(part_of(X7,X6))|~(part_of(X8,X6)))|~(incident_c(X5,X7)))|~(incident_c(X5,X8)))|(part_of(X7,X8)|part_of(X8,X7)))&incident_c(X5,X6))|~(end_point(X5,X6)))&((~(incident_c(X5,X6))|((((part_of(esk7_2(X5,X6),X6)&part_of(esk8_2(X5,X6),X6))&incident_c(X5,esk7_2(X5,X6)))&incident_c(X5,esk8_2(X5,X6)))&(~(part_of(esk7_2(X5,X6),esk8_2(X5,X6)))&~(part_of(esk8_2(X5,X6),esk7_2(X5,X6))))))|end_point(X5,X6))),inference(shift_quantors,[status(thm)],[71])).
% fof(73, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(part_of(X7,X6))|~(part_of(X8,X6)))|~(incident_c(X5,X7)))|~(incident_c(X5,X8)))|(part_of(X7,X8)|part_of(X8,X7)))|~(end_point(X5,X6)))&(incident_c(X5,X6)|~(end_point(X5,X6))))&((((((part_of(esk7_2(X5,X6),X6)|~(incident_c(X5,X6)))|end_point(X5,X6))&((part_of(esk8_2(X5,X6),X6)|~(incident_c(X5,X6)))|end_point(X5,X6)))&((incident_c(X5,esk7_2(X5,X6))|~(incident_c(X5,X6)))|end_point(X5,X6)))&((incident_c(X5,esk8_2(X5,X6))|~(incident_c(X5,X6)))|end_point(X5,X6)))&(((~(part_of(esk7_2(X5,X6),esk8_2(X5,X6)))|~(incident_c(X5,X6)))|end_point(X5,X6))&((~(part_of(esk8_2(X5,X6),esk7_2(X5,X6)))|~(incident_c(X5,X6)))|end_point(X5,X6))))),inference(distribute,[status(thm)],[72])).
% cnf(80,plain,(incident_c(X1,X2)|~end_point(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(82, plain,![X3]:![X1]:((~(inner_point(X3,X1))|(incident_c(X3,X1)&~(end_point(X3,X1))))&((~(incident_c(X3,X1))|end_point(X3,X1))|inner_point(X3,X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(83, plain,![X4]:![X5]:((~(inner_point(X4,X5))|(incident_c(X4,X5)&~(end_point(X4,X5))))&((~(incident_c(X4,X5))|end_point(X4,X5))|inner_point(X4,X5))),inference(variable_rename,[status(thm)],[82])).
% fof(84, plain,![X4]:![X5]:(((incident_c(X4,X5)|~(inner_point(X4,X5)))&(~(end_point(X4,X5))|~(inner_point(X4,X5))))&((~(incident_c(X4,X5))|end_point(X4,X5))|inner_point(X4,X5))),inference(distribute,[status(thm)],[83])).
% cnf(86,plain,(~inner_point(X1,X2)|~end_point(X1,X2)),inference(split_conjunct,[status(thm)],[84])).
% cnf(87,plain,(incident_c(X1,X2)|~inner_point(X1,X2)),inference(split_conjunct,[status(thm)],[84])).
% fof(134, negated_conjecture,?[X1]:?[X3]:?[X5]:?[X6]:(between_c(X1,X3,X5,X6)&(((((~(incident_c(X3,X1))|~(incident_c(X5,X1)))|~(incident_c(X6,X1)))|X3=X5)|X5=X6)|X3=X6)),inference(fof_nnf,[status(thm)],[19])).
% fof(135, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:(between_c(X7,X8,X9,X10)&(((((~(incident_c(X8,X7))|~(incident_c(X9,X7)))|~(incident_c(X10,X7)))|X8=X9)|X9=X10)|X8=X10)),inference(variable_rename,[status(thm)],[134])).
% fof(136, negated_conjecture,(between_c(esk15_0,esk16_0,esk17_0,esk18_0)&(((((~(incident_c(esk16_0,esk15_0))|~(incident_c(esk17_0,esk15_0)))|~(incident_c(esk18_0,esk15_0)))|esk16_0=esk17_0)|esk17_0=esk18_0)|esk16_0=esk18_0)),inference(skolemize,[status(esa)],[135])).
% cnf(137,negated_conjecture,(esk16_0=esk18_0|esk17_0=esk18_0|esk16_0=esk17_0|~incident_c(esk18_0,esk15_0)|~incident_c(esk17_0,esk15_0)|~incident_c(esk16_0,esk15_0)),inference(split_conjunct,[status(thm)],[136])).
% cnf(138,negated_conjecture,(between_c(esk15_0,esk16_0,esk17_0,esk18_0)),inference(split_conjunct,[status(thm)],[136])).
% cnf(139,plain,(~between_c(X1,X2,X3,X2)),inference(er,[status(thm)],[67,theory(equality)])).
% cnf(166,plain,(incident_c(X1,esk6_4(X2,X3,X4,X1))|~between_c(X2,X3,X4,X1)),inference(spm,[status(thm)],[80,64,theory(equality)])).
% cnf(170,plain,(incident_c(X1,esk6_4(X2,X1,X3,X4))|~between_c(X2,X1,X3,X4)),inference(spm,[status(thm)],[80,65,theory(equality)])).
% cnf(172,plain,(incident_c(X1,esk6_4(X2,X3,X1,X4))|~between_c(X2,X3,X1,X4)),inference(spm,[status(thm)],[87,63,theory(equality)])).
% cnf(173,plain,(~end_point(X1,esk6_4(X2,X3,X1,X4))|~between_c(X2,X3,X1,X4)),inference(spm,[status(thm)],[86,63,theory(equality)])).
% cnf(175,plain,(incident_c(X1,X2)|~incident_c(X1,esk6_4(X2,X3,X4,X5))|~between_c(X2,X3,X4,X5)),inference(spm,[status(thm)],[57,66,theory(equality)])).
% cnf(215,plain,(~between_c(X1,X2,X3,X3)),inference(spm,[status(thm)],[173,64,theory(equality)])).
% cnf(216,plain,(~between_c(X1,X2,X2,X3)),inference(spm,[status(thm)],[173,65,theory(equality)])).
% cnf(343,plain,(incident_c(X1,X2)|~between_c(X2,X3,X4,X1)),inference(spm,[status(thm)],[175,166,theory(equality)])).
% cnf(344,plain,(incident_c(X1,X2)|~between_c(X2,X1,X3,X4)),inference(spm,[status(thm)],[175,170,theory(equality)])).
% cnf(345,plain,(incident_c(X1,X2)|~between_c(X2,X3,X1,X4)),inference(spm,[status(thm)],[175,172,theory(equality)])).
% cnf(346,negated_conjecture,(incident_c(esk18_0,esk15_0)),inference(spm,[status(thm)],[343,138,theory(equality)])).
% cnf(347,negated_conjecture,(esk17_0=esk16_0|esk18_0=esk16_0|esk18_0=esk17_0|~incident_c(esk16_0,esk15_0)|~incident_c(esk17_0,esk15_0)|$false),inference(rw,[status(thm)],[137,346,theory(equality)])).
% cnf(348,negated_conjecture,(esk17_0=esk16_0|esk18_0=esk16_0|esk18_0=esk17_0|~incident_c(esk16_0,esk15_0)|~incident_c(esk17_0,esk15_0)),inference(cn,[status(thm)],[347,theory(equality)])).
% cnf(349,negated_conjecture,(incident_c(esk16_0,esk15_0)),inference(spm,[status(thm)],[344,138,theory(equality)])).
% cnf(350,negated_conjecture,(esk18_0=esk17_0|esk18_0=esk16_0|esk17_0=esk16_0|$false|~incident_c(esk17_0,esk15_0)),inference(rw,[status(thm)],[348,349,theory(equality)])).
% cnf(351,negated_conjecture,(esk18_0=esk17_0|esk18_0=esk16_0|esk17_0=esk16_0|~incident_c(esk17_0,esk15_0)),inference(cn,[status(thm)],[350,theory(equality)])).
% cnf(352,negated_conjecture,(incident_c(esk17_0,esk15_0)),inference(spm,[status(thm)],[345,138,theory(equality)])).
% cnf(353,negated_conjecture,(esk17_0=esk16_0|esk18_0=esk16_0|esk18_0=esk17_0|$false),inference(rw,[status(thm)],[351,352,theory(equality)])).
% cnf(354,negated_conjecture,(esk17_0=esk16_0|esk18_0=esk16_0|esk18_0=esk17_0),inference(cn,[status(thm)],[353,theory(equality)])).
% cnf(356,negated_conjecture,(between_c(esk15_0,esk16_0,esk17_0,esk17_0)|esk18_0=esk16_0|esk17_0=esk16_0),inference(spm,[status(thm)],[138,354,theory(equality)])).
% cnf(358,negated_conjecture,(esk18_0=esk16_0|esk17_0=esk16_0),inference(sr,[status(thm)],[356,215,theory(equality)])).
% cnf(360,negated_conjecture,(between_c(esk15_0,esk16_0,esk17_0,esk16_0)|esk17_0=esk16_0),inference(spm,[status(thm)],[138,358,theory(equality)])).
% cnf(362,negated_conjecture,(esk17_0=esk16_0),inference(sr,[status(thm)],[360,139,theory(equality)])).
% cnf(366,negated_conjecture,(between_c(esk15_0,esk16_0,esk16_0,esk18_0)),inference(rw,[status(thm)],[138,362,theory(equality)])).
% cnf(367,negated_conjecture,($false),inference(sr,[status(thm)],[366,216,theory(equality)])).
% cnf(368,negated_conjecture,($false),367,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 158
% # ...of these trivial                : 1
% # ...subsumed                        : 9
% # ...remaining for further processing: 148
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 1
% # Backward-rewritten                 : 6
% # Generated clauses                  : 214
% # ...of the previous two non-trivial : 196
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 196
% # Factorizations                     : 11
% # Equation resolutions               : 7
% # Current number of processed clauses: 89
% #    Positive orientable unit clauses: 7
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 4
% #    Non-unit-clauses                : 78
% # Current number of unprocessed clauses: 140
% # ...number of literals in the above : 613
% # Clause-clause subsumption calls (NU) : 213
% # Rec. Clause-clause subsumption calls : 191
% # Unit Clause-clause subsumption calls : 37
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 21
% # Indexed BW rewrite successes       : 4
% # Backwards rewriting index:    71 leaves,   2.01+/-2.126 terms/leaf
% # Paramod-from index:           37 leaves,   1.24+/-0.588 terms/leaf
% # Paramod-into index:           67 leaves,   1.69+/-1.295 terms/leaf
% # -------------------------------------------------
% # User time              : 0.030 s
% # System time            : 0.003 s
% # Total time             : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP20298/GEO111+1.tptp
% 
%------------------------------------------------------------------------------