TSTP Solution File: GEO225+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO225+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art01.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:17:21 EST 2010

% Result   : Theorem 1.09s
% Output   : Solution 1.09s
% 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/SystemOnTPTP14286/GEO225+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP14286/GEO225+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14286/GEO225+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 14418
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time     : 0.013 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(2, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(8, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(9, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(19, conjecture,![X4]:![X5]:(((point(X4)&point(X5))&distinct_points(X4,X5))=>?[X1]:(line(X1)=>(~(apart_point_and_line(X4,X1))&~(apart_point_and_line(X5,X1))))),file('/tmp/SRASS.s.p', con)).
% fof(20, negated_conjecture,~(![X4]:![X5]:(((point(X4)&point(X5))&distinct_points(X4,X5))=>?[X1]:(line(X1)=>(~(apart_point_and_line(X4,X1))&~(apart_point_and_line(X5,X1)))))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(22, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(23, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(28, negated_conjecture,~(![X4]:![X5]:(((point(X4)&point(X5))&distinct_points(X4,X5))=>?[X1]:(line(X1)=>(~(apart_point_and_line(X4,X1))&~(apart_point_and_line(X5,X1)))))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(29, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[21])).
% cnf(30,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(32, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(49, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[22])).
% fof(50, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[23])).
% fof(53, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(80, negated_conjecture,?[X4]:?[X5]:(((point(X4)&point(X5))&distinct_points(X4,X5))&![X1]:(line(X1)&(apart_point_and_line(X4,X1)|apart_point_and_line(X5,X1)))),inference(fof_nnf,[status(thm)],[28])).
% fof(81, negated_conjecture,?[X6]:?[X7]:(((point(X6)&point(X7))&distinct_points(X6,X7))&![X8]:(line(X8)&(apart_point_and_line(X6,X8)|apart_point_and_line(X7,X8)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(((point(esk1_0)&point(esk2_0))&distinct_points(esk1_0,esk2_0))&![X8]:(line(X8)&(apart_point_and_line(esk1_0,X8)|apart_point_and_line(esk2_0,X8)))),inference(skolemize,[status(esa)],[81])).
% fof(83, negated_conjecture,![X8]:((line(X8)&(apart_point_and_line(esk1_0,X8)|apart_point_and_line(esk2_0,X8)))&((point(esk1_0)&point(esk2_0))&distinct_points(esk1_0,esk2_0))),inference(shift_quantors,[status(thm)],[82])).
% cnf(84,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[83])).
% cnf(87,negated_conjecture,(apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk1_0,X1)),inference(split_conjunct,[status(thm)],[83])).
% cnf(93,negated_conjecture,(distinct_points(esk1_0,X1)|distinct_points(esk2_0,X1)),inference(spm,[status(thm)],[33,84,theory(equality)])).
% cnf(95,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(X1,esk1_0))|~distinct_points(X1,esk1_0)),inference(spm,[status(thm)],[54,87,theory(equality)])).
% cnf(100,negated_conjecture,(~distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[51,95,theory(equality)])).
% cnf(101,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[30,93,theory(equality)])).
% cnf(103,negated_conjecture,($false),inference(sr,[status(thm)],[101,100,theory(equality)])).
% cnf(104,negated_conjecture,($false),103,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 41
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 41
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 10
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 10
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 22
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 4
% #    Non-unit-clauses                : 15
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 14
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    23 leaves,   1.91+/-1.742 terms/leaf
% # Paramod-from index:            7 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           19 leaves,   1.42+/-0.591 terms/leaf
% # -------------------------------------------------
% # User time              : 0.013 s
% # System time            : 0.003 s
% # Total time             : 0.016 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/SystemOnTPTP14286/GEO225+1.tptp
% 
%------------------------------------------------------------------------------