TSTP Solution File: GEO220+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO220+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:15:05 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/SystemOnTPTP12805/GEO220+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12805/GEO220+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12805/GEO220+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 12901
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(unorthogonal_lines(X4,X6)))=>~(convergent_lines(X5,X6))),file('/tmp/SRASS.s.p', couo1)).
% fof(18, conjecture,![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(unorthogonal_lines(X4,X6)))=>~(convergent_lines(X5,X6))),file('/tmp/SRASS.s.p', con)).
% fof(19, negated_conjecture,~(![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(unorthogonal_lines(X4,X6)))=>~(convergent_lines(X5,X6)))),inference(assume_negation,[status(cth)],[18])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(unorthogonal_lines(X4,X6)))=>~(convergent_lines(X5,X6))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(30, negated_conjecture,~(![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(unorthogonal_lines(X4,X6)))=>~(convergent_lines(X5,X6)))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(46, plain,![X4]:![X5]:![X6]:((unorthogonal_lines(X4,X5)|unorthogonal_lines(X4,X6))|~(convergent_lines(X5,X6))),inference(fof_nnf,[status(thm)],[23])).
% fof(47, plain,![X7]:![X8]:![X9]:((unorthogonal_lines(X7,X8)|unorthogonal_lines(X7,X9))|~(convergent_lines(X8,X9))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(unorthogonal_lines(X3,X2)|unorthogonal_lines(X3,X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[47])).
% fof(83, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(unorthogonal_lines(X4,X5))&~(unorthogonal_lines(X4,X6)))&convergent_lines(X5,X6)),inference(fof_nnf,[status(thm)],[30])).
% fof(84, negated_conjecture,?[X7]:?[X8]:?[X9]:((~(unorthogonal_lines(X7,X8))&~(unorthogonal_lines(X7,X9)))&convergent_lines(X8,X9)),inference(variable_rename,[status(thm)],[83])).
% fof(85, negated_conjecture,((~(unorthogonal_lines(esk1_0,esk2_0))&~(unorthogonal_lines(esk1_0,esk3_0)))&convergent_lines(esk2_0,esk3_0)),inference(skolemize,[status(esa)],[84])).
% cnf(86,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[85])).
% cnf(87,negated_conjecture,(~unorthogonal_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[85])).
% cnf(88,negated_conjecture,(~unorthogonal_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[85])).
% cnf(93,negated_conjecture,(unorthogonal_lines(X1,esk3_0)|unorthogonal_lines(X1,esk2_0)),inference(spm,[status(thm)],[48,86,theory(equality)])).
% cnf(118,negated_conjecture,(unorthogonal_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[88,93,theory(equality)])).
% cnf(122,negated_conjecture,($false),inference(sr,[status(thm)],[118,87,theory(equality)])).
% cnf(123,negated_conjecture,($false),122,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 52
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 51
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 32
% # ...of the previous two non-trivial : 25
% # Contextual simplify-reflections : 1
% # Paramodulations : 32
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 47
% # Clause-clause subsumption calls (NU) : 40
% # Rec. Clause-clause subsumption calls : 40
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 25 leaves, 2.00+/-1.789 terms/leaf
% # Paramod-from index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 21 leaves, 1.57+/-0.849 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.001 s
% # Total time : 0.016 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/SystemOnTPTP12805/GEO220+1.tptp
%
%------------------------------------------------------------------------------