%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO212+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 : art05.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:11:52 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/SystemOnTPTP10992/GEO212+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10992/GEO212+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10992/GEO212+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 11088
% 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', ax6)).
% fof(3, axiom,![X4]:![X5]:(convergent_lines(X4,X5)|unorthogonal_lines(X4,X5)),file('/tmp/SRASS.s.p', occu1)).
% fof(4, axiom,![X4]:![X5]:![X6]:((convergent_lines(X4,X5)&unorthogonal_lines(X4,X5))=>((convergent_lines(X4,X6)&unorthogonal_lines(X4,X6))|(convergent_lines(X5,X6)&unorthogonal_lines(X5,X6)))),file('/tmp/SRASS.s.p', oac1)).
% fof(23, conjecture,![X4]:![X5]:![X6]:(unorthogonal_lines(X4,X5)=>(convergent_lines(X4,X6)|unorthogonal_lines(X5,X6))),file('/tmp/SRASS.s.p', con)).
% fof(24, negated_conjecture,~(![X4]:![X5]:![X6]:(unorthogonal_lines(X4,X5)=>(convergent_lines(X4,X6)|unorthogonal_lines(X5,X6)))),inference(assume_negation,[status(cth)],[23])).
% fof(25, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(36, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[25])).
% cnf(37,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(39, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X6]:![X7]:(convergent_lines(X6,X7)|unorthogonal_lines(X6,X7)),inference(variable_rename,[status(thm)],[3])).
% cnf(42,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:((~(convergent_lines(X4,X5))|~(unorthogonal_lines(X4,X5)))|((convergent_lines(X4,X6)&unorthogonal_lines(X4,X6))|(convergent_lines(X5,X6)&unorthogonal_lines(X5,X6)))),inference(fof_nnf,[status(thm)],[4])).
% fof(44, plain,![X7]:![X8]:![X9]:((~(convergent_lines(X7,X8))|~(unorthogonal_lines(X7,X8)))|((convergent_lines(X7,X9)&unorthogonal_lines(X7,X9))|(convergent_lines(X8,X9)&unorthogonal_lines(X8,X9)))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X7]:![X8]:![X9]:((((convergent_lines(X8,X9)|convergent_lines(X7,X9))|(~(convergent_lines(X7,X8))|~(unorthogonal_lines(X7,X8))))&((unorthogonal_lines(X8,X9)|convergent_lines(X7,X9))|(~(convergent_lines(X7,X8))|~(unorthogonal_lines(X7,X8)))))&(((convergent_lines(X8,X9)|unorthogonal_lines(X7,X9))|(~(convergent_lines(X7,X8))|~(unorthogonal_lines(X7,X8))))&((unorthogonal_lines(X8,X9)|unorthogonal_lines(X7,X9))|(~(convergent_lines(X7,X8))|~(unorthogonal_lines(X7,X8)))))),inference(distribute,[status(thm)],[44])).
% cnf(48,plain,(convergent_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[45])).
% fof(98, negated_conjecture,?[X4]:?[X5]:?[X6]:(unorthogonal_lines(X4,X5)&(~(convergent_lines(X4,X6))&~(unorthogonal_lines(X5,X6)))),inference(fof_nnf,[status(thm)],[24])).
% fof(99, negated_conjecture,?[X7]:?[X8]:?[X9]:(unorthogonal_lines(X7,X8)&(~(convergent_lines(X7,X9))&~(unorthogonal_lines(X8,X9)))),inference(variable_rename,[status(thm)],[98])).
% fof(100, negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)&(~(convergent_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,(~convergent_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,42,theory(equality)])).
% cnf(109,negated_conjecture,(unorthogonal_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[48,103,theory(equality)])).
% cnf(113,negated_conjecture,(convergent_lines(esk3_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[40,104,theory(equality)])).
% cnf(118,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(esk3_0,X2)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[40,113,theory(equality)])).
% cnf(146,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(X1,esk3_0)),inference(spm,[status(thm)],[37,118,theory(equality)])).
% cnf(181,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[102,146,theory(equality)])).
% cnf(190,negated_conjecture,(convergent_lines(esk1_0,esk3_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[101,109,theory(equality)])).
% cnf(191,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(sr,[status(thm)],[190,102,theory(equality)])).
% cnf(192,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[40,181,theory(equality)])).
% cnf(198,negated_conjecture,(convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[191,192,theory(equality)])).
% cnf(201,negated_conjecture,($false),inference(sr,[status(thm)],[198,37,theory(equality)])).
% cnf(202,negated_conjecture,($false),201,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 48
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 45
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 84
% # ...of the previous two non-trivial : 69
% # Contextual simplify-reflections : 1
% # Paramodulations : 80
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 45
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 29
% # Current number of unprocessed clauses: 49
% # ...number of literals in the above : 186
% # Clause-clause subsumption calls (NU) : 63
% # Rec. Clause-clause subsumption calls : 50
% # Unit Clause-clause subsumption calls : 28
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 36 leaves, 1.92+/-1.770 terms/leaf
% # Paramod-from index: 17 leaves, 1.24+/-0.546 terms/leaf
% # Paramod-into index: 35 leaves, 1.54+/-1.051 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.004 s
% # Total time : 0.019 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/SystemOnTPTP10992/GEO212+1.tptp
%
%------------------------------------------------------------------------------