%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO245+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:22:44 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/SystemOnTPTP18259/GEO245+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP18259/GEO245+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18259/GEO245+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 18355
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:![X4]:~((left_apart_point(X1,X4)|left_apart_point(X1,reverse_line(X4)))),file('/tmp/SRASS.s.p', ax10_basics)).
% fof(37, conjecture,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(left_apart_point(X3,line_connecting(X1,X2))=>right_apart_point(X2,line_connecting(X1,X3)))),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(left_apart_point(X3,line_connecting(X1,X2))=>right_apart_point(X2,line_connecting(X1,X3))))),inference(assume_negation,[status(cth)],[37])).
% fof(82, plain,![X1]:![X4]:(~(left_apart_point(X1,X4))&~(left_apart_point(X1,reverse_line(X4)))),inference(fof_nnf,[status(thm)],[9])).
% fof(83, plain,![X5]:![X6]:(~(left_apart_point(X5,X6))&~(left_apart_point(X5,reverse_line(X6)))),inference(variable_rename,[status(thm)],[82])).
% cnf(85,plain,(~left_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[83])).
% fof(186, negated_conjecture,?[X1]:?[X2]:?[X3]:(distinct_points(X1,X2)&(left_apart_point(X3,line_connecting(X1,X2))&~(right_apart_point(X2,line_connecting(X1,X3))))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X4]:?[X5]:?[X6]:(distinct_points(X4,X5)&(left_apart_point(X6,line_connecting(X4,X5))&~(right_apart_point(X5,line_connecting(X4,X6))))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,(distinct_points(esk1_0,esk2_0)&(left_apart_point(esk3_0,line_connecting(esk1_0,esk2_0))&~(right_apart_point(esk2_0,line_connecting(esk1_0,esk3_0))))),inference(skolemize,[status(esa)],[187])).
% cnf(190,negated_conjecture,(left_apart_point(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[188])).
% cnf(192,negated_conjecture,($false),inference(sr,[status(thm)],[190,85,theory(equality)])).
% cnf(193,negated_conjecture,($false),192,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 4
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 4
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 3
% #    Positive orientable unit clauses: 1
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 65
% # ...number of literals in the above : 173
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:     6 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            1 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            5 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.014 s
% # System time            : 0.003 s
% # Total time             : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP18259/GEO245+3.tptp
% 
%------------------------------------------------------------------------------