TSTP Solution File: GEO212+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO212+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:11:58 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/SystemOnTPTP12980/GEO212+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12980/GEO212+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12980/GEO212+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 13076
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(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(21, conjecture,![X4]:![X5]:![X6]:(unorthogonal_lines(X4,X5)=>(convergent_lines(X4,X6)|unorthogonal_lines(X5,X6))),file('/tmp/SRASS.s.p', con)).
% fof(22, negated_conjecture,~(![X4]:![X5]:![X6]:(unorthogonal_lines(X4,X5)=>(convergent_lines(X4,X6)|unorthogonal_lines(X5,X6)))),inference(assume_negation,[status(cth)],[21])).
% fof(23, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(30, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[23])).
% cnf(31,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X6]:![X7]:(convergent_lines(X6,X7)|unorthogonal_lines(X6,X7)),inference(variable_rename,[status(thm)],[3])).
% cnf(36,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, 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(38, 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)],[37])).
% fof(39, 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)],[38])).
% cnf(42,plain,(convergent_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[39])).
% fof(90, negated_conjecture,?[X4]:?[X5]:?[X6]:(unorthogonal_lines(X4,X5)&(~(convergent_lines(X4,X6))&~(unorthogonal_lines(X5,X6)))),inference(fof_nnf,[status(thm)],[22])).
% fof(91, negated_conjecture,?[X7]:?[X8]:?[X9]:(unorthogonal_lines(X7,X8)&(~(convergent_lines(X7,X9))&~(unorthogonal_lines(X8,X9)))),inference(variable_rename,[status(thm)],[90])).
% fof(92, negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)&(~(convergent_lines(esk1_0,esk3_0))&~(unorthogonal_lines(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[91])).
% cnf(93,negated_conjecture,(~unorthogonal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(94,negated_conjecture,(~convergent_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(95,negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(98,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[93,36,theory(equality)])).
% cnf(103,negated_conjecture,(unorthogonal_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[42,95,theory(equality)])).
% cnf(115,negated_conjecture,(convergent_lines(esk3_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[34,98,theory(equality)])).
% cnf(118,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(esk3_0,X2)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[34,115,theory(equality)])).
% cnf(153,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(X1,esk3_0)),inference(spm,[status(thm)],[31,118,theory(equality)])).
% cnf(162,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[94,153,theory(equality)])).
% cnf(168,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[34,162,theory(equality)])).
% cnf(183,negated_conjecture,(convergent_lines(esk1_0,esk3_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[93,103,theory(equality)])).
% cnf(184,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(sr,[status(thm)],[183,94,theory(equality)])).
% cnf(189,negated_conjecture,(convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[184,168,theory(equality)])).
% cnf(192,negated_conjecture,($false),inference(sr,[status(thm)],[189,31,theory(equality)])).
% cnf(193,negated_conjecture,($false),192,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 56
% # ...of these trivial : 0
% # ...subsumed : 7
% # ...remaining for further processing: 49
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 85
% # ...of the previous two non-trivial : 71
% # Contextual simplify-reflections : 1
% # Paramodulations : 83
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 49
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 30
% # Current number of unprocessed clauses: 43
% # ...number of literals in the above : 167
% # Clause-clause subsumption calls (NU) : 64
% # Rec. Clause-clause subsumption calls : 50
% # Unit Clause-clause subsumption calls : 29
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 43 leaves, 1.74+/-1.526 terms/leaf
% # Paramod-from index: 22 leaves, 1.09+/-0.287 terms/leaf
% # Paramod-into index: 41 leaves, 1.46+/-0.886 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.001 s
% # Total time : 0.019 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/SystemOnTPTP12980/GEO212+2.tptp
%
%------------------------------------------------------------------------------