TSTP Solution File: GEO117+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO117+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 : art07.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:34:25 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/SystemOnTPTP8737/GEO117+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8737/GEO117+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8737/GEO117+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 8833
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X5]:![X3]:![X4]:![X6]:(between_o(X5,X3,X4,X6)<=>((ordered_by(X5,X3,X4)&ordered_by(X5,X4,X6))|(ordered_by(X5,X6,X4)&ordered_by(X5,X4,X3)))),file('/tmp/SRASS.s.p', between_o_defn)).
% fof(21, axiom,![X3]:![X4]:![X6]:![X5]:(between_o(X5,X3,X4,X6)<=>?[X7]:(![X3]:(incident_o(X3,X5)<=>incident_c(X3,X7))&between_c(X7,X3,X4,X6))),file('/tmp/SRASS.s.p', o3)).
% fof(27, axiom,![X7]:![X3]:![X4]:![X6]:(between_c(X7,X3,X4,X6)<=>(~(X3=X6)&?[X11]:(((part_of(X11,X7)&end_point(X3,X11))&end_point(X6,X11))&inner_point(X4,X11)))),file('/tmp/SRASS.s.p', between_c_defn)).
% fof(28, conjecture,![X5]:![X3]:~(ordered_by(X5,X3,X3)),file('/tmp/SRASS.s.p', theorem_4_4)).
% fof(29, negated_conjecture,~(![X5]:![X3]:~(ordered_by(X5,X3,X3))),inference(assume_negation,[status(cth)],[28])).
% fof(31, negated_conjecture,~(![X5]:![X3]:~(ordered_by(X5,X3,X3))),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(43, plain,![X5]:![X3]:![X4]:![X6]:((~(between_o(X5,X3,X4,X6))|((ordered_by(X5,X3,X4)&ordered_by(X5,X4,X6))|(ordered_by(X5,X6,X4)&ordered_by(X5,X4,X3))))&(((~(ordered_by(X5,X3,X4))|~(ordered_by(X5,X4,X6)))&(~(ordered_by(X5,X6,X4))|~(ordered_by(X5,X4,X3))))|between_o(X5,X3,X4,X6))),inference(fof_nnf,[status(thm)],[3])).
% fof(44, plain,![X7]:![X8]:![X9]:![X10]:((~(between_o(X7,X8,X9,X10))|((ordered_by(X7,X8,X9)&ordered_by(X7,X9,X10))|(ordered_by(X7,X10,X9)&ordered_by(X7,X9,X8))))&(((~(ordered_by(X7,X8,X9))|~(ordered_by(X7,X9,X10)))&(~(ordered_by(X7,X10,X9))|~(ordered_by(X7,X9,X8))))|between_o(X7,X8,X9,X10))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X7]:![X8]:![X9]:![X10]:(((((ordered_by(X7,X10,X9)|ordered_by(X7,X8,X9))|~(between_o(X7,X8,X9,X10)))&((ordered_by(X7,X9,X8)|ordered_by(X7,X8,X9))|~(between_o(X7,X8,X9,X10))))&(((ordered_by(X7,X10,X9)|ordered_by(X7,X9,X10))|~(between_o(X7,X8,X9,X10)))&((ordered_by(X7,X9,X8)|ordered_by(X7,X9,X10))|~(between_o(X7,X8,X9,X10)))))&(((~(ordered_by(X7,X8,X9))|~(ordered_by(X7,X9,X10)))|between_o(X7,X8,X9,X10))&((~(ordered_by(X7,X10,X9))|~(ordered_by(X7,X9,X8)))|between_o(X7,X8,X9,X10)))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(between_o(X1,X2,X3,X4)|~ordered_by(X1,X3,X2)|~ordered_by(X1,X4,X3)),inference(split_conjunct,[status(thm)],[45])).
% fof(167, plain,![X3]:![X4]:![X6]:![X5]:((~(between_o(X5,X3,X4,X6))|?[X7]:(![X3]:((~(incident_o(X3,X5))|incident_c(X3,X7))&(~(incident_c(X3,X7))|incident_o(X3,X5)))&between_c(X7,X3,X4,X6)))&(![X7]:(?[X3]:((~(incident_o(X3,X5))|~(incident_c(X3,X7)))&(incident_o(X3,X5)|incident_c(X3,X7)))|~(between_c(X7,X3,X4,X6)))|between_o(X5,X3,X4,X6))),inference(fof_nnf,[status(thm)],[21])).
% fof(168, plain,![X8]:![X9]:![X10]:![X11]:((~(between_o(X11,X8,X9,X10))|?[X12]:(![X13]:((~(incident_o(X13,X11))|incident_c(X13,X12))&(~(incident_c(X13,X12))|incident_o(X13,X11)))&between_c(X12,X8,X9,X10)))&(![X14]:(?[X15]:((~(incident_o(X15,X11))|~(incident_c(X15,X14)))&(incident_o(X15,X11)|incident_c(X15,X14)))|~(between_c(X14,X8,X9,X10)))|between_o(X11,X8,X9,X10))),inference(variable_rename,[status(thm)],[167])).
% fof(169, plain,![X8]:![X9]:![X10]:![X11]:((~(between_o(X11,X8,X9,X10))|(![X13]:((~(incident_o(X13,X11))|incident_c(X13,esk18_4(X8,X9,X10,X11)))&(~(incident_c(X13,esk18_4(X8,X9,X10,X11)))|incident_o(X13,X11)))&between_c(esk18_4(X8,X9,X10,X11),X8,X9,X10)))&(![X14]:(((~(incident_o(esk19_5(X8,X9,X10,X11,X14),X11))|~(incident_c(esk19_5(X8,X9,X10,X11,X14),X14)))&(incident_o(esk19_5(X8,X9,X10,X11,X14),X11)|incident_c(esk19_5(X8,X9,X10,X11,X14),X14)))|~(between_c(X14,X8,X9,X10)))|between_o(X11,X8,X9,X10))),inference(skolemize,[status(esa)],[168])).
% fof(170, plain,![X8]:![X9]:![X10]:![X11]:![X13]:![X14]:(((((~(incident_o(esk19_5(X8,X9,X10,X11,X14),X11))|~(incident_c(esk19_5(X8,X9,X10,X11,X14),X14)))&(incident_o(esk19_5(X8,X9,X10,X11,X14),X11)|incident_c(esk19_5(X8,X9,X10,X11,X14),X14)))|~(between_c(X14,X8,X9,X10)))|between_o(X11,X8,X9,X10))&((((~(incident_o(X13,X11))|incident_c(X13,esk18_4(X8,X9,X10,X11)))&(~(incident_c(X13,esk18_4(X8,X9,X10,X11)))|incident_o(X13,X11)))&between_c(esk18_4(X8,X9,X10,X11),X8,X9,X10))|~(between_o(X11,X8,X9,X10)))),inference(shift_quantors,[status(thm)],[169])).
% fof(171, plain,![X8]:![X9]:![X10]:![X11]:![X13]:![X14]:(((((~(incident_o(esk19_5(X8,X9,X10,X11,X14),X11))|~(incident_c(esk19_5(X8,X9,X10,X11,X14),X14)))|~(between_c(X14,X8,X9,X10)))|between_o(X11,X8,X9,X10))&(((incident_o(esk19_5(X8,X9,X10,X11,X14),X11)|incident_c(esk19_5(X8,X9,X10,X11,X14),X14))|~(between_c(X14,X8,X9,X10)))|between_o(X11,X8,X9,X10)))&((((~(incident_o(X13,X11))|incident_c(X13,esk18_4(X8,X9,X10,X11)))|~(between_o(X11,X8,X9,X10)))&((~(incident_c(X13,esk18_4(X8,X9,X10,X11)))|incident_o(X13,X11))|~(between_o(X11,X8,X9,X10))))&(between_c(esk18_4(X8,X9,X10,X11),X8,X9,X10)|~(between_o(X11,X8,X9,X10))))),inference(distribute,[status(thm)],[170])).
% cnf(172,plain,(between_c(esk18_4(X2,X3,X4,X1),X2,X3,X4)|~between_o(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[171])).
% fof(211, plain,![X7]:![X3]:![X4]:![X6]:((~(between_c(X7,X3,X4,X6))|(~(X3=X6)&?[X11]:(((part_of(X11,X7)&end_point(X3,X11))&end_point(X6,X11))&inner_point(X4,X11))))&((X3=X6|![X11]:(((~(part_of(X11,X7))|~(end_point(X3,X11)))|~(end_point(X6,X11)))|~(inner_point(X4,X11))))|between_c(X7,X3,X4,X6))),inference(fof_nnf,[status(thm)],[27])).
% fof(212, 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)],[211])).
% fof(213, plain,![X12]:![X13]:![X14]:![X15]:((~(between_c(X12,X13,X14,X15))|(~(X13=X15)&(((part_of(esk24_4(X12,X13,X14,X15),X12)&end_point(X13,esk24_4(X12,X13,X14,X15)))&end_point(X15,esk24_4(X12,X13,X14,X15)))&inner_point(X14,esk24_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)],[212])).
% fof(214, 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(esk24_4(X12,X13,X14,X15),X12)&end_point(X13,esk24_4(X12,X13,X14,X15)))&end_point(X15,esk24_4(X12,X13,X14,X15)))&inner_point(X14,esk24_4(X12,X13,X14,X15)))))),inference(shift_quantors,[status(thm)],[213])).
% fof(215, 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(esk24_4(X12,X13,X14,X15),X12)|~(between_c(X12,X13,X14,X15)))&(end_point(X13,esk24_4(X12,X13,X14,X15))|~(between_c(X12,X13,X14,X15))))&(end_point(X15,esk24_4(X12,X13,X14,X15))|~(between_c(X12,X13,X14,X15))))&(inner_point(X14,esk24_4(X12,X13,X14,X15))|~(between_c(X12,X13,X14,X15)))))),inference(distribute,[status(thm)],[214])).
% cnf(220,plain,(~between_c(X1,X2,X3,X4)|X2!=X4),inference(split_conjunct,[status(thm)],[215])).
% fof(222, negated_conjecture,?[X5]:?[X3]:ordered_by(X5,X3,X3),inference(fof_nnf,[status(thm)],[31])).
% fof(223, negated_conjecture,?[X6]:?[X7]:ordered_by(X6,X7,X7),inference(variable_rename,[status(thm)],[222])).
% fof(224, negated_conjecture,ordered_by(esk25_0,esk26_0,esk26_0),inference(skolemize,[status(esa)],[223])).
% cnf(225,negated_conjecture,(ordered_by(esk25_0,esk26_0,esk26_0)),inference(split_conjunct,[status(thm)],[224])).
% cnf(226,plain,(~between_c(X1,X2,X3,X2)),inference(er,[status(thm)],[220,theory(equality)])).
% cnf(260,negated_conjecture,(between_o(esk25_0,X1,esk26_0,esk26_0)|~ordered_by(esk25_0,esk26_0,X1)),inference(spm,[status(thm)],[46,225,theory(equality)])).
% cnf(297,plain,(~between_o(X3,X1,X2,X1)),inference(spm,[status(thm)],[226,172,theory(equality)])).
% cnf(414,negated_conjecture,(between_o(esk25_0,esk26_0,esk26_0,esk26_0)),inference(spm,[status(thm)],[260,225,theory(equality)])).
% cnf(417,negated_conjecture,($false),inference(sr,[status(thm)],[414,297,theory(equality)])).
% cnf(418,negated_conjecture,($false),417,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 187
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 185
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 185
% # ...of the previous two non-trivial : 159
% # Contextual simplify-reflections : 2
% # Paramodulations : 168
% # Factorizations : 10
% # Equation resolutions : 7
% # Current number of processed clauses: 98
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 85
% # Current number of unprocessed clauses: 144
% # ...number of literals in the above : 649
% # Clause-clause subsumption calls (NU) : 469
% # Rec. Clause-clause subsumption calls : 273
% # Unit Clause-clause subsumption calls : 73
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 85 leaves, 2.11+/-2.255 terms/leaf
% # Paramod-from index: 36 leaves, 1.19+/-0.461 terms/leaf
% # Paramod-into index: 78 leaves, 1.56+/-1.105 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.004 s
% # Total time : 0.040 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/SystemOnTPTP8737/GEO117+1.tptp
%
%------------------------------------------------------------------------------