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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO178+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 : art03.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:01:10 EST 2010

% Result   : Theorem 0.88s
% Output   : Solution 0.88s
% 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/SystemOnTPTP20265/GEO178+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP20265/GEO178+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20265/GEO178+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 20361
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(4, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(5, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),file('/tmp/SRASS.s.p', ceq1)).
% fof(15, conjecture,![X1]:![X2]:![X3]:((distinct_points(X1,X2)&apart_point_and_line(X3,line_connecting(X1,X2)))=>(distinct_points(X3,X1)&distinct_points(X3,X2))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:((distinct_points(X1,X2)&apart_point_and_line(X3,line_connecting(X1,X2)))=>(distinct_points(X3,X1)&distinct_points(X3,X2)))),inference(assume_negation,[status(cth)],[15])).
% fof(18, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(19, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(29, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[18])).
% fof(30, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[19])).
% fof(33, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(36, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_points(X4,X6)|apart_point_and_line(X6,X5))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(63, negated_conjecture,?[X1]:?[X2]:?[X3]:((distinct_points(X1,X2)&apart_point_and_line(X3,line_connecting(X1,X2)))&(~(distinct_points(X3,X1))|~(distinct_points(X3,X2)))),inference(fof_nnf,[status(thm)],[16])).
% fof(64, negated_conjecture,?[X4]:?[X5]:?[X6]:((distinct_points(X4,X5)&apart_point_and_line(X6,line_connecting(X4,X5)))&(~(distinct_points(X6,X4))|~(distinct_points(X6,X5)))),inference(variable_rename,[status(thm)],[63])).
% fof(65, negated_conjecture,((distinct_points(esk1_0,esk2_0)&apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)))&(~(distinct_points(esk3_0,esk1_0))|~(distinct_points(esk3_0,esk2_0)))),inference(skolemize,[status(esa)],[64])).
% cnf(66,negated_conjecture,(~distinct_points(esk3_0,esk2_0)|~distinct_points(esk3_0,esk1_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(70,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|distinct_points(esk3_0,X1)),inference(spm,[status(thm)],[37,67,theory(equality)])).
% cnf(78,negated_conjecture,(distinct_points(esk3_0,esk2_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[34,70,theory(equality)])).
% cnf(79,negated_conjecture,(distinct_points(esk3_0,esk1_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[31,70,theory(equality)])).
% cnf(80,negated_conjecture,(distinct_points(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[78,68,theory(equality)])).
% cnf(81,negated_conjecture,(distinct_points(esk3_0,esk2_0)),inference(cn,[status(thm)],[80,theory(equality)])).
% cnf(82,negated_conjecture,(distinct_points(esk3_0,esk1_0)|$false),inference(rw,[status(thm)],[79,68,theory(equality)])).
% cnf(83,negated_conjecture,(distinct_points(esk3_0,esk1_0)),inference(cn,[status(thm)],[82,theory(equality)])).
% cnf(86,negated_conjecture,(~distinct_points(esk3_0,esk1_0)|$false),inference(rw,[status(thm)],[66,81,theory(equality)])).
% cnf(87,negated_conjecture,(~distinct_points(esk3_0,esk1_0)),inference(cn,[status(thm)],[86,theory(equality)])).
% cnf(89,negated_conjecture,($false),inference(rw,[status(thm)],[87,83,theory(equality)])).
% cnf(90,negated_conjecture,($false),inference(cn,[status(thm)],[89,theory(equality)])).
% cnf(91,negated_conjecture,($false),90,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 40
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 40
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 14
% # ...of the previous two non-trivial : 15
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 14
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 21
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 13
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 21
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # 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:    22 leaves,   1.95+/-1.770 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.011 s
% # System time            : 0.003 s
% # Total time             : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP20265/GEO178+1.tptp
% 
%------------------------------------------------------------------------------