TSTP Solution File: GEO087+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO087+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:44 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/SystemOnTPTP10146/GEO087+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10146/GEO087+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10146/GEO087+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 10242
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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(3, axiom,![X5]:![X1]:![X2]:(meet(X5,X1,X2)<=>((incident_c(X5,X1)&incident_c(X5,X2))&![X6]:((incident_c(X6,X1)&incident_c(X6,X2))=>(end_point(X6,X1)&end_point(X6,X2))))),file('/tmp/SRASS.s.p', meet_defn)).
% fof(11, axiom,![X1]:?[X5]:inner_point(X5,X1),file('/tmp/SRASS.s.p', c3)).
% fof(15, axiom,![X5]:![X1]:(inner_point(X5,X1)<=>(incident_c(X5,X1)&~(end_point(X5,X1)))),file('/tmp/SRASS.s.p', inner_point_defn)).
% fof(17, conjecture,![X2]:![X3]:(part_of(X2,X3)=>~(?[X5]:meet(X5,X2,X3))),file('/tmp/SRASS.s.p', corollary_2_9)).
% fof(18, negated_conjecture,~(![X2]:![X3]:(part_of(X2,X3)=>~(?[X5]:meet(X5,X2,X3)))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X5]:![X1]:(inner_point(X5,X1)<=>(incident_c(X5,X1)&~(end_point(X5,X1)))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(24, 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)],[2])).
% fof(25, 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)],[24])).
% fof(26, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&((incident_c(esk1_2(X6,X7),X7)&~(incident_c(esk1_2(X6,X7),X6)))|part_of(X7,X6))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk1_2(X6,X7),X7)&~(incident_c(esk1_2(X6,X7),X6)))|part_of(X7,X6))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk1_2(X6,X7),X7)|part_of(X7,X6))&(~(incident_c(esk1_2(X6,X7),X6))|part_of(X7,X6)))),inference(distribute,[status(thm)],[27])).
% cnf(31,plain,(incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X5]:![X1]:![X2]:((~(meet(X5,X1,X2))|((incident_c(X5,X1)&incident_c(X5,X2))&![X6]:((~(incident_c(X6,X1))|~(incident_c(X6,X2)))|(end_point(X6,X1)&end_point(X6,X2)))))&(((~(incident_c(X5,X1))|~(incident_c(X5,X2)))|?[X6]:((incident_c(X6,X1)&incident_c(X6,X2))&(~(end_point(X6,X1))|~(end_point(X6,X2)))))|meet(X5,X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(33, plain,![X7]:![X8]:![X9]:((~(meet(X7,X8,X9))|((incident_c(X7,X8)&incident_c(X7,X9))&![X10]:((~(incident_c(X10,X8))|~(incident_c(X10,X9)))|(end_point(X10,X8)&end_point(X10,X9)))))&(((~(incident_c(X7,X8))|~(incident_c(X7,X9)))|?[X11]:((incident_c(X11,X8)&incident_c(X11,X9))&(~(end_point(X11,X8))|~(end_point(X11,X9)))))|meet(X7,X8,X9))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X7]:![X8]:![X9]:((~(meet(X7,X8,X9))|((incident_c(X7,X8)&incident_c(X7,X9))&![X10]:((~(incident_c(X10,X8))|~(incident_c(X10,X9)))|(end_point(X10,X8)&end_point(X10,X9)))))&(((~(incident_c(X7,X8))|~(incident_c(X7,X9)))|((incident_c(esk2_3(X7,X8,X9),X8)&incident_c(esk2_3(X7,X8,X9),X9))&(~(end_point(esk2_3(X7,X8,X9),X8))|~(end_point(esk2_3(X7,X8,X9),X9)))))|meet(X7,X8,X9))),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X7]:![X8]:![X9]:![X10]:(((((~(incident_c(X10,X8))|~(incident_c(X10,X9)))|(end_point(X10,X8)&end_point(X10,X9)))&(incident_c(X7,X8)&incident_c(X7,X9)))|~(meet(X7,X8,X9)))&(((~(incident_c(X7,X8))|~(incident_c(X7,X9)))|((incident_c(esk2_3(X7,X8,X9),X8)&incident_c(esk2_3(X7,X8,X9),X9))&(~(end_point(esk2_3(X7,X8,X9),X8))|~(end_point(esk2_3(X7,X8,X9),X9)))))|meet(X7,X8,X9))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X7]:![X8]:![X9]:![X10]:(((((end_point(X10,X8)|(~(incident_c(X10,X8))|~(incident_c(X10,X9))))|~(meet(X7,X8,X9)))&((end_point(X10,X9)|(~(incident_c(X10,X8))|~(incident_c(X10,X9))))|~(meet(X7,X8,X9))))&((incident_c(X7,X8)|~(meet(X7,X8,X9)))&(incident_c(X7,X9)|~(meet(X7,X8,X9)))))&((((incident_c(esk2_3(X7,X8,X9),X8)|(~(incident_c(X7,X8))|~(incident_c(X7,X9))))|meet(X7,X8,X9))&((incident_c(esk2_3(X7,X8,X9),X9)|(~(incident_c(X7,X8))|~(incident_c(X7,X9))))|meet(X7,X8,X9)))&(((~(end_point(esk2_3(X7,X8,X9),X8))|~(end_point(esk2_3(X7,X8,X9),X9)))|(~(incident_c(X7,X8))|~(incident_c(X7,X9))))|meet(X7,X8,X9)))),inference(distribute,[status(thm)],[35])).
% cnf(43,plain,(end_point(X4,X2)|~meet(X1,X2,X3)|~incident_c(X4,X3)|~incident_c(X4,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(87, plain,![X6]:?[X7]:inner_point(X7,X6),inference(variable_rename,[status(thm)],[11])).
% fof(88, plain,![X6]:inner_point(esk10_1(X6),X6),inference(skolemize,[status(esa)],[87])).
% cnf(89,plain,(inner_point(esk10_1(X1),X1)),inference(split_conjunct,[status(thm)],[88])).
% fof(110, plain,![X5]:![X1]:((~(inner_point(X5,X1))|(incident_c(X5,X1)&~(end_point(X5,X1))))&((~(incident_c(X5,X1))|end_point(X5,X1))|inner_point(X5,X1))),inference(fof_nnf,[status(thm)],[19])).
% fof(111, plain,![X6]:![X7]:((~(inner_point(X6,X7))|(incident_c(X6,X7)&~(end_point(X6,X7))))&((~(incident_c(X6,X7))|end_point(X6,X7))|inner_point(X6,X7))),inference(variable_rename,[status(thm)],[110])).
% fof(112, plain,![X6]:![X7]:(((incident_c(X6,X7)|~(inner_point(X6,X7)))&(~(end_point(X6,X7))|~(inner_point(X6,X7))))&((~(incident_c(X6,X7))|end_point(X6,X7))|inner_point(X6,X7))),inference(distribute,[status(thm)],[111])).
% cnf(114,plain,(~inner_point(X1,X2)|~end_point(X1,X2)),inference(split_conjunct,[status(thm)],[112])).
% cnf(115,plain,(incident_c(X1,X2)|~inner_point(X1,X2)),inference(split_conjunct,[status(thm)],[112])).
% fof(122, negated_conjecture,?[X2]:?[X3]:(part_of(X2,X3)&?[X5]:meet(X5,X2,X3)),inference(fof_nnf,[status(thm)],[18])).
% fof(123, negated_conjecture,?[X6]:?[X7]:(part_of(X6,X7)&?[X8]:meet(X8,X6,X7)),inference(variable_rename,[status(thm)],[122])).
% fof(124, negated_conjecture,(part_of(esk14_0,esk15_0)&meet(esk16_0,esk14_0,esk15_0)),inference(skolemize,[status(esa)],[123])).
% cnf(125,negated_conjecture,(meet(esk16_0,esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(126,negated_conjecture,(part_of(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(130,plain,(incident_c(esk10_1(X1),X1)),inference(spm,[status(thm)],[115,89,theory(equality)])).
% cnf(131,plain,(~end_point(esk10_1(X1),X1)),inference(spm,[status(thm)],[114,89,theory(equality)])).
% cnf(141,negated_conjecture,(incident_c(X1,esk15_0)|~incident_c(X1,esk14_0)),inference(spm,[status(thm)],[31,126,theory(equality)])).
% cnf(165,negated_conjecture,(end_point(X1,esk14_0)|~incident_c(X1,esk15_0)|~incident_c(X1,esk14_0)),inference(spm,[status(thm)],[43,125,theory(equality)])).
% cnf(318,negated_conjecture,(end_point(X1,esk14_0)|~incident_c(X1,esk14_0)),inference(csr,[status(thm)],[165,141])).
% cnf(319,negated_conjecture,(~incident_c(esk10_1(esk14_0),esk14_0)),inference(spm,[status(thm)],[131,318,theory(equality)])).
% cnf(326,negated_conjecture,($false),inference(rw,[status(thm)],[319,130,theory(equality)])).
% cnf(327,negated_conjecture,($false),inference(cn,[status(thm)],[326,theory(equality)])).
% cnf(328,negated_conjecture,($false),327,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 121
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 118
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 185
% # ...of the previous two non-trivial : 159
% # Contextual simplify-reflections : 2
% # Paramodulations : 171
% # Factorizations : 8
% # Equation resolutions : 6
% # Current number of processed clauses: 72
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 59
% # Current number of unprocessed clauses: 119
% # ...number of literals in the above : 567
% # Clause-clause subsumption calls (NU) : 129
% # Rec. Clause-clause subsumption calls : 107
% # Unit Clause-clause subsumption calls : 48
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 17
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 72 leaves, 1.58+/-1.714 terms/leaf
% # Paramod-from index: 33 leaves, 1.15+/-0.435 terms/leaf
% # Paramod-into index: 65 leaves, 1.34+/-0.899 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.006 s
% # Total time : 0.029 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/SystemOnTPTP10146/GEO087+1.tptp
%
%------------------------------------------------------------------------------