TSTP Solution File: GEO173+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO173+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 05:04:34 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP6933/GEO173+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6933/GEO173+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6933/GEO173+1.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 7065
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.011 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]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(8, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(9, 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(15, 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(16, 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)],[15])).
% fof(17, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(20, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(21, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(24, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(25,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(30, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(31, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(39, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[20])).
% fof(40, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[21])).
% fof(43, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[42])).
% cnf(44,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, 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)],[9])).
% fof(46, 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)],[45])).
% cnf(47,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)],[46])).
% fof(63, 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)],[16])).
% fof(64, 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)],[63])).
% fof(65, 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)],[64])).
% cnf(66,negated_conjecture,(~apart_point_and_line(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,negated_conjecture,(distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[65])).
% cnf(70,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(71,negated_conjecture,(distinct_points(esk1_0,X1)|distinct_points(esk2_0,X1)),inference(spm,[status(thm)],[32,70,theory(equality)])).
% cnf(75,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)],[47,68,theory(equality)])).
% cnf(76,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[25,71,theory(equality)])).
% cnf(91,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)],[75,76,theory(equality)])).
% cnf(94,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)],[91,67,theory(equality)])).
% cnf(95,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)],[94,66,theory(equality)])).
% cnf(101,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[41,95,theory(equality)])).
% cnf(102,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[101,70,theory(equality)])).
% cnf(103,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[102,theory(equality)])).
% cnf(106,negated_conjecture,(~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[44,103,theory(equality)])).
% cnf(108,negated_conjecture,($false),inference(rw,[status(thm)],[106,70,theory(equality)])).
% cnf(109,negated_conjecture,($false),inference(cn,[status(thm)],[108,theory(equality)])).
% cnf(110,negated_conjecture,($false),109,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 26
% # ...of the previous two non-trivial : 22
% # Contextual simplify-reflections : 0
% # Paramodulations : 26
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 26
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 37
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 30 leaves, 1.73+/-1.482 terms/leaf
% # Paramod-from index: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 24 leaves, 1.38+/-0.633 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.001 s
% # Total time : 0.013 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/SystemOnTPTP6933/GEO173+1.tptp
%
%------------------------------------------------------------------------------