TSTP Solution File: GEO219+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO219+3 : TPTP v5.0.0. Released v4.0.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:54 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP12546/GEO219+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12546/GEO219+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12546/GEO219+3.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 12642
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(parallel_lines(X1,X2)<=>~(convergent_lines(X1,X2))),file('/tmp/SRASS.s.p', a3)).
% fof(2, axiom,![X1]:![X2]:(orthogonal_lines(X1,X2)<=>~(unorthogonal_lines(X1,X2))),file('/tmp/SRASS.s.p', a5)).
% fof(3, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(4, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(7, axiom,![X4]:![X5]:(convergent_lines(X4,X5)|unorthogonal_lines(X4,X5)),file('/tmp/SRASS.s.p', occu1)).
% fof(10, 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(36, conjecture,![X4]:![X5]:![X6]:((orthogonal_lines(X4,X5)¶llel_lines(X4,X6))=>orthogonal_lines(X5,X6)),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X4]:![X5]:![X6]:((orthogonal_lines(X4,X5)¶llel_lines(X4,X6))=>orthogonal_lines(X5,X6))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:![X2]:(parallel_lines(X1,X2)<=>~(convergent_lines(X1,X2))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(39, plain,![X1]:![X2]:(orthogonal_lines(X1,X2)<=>~(unorthogonal_lines(X1,X2))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(40, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(43, 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)],[10,theory(equality)])).
% fof(57, plain,![X1]:![X2]:((~(parallel_lines(X1,X2))|~(convergent_lines(X1,X2)))&(convergent_lines(X1,X2)|parallel_lines(X1,X2))),inference(fof_nnf,[status(thm)],[38])).
% fof(58, plain,![X3]:![X4]:((~(parallel_lines(X3,X4))|~(convergent_lines(X3,X4)))&(convergent_lines(X3,X4)|parallel_lines(X3,X4))),inference(variable_rename,[status(thm)],[57])).
% cnf(60,plain,(~convergent_lines(X1,X2)|~parallel_lines(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(61, plain,![X1]:![X2]:((~(orthogonal_lines(X1,X2))|~(unorthogonal_lines(X1,X2)))&(unorthogonal_lines(X1,X2)|orthogonal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[39])).
% fof(62, plain,![X3]:![X4]:((~(orthogonal_lines(X3,X4))|~(unorthogonal_lines(X3,X4)))&(unorthogonal_lines(X3,X4)|orthogonal_lines(X3,X4))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(orthogonal_lines(X1,X2)|unorthogonal_lines(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(~unorthogonal_lines(X1,X2)|~orthogonal_lines(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(65, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[40])).
% cnf(66,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(67, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(68, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[68])).
% fof(75, plain,![X6]:![X7]:(convergent_lines(X6,X7)|unorthogonal_lines(X6,X7)),inference(variable_rename,[status(thm)],[7])).
% cnf(76,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[75])).
% fof(87, 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)],[43])).
% fof(88, 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)],[87])).
% fof(89, 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)],[88])).
% cnf(91,plain,(unorthogonal_lines(X3,X1)|convergent_lines(X3,X2)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[89])).
% cnf(93,plain,(convergent_lines(X3,X1)|convergent_lines(X3,X2)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[89])).
% fof(167, negated_conjecture,?[X4]:?[X5]:?[X6]:((orthogonal_lines(X4,X5)¶llel_lines(X4,X6))&~(orthogonal_lines(X5,X6))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X7]:?[X8]:?[X9]:((orthogonal_lines(X7,X8)¶llel_lines(X7,X9))&~(orthogonal_lines(X8,X9))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((orthogonal_lines(esk1_0,esk2_0)¶llel_lines(esk1_0,esk3_0))&~(orthogonal_lines(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~orthogonal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(parallel_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(orthogonal_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(174,negated_conjecture,(unorthogonal_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[170,63,theory(equality)])).
% cnf(175,negated_conjecture,(~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[60,171,theory(equality)])).
% cnf(177,negated_conjecture,(~unorthogonal_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[64,172,theory(equality)])).
% cnf(196,negated_conjecture,(convergent_lines(X1,esk2_0)|convergent_lines(X1,esk3_0)|~convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[93,174,theory(equality)])).
% cnf(197,negated_conjecture,(unorthogonal_lines(X1,esk2_0)|convergent_lines(X1,esk3_0)|~convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[91,174,theory(equality)])).
% cnf(205,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[177,76,theory(equality)])).
% cnf(206,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[69,205,theory(equality)])).
% cnf(395,negated_conjecture,(convergent_lines(X1,esk3_0)|convergent_lines(X1,esk2_0)|convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[196,206,theory(equality)])).
% cnf(398,negated_conjecture,(convergent_lines(X1,esk3_0)|convergent_lines(X1,esk2_0)),inference(sr,[status(thm)],[395,175,theory(equality)])).
% cnf(401,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[66,398,theory(equality)])).
% cnf(477,negated_conjecture,(unorthogonal_lines(X1,esk2_0)|convergent_lines(X1,esk3_0)|$false),inference(rw,[status(thm)],[197,401,theory(equality)])).
% cnf(478,negated_conjecture,(unorthogonal_lines(X1,esk2_0)|convergent_lines(X1,esk3_0)),inference(cn,[status(thm)],[477,theory(equality)])).
% cnf(479,negated_conjecture,(convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[177,478,theory(equality)])).
% cnf(487,negated_conjecture,($false),inference(sr,[status(thm)],[479,175,theory(equality)])).
% cnf(488,negated_conjecture,($false),487,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 117
% # ...of these trivial : 0
% # ...subsumed : 18
% # ...remaining for further processing: 99
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 5
% # Generated clauses : 278
% # ...of the previous two non-trivial : 246
% # Contextual simplify-reflections : 4
% # Paramodulations : 276
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 93
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 62
% # Current number of unprocessed clauses: 149
% # ...number of literals in the above : 514
% # Clause-clause subsumption calls (NU) : 150
% # Rec. Clause-clause subsumption calls : 145
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 77 leaves, 1.49+/-1.213 terms/leaf
% # Paramod-from index: 48 leaves, 1.08+/-0.344 terms/leaf
% # Paramod-into index: 71 leaves, 1.32+/-0.835 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.006 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP12546/GEO219+3.tptp
%
%------------------------------------------------------------------------------