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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO213+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 : art04.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:12:11 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/SystemOnTPTP14375/GEO213+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP14375/GEO213+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14375/GEO213+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 14471
% 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(1, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(2, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(5, axiom,![X5]:![X6]:(convergent_lines(X5,X6)|unorthogonal_lines(X5,X6)),file('/tmp/SRASS.s.p', occu1)).
% fof(6, axiom,![X5]:![X6]:![X7]:((convergent_lines(X5,X6)&unorthogonal_lines(X5,X6))=>((convergent_lines(X5,X7)&unorthogonal_lines(X5,X7))|(convergent_lines(X6,X7)&unorthogonal_lines(X6,X7)))),file('/tmp/SRASS.s.p', oac1)).
% fof(7, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(8, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(9, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(23, conjecture,![X5]:![X6]:![X7]:(unorthogonal_lines(X5,X6)=>(distinct_lines(X5,X7)|unorthogonal_lines(X6,X7))),file('/tmp/SRASS.s.p', con)).
% fof(24, negated_conjecture,~(![X5]:![X6]:![X7]:(unorthogonal_lines(X5,X6)=>(distinct_lines(X5,X7)|unorthogonal_lines(X6,X7)))),inference(assume_negation,[status(cth)],[23])).
% fof(25, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(26, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(36, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[25])).
% cnf(37,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(39, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(47, plain,![X7]:![X8]:(convergent_lines(X7,X8)|unorthogonal_lines(X7,X8)),inference(variable_rename,[status(thm)],[5])).
% cnf(48,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X5]:![X6]:![X7]:((~(convergent_lines(X5,X6))|~(unorthogonal_lines(X5,X6)))|((convergent_lines(X5,X7)&unorthogonal_lines(X5,X7))|(convergent_lines(X6,X7)&unorthogonal_lines(X6,X7)))),inference(fof_nnf,[status(thm)],[6])).
% fof(50, plain,![X8]:![X9]:![X10]:((~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))|((convergent_lines(X8,X10)&unorthogonal_lines(X8,X10))|(convergent_lines(X9,X10)&unorthogonal_lines(X9,X10)))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X8]:![X9]:![X10]:((((convergent_lines(X9,X10)|convergent_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9))))&((unorthogonal_lines(X9,X10)|convergent_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))))&(((convergent_lines(X9,X10)|unorthogonal_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9))))&((unorthogonal_lines(X9,X10)|unorthogonal_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))))),inference(distribute,[status(thm)],[50])).
% cnf(52,plain,(unorthogonal_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,plain,(convergent_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(56, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(57, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[26])).
% cnf(60,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(62, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(98, negated_conjecture,?[X5]:?[X6]:?[X7]:(unorthogonal_lines(X5,X6)&(~(distinct_lines(X5,X7))&~(unorthogonal_lines(X6,X7)))),inference(fof_nnf,[status(thm)],[24])).
% fof(99, negated_conjecture,?[X8]:?[X9]:?[X10]:(unorthogonal_lines(X8,X9)&(~(distinct_lines(X8,X10))&~(unorthogonal_lines(X9,X10)))),inference(variable_rename,[status(thm)],[98])).
% fof(100, negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)&(~(distinct_lines(esk1_0,esk3_0))&~(unorthogonal_lines(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[99])).
% cnf(101,negated_conjecture,(~unorthogonal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(102,negated_conjecture,(~distinct_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(103,negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(104,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[101,48,theory(equality)])).
% cnf(106,negated_conjecture,(unorthogonal_lines(esk1_0,X1)|unorthogonal_lines(esk2_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[52,103,theory(equality)])).
% cnf(109,negated_conjecture,(convergent_lines(esk1_0,X1)|unorthogonal_lines(esk2_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[54,103,theory(equality)])).
% cnf(113,negated_conjecture,(convergent_lines(esk2_0,X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[58,104,theory(equality)])).
% cnf(119,negated_conjecture,(distinct_lines(X1,X2)|distinct_lines(esk3_0,X2)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[40,113,theory(equality)])).
% cnf(135,negated_conjecture,(convergent_lines(esk1_0,X1)|unorthogonal_lines(X2,X1)|unorthogonal_lines(esk2_0,X2)|~convergent_lines(esk1_0,X2)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[54,106,theory(equality)])).
% cnf(157,negated_conjecture,(convergent_lines(esk2_0,X1)|distinct_lines(X1,esk3_0)),inference(spm,[status(thm)],[37,119,theory(equality)])).
% cnf(179,negated_conjecture,(convergent_lines(esk1_0,esk3_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[101,109,theory(equality)])).
% cnf(180,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[102,157,theory(equality)])).
% cnf(187,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[63,180,theory(equality)])).
% cnf(199,negated_conjecture,(convergent_lines(esk1_0,X1)|distinct_lines(esk3_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[58,179,theory(equality)])).
% cnf(515,negated_conjecture,(convergent_lines(esk1_0,X1)|unorthogonal_lines(esk2_0,X2)|unorthogonal_lines(X2,X1)|~convergent_lines(esk1_0,esk2_0)),inference(csr,[status(thm)],[135,109])).
% cnf(516,negated_conjecture,(convergent_lines(esk1_0,X1)|unorthogonal_lines(esk2_0,X2)|unorthogonal_lines(X2,X1)|convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[515,187,theory(equality)])).
% cnf(518,negated_conjecture,(convergent_lines(esk1_0,X1)|unorthogonal_lines(esk2_0,X2)|unorthogonal_lines(X2,X1)),inference(sr,[status(thm)],[516,60,theory(equality)])).
% cnf(519,negated_conjecture,(convergent_lines(esk1_0,esk2_0)|unorthogonal_lines(esk2_0,esk2_0)),inference(ef,[status(thm)],[518,theory(equality)])).
% cnf(529,negated_conjecture,(unorthogonal_lines(esk2_0,X1)|convergent_lines(esk1_0,esk2_0)|~convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[52,519,theory(equality)])).
% cnf(595,negated_conjecture,(convergent_lines(esk1_0,esk2_0)|unorthogonal_lines(esk2_0,X1)),inference(csr,[status(thm)],[529,187])).
% cnf(599,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[101,595,theory(equality)])).
% cnf(605,negated_conjecture,(convergent_lines(esk1_0,X1)|distinct_lines(esk3_0,X1)|$false),inference(rw,[status(thm)],[199,599,theory(equality)])).
% cnf(606,negated_conjecture,(convergent_lines(esk1_0,X1)|distinct_lines(esk3_0,X1)),inference(cn,[status(thm)],[605,theory(equality)])).
% cnf(622,negated_conjecture,(distinct_lines(X1,X2)|distinct_lines(esk3_0,X2)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[40,606,theory(equality)])).
% cnf(644,negated_conjecture,(convergent_lines(esk1_0,X1)|distinct_lines(X1,esk3_0)),inference(spm,[status(thm)],[37,622,theory(equality)])).
% cnf(674,negated_conjecture,(convergent_lines(esk1_0,esk1_0)),inference(spm,[status(thm)],[102,644,theory(equality)])).
% cnf(679,negated_conjecture,($false),inference(sr,[status(thm)],[674,60,theory(equality)])).
% cnf(680,negated_conjecture,($false),679,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 155
% # ...of these trivial                : 0
% # ...subsumed                        : 41
% # ...remaining for further processing: 114
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 5
% # Backward-rewritten                 : 7
% # Generated clauses                  : 482
% # ...of the previous two non-trivial : 410
% # Contextual simplify-reflections    : 9
% # Paramodulations                    : 446
% # Factorizations                     : 36
% # Equation resolutions               : 0
% # Current number of processed clauses: 102
% #    Positive orientable unit clauses: 13
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 9
% #    Non-unit-clauses                : 80
% # Current number of unprocessed clauses: 261
% # ...number of literals in the above : 1106
% # Clause-clause subsumption calls (NU) : 1356
% # Rec. Clause-clause subsumption calls : 764
% # Unit Clause-clause subsumption calls : 161
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 3
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:    65 leaves,   1.92+/-1.611 terms/leaf
% # Paramod-from index:           46 leaves,   1.54+/-0.852 terms/leaf
% # Paramod-into index:           63 leaves,   1.76+/-1.191 terms/leaf
% # -------------------------------------------------
% # User time              : 0.031 s
% # System time            : 0.005 s
% # Total time             : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP14375/GEO213+1.tptp
% 
%------------------------------------------------------------------------------