TSTP Solution File: GEO181+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO181+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 : 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:02:14 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP11267/GEO181+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11267/GEO181+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11267/GEO181+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 11363
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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(2, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(3, 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(5, 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(10, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),file('/tmp/SRASS.s.p', ceq2)).
% fof(13, conjecture,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(apart_point_and_line(X3,line_connecting(X1,X2))=>apart_point_and_line(X2,line_connecting(X1,X3)))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(apart_point_and_line(X3,line_connecting(X1,X2))=>apart_point_and_line(X2,line_connecting(X1,X3))))),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(20, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(21, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, 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)],[3])).
% fof(24, 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)],[23])).
% fof(25, 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)],[24])).
% cnf(26,plain,(distinct_points(X3,X2)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(distinct_points(X3,X1)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[25])).
% fof(31, 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)],[5])).
% fof(32, 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)],[31])).
% cnf(33,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)],[32])).
% fof(44, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),inference(fof_nnf,[status(thm)],[10])).
% fof(45, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_lines(X5,X6)|apart_point_and_line(X4,X6))),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[45])).
% fof(55, negated_conjecture,?[X1]:?[X2]:?[X3]:(distinct_points(X1,X2)&(apart_point_and_line(X3,line_connecting(X1,X2))&~(apart_point_and_line(X2,line_connecting(X1,X3))))),inference(fof_nnf,[status(thm)],[14])).
% fof(56, negated_conjecture,?[X4]:?[X5]:?[X6]:(distinct_points(X4,X5)&(apart_point_and_line(X6,line_connecting(X4,X5))&~(apart_point_and_line(X5,line_connecting(X4,X6))))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(distinct_points(esk1_0,esk2_0)&(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))&~(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk3_0))))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~apart_point_and_line(esk2_0,line_connecting(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(61,negated_conjecture,(distinct_points(esk1_0,X1)|distinct_points(esk2_0,X1)),inference(spm,[status(thm)],[22,60,theory(equality)])).
% cnf(66,negated_conjecture,(distinct_points(esk3_0,esk1_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[27,59,theory(equality)])).
% cnf(67,negated_conjecture,(distinct_points(esk3_0,esk1_0)|$false),inference(rw,[status(thm)],[66,60,theory(equality)])).
% cnf(68,negated_conjecture,(distinct_points(esk3_0,esk1_0)),inference(cn,[status(thm)],[67,theory(equality)])).
% cnf(69,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),X1)|apart_point_and_line(esk3_0,X1)),inference(spm,[status(thm)],[46,59,theory(equality)])).
% cnf(75,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[19,61,theory(equality)])).
% cnf(78,negated_conjecture,(distinct_points(esk3_0,X1)|distinct_points(esk1_0,X1)),inference(spm,[status(thm)],[22,68,theory(equality)])).
% cnf(83,negated_conjecture,(distinct_points(esk3_0,X1)|distinct_points(X2,X1)|distinct_points(esk1_0,X2)),inference(spm,[status(thm)],[22,78,theory(equality)])).
% cnf(115,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X1,X2)|apart_point_and_line(X3,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X3,X2)|apart_point_and_line(esk3_0,X2)|~distinct_points(X1,X3)),inference(spm,[status(thm)],[33,69,theory(equality)])).
% cnf(502,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(esk3_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[115,75,theory(equality)])).
% cnf(1443,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk3_0,X1)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[27,502,theory(equality)])).
% cnf(1447,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk3_0,X1)|$false),inference(rw,[status(thm)],[1443,60,theory(equality)])).
% cnf(1448,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk3_0,X1)),inference(cn,[status(thm)],[1447,theory(equality)])).
% cnf(1449,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk3_0,X1)),inference(sr,[status(thm)],[1448,19,theory(equality)])).
% cnf(1569,negated_conjecture,(distinct_points(esk2_0,esk2_0)|apart_point_and_line(esk3_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[26,1449,theory(equality)])).
% cnf(1571,negated_conjecture,(distinct_points(esk2_0,esk2_0)|apart_point_and_line(esk3_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)|$false),inference(rw,[status(thm)],[1569,60,theory(equality)])).
% cnf(1572,negated_conjecture,(distinct_points(esk2_0,esk2_0)|apart_point_and_line(esk3_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)),inference(cn,[status(thm)],[1571,theory(equality)])).
% cnf(1573,negated_conjecture,(apart_point_and_line(esk3_0,X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)),inference(sr,[status(thm)],[1572,19,theory(equality)])).
% cnf(1577,negated_conjecture,(distinct_points(esk3_0,X1)|apart_point_and_line(esk2_0,line_connecting(X2,X1))|apart_point_and_line(esk1_0,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(spm,[status(thm)],[26,1573,theory(equality)])).
% cnf(5117,negated_conjecture,(distinct_points(esk1_0,X1)|apart_point_and_line(esk2_0,line_connecting(X1,X2))|distinct_points(esk3_0,X2)|~distinct_points(X1,X2)),inference(spm,[status(thm)],[27,1577,theory(equality)])).
% cnf(5120,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(X1,X2))|distinct_points(esk1_0,X1)|distinct_points(esk3_0,X2)),inference(csr,[status(thm)],[5117,83])).
% cnf(5127,negated_conjecture,(distinct_points(esk3_0,esk3_0)|distinct_points(esk1_0,esk1_0)),inference(spm,[status(thm)],[58,5120,theory(equality)])).
% cnf(5128,negated_conjecture,(distinct_points(esk1_0,esk1_0)),inference(sr,[status(thm)],[5127,19,theory(equality)])).
% cnf(5129,negated_conjecture,($false),inference(sr,[status(thm)],[5128,19,theory(equality)])).
% cnf(5130,negated_conjecture,($false),5129,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 852
% # ...of these trivial : 0
% # ...subsumed : 659
% # ...remaining for further processing: 193
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 3959
% # ...of the previous two non-trivial : 3379
% # Contextual simplify-reflections : 263
% # Paramodulations : 3249
% # Factorizations : 710
% # Equation resolutions : 0
% # Current number of processed clauses: 173
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 162
% # Current number of unprocessed clauses: 2523
% # ...number of literals in the above : 17902
% # Clause-clause subsumption calls (NU) : 16078
% # Rec. Clause-clause subsumption calls : 6885
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 64 leaves, 2.02+/-2.154 terms/leaf
% # Paramod-from index: 39 leaves, 1.72+/-1.753 terms/leaf
% # Paramod-into index: 60 leaves, 1.75+/-1.776 terms/leaf
% # -------------------------------------------------
% # User time : 0.343 s
% # System time : 0.006 s
% # Total time : 0.349 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.48 CPU 0.57 WC
% FINAL PrfWatch: 0.48 CPU 0.57 WC
% SZS output end Solution for /tmp/SystemOnTPTP11267/GEO181+2.tptp
%
%------------------------------------------------------------------------------