TSTP Solution File: GEO088+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO088+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 : art06.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:20:55 EST 2010
% Result : Theorem 80.04s
% Output : Solution 80.52s
% 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/SystemOnTPTP10405/GEO088+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~theorem_2_10:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... part_of_defn:
% CSA axiom part_of_defn found
% Looking for CSA axiom ... end_point_defn:
% CSA axiom end_point_defn found
% Looking for CSA axiom ... c2:
% CSA axiom c2 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :c2:end_point_defn:part_of_defn (3)
% Unselected axioms are ... :meet_defn:inner_point_defn:c9:c3:c5:c6:c1:closed_defn:open_defn:sum_defn:c8:c4:c7 (13)
% SZS status THM for /tmp/SystemOnTPTP10405/GEO088+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP10405/GEO088+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 11381
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X5]:![X1]:(end_point(X5,X1)<=>(incident_c(X5,X1)&![X2]:![X3]:((((part_of(X2,X1)&part_of(X3,X1))&incident_c(X5,X2))&incident_c(X5,X3))=>(part_of(X2,X3)|part_of(X3,X2))))),file('/tmp/SRASS.s.p', end_point_defn)).
% fof(3, axiom,![X1]:![X2]:(part_of(X2,X1)<=>![X5]:(incident_c(X5,X2)=>incident_c(X5,X1))),file('/tmp/SRASS.s.p', part_of_defn)).
% fof(4, conjecture,![X1]:![X6]:![X5]:(((part_of(X6,X1)&end_point(X5,X1))&incident_c(X5,X6))=>end_point(X5,X6)),file('/tmp/SRASS.s.p', theorem_2_10)).
% fof(5, negated_conjecture,~(![X1]:![X6]:![X5]:(((part_of(X6,X1)&end_point(X5,X1))&incident_c(X5,X6))=>end_point(X5,X6))),inference(assume_negation,[status(cth)],[4])).
% fof(10, plain,![X5]:![X1]:((~(end_point(X5,X1))|(incident_c(X5,X1)&![X2]:![X3]:((((~(part_of(X2,X1))|~(part_of(X3,X1)))|~(incident_c(X5,X2)))|~(incident_c(X5,X3)))|(part_of(X2,X3)|part_of(X3,X2)))))&((~(incident_c(X5,X1))|?[X2]:?[X3]:((((part_of(X2,X1)&part_of(X3,X1))&incident_c(X5,X2))&incident_c(X5,X3))&(~(part_of(X2,X3))&~(part_of(X3,X2)))))|end_point(X5,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(11, plain,![X6]:![X7]:((~(end_point(X6,X7))|(incident_c(X6,X7)&![X8]:![X9]:((((~(part_of(X8,X7))|~(part_of(X9,X7)))|~(incident_c(X6,X8)))|~(incident_c(X6,X9)))|(part_of(X8,X9)|part_of(X9,X8)))))&((~(incident_c(X6,X7))|?[X10]:?[X11]:((((part_of(X10,X7)&part_of(X11,X7))&incident_c(X6,X10))&incident_c(X6,X11))&(~(part_of(X10,X11))&~(part_of(X11,X10)))))|end_point(X6,X7))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,![X6]:![X7]:((~(end_point(X6,X7))|(incident_c(X6,X7)&![X8]:![X9]:((((~(part_of(X8,X7))|~(part_of(X9,X7)))|~(incident_c(X6,X8)))|~(incident_c(X6,X9)))|(part_of(X8,X9)|part_of(X9,X8)))))&((~(incident_c(X6,X7))|((((part_of(esk1_2(X6,X7),X7)&part_of(esk2_2(X6,X7),X7))&incident_c(X6,esk1_2(X6,X7)))&incident_c(X6,esk2_2(X6,X7)))&(~(part_of(esk1_2(X6,X7),esk2_2(X6,X7)))&~(part_of(esk2_2(X6,X7),esk1_2(X6,X7))))))|end_point(X6,X7))),inference(skolemize,[status(esa)],[11])).
% fof(13, plain,![X6]:![X7]:![X8]:![X9]:(((((((~(part_of(X8,X7))|~(part_of(X9,X7)))|~(incident_c(X6,X8)))|~(incident_c(X6,X9)))|(part_of(X8,X9)|part_of(X9,X8)))&incident_c(X6,X7))|~(end_point(X6,X7)))&((~(incident_c(X6,X7))|((((part_of(esk1_2(X6,X7),X7)&part_of(esk2_2(X6,X7),X7))&incident_c(X6,esk1_2(X6,X7)))&incident_c(X6,esk2_2(X6,X7)))&(~(part_of(esk1_2(X6,X7),esk2_2(X6,X7)))&~(part_of(esk2_2(X6,X7),esk1_2(X6,X7))))))|end_point(X6,X7))),inference(shift_quantors,[status(thm)],[12])).
% fof(14, plain,![X6]:![X7]:![X8]:![X9]:(((((((~(part_of(X8,X7))|~(part_of(X9,X7)))|~(incident_c(X6,X8)))|~(incident_c(X6,X9)))|(part_of(X8,X9)|part_of(X9,X8)))|~(end_point(X6,X7)))&(incident_c(X6,X7)|~(end_point(X6,X7))))&((((((part_of(esk1_2(X6,X7),X7)|~(incident_c(X6,X7)))|end_point(X6,X7))&((part_of(esk2_2(X6,X7),X7)|~(incident_c(X6,X7)))|end_point(X6,X7)))&((incident_c(X6,esk1_2(X6,X7))|~(incident_c(X6,X7)))|end_point(X6,X7)))&((incident_c(X6,esk2_2(X6,X7))|~(incident_c(X6,X7)))|end_point(X6,X7)))&(((~(part_of(esk1_2(X6,X7),esk2_2(X6,X7)))|~(incident_c(X6,X7)))|end_point(X6,X7))&((~(part_of(esk2_2(X6,X7),esk1_2(X6,X7)))|~(incident_c(X6,X7)))|end_point(X6,X7))))),inference(distribute,[status(thm)],[13])).
% cnf(15,plain,(end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk2_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,plain,(end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk1_2(X1,X2),esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(end_point(X1,X2)|incident_c(X1,esk2_2(X1,X2))|~incident_c(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% cnf(18,plain,(end_point(X1,X2)|incident_c(X1,esk1_2(X1,X2))|~incident_c(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% cnf(19,plain,(end_point(X1,X2)|part_of(esk2_2(X1,X2),X2)|~incident_c(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% cnf(20,plain,(end_point(X1,X2)|part_of(esk1_2(X1,X2),X2)|~incident_c(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% cnf(22,plain,(part_of(X3,X4)|part_of(X4,X3)|~end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X4)|~part_of(X3,X2)|~part_of(X4,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(23, plain,![X1]:![X2]:((~(part_of(X2,X1))|![X5]:(~(incident_c(X5,X2))|incident_c(X5,X1)))&(?[X5]:(incident_c(X5,X2)&~(incident_c(X5,X1)))|part_of(X2,X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&(?[X9]:(incident_c(X9,X7)&~(incident_c(X9,X6)))|part_of(X7,X6))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&((incident_c(esk3_2(X6,X7),X7)&~(incident_c(esk3_2(X6,X7),X6)))|part_of(X7,X6))),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk3_2(X6,X7),X7)&~(incident_c(esk3_2(X6,X7),X6)))|part_of(X7,X6))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk3_2(X6,X7),X7)|part_of(X7,X6))&(~(incident_c(esk3_2(X6,X7),X6))|part_of(X7,X6)))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(part_of(X1,X2)|~incident_c(esk3_2(X2,X1),X2)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(part_of(X1,X2)|incident_c(esk3_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,plain,(incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(31, negated_conjecture,?[X1]:?[X6]:?[X5]:(((part_of(X6,X1)&end_point(X5,X1))&incident_c(X5,X6))&~(end_point(X5,X6))),inference(fof_nnf,[status(thm)],[5])).
% fof(32, negated_conjecture,?[X7]:?[X8]:?[X9]:(((part_of(X8,X7)&end_point(X9,X7))&incident_c(X9,X8))&~(end_point(X9,X8))),inference(variable_rename,[status(thm)],[31])).
% fof(33, negated_conjecture,(((part_of(esk5_0,esk4_0)&end_point(esk6_0,esk4_0))&incident_c(esk6_0,esk5_0))&~(end_point(esk6_0,esk5_0))),inference(skolemize,[status(esa)],[32])).
% cnf(34,negated_conjecture,(~end_point(esk6_0,esk5_0)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,negated_conjecture,(incident_c(esk6_0,esk5_0)),inference(split_conjunct,[status(thm)],[33])).
% cnf(36,negated_conjecture,(end_point(esk6_0,esk4_0)),inference(split_conjunct,[status(thm)],[33])).
% cnf(37,negated_conjecture,(part_of(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[33])).
% cnf(39,negated_conjecture,(incident_c(X1,esk4_0)|~incident_c(X1,esk5_0)),inference(spm,[status(thm)],[30,37,theory(equality)])).
% cnf(41,plain,(incident_c(X1,X2)|end_point(X3,X2)|~incident_c(X1,esk1_2(X3,X2))|~incident_c(X3,X2)),inference(spm,[status(thm)],[30,20,theory(equality)])).
% cnf(42,plain,(incident_c(X1,X2)|end_point(X3,X2)|~incident_c(X1,esk2_2(X3,X2))|~incident_c(X3,X2)),inference(spm,[status(thm)],[30,19,theory(equality)])).
% cnf(46,plain,(part_of(esk1_2(X1,X2),X3)|part_of(X3,esk1_2(X1,X2))|end_point(X1,X2)|~incident_c(X1,X3)|~end_point(X1,X4)|~part_of(esk1_2(X1,X2),X4)|~part_of(X3,X4)|~incident_c(X1,X2)),inference(spm,[status(thm)],[22,18,theory(equality)])).
% cnf(50,negated_conjecture,(part_of(X1,esk4_0)|~incident_c(esk3_2(esk4_0,X1),esk5_0)),inference(spm,[status(thm)],[28,39,theory(equality)])).
% cnf(52,plain,(incident_c(esk3_2(X1,esk1_2(X2,X3)),X3)|end_point(X2,X3)|part_of(esk1_2(X2,X3),X1)|~incident_c(X2,X3)),inference(spm,[status(thm)],[41,29,theory(equality)])).
% cnf(56,plain,(incident_c(esk3_2(X1,esk2_2(X2,X3)),X3)|end_point(X2,X3)|part_of(esk2_2(X2,X3),X1)|~incident_c(X2,X3)),inference(spm,[status(thm)],[42,29,theory(equality)])).
% cnf(95,negated_conjecture,(part_of(esk1_2(X1,esk5_0),esk4_0)|end_point(X1,esk5_0)|~incident_c(X1,esk5_0)),inference(spm,[status(thm)],[50,52,theory(equality)])).
% cnf(118,negated_conjecture,(part_of(esk2_2(X1,esk5_0),esk4_0)|end_point(X1,esk5_0)|~incident_c(X1,esk5_0)),inference(spm,[status(thm)],[50,56,theory(equality)])).
% cnf(161,negated_conjecture,(end_point(X1,esk5_0)|part_of(X2,esk1_2(X1,esk5_0))|part_of(esk1_2(X1,esk5_0),X2)|~incident_c(X1,X2)|~incident_c(X1,esk5_0)|~end_point(X1,esk4_0)|~part_of(X2,esk4_0)),inference(spm,[status(thm)],[46,95,theory(equality)])).
% cnf(215,negated_conjecture,(end_point(esk6_0,esk5_0)|part_of(esk1_2(esk6_0,esk5_0),X1)|part_of(X1,esk1_2(esk6_0,esk5_0))|~incident_c(esk6_0,X1)|~end_point(esk6_0,esk4_0)|~part_of(X1,esk4_0)),inference(spm,[status(thm)],[161,35,theory(equality)])).
% cnf(220,negated_conjecture,(end_point(esk6_0,esk5_0)|part_of(esk1_2(esk6_0,esk5_0),X1)|part_of(X1,esk1_2(esk6_0,esk5_0))|~incident_c(esk6_0,X1)|$false|~part_of(X1,esk4_0)),inference(rw,[status(thm)],[215,36,theory(equality)])).
% cnf(221,negated_conjecture,(end_point(esk6_0,esk5_0)|part_of(esk1_2(esk6_0,esk5_0),X1)|part_of(X1,esk1_2(esk6_0,esk5_0))|~incident_c(esk6_0,X1)|~part_of(X1,esk4_0)),inference(cn,[status(thm)],[220,theory(equality)])).
% cnf(222,negated_conjecture,(part_of(esk1_2(esk6_0,esk5_0),X1)|part_of(X1,esk1_2(esk6_0,esk5_0))|~incident_c(esk6_0,X1)|~part_of(X1,esk4_0)),inference(sr,[status(thm)],[221,34,theory(equality)])).
% cnf(224,negated_conjecture,(part_of(esk2_2(esk6_0,X1),esk1_2(esk6_0,esk5_0))|part_of(esk1_2(esk6_0,esk5_0),esk2_2(esk6_0,X1))|end_point(esk6_0,X1)|~part_of(esk2_2(esk6_0,X1),esk4_0)|~incident_c(esk6_0,X1)),inference(spm,[status(thm)],[222,17,theory(equality)])).
% cnf(394,negated_conjecture,(end_point(esk6_0,esk5_0)|part_of(esk1_2(esk6_0,esk5_0),esk2_2(esk6_0,esk5_0))|~incident_c(esk6_0,esk5_0)|~part_of(esk2_2(esk6_0,esk5_0),esk4_0)),inference(spm,[status(thm)],[15,224,theory(equality)])).
% cnf(395,negated_conjecture,(end_point(esk6_0,esk5_0)|part_of(esk1_2(esk6_0,esk5_0),esk2_2(esk6_0,esk5_0))|$false|~part_of(esk2_2(esk6_0,esk5_0),esk4_0)),inference(rw,[status(thm)],[394,35,theory(equality)])).
% cnf(396,negated_conjecture,(end_point(esk6_0,esk5_0)|part_of(esk1_2(esk6_0,esk5_0),esk2_2(esk6_0,esk5_0))|~part_of(esk2_2(esk6_0,esk5_0),esk4_0)),inference(cn,[status(thm)],[395,theory(equality)])).
% cnf(397,negated_conjecture,(part_of(esk1_2(esk6_0,esk5_0),esk2_2(esk6_0,esk5_0))|~part_of(esk2_2(esk6_0,esk5_0),esk4_0)),inference(sr,[status(thm)],[396,34,theory(equality)])).
% cnf(402,negated_conjecture,(end_point(esk6_0,esk5_0)|~incident_c(esk6_0,esk5_0)|~part_of(esk2_2(esk6_0,esk5_0),esk4_0)),inference(spm,[status(thm)],[16,397,theory(equality)])).
% cnf(412,negated_conjecture,(end_point(esk6_0,esk5_0)|$false|~part_of(esk2_2(esk6_0,esk5_0),esk4_0)),inference(rw,[status(thm)],[402,35,theory(equality)])).
% cnf(413,negated_conjecture,(end_point(esk6_0,esk5_0)|~part_of(esk2_2(esk6_0,esk5_0),esk4_0)),inference(cn,[status(thm)],[412,theory(equality)])).
% cnf(414,negated_conjecture,(~part_of(esk2_2(esk6_0,esk5_0),esk4_0)),inference(sr,[status(thm)],[413,34,theory(equality)])).
% cnf(442,negated_conjecture,(end_point(esk6_0,esk5_0)|~incident_c(esk6_0,esk5_0)),inference(spm,[status(thm)],[414,118,theory(equality)])).
% cnf(445,negated_conjecture,(end_point(esk6_0,esk5_0)|$false),inference(rw,[status(thm)],[442,35,theory(equality)])).
% cnf(446,negated_conjecture,(end_point(esk6_0,esk5_0)),inference(cn,[status(thm)],[445,theory(equality)])).
% cnf(447,negated_conjecture,($false),inference(sr,[status(thm)],[446,34,theory(equality)])).
% cnf(448,negated_conjecture,($false),447,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 116
% # ...of these trivial : 0
% # ...subsumed : 31
% # ...remaining for further processing: 85
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 216
% # ...of the previous two non-trivial : 163
% # Contextual simplify-reflections : 10
% # Paramodulations : 214
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 67
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 60
% # Current number of unprocessed clauses: 79
% # ...number of literals in the above : 508
% # Clause-clause subsumption calls (NU) : 374
% # Rec. Clause-clause subsumption calls : 203
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 16
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 91 leaves, 1.58+/-1.611 terms/leaf
% # Paramod-from index: 25 leaves, 1.08+/-0.271 terms/leaf
% # Paramod-into index: 60 leaves, 1.30+/-0.557 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.002 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP10405/GEO088+1.tptp
%
%------------------------------------------------------------------------------