TSTP Solution File: GEO213+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO213+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 : 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:12:17 EST 2010
% Result : Theorem 0.90s
% 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/SystemOnTPTP11251/GEO213+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11251/GEO213+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11251/GEO213+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 11347
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X5]:![X6]:(convergent_lines(X5,X6)|unorthogonal_lines(X5,X6)),file('/tmp/SRASS.s.p', occu1)).
% fof(5, axiom,![X5]:![X6]:![X7]:((convergent_lines(X5,X6)&unorthogonal_lines(X5,X6))=>((convergent_lines(X5,X7)&unorthogonal_lines(X5,X7))|(convergent_lines(X6,X7)&unorthogonal_lines(X6,X7)))),file('/tmp/SRASS.s.p', oac1)).
% fof(7, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', ceq3)).
% fof(8, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(9, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', apart6)).
% fof(21, conjecture,![X5]:![X6]:![X7]:(unorthogonal_lines(X5,X6)=>(distinct_lines(X5,X7)|unorthogonal_lines(X6,X7))),file('/tmp/SRASS.s.p', con)).
% fof(22, negated_conjecture,~(![X5]:![X6]:![X7]:(unorthogonal_lines(X5,X6)=>(distinct_lines(X5,X7)|unorthogonal_lines(X6,X7)))),inference(assume_negation,[status(cth)],[21])).
% fof(24, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(38, plain,![X7]:![X8]:(convergent_lines(X7,X8)|unorthogonal_lines(X7,X8)),inference(variable_rename,[status(thm)],[4])).
% cnf(39,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X5]:![X6]:![X7]:((~(convergent_lines(X5,X6))|~(unorthogonal_lines(X5,X6)))|((convergent_lines(X5,X7)&unorthogonal_lines(X5,X7))|(convergent_lines(X6,X7)&unorthogonal_lines(X6,X7)))),inference(fof_nnf,[status(thm)],[5])).
% fof(41, plain,![X8]:![X9]:![X10]:((~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))|((convergent_lines(X8,X10)&unorthogonal_lines(X8,X10))|(convergent_lines(X9,X10)&unorthogonal_lines(X9,X10)))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X8]:![X9]:![X10]:((((convergent_lines(X9,X10)|convergent_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9))))&((unorthogonal_lines(X9,X10)|convergent_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))))&(((convergent_lines(X9,X10)|unorthogonal_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9))))&((unorthogonal_lines(X9,X10)|unorthogonal_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))))),inference(distribute,[status(thm)],[41])).
% cnf(45,plain,(convergent_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(50, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(51, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(53, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[24])).
% cnf(54,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(56, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(90, negated_conjecture,?[X5]:?[X6]:?[X7]:(unorthogonal_lines(X5,X6)&(~(distinct_lines(X5,X7))&~(unorthogonal_lines(X6,X7)))),inference(fof_nnf,[status(thm)],[22])).
% fof(91, negated_conjecture,?[X8]:?[X9]:?[X10]:(unorthogonal_lines(X8,X9)&(~(distinct_lines(X8,X10))&~(unorthogonal_lines(X9,X10)))),inference(variable_rename,[status(thm)],[90])).
% fof(92, negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)&(~(distinct_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,(~distinct_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(96,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[93,39,theory(equality)])).
% cnf(97,negated_conjecture,(~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[94,52,theory(equality)])).
% cnf(105,negated_conjecture,(convergent_lines(esk1_0,X1)|unorthogonal_lines(esk2_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[45,95,theory(equality)])).
% cnf(116,negated_conjecture,(convergent_lines(esk3_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[57,96,theory(equality)])).
% cnf(119,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(esk3_0,X2)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[57,116,theory(equality)])).
% cnf(129,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(X1,esk3_0)),inference(spm,[status(thm)],[54,119,theory(equality)])).
% cnf(135,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[97,129,theory(equality)])).
% cnf(140,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[57,135,theory(equality)])).
% cnf(269,negated_conjecture,(convergent_lines(esk1_0,esk3_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[93,105,theory(equality)])).
% cnf(270,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(sr,[status(thm)],[269,97,theory(equality)])).
% cnf(271,negated_conjecture,(convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[270,140,theory(equality)])).
% cnf(273,negated_conjecture,($false),inference(sr,[status(thm)],[271,54,theory(equality)])).
% cnf(274,negated_conjecture,($false),273,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 73
% # ...of these trivial : 0
% # ...subsumed : 11
% # ...remaining for further processing: 62
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 153
% # ...of the previous two non-trivial : 125
% # Contextual simplify-reflections : 1
% # Paramodulations : 145
% # Factorizations : 8
% # Equation resolutions : 0
% # Current number of processed clauses: 62
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 40
% # Current number of unprocessed clauses: 80
% # ...number of literals in the above : 293
% # Clause-clause subsumption calls (NU) : 224
% # Rec. Clause-clause subsumption calls : 143
% # 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: 53 leaves, 1.70+/-1.487 terms/leaf
% # Paramod-from index: 30 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 50 leaves, 1.44+/-0.779 terms/leaf
% # -----------------
% --------------------------------
% # User time : 0.015 s
% # System time : 0.006 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP11251/GEO213+2.tptp
%
%------------------------------------------------------------------------------