TSTP Solution File: GEO214+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO214+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 : 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:47 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/SystemOnTPTP6223/GEO214+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6223/GEO214+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6223/GEO214+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 6319
% 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', apart6)).
% fof(21, conjecture,![X1]:![X2]:(unorthogonal_lines(X1,X2)=>unorthogonal_lines(X2,X1)),file('/tmp/SRASS.s.p', con)).
% fof(22, negated_conjecture,~(![X1]:![X2]:(unorthogonal_lines(X1,X2)=>unorthogonal_lines(X2,X1))),inference(assume_negation,[status(cth)],[21])).
% fof(24, plain,![X4]:~(convergent_lines(X4,X4)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(30, plain,![X3]:![X4]:(convergent_lines(X3,X4)|unorthogonal_lines(X3,X4)),inference(variable_rename,[status(thm)],[1])).
% cnf(31,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, 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(33, 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)],[32])).
% fof(34, 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)],[33])).
% cnf(37,plain,(convergent_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[34])).
% fof(41, plain,![X5]:~(convergent_lines(X5,X5)),inference(variable_rename,[status(thm)],[24])).
% cnf(42,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(46, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(fof_nnf,[status(thm)],[6])).
% fof(47, plain,![X7]:![X8]:![X9]:(~(convergent_lines(X7,X8))|(convergent_lines(X7,X9)|convergent_lines(X8,X9))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(90, negated_conjecture,?[X1]:?[X2]:(unorthogonal_lines(X1,X2)&~(unorthogonal_lines(X2,X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(91, negated_conjecture,?[X3]:?[X4]:(unorthogonal_lines(X3,X4)&~(unorthogonal_lines(X4,X3))),inference(variable_rename,[status(thm)],[90])).
% fof(92, negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)&~(unorthogonal_lines(esk2_0,esk1_0))),inference(skolemize,[status(esa)],[91])).
% cnf(93,negated_conjecture,(~unorthogonal_lines(esk2_0,esk1_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(94,negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(96,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[93,31,theory(equality)])).
% cnf(106,negated_conjecture,(unorthogonal_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[37,94,theory(equality)])).
% cnf(114,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[48,96,theory(equality)])).
% cnf(235,negated_conjecture,(convergent_lines(esk1_0,esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[93,106,theory(equality)])).
% cnf(236,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(sr,[status(thm)],[235,42,theory(equality)])).
% cnf(237,negated_conjecture,(convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[236,114,theory(equality)])).
% cnf(239,negated_conjecture,($false),inference(sr,[status(thm)],[237,42,theory(equality)])).
% cnf(240,negated_conjecture,($false),239,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 64
% # ...of these trivial : 0
% # ...subsumed : 9
% # ...remaining for further processing: 55
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 126
% # ...of the previous two non-trivial : 104
% # Contextual simplify-reflections : 1
% # Paramodulations : 120
% # Factorizations : 6
% # Equation resolutions : 0
% # Current number of processed clauses: 55
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 38
% # Current number of unprocessed clauses: 67
% # ...number of literals in the above : 290
% # Clause-clause subsumption calls (NU) : 120
% # Rec. Clause-clause subsumption calls : 82
% # Unit Clause-clause subsumption calls : 33
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 43 leaves, 1.86+/-1.651 terms/leaf
% # Paramod-from index: 24 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 41 leaves, 1.54+/-0.990 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.005 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/SystemOnTPTP6223/GEO214+2.tptp
%
%------------------------------------------------------------------------------