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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO173+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 : 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 05:00:02 EST 2010

% Result   : Theorem 0.93s
% Output   : Solution 0.93s
% 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/SystemOnTPTP28967/GEO173+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP28967/GEO173+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28967/GEO173+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 29063
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.015 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(4, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(7, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(8, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(9, axiom,![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_lines(X4,X5))=>(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),file('/tmp/SRASS.s.p', cu1)).
% fof(36, conjecture,![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_lines(X4,line_connecting(X1,X2)))=>(apart_point_and_line(X1,X4)|apart_point_and_line(X2,X4))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_lines(X4,line_connecting(X1,X2)))=>(apart_point_and_line(X1,X4)|apart_point_and_line(X2,X4)))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(42, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(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(63, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(64, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(72, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[41])).
% fof(73, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[72])).
% cnf(74,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(75, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[42])).
% fof(76, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[75])).
% cnf(77,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[76])).
% fof(78, plain,![X1]:![X2]:![X4]:![X5]:((~(distinct_points(X1,X2))|~(distinct_lines(X4,X5)))|(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),inference(fof_nnf,[status(thm)],[9])).
% fof(79, plain,![X6]:![X7]:![X8]:![X9]:((~(distinct_points(X6,X7))|~(distinct_lines(X8,X9)))|(((apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9))|apart_point_and_line(X7,X8))|apart_point_and_line(X7,X9))),inference(variable_rename,[status(thm)],[78])).
% cnf(80,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)],[79])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_lines(X4,line_connecting(X1,X2)))&(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X2,X4)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((distinct_points(X6,X7)&convergent_lines(X8,X9))&distinct_lines(X8,line_connecting(X6,X7)))&(~(apart_point_and_line(X6,X8))&~(apart_point_and_line(X7,X8)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)))&(~(apart_point_and_line(esk1_0,esk3_0))&~(apart_point_and_line(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~apart_point_and_line(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(174,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(184,negated_conjecture,(distinct_points(esk2_0,X1)|distinct_points(esk1_0,X1)),inference(spm,[status(thm)],[65,174,theory(equality)])).
% cnf(198,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)],[80,172,theory(equality)])).
% cnf(249,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[58,184,theory(equality)])).
% cnf(340,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)],[198,249,theory(equality)])).
% cnf(343,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)],[340,170,theory(equality)])).
% cnf(344,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)],[343,171,theory(equality)])).
% cnf(350,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[74,344,theory(equality)])).
% cnf(351,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[350,174,theory(equality)])).
% cnf(352,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[351,theory(equality)])).
% cnf(355,negated_conjecture,(~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[77,352,theory(equality)])).
% cnf(357,negated_conjecture,($false),inference(rw,[status(thm)],[355,174,theory(equality)])).
% cnf(358,negated_conjecture,($false),inference(cn,[status(thm)],[357,theory(equality)])).
% cnf(359,negated_conjecture,($false),358,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 83
% # ...of these trivial                : 0
% # ...subsumed                        : 10
% # ...remaining for further processing: 73
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 1
% # Backward-rewritten                 : 1
% # Generated clauses                  : 155
% # ...of the previous two non-trivial : 134
% # Contextual simplify-reflections    : 4
% # Paramodulations                    : 153
% # Factorizations                     : 2
% # Equation resolutions               : 0
% # Current number of processed clauses: 71
% #    Positive orientable unit clauses: 12
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 9
% #    Non-unit-clauses                : 50
% # Current number of unprocessed clauses: 89
% # ...number of literals in the above : 336
% # Clause-clause subsumption calls (NU) : 79
% # Rec. Clause-clause subsumption calls : 71
% # 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:    65 leaves,   1.57+/-1.277 terms/leaf
% # Paramod-from index:           31 leaves,   1.06+/-0.246 terms/leaf
% # Paramod-into index:           55 leaves,   1.40+/-0.907 terms/leaf
% # -------------------------------------------------
% # User time              : 0.017 s
% # System time            : 0.006 s
% # Total time             : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP28967/GEO173+3.tptp
% 
%------------------------------------------------------------------------------