TSTP Solution File: GEO208+2 by SRASS---0.1

View Problem - Process Solution

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

% Computer : art06.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:10:40 EST 2010

% Result   : Theorem 0.89s
% Output   : Solution 0.89s
% 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/SystemOnTPTP12462/GEO208+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP12462/GEO208+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12462/GEO208+2.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 12558
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:![X3]:(distinct_lines(X2,X3)=>((apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3))|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', cup1)).
% fof(16, conjecture,![X1]:![X2]:![X3]:(((~(apart_point_and_line(X1,X2))&~(apart_point_and_line(X1,X3)))&~(convergent_lines(X2,X3)))=>~(distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', con)).
% fof(17, negated_conjecture,~(![X1]:![X2]:![X3]:(((~(apart_point_and_line(X1,X2))&~(apart_point_and_line(X1,X3)))&~(convergent_lines(X2,X3)))=>~(distinct_lines(X2,X3)))),inference(assume_negation,[status(cth)],[16])).
% fof(23, negated_conjecture,~(![X1]:![X2]:![X3]:(((~(apart_point_and_line(X1,X2))&~(apart_point_and_line(X1,X3)))&~(convergent_lines(X2,X3)))=>~(distinct_lines(X2,X3)))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(40, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X2,X3))|((apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3))|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(41, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X5,X6))|((apart_point_and_line(X4,X5)|apart_point_and_line(X4,X6))|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[40])).
% cnf(42,plain,(convergent_lines(X1,X2)|apart_point_and_line(X3,X2)|apart_point_and_line(X3,X1)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(68, negated_conjecture,?[X1]:?[X2]:?[X3]:(((~(apart_point_and_line(X1,X2))&~(apart_point_and_line(X1,X3)))&~(convergent_lines(X2,X3)))&distinct_lines(X2,X3)),inference(fof_nnf,[status(thm)],[23])).
% fof(69, negated_conjecture,?[X4]:?[X5]:?[X6]:(((~(apart_point_and_line(X4,X5))&~(apart_point_and_line(X4,X6)))&~(convergent_lines(X5,X6)))&distinct_lines(X5,X6)),inference(variable_rename,[status(thm)],[68])).
% fof(70, negated_conjecture,(((~(apart_point_and_line(esk1_0,esk2_0))&~(apart_point_and_line(esk1_0,esk3_0)))&~(convergent_lines(esk2_0,esk3_0)))&distinct_lines(esk2_0,esk3_0)),inference(skolemize,[status(esa)],[69])).
% cnf(71,negated_conjecture,(distinct_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(72,negated_conjecture,(~convergent_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(73,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(74,negated_conjecture,(~apart_point_and_line(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(78,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[42,71,theory(equality)])).
% cnf(80,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)),inference(sr,[status(thm)],[78,72,theory(equality)])).
% cnf(92,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)),inference(spm,[status(thm)],[74,80,theory(equality)])).
% cnf(95,negated_conjecture,($false),inference(sr,[status(thm)],[92,73,theory(equality)])).
% cnf(96,negated_conjecture,($false),95,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 47
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 19
% # ...of the previous two non-trivial : 15
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 19
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 25
% #    Positive orientable unit clauses: 2
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 8
% #    Non-unit-clauses                : 15
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 38
% # Clause-clause subsumption calls (NU) : 11
% # Rec. Clause-clause subsumption calls : 11
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    24 leaves,   1.88+/-1.666 terms/leaf
% # Paramod-from index:            6 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           21 leaves,   1.48+/-0.852 terms/leaf
% # -------------------------------------------------
% # User time              : 0.012 s
% # System time            : 0.003 s
% # Total time             : 0.015 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/SystemOnTPTP12462/GEO208+2.tptp
% 
%------------------------------------------------------------------------------