TSTP Solution File: GEO184+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO184+3 : TPTP v5.0.0. Released v4.0.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 05:03:19 EST 2010

% Result   : Theorem 0.94s
% Output   : Solution 0.94s
% 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/SystemOnTPTP32353/GEO184+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP32353/GEO184+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32353/GEO184+3.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 32462
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(3, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(5, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(6, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(7, axiom,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),file('/tmp/SRASS.s.p', a4)).
% fof(8, axiom,![X1]:![X2]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),file('/tmp/SRASS.s.p', ax2)).
% fof(23, axiom,![X1]:![X2]:![X9]:![X10]:((distinct_points(X1,X2)&distinct_lines(X9,X10))=>(((apart_point_and_line(X1,X9)|apart_point_and_line(X1,X10))|apart_point_and_line(X2,X9))|apart_point_and_line(X2,X10))),file('/tmp/SRASS.s.p', cu1)).
% fof(36, conjecture,![X1]:![X2]:![X9]:![X10]:((((distinct_points(X1,X2)&convergent_lines(X9,X10))&incident_point_and_line(X1,X9))&incident_point_and_line(X2,X9))=>equal_lines(X9,line_connecting(X1,X2))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X9]:![X10]:((((distinct_points(X1,X2)&convergent_lines(X9,X10))&incident_point_and_line(X1,X9))&incident_point_and_line(X2,X9))=>equal_lines(X9,line_connecting(X1,X2)))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(40, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(42, plain,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(43, plain,![X1]:![X2]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(57, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[38])).
% cnf(58,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(61, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(62, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(68, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(70, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[41])).
% fof(71, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(73, plain,![X1]:![X2]:((~(incident_point_and_line(X1,X2))|~(apart_point_and_line(X1,X2)))&(apart_point_and_line(X1,X2)|incident_point_and_line(X1,X2))),inference(fof_nnf,[status(thm)],[42])).
% fof(74, plain,![X3]:![X4]:((~(incident_point_and_line(X3,X4))|~(apart_point_and_line(X3,X4)))&(apart_point_and_line(X3,X4)|incident_point_and_line(X3,X4))),inference(variable_rename,[status(thm)],[73])).
% cnf(76,plain,(~apart_point_and_line(X1,X2)|~incident_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(77, plain,![X1]:![X2]:((~(equal_lines(X1,X2))|~(distinct_lines(X1,X2)))&(distinct_lines(X1,X2)|equal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[43])).
% fof(78, plain,![X3]:![X4]:((~(equal_lines(X3,X4))|~(distinct_lines(X3,X4)))&(distinct_lines(X3,X4)|equal_lines(X3,X4))),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(equal_lines(X1,X2)|distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[78])).
% fof(130, plain,![X1]:![X2]:![X9]:![X10]:((~(distinct_points(X1,X2))|~(distinct_lines(X9,X10)))|(((apart_point_and_line(X1,X9)|apart_point_and_line(X1,X10))|apart_point_and_line(X2,X9))|apart_point_and_line(X2,X10))),inference(fof_nnf,[status(thm)],[23])).
% fof(131, plain,![X11]:![X12]:![X13]:![X14]:((~(distinct_points(X11,X12))|~(distinct_lines(X13,X14)))|(((apart_point_and_line(X11,X13)|apart_point_and_line(X11,X14))|apart_point_and_line(X12,X13))|apart_point_and_line(X12,X14))),inference(variable_rename,[status(thm)],[130])).
% cnf(132,plain,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X2)|~distinct_points(X4,X1)),inference(split_conjunct,[status(thm)],[131])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X9]:?[X10]:((((distinct_points(X1,X2)&convergent_lines(X9,X10))&incident_point_and_line(X1,X9))&incident_point_and_line(X2,X9))&~(equal_lines(X9,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X11]:?[X12]:?[X13]:?[X14]:((((distinct_points(X11,X12)&convergent_lines(X13,X14))&incident_point_and_line(X11,X13))&incident_point_and_line(X12,X13))&~(equal_lines(X13,line_connecting(X11,X12)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&incident_point_and_line(esk1_0,esk3_0))&incident_point_and_line(esk2_0,esk3_0))&~(equal_lines(esk3_0,line_connecting(esk1_0,esk2_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(incident_point_and_line(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(incident_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(174,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(175,negated_conjecture,(distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[170,79,theory(equality)])).
% cnf(179,negated_conjecture,(~apart_point_and_line(esk2_0,esk3_0)),inference(spm,[status(thm)],[76,171,theory(equality)])).
% cnf(180,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(spm,[status(thm)],[76,172,theory(equality)])).
% cnf(184,negated_conjecture,(distinct_points(esk2_0,X1)|distinct_points(esk1_0,X1)),inference(spm,[status(thm)],[63,174,theory(equality)])).
% cnf(199,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,esk3_0)|~distinct_points(X2,X1)),inference(spm,[status(thm)],[132,175,theory(equality)])).
% cnf(239,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[58,184,theory(equality)])).
% cnf(305,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,esk3_0)|apart_point_and_line(esk1_0,esk3_0)),inference(spm,[status(thm)],[199,239,theory(equality)])).
% cnf(308,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,esk3_0)),inference(sr,[status(thm)],[305,179,theory(equality)])).
% cnf(309,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(sr,[status(thm)],[308,180,theory(equality)])).
% cnf(337,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[69,309,theory(equality)])).
% cnf(338,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[337,174,theory(equality)])).
% cnf(339,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[338,theory(equality)])).
% cnf(342,negated_conjecture,(~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[72,339,theory(equality)])).
% cnf(344,negated_conjecture,($false),inference(rw,[status(thm)],[342,174,theory(equality)])).
% cnf(345,negated_conjecture,($false),inference(cn,[status(thm)],[344,theory(equality)])).
% cnf(346,negated_conjecture,($false),345,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 87
% # ...of these trivial                : 0
% # ...subsumed                        : 11
% # ...remaining for further processing: 76
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 146
% # ...of the previous two non-trivial : 123
% # Contextual simplify-reflections    : 4
% # Paramodulations                    : 144
% # Factorizations                     : 2
% # Equation resolutions               : 0
% # Current number of processed clauses: 75
% #    Positive orientable unit clauses: 14
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 10
% #    Non-unit-clauses                : 51
% # Current number of unprocessed clauses: 85
% # ...number of literals in the above : 306
% # Clause-clause subsumption calls (NU) : 77
% # Rec. Clause-clause subsumption calls : 73
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    67 leaves,   1.58+/-1.384 terms/leaf
% # Paramod-from index:           35 leaves,   1.06+/-0.333 terms/leaf
% # Paramod-into index:           59 leaves,   1.37+/-0.900 terms/leaf
% # -------------------------------------------------
% # User time              : 0.018 s
% # System time            : 0.004 s
% # Total time             : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.21 WC
% FINAL PrfWatch: 0.11 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP32353/GEO184+3.tptp
% 
%------------------------------------------------------------------------------