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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO217+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 : 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:13:59 EST 2010

% Result   : Theorem 0.91s
% Output   : Solution 0.91s
% 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/SystemOnTPTP25705/GEO217+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP25705/GEO217+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25705/GEO217+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 25801
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(2, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', apart6)).
% fof(16, conjecture,![X4]:![X5]:![X6]:((~(convergent_lines(X4,X5))&~(convergent_lines(X4,X6)))=>~(convergent_lines(X5,X6))),file('/tmp/SRASS.s.p', con)).
% fof(17, negated_conjecture,~(![X4]:![X5]:![X6]:((~(convergent_lines(X4,X5))&~(convergent_lines(X4,X6)))=>~(convergent_lines(X5,X6)))),inference(assume_negation,[status(cth)],[16])).
% fof(18, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(24, negated_conjecture,~(![X4]:![X5]:![X6]:((~(convergent_lines(X4,X5))&~(convergent_lines(X4,X6)))=>~(convergent_lines(X5,X6)))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(25, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[18])).
% cnf(26,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(28, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(75, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(convergent_lines(X4,X5))&~(convergent_lines(X4,X6)))&convergent_lines(X5,X6)),inference(fof_nnf,[status(thm)],[24])).
% fof(76, negated_conjecture,?[X7]:?[X8]:?[X9]:((~(convergent_lines(X7,X8))&~(convergent_lines(X7,X9)))&convergent_lines(X8,X9)),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((~(convergent_lines(esk1_0,esk2_0))&~(convergent_lines(esk1_0,esk3_0)))&convergent_lines(esk2_0,esk3_0)),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(~convergent_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(83,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[29,78,theory(equality)])).
% cnf(97,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(X2,X1)|convergent_lines(esk3_0,X2)),inference(spm,[status(thm)],[29,83,theory(equality)])).
% cnf(105,negated_conjecture,(convergent_lines(esk3_0,X1)|convergent_lines(X1,esk2_0)),inference(spm,[status(thm)],[26,97,theory(equality)])).
% cnf(127,negated_conjecture,(convergent_lines(esk3_0,esk1_0)),inference(spm,[status(thm)],[80,105,theory(equality)])).
% cnf(135,negated_conjecture,(convergent_lines(esk3_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[29,127,theory(equality)])).
% cnf(140,negated_conjecture,(convergent_lines(esk3_0,esk3_0)),inference(spm,[status(thm)],[79,135,theory(equality)])).
% cnf(143,negated_conjecture,($false),inference(sr,[status(thm)],[140,26,theory(equality)])).
% cnf(144,negated_conjecture,($false),143,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 64
% # ...of these trivial                : 0
% # ...subsumed                        : 7
% # ...remaining for further processing: 57
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 57
% # ...of the previous two non-trivial : 48
% # Contextual simplify-reflections    : 1
% # Paramodulations                    : 55
% # Factorizations                     : 2
% # Equation resolutions               : 0
% # Current number of processed clauses: 35
% #    Positive orientable unit clauses: 4
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 5
% #    Non-unit-clauses                : 26
% # Current number of unprocessed clauses: 29
% # ...number of literals in the above : 106
% # Clause-clause subsumption calls (NU) : 66
% # Rec. Clause-clause subsumption calls : 60
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    29 leaves,   1.97+/-1.790 terms/leaf
% # Paramod-from index:           14 leaves,   1.07+/-0.258 terms/leaf
% # Paramod-into index:           25 leaves,   1.68+/-1.009 terms/leaf
% # -------------------------------------------------
% # User time              : 0.016 s
% # System time            : 0.004 s
% # Total time             : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP25705/GEO217+2.tptp
% 
%------------------------------------------------------------------------------