%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO214+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 : 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:12:38 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP5964/GEO214+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5964/GEO214+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5964/GEO214+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 6060
% 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]:![X2]:(convergent_lines(X1,X2)|unorthogonal_lines(X1,X2)),file('/tmp/SRASS.s.p', occu1)).
% fof(2, axiom,![X1]:![X2]:![X3]:((convergent_lines(X1,X2)&unorthogonal_lines(X1,X2))=>((convergent_lines(X1,X3)&unorthogonal_lines(X1,X3))|(convergent_lines(X2,X3)&unorthogonal_lines(X2,X3)))),file('/tmp/SRASS.s.p', oac1)).
% fof(4, axiom,![X4]:~(convergent_lines(X4,X4)),file('/tmp/SRASS.s.p', apart3)).
% fof(6, axiom,![X4]:![X5]:![X6]:(convergent_lines(X4,X5)=>(convergent_lines(X4,X6)|convergent_lines(X5,X6))),file('/tmp/SRASS.s.p', ax6)).
% fof(23, conjecture,![X1]:![X2]:(unorthogonal_lines(X1,X2)=>unorthogonal_lines(X2,X1)),file('/tmp/SRASS.s.p', con)).
% fof(24, negated_conjecture,~(![X1]:![X2]:(unorthogonal_lines(X1,X2)=>unorthogonal_lines(X2,X1))),inference(assume_negation,[status(cth)],[23])).
% fof(26, plain,![X4]:~(convergent_lines(X4,X4)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(36, plain,![X3]:![X4]:(convergent_lines(X3,X4)|unorthogonal_lines(X3,X4)),inference(variable_rename,[status(thm)],[1])).
% cnf(37,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:![X3]:((~(convergent_lines(X1,X2))|~(unorthogonal_lines(X1,X2)))|((convergent_lines(X1,X3)&unorthogonal_lines(X1,X3))|(convergent_lines(X2,X3)&unorthogonal_lines(X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(39, 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(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:((((convergent_lines(X5,X6)|convergent_lines(X4,X6))|(~(convergent_lines(X4,X5))|~(unorthogonal_lines(X4,X5))))&((unorthogonal_lines(X5,X6)|convergent_lines(X4,X6))|(~(convergent_lines(X4,X5))|~(unorthogonal_lines(X4,X5)))))&(((convergent_lines(X5,X6)|unorthogonal_lines(X4,X6))|(~(convergent_lines(X4,X5))|~(unorthogonal_lines(X4,X5))))&((unorthogonal_lines(X5,X6)|unorthogonal_lines(X4,X6))|(~(convergent_lines(X4,X5))|~(unorthogonal_lines(X4,X5)))))),inference(distribute,[status(thm)],[39])).
% cnf(43,plain,(convergent_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(47, plain,![X5]:~(convergent_lines(X5,X5)),inference(variable_rename,[status(thm)],[26])).
% cnf(48,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(52, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(fof_nnf,[status(thm)],[6])).
% fof(53, plain,![X7]:![X8]:![X9]:(~(convergent_lines(X7,X8))|(convergent_lines(X7,X9)|convergent_lines(X8,X9))),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(98, negated_conjecture,?[X1]:?[X2]:(unorthogonal_lines(X1,X2)&~(unorthogonal_lines(X2,X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(99, negated_conjecture,?[X3]:?[X4]:(unorthogonal_lines(X3,X4)&~(unorthogonal_lines(X4,X3))),inference(variable_rename,[status(thm)],[98])).
% fof(100, negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)&~(unorthogonal_lines(esk2_0,esk1_0))),inference(skolemize,[status(esa)],[99])).
% cnf(101,negated_conjecture,(~unorthogonal_lines(esk2_0,esk1_0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(102,negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(103,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[101,37,theory(equality)])).
% cnf(110,negated_conjecture,(unorthogonal_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[43,102,theory(equality)])).
% cnf(112,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[54,103,theory(equality)])).
% cnf(212,negated_conjecture,(convergent_lines(esk1_0,esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[101,110,theory(equality)])).
% cnf(213,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(sr,[status(thm)],[212,48,theory(equality)])).
% cnf(241,negated_conjecture,(convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[213,112,theory(equality)])).
% cnf(243,negated_conjecture,($false),inference(sr,[status(thm)],[241,48,theory(equality)])).
% cnf(244,negated_conjecture,($false),243,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 55
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 50
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 120
% # ...of the previous two non-trivial : 97
% # Contextual simplify-reflections : 1
% # Paramodulations : 112
% # Factorizations : 8
% # Equation resolutions : 0
% # Current number of processed clauses: 50
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 35
% # Current number of unprocessed clauses: 69
% # ...number of literals in the above : 314
% # Clause-clause subsumption calls (NU) : 128
% # Rec. Clause-clause subsumption calls : 83
% # Unit Clause-clause subsumption calls : 27
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 39 leaves, 1.90+/-1.692 terms/leaf
% # Paramod-from index: 22 leaves, 1.27+/-0.538 terms/leaf
% # Paramod-into index: 38 leaves, 1.58+/-1.067 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.005 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP5964/GEO214+1.tptp
%
%------------------------------------------------------------------------------