TSTP Solution File: GEO173+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO173+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 04:59:56 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP31833/GEO173+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31833/GEO173+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31833/GEO173+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 31929
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(4, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(7, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(apart_point_and_line(X3,line_connecting(X1,X2))=>(distinct_points(X3,X1)&distinct_points(X3,X2)))),file('/tmp/SRASS.s.p', con1)).
% fof(8, axiom,![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_lines(X4,X5))=>(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),file('/tmp/SRASS.s.p', cu1)).
% fof(13, conjecture,![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_lines(X4,line_connecting(X1,X2)))=>(apart_point_and_line(X1,X4)|apart_point_and_line(X2,X4))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_lines(X4,line_connecting(X1,X2)))=>(apart_point_and_line(X1,X4)|apart_point_and_line(X2,X4)))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(19,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(24, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(33, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(~(apart_point_and_line(X3,line_connecting(X1,X2)))|(distinct_points(X3,X1)&distinct_points(X3,X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(34, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(~(apart_point_and_line(X6,line_connecting(X4,X5)))|(distinct_points(X6,X4)&distinct_points(X6,X5)))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:(((distinct_points(X6,X4)|~(apart_point_and_line(X6,line_connecting(X4,X5))))|~(distinct_points(X4,X5)))&((distinct_points(X6,X5)|~(apart_point_and_line(X6,line_connecting(X4,X5))))|~(distinct_points(X4,X5)))),inference(distribute,[status(thm)],[34])).
% cnf(36,plain,(distinct_points(X3,X2)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,plain,(distinct_points(X3,X1)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[35])).
% fof(38, plain,![X1]:![X2]:![X4]:![X5]:((~(distinct_points(X1,X2))|~(distinct_lines(X4,X5)))|(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),inference(fof_nnf,[status(thm)],[8])).
% fof(39, plain,![X6]:![X7]:![X8]:![X9]:((~(distinct_points(X6,X7))|~(distinct_lines(X8,X9)))|(((apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9))|apart_point_and_line(X7,X8))|apart_point_and_line(X7,X9))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X2)|~distinct_points(X4,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(55, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_lines(X4,line_connecting(X1,X2)))&(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X2,X4)))),inference(fof_nnf,[status(thm)],[14])).
% fof(56, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((distinct_points(X6,X7)&convergent_lines(X8,X9))&distinct_lines(X8,line_connecting(X6,X7)))&(~(apart_point_and_line(X6,X8))&~(apart_point_and_line(X7,X8)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)))&(~(apart_point_and_line(esk1_0,esk3_0))&~(apart_point_and_line(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~apart_point_and_line(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,negated_conjecture,(distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(62,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(63,negated_conjecture,(distinct_points(esk1_0,X1)|distinct_points(esk2_0,X1)),inference(spm,[status(thm)],[26,62,theory(equality)])).
% cnf(72,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,esk3_0)|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|~distinct_points(X1,X2)),inference(spm,[status(thm)],[40,60,theory(equality)])).
% cnf(74,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[19,63,theory(equality)])).
% cnf(190,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,esk3_0)|apart_point_and_line(esk2_0,esk3_0)),inference(spm,[status(thm)],[72,74,theory(equality)])).
% cnf(209,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,esk3_0)),inference(sr,[status(thm)],[190,59,theory(equality)])).
% cnf(210,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(sr,[status(thm)],[209,58,theory(equality)])).
% cnf(230,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[37,210,theory(equality)])).
% cnf(234,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[230,62,theory(equality)])).
% cnf(235,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[234,theory(equality)])).
% cnf(236,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(sr,[status(thm)],[235,19,theory(equality)])).
% cnf(241,negated_conjecture,(distinct_points(esk2_0,esk2_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[36,236,theory(equality)])).
% cnf(244,negated_conjecture,(distinct_points(esk2_0,esk2_0)|$false),inference(rw,[status(thm)],[241,62,theory(equality)])).
% cnf(245,negated_conjecture,(distinct_points(esk2_0,esk2_0)),inference(cn,[status(thm)],[244,theory(equality)])).
% cnf(246,negated_conjecture,($false),inference(sr,[status(thm)],[245,19,theory(equality)])).
% cnf(247,negated_conjecture,($false),246,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 76
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 63
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 130
% # ...of the previous two non-trivial : 99
% # Contextual simplify-reflections : 0
% # Paramodulations : 108
% # Factorizations : 22
% # Equation resolutions : 0
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 57
% # ...number of literals in the above : 233
% # Clause-clause subsumption calls (NU) : 124
% # Rec. Clause-clause subsumption calls : 92
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 38 leaves, 1.84+/-1.725 terms/leaf
% # Paramod-from index: 20 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 32 leaves, 1.62+/-0.992 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.003 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/SystemOnTPTP31833/GEO173+2.tptp
%
%------------------------------------------------------------------------------