TSTP Solution File: GEO125+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO125+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 : art02.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:37:58 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP11136/GEO125+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11136/GEO125+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11136/GEO125+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 11232
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(ordered_by(X1,X2,X3)=>(incident_o(X2,X1)&incident_o(X3,X1))),file('/tmp/SRASS.s.p', o1)).
% fof(2, axiom,![X2]:![X1]:(finish_point(X2,X1)<=>(incident_o(X2,X1)&![X3]:((~(X2=X3)&incident_o(X3,X1))=>ordered_by(X1,X3,X2)))),file('/tmp/SRASS.s.p', finish_point_defn)).
% fof(14, axiom,![X1]:![X2]:![X3]:![X5]:(between_o(X1,X2,X3,X5)<=>((ordered_by(X1,X2,X3)&ordered_by(X1,X3,X5))|(ordered_by(X1,X5,X3)&ordered_by(X1,X3,X2)))),file('/tmp/SRASS.s.p', between_o_defn)).
% fof(25, axiom,![X4]:![X2]:![X3]:![X5]:(between_c(X4,X2,X3,X5)<=>(~(X2=X5)&?[X11]:(((part_of(X11,X4)&end_point(X2,X11))&end_point(X5,X11))&inner_point(X3,X11)))),file('/tmp/SRASS.s.p', between_c_defn)).
% fof(27, axiom,![X2]:![X3]:![X5]:![X1]:(between_o(X1,X2,X3,X5)<=>?[X4]:(![X2]:(incident_o(X2,X1)<=>incident_c(X2,X4))&between_c(X4,X2,X3,X5))),file('/tmp/SRASS.s.p', o3)).
% fof(28, conjecture,![X1]:![X2]:![X3]:((finish_point(X2,X1)&finish_point(X3,X1))=>X2=X3),file('/tmp/SRASS.s.p', corollary_4_10_2)).
% fof(29, negated_conjecture,~(![X1]:![X2]:![X3]:((finish_point(X2,X1)&finish_point(X3,X1))=>X2=X3)),inference(assume_negation,[status(cth)],[28])).
% fof(31, plain,![X1]:![X2]:![X3]:(~(ordered_by(X1,X2,X3))|(incident_o(X2,X1)&incident_o(X3,X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(32, plain,![X4]:![X5]:![X6]:(~(ordered_by(X4,X5,X6))|(incident_o(X5,X4)&incident_o(X6,X4))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:((incident_o(X5,X4)|~(ordered_by(X4,X5,X6)))&(incident_o(X6,X4)|~(ordered_by(X4,X5,X6)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(incident_o(X3,X1)|~ordered_by(X1,X2,X3)),inference(split_conjunct,[status(thm)],[33])).
% fof(36, plain,![X2]:![X1]:((~(finish_point(X2,X1))|(incident_o(X2,X1)&![X3]:((X2=X3|~(incident_o(X3,X1)))|ordered_by(X1,X3,X2))))&((~(incident_o(X2,X1))|?[X3]:((~(X2=X3)&incident_o(X3,X1))&~(ordered_by(X1,X3,X2))))|finish_point(X2,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(37, plain,![X4]:![X5]:((~(finish_point(X4,X5))|(incident_o(X4,X5)&![X6]:((X4=X6|~(incident_o(X6,X5)))|ordered_by(X5,X6,X4))))&((~(incident_o(X4,X5))|?[X7]:((~(X4=X7)&incident_o(X7,X5))&~(ordered_by(X5,X7,X4))))|finish_point(X4,X5))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X4]:![X5]:((~(finish_point(X4,X5))|(incident_o(X4,X5)&![X6]:((X4=X6|~(incident_o(X6,X5)))|ordered_by(X5,X6,X4))))&((~(incident_o(X4,X5))|((~(X4=esk1_2(X4,X5))&incident_o(esk1_2(X4,X5),X5))&~(ordered_by(X5,esk1_2(X4,X5),X4))))|finish_point(X4,X5))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:(((((X4=X6|~(incident_o(X6,X5)))|ordered_by(X5,X6,X4))&incident_o(X4,X5))|~(finish_point(X4,X5)))&((~(incident_o(X4,X5))|((~(X4=esk1_2(X4,X5))&incident_o(esk1_2(X4,X5),X5))&~(ordered_by(X5,esk1_2(X4,X5),X4))))|finish_point(X4,X5))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:(((((X4=X6|~(incident_o(X6,X5)))|ordered_by(X5,X6,X4))|~(finish_point(X4,X5)))&(incident_o(X4,X5)|~(finish_point(X4,X5))))&((((~(X4=esk1_2(X4,X5))|~(incident_o(X4,X5)))|finish_point(X4,X5))&((incident_o(esk1_2(X4,X5),X5)|~(incident_o(X4,X5)))|finish_point(X4,X5)))&((~(ordered_by(X5,esk1_2(X4,X5),X4))|~(incident_o(X4,X5)))|finish_point(X4,X5)))),inference(distribute,[status(thm)],[39])).
% cnf(44,plain,(incident_o(X1,X2)|~finish_point(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% cnf(45,plain,(ordered_by(X2,X3,X1)|X1=X3|~finish_point(X1,X2)|~incident_o(X3,X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(122, plain,![X1]:![X2]:![X3]:![X5]:((~(between_o(X1,X2,X3,X5))|((ordered_by(X1,X2,X3)&ordered_by(X1,X3,X5))|(ordered_by(X1,X5,X3)&ordered_by(X1,X3,X2))))&(((~(ordered_by(X1,X2,X3))|~(ordered_by(X1,X3,X5)))&(~(ordered_by(X1,X5,X3))|~(ordered_by(X1,X3,X2))))|between_o(X1,X2,X3,X5))),inference(fof_nnf,[status(thm)],[14])).
% fof(123, plain,![X6]:![X7]:![X8]:![X9]:((~(between_o(X6,X7,X8,X9))|((ordered_by(X6,X7,X8)&ordered_by(X6,X8,X9))|(ordered_by(X6,X9,X8)&ordered_by(X6,X8,X7))))&(((~(ordered_by(X6,X7,X8))|~(ordered_by(X6,X8,X9)))&(~(ordered_by(X6,X9,X8))|~(ordered_by(X6,X8,X7))))|between_o(X6,X7,X8,X9))),inference(variable_rename,[status(thm)],[122])).
% fof(124, plain,![X6]:![X7]:![X8]:![X9]:(((((ordered_by(X6,X9,X8)|ordered_by(X6,X7,X8))|~(between_o(X6,X7,X8,X9)))&((ordered_by(X6,X8,X7)|ordered_by(X6,X7,X8))|~(between_o(X6,X7,X8,X9))))&(((ordered_by(X6,X9,X8)|ordered_by(X6,X8,X9))|~(between_o(X6,X7,X8,X9)))&((ordered_by(X6,X8,X7)|ordered_by(X6,X8,X9))|~(between_o(X6,X7,X8,X9)))))&(((~(ordered_by(X6,X7,X8))|~(ordered_by(X6,X8,X9)))|between_o(X6,X7,X8,X9))&((~(ordered_by(X6,X9,X8))|~(ordered_by(X6,X8,X7)))|between_o(X6,X7,X8,X9)))),inference(distribute,[status(thm)],[123])).
% cnf(125,plain,(between_o(X1,X2,X3,X4)|~ordered_by(X1,X3,X2)|~ordered_by(X1,X4,X3)),inference(split_conjunct,[status(thm)],[124])).
% fof(196, plain,![X4]:![X2]:![X3]:![X5]:((~(between_c(X4,X2,X3,X5))|(~(X2=X5)&?[X11]:(((part_of(X11,X4)&end_point(X2,X11))&end_point(X5,X11))&inner_point(X3,X11))))&((X2=X5|![X11]:(((~(part_of(X11,X4))|~(end_point(X2,X11)))|~(end_point(X5,X11)))|~(inner_point(X3,X11))))|between_c(X4,X2,X3,X5))),inference(fof_nnf,[status(thm)],[25])).
% fof(197, plain,![X12]:![X13]:![X14]:![X15]:((~(between_c(X12,X13,X14,X15))|(~(X13=X15)&?[X16]:(((part_of(X16,X12)&end_point(X13,X16))&end_point(X15,X16))&inner_point(X14,X16))))&((X13=X15|![X17]:(((~(part_of(X17,X12))|~(end_point(X13,X17)))|~(end_point(X15,X17)))|~(inner_point(X14,X17))))|between_c(X12,X13,X14,X15))),inference(variable_rename,[status(thm)],[196])).
% fof(198, plain,![X12]:![X13]:![X14]:![X15]:((~(between_c(X12,X13,X14,X15))|(~(X13=X15)&(((part_of(esk22_4(X12,X13,X14,X15),X12)&end_point(X13,esk22_4(X12,X13,X14,X15)))&end_point(X15,esk22_4(X12,X13,X14,X15)))&inner_point(X14,esk22_4(X12,X13,X14,X15)))))&((X13=X15|![X17]:(((~(part_of(X17,X12))|~(end_point(X13,X17)))|~(end_point(X15,X17)))|~(inner_point(X14,X17))))|between_c(X12,X13,X14,X15))),inference(skolemize,[status(esa)],[197])).
% fof(199, plain,![X12]:![X13]:![X14]:![X15]:![X17]:((((((~(part_of(X17,X12))|~(end_point(X13,X17)))|~(end_point(X15,X17)))|~(inner_point(X14,X17)))|X13=X15)|between_c(X12,X13,X14,X15))&(~(between_c(X12,X13,X14,X15))|(~(X13=X15)&(((part_of(esk22_4(X12,X13,X14,X15),X12)&end_point(X13,esk22_4(X12,X13,X14,X15)))&end_point(X15,esk22_4(X12,X13,X14,X15)))&inner_point(X14,esk22_4(X12,X13,X14,X15)))))),inference(shift_quantors,[status(thm)],[198])).
% fof(200, plain,![X12]:![X13]:![X14]:![X15]:![X17]:((((((~(part_of(X17,X12))|~(end_point(X13,X17)))|~(end_point(X15,X17)))|~(inner_point(X14,X17)))|X13=X15)|between_c(X12,X13,X14,X15))&((~(X13=X15)|~(between_c(X12,X13,X14,X15)))&((((part_of(esk22_4(X12,X13,X14,X15),X12)|~(between_c(X12,X13,X14,X15)))&(end_point(X13,esk22_4(X12,X13,X14,X15))|~(between_c(X12,X13,X14,X15))))&(end_point(X15,esk22_4(X12,X13,X14,X15))|~(between_c(X12,X13,X14,X15))))&(inner_point(X14,esk22_4(X12,X13,X14,X15))|~(between_c(X12,X13,X14,X15)))))),inference(distribute,[status(thm)],[199])).
% cnf(205,plain,(~between_c(X1,X2,X3,X4)|X2!=X4),inference(split_conjunct,[status(thm)],[200])).
% fof(211, plain,![X2]:![X3]:![X5]:![X1]:((~(between_o(X1,X2,X3,X5))|?[X4]:(![X2]:((~(incident_o(X2,X1))|incident_c(X2,X4))&(~(incident_c(X2,X4))|incident_o(X2,X1)))&between_c(X4,X2,X3,X5)))&(![X4]:(?[X2]:((~(incident_o(X2,X1))|~(incident_c(X2,X4)))&(incident_o(X2,X1)|incident_c(X2,X4)))|~(between_c(X4,X2,X3,X5)))|between_o(X1,X2,X3,X5))),inference(fof_nnf,[status(thm)],[27])).
% fof(212, plain,![X6]:![X7]:![X8]:![X9]:((~(between_o(X9,X6,X7,X8))|?[X10]:(![X11]:((~(incident_o(X11,X9))|incident_c(X11,X10))&(~(incident_c(X11,X10))|incident_o(X11,X9)))&between_c(X10,X6,X7,X8)))&(![X12]:(?[X13]:((~(incident_o(X13,X9))|~(incident_c(X13,X12)))&(incident_o(X13,X9)|incident_c(X13,X12)))|~(between_c(X12,X6,X7,X8)))|between_o(X9,X6,X7,X8))),inference(variable_rename,[status(thm)],[211])).
% fof(213, plain,![X6]:![X7]:![X8]:![X9]:((~(between_o(X9,X6,X7,X8))|(![X11]:((~(incident_o(X11,X9))|incident_c(X11,esk23_4(X6,X7,X8,X9)))&(~(incident_c(X11,esk23_4(X6,X7,X8,X9)))|incident_o(X11,X9)))&between_c(esk23_4(X6,X7,X8,X9),X6,X7,X8)))&(![X12]:(((~(incident_o(esk24_5(X6,X7,X8,X9,X12),X9))|~(incident_c(esk24_5(X6,X7,X8,X9,X12),X12)))&(incident_o(esk24_5(X6,X7,X8,X9,X12),X9)|incident_c(esk24_5(X6,X7,X8,X9,X12),X12)))|~(between_c(X12,X6,X7,X8)))|between_o(X9,X6,X7,X8))),inference(skolemize,[status(esa)],[212])).
% fof(214, plain,![X6]:![X7]:![X8]:![X9]:![X11]:![X12]:(((((~(incident_o(esk24_5(X6,X7,X8,X9,X12),X9))|~(incident_c(esk24_5(X6,X7,X8,X9,X12),X12)))&(incident_o(esk24_5(X6,X7,X8,X9,X12),X9)|incident_c(esk24_5(X6,X7,X8,X9,X12),X12)))|~(between_c(X12,X6,X7,X8)))|between_o(X9,X6,X7,X8))&((((~(incident_o(X11,X9))|incident_c(X11,esk23_4(X6,X7,X8,X9)))&(~(incident_c(X11,esk23_4(X6,X7,X8,X9)))|incident_o(X11,X9)))&between_c(esk23_4(X6,X7,X8,X9),X6,X7,X8))|~(between_o(X9,X6,X7,X8)))),inference(shift_quantors,[status(thm)],[213])).
% fof(215, plain,![X6]:![X7]:![X8]:![X9]:![X11]:![X12]:(((((~(incident_o(esk24_5(X6,X7,X8,X9,X12),X9))|~(incident_c(esk24_5(X6,X7,X8,X9,X12),X12)))|~(between_c(X12,X6,X7,X8)))|between_o(X9,X6,X7,X8))&(((incident_o(esk24_5(X6,X7,X8,X9,X12),X9)|incident_c(esk24_5(X6,X7,X8,X9,X12),X12))|~(between_c(X12,X6,X7,X8)))|between_o(X9,X6,X7,X8)))&((((~(incident_o(X11,X9))|incident_c(X11,esk23_4(X6,X7,X8,X9)))|~(between_o(X9,X6,X7,X8)))&((~(incident_c(X11,esk23_4(X6,X7,X8,X9)))|incident_o(X11,X9))|~(between_o(X9,X6,X7,X8))))&(between_c(esk23_4(X6,X7,X8,X9),X6,X7,X8)|~(between_o(X9,X6,X7,X8))))),inference(distribute,[status(thm)],[214])).
% cnf(216,plain,(between_c(esk23_4(X2,X3,X4,X1),X2,X3,X4)|~between_o(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[215])).
% fof(221, negated_conjecture,?[X1]:?[X2]:?[X3]:((finish_point(X2,X1)&finish_point(X3,X1))&~(X2=X3)),inference(fof_nnf,[status(thm)],[29])).
% fof(222, negated_conjecture,?[X4]:?[X5]:?[X6]:((finish_point(X5,X4)&finish_point(X6,X4))&~(X5=X6)),inference(variable_rename,[status(thm)],[221])).
% fof(223, negated_conjecture,((finish_point(esk26_0,esk25_0)&finish_point(esk27_0,esk25_0))&~(esk26_0=esk27_0)),inference(skolemize,[status(esa)],[222])).
% cnf(224,negated_conjecture,(esk26_0!=esk27_0),inference(split_conjunct,[status(thm)],[223])).
% cnf(225,negated_conjecture,(finish_point(esk27_0,esk25_0)),inference(split_conjunct,[status(thm)],[223])).
% cnf(226,negated_conjecture,(finish_point(esk26_0,esk25_0)),inference(split_conjunct,[status(thm)],[223])).
% cnf(227,plain,(~between_c(X1,X2,X3,X2)),inference(er,[status(thm)],[205,theory(equality)])).
% cnf(230,negated_conjecture,(incident_o(esk27_0,esk25_0)),inference(spm,[status(thm)],[44,225,theory(equality)])).
% cnf(243,negated_conjecture,(esk27_0=X1|ordered_by(esk25_0,X1,esk27_0)|~incident_o(X1,esk25_0)),inference(spm,[status(thm)],[45,225,theory(equality)])).
% cnf(244,negated_conjecture,(esk26_0=X1|ordered_by(esk25_0,X1,esk26_0)|~incident_o(X1,esk25_0)),inference(spm,[status(thm)],[45,226,theory(equality)])).
% cnf(272,plain,(~between_o(X3,X1,X2,X1)),inference(spm,[status(thm)],[227,216,theory(equality)])).
% cnf(389,plain,(~ordered_by(X1,X2,X3)|~ordered_by(X1,X3,X2)),inference(spm,[status(thm)],[272,125,theory(equality)])).
% cnf(447,negated_conjecture,(esk27_0=X1|~ordered_by(esk25_0,esk27_0,X1)|~incident_o(X1,esk25_0)),inference(spm,[status(thm)],[389,243,theory(equality)])).
% cnf(451,negated_conjecture,(esk27_0=X1|~ordered_by(esk25_0,esk27_0,X1)),inference(csr,[status(thm)],[447,34])).
% cnf(463,negated_conjecture,(esk27_0=esk26_0|~incident_o(esk27_0,esk25_0)),inference(spm,[status(thm)],[451,244,theory(equality)])).
% cnf(465,negated_conjecture,(esk27_0=esk26_0|$false),inference(rw,[status(thm)],[463,230,theory(equality)])).
% cnf(466,negated_conjecture,(esk27_0=esk26_0),inference(cn,[status(thm)],[465,theory(equality)])).
% cnf(467,negated_conjecture,($false),inference(sr,[status(thm)],[466,224,theory(equality)])).
% cnf(468,negated_conjecture,($false),467,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 214
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 208
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 226
% # ...of the previous two non-trivial : 186
% # Contextual simplify-reflections : 3
% # Paramodulations : 208
% # Factorizations : 10
% # Equation resolutions : 8
% # Current number of processed clauses: 119
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 94
% # Current number of unprocessed clauses: 148
% # ...number of literals in the above : 669
% # Clause-clause subsumption calls (NU) : 556
% # Rec. Clause-clause subsumption calls : 328
% # Unit Clause-clause subsumption calls : 175
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 103 leaves, 1.91+/-2.199 terms/leaf
% # Paramod-from index: 48 leaves, 1.15+/-0.408 terms/leaf
% # Paramod-into index: 92 leaves, 1.50+/-1.098 terms/leaf
% # -------------------------------------------------
% # User time : 0.041 s
% # System time : 0.003 s
% # Total time : 0.044 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/SystemOnTPTP11136/GEO125+1.tptp
%
%------------------------------------------------------------------------------