TSTP Solution File: GEO219+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO219+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:14:40 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/SystemOnTPTP12287/GEO219+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12287/GEO219+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12287/GEO219+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 12383
% 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(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', coipo1)).
% 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', cotno1)).
% fof(18, conjecture,![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(convergent_lines(X4,X6)))=>~(unorthogonal_lines(X5,X6))),file('/tmp/SRASS.s.p', con)).
% fof(19, negated_conjecture,~(![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(convergent_lines(X4,X6)))=>~(unorthogonal_lines(X5,X6)))),inference(assume_negation,[status(cth)],[18])).
% fof(21, plain,![X4]:![X5]:~((~(convergent_lines(X4,X5))&~(unorthogonal_lines(X4,X5)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(22, 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_simplification,[status(thm)],[4,theory(equality)])).
% fof(30, negated_conjecture,~(![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(convergent_lines(X4,X6)))=>~(unorthogonal_lines(X5,X6)))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(33, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(34, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[33])).
% cnf(35,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:(convergent_lines(X4,X5)|unorthogonal_lines(X4,X5)),inference(fof_nnf,[status(thm)],[21])).
% fof(37, plain,![X6]:![X7]:(convergent_lines(X6,X7)|unorthogonal_lines(X6,X7)),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% 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(fof_nnf,[status(thm)],[22])).
% fof(40, 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)],[39])).
% fof(41, plain,![X7]:![X8]:![X9]:((((convergent_lines(X7,X9)|convergent_lines(X7,X8))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9))))&((unorthogonal_lines(X7,X9)|convergent_lines(X7,X8))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))))&(((convergent_lines(X7,X9)|unorthogonal_lines(X7,X8))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9))))&((unorthogonal_lines(X7,X9)|unorthogonal_lines(X7,X8))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))))),inference(distribute,[status(thm)],[40])).
% cnf(43,plain,(unorthogonal_lines(X3,X1)|convergent_lines(X3,X2)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(83, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(unorthogonal_lines(X4,X5))&~(convergent_lines(X4,X6)))&unorthogonal_lines(X5,X6)),inference(fof_nnf,[status(thm)],[30])).
% fof(84, negated_conjecture,?[X7]:?[X8]:?[X9]:((~(unorthogonal_lines(X7,X8))&~(convergent_lines(X7,X9)))&unorthogonal_lines(X8,X9)),inference(variable_rename,[status(thm)],[83])).
% fof(85, negated_conjecture,((~(unorthogonal_lines(esk1_0,esk2_0))&~(convergent_lines(esk1_0,esk3_0)))&unorthogonal_lines(esk2_0,esk3_0)),inference(skolemize,[status(esa)],[84])).
% cnf(86,negated_conjecture,(unorthogonal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[85])).
% cnf(87,negated_conjecture,(~convergent_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(90,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[88,38,theory(equality)])).
% cnf(93,negated_conjecture,(unorthogonal_lines(X1,esk2_0)|convergent_lines(X1,esk3_0)|~convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[43,86,theory(equality)])).
% cnf(99,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[35,90,theory(equality)])).
% cnf(112,negated_conjecture,(convergent_lines(esk1_0,esk3_0)|~convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[88,93,theory(equality)])).
% cnf(116,negated_conjecture,(~convergent_lines(esk2_0,esk3_0)),inference(sr,[status(thm)],[112,87,theory(equality)])).
% cnf(120,negated_conjecture,(convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[116,99,theory(equality)])).
% cnf(121,negated_conjecture,($false),inference(sr,[status(thm)],[120,87,theory(equality)])).
% cnf(122,negated_conjecture,($false),121,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 53
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...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 : 29
% # ...of the previous two non-trivial : 24
% # Contextual simplify-reflections : 1
% # Paramodulations : 29
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 16
% # ...number of literals in the above : 62
% # Clause-clause subsumption calls (NU) : 47
% # Rec. Clause-clause subsumption calls : 45
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 26 leaves, 1.96+/-1.765 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 21 leaves, 1.57+/-0.849 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.003 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP12287/GEO219+1.tptp
%
%------------------------------------------------------------------------------