TSTP Solution File: GEO222+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO222+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 : art04.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:16:18 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP15411/GEO222+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15411/GEO222+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15411/GEO222+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 15507
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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(3, axiom,![X3]:![X4]:~(unorthogonal_lines(orthogonal_through_point(X4,X3),X4)),file('/tmp/SRASS.s.p', ooc1)).
% fof(4, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(5, axiom,![X1]:![X2]:![X5]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X5)|convergent_lines(X2,X5))),file('/tmp/SRASS.s.p', ax6)).
% fof(12, axiom,![X4]:![X6]:(convergent_lines(X4,X6)|unorthogonal_lines(X4,X6)),file('/tmp/SRASS.s.p', occu1)).
% fof(13, axiom,![X4]:![X6]:![X7]:((convergent_lines(X4,X6)&unorthogonal_lines(X4,X6))=>((convergent_lines(X4,X7)&unorthogonal_lines(X4,X7))|(convergent_lines(X6,X7)&unorthogonal_lines(X6,X7)))),file('/tmp/SRASS.s.p', oac1)).
% fof(16, axiom,![X4]:![X6]:![X7]:((~(unorthogonal_lines(X4,X6))&~(unorthogonal_lines(X4,X7)))=>~(convergent_lines(X6,X7))),file('/tmp/SRASS.s.p', couo1)).
% fof(36, conjecture,![X3]:![X4]:parallel_lines(X4,orthogonal_through_point(orthogonal_through_point(X4,X3),X3)),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X3]:![X4]:parallel_lines(X4,orthogonal_through_point(orthogonal_through_point(X4,X3),X3))),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(40, plain,![X3]:![X4]:~(unorthogonal_lines(orthogonal_through_point(X4,X3),X4)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(41, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(46, plain,![X4]:![X6]:![X7]:((~(unorthogonal_lines(X4,X6))&~(unorthogonal_lines(X4,X7)))=>~(convergent_lines(X6,X7))),inference(fof_simplification,[status(thm)],[16,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(59,plain,(parallel_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(63, plain,![X5]:![X6]:~(unorthogonal_lines(orthogonal_through_point(X6,X5),X6)),inference(variable_rename,[status(thm)],[40])).
% cnf(64,plain,(~unorthogonal_lines(orthogonal_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(65, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[41])).
% cnf(66,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(67, plain,![X1]:![X2]:![X5]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X5)|convergent_lines(X2,X5))),inference(fof_nnf,[status(thm)],[5])).
% fof(68, plain,![X6]:![X7]:![X8]:(~(convergent_lines(X6,X7))|(convergent_lines(X6,X8)|convergent_lines(X7,X8))),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(86, plain,![X7]:![X8]:(convergent_lines(X7,X8)|unorthogonal_lines(X7,X8)),inference(variable_rename,[status(thm)],[12])).
% cnf(87,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[86])).
% fof(88, plain,![X4]:![X6]:![X7]:((~(convergent_lines(X4,X6))|~(unorthogonal_lines(X4,X6)))|((convergent_lines(X4,X7)&unorthogonal_lines(X4,X7))|(convergent_lines(X6,X7)&unorthogonal_lines(X6,X7)))),inference(fof_nnf,[status(thm)],[13])).
% fof(89, 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)],[88])).
% fof(90, 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)],[89])).
% cnf(93,plain,(convergent_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[90])).
% fof(105, plain,![X4]:![X6]:![X7]:((unorthogonal_lines(X4,X6)|unorthogonal_lines(X4,X7))|~(convergent_lines(X6,X7))),inference(fof_nnf,[status(thm)],[46])).
% fof(106, plain,![X8]:![X9]:![X10]:((unorthogonal_lines(X8,X9)|unorthogonal_lines(X8,X10))|~(convergent_lines(X9,X10))),inference(variable_rename,[status(thm)],[105])).
% cnf(107,plain,(unorthogonal_lines(X3,X2)|unorthogonal_lines(X3,X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[106])).
% fof(167, negated_conjecture,?[X3]:?[X4]:~(parallel_lines(X4,orthogonal_through_point(orthogonal_through_point(X4,X3),X3))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X5]:?[X6]:~(parallel_lines(X6,orthogonal_through_point(orthogonal_through_point(X6,X5),X5))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,~(parallel_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~parallel_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,plain,(convergent_lines(orthogonal_through_point(X1,X2),X1)),inference(spm,[status(thm)],[64,87,theory(equality)])).
% cnf(172,negated_conjecture,(convergent_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))),inference(spm,[status(thm)],[170,59,theory(equality)])).
% cnf(188,plain,(convergent_lines(X1,X2)|convergent_lines(orthogonal_through_point(X1,X3),X2)),inference(spm,[status(thm)],[69,171,theory(equality)])).
% cnf(193,negated_conjecture,(unorthogonal_lines(X1,esk2_0)|unorthogonal_lines(X1,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))),inference(spm,[status(thm)],[107,172,theory(equality)])).
% cnf(207,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|convergent_lines(X2,X1)|unorthogonal_lines(X2,esk2_0)|~convergent_lines(X2,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))),inference(spm,[status(thm)],[93,193,theory(equality)])).
% cnf(212,plain,(convergent_lines(X1,orthogonal_through_point(X1,X2))),inference(spm,[status(thm)],[66,188,theory(equality)])).
% cnf(699,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|unorthogonal_lines(orthogonal_through_point(esk2_0,esk1_0),esk2_0)|convergent_lines(orthogonal_through_point(esk2_0,esk1_0),X1)),inference(spm,[status(thm)],[207,212,theory(equality)])).
% cnf(716,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|convergent_lines(orthogonal_through_point(esk2_0,esk1_0),X1)),inference(sr,[status(thm)],[699,64,theory(equality)])).
% cnf(728,negated_conjecture,(convergent_lines(orthogonal_through_point(esk2_0,esk1_0),orthogonal_through_point(esk2_0,esk1_0))),inference(spm,[status(thm)],[64,716,theory(equality)])).
% cnf(729,negated_conjecture,($false),inference(sr,[status(thm)],[728,66,theory(equality)])).
% cnf(730,negated_conjecture,($false),729,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 119
% # ...of these trivial : 0
% # ...subsumed : 22
% # ...remaining for further processing: 97
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 484
% # ...of the previous two non-trivial : 418
% # Contextual simplify-reflections : 4
% # Paramodulations : 462
% # Factorizations : 22
% # Equation resolutions : 0
% # Current number of processed clauses: 97
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 76
% # Current number of unprocessed clauses: 346
% # ...number of literals in the above : 1452
% # Clause-clause subsumption calls (NU) : 417
% # Rec. Clause-clause subsumption calls : 330
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 69 leaves, 2.00+/-1.926 terms/leaf
% # Paramod-from index: 41 leaves, 1.61+/-1.207 terms/leaf
% # Paramod-into index: 62 leaves, 1.81+/-1.585 terms/leaf
% # -------------------------------------------------
% # User time : 0.033 s
% # System time : 0.005 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP15411/GEO222+3.tptp
%
%------------------------------------------------------------------------------