TSTP Solution File: GEO182+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO182+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 : art03.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:34 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP21301/GEO182+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21301/GEO182+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21301/GEO182+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 21397
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(X3,line_connecting(X2,X1)))),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(X3,line_connecting(X2,X1))))),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(X3,line_connecting(X2,X1))))),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(X6,line_connecting(X5,X4))))),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(esk3_0,line_connecting(esk2_0,esk1_0))))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_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(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(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(1444,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(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)|$false),inference(rw,[status(thm)],[1444,60,theory(equality)])).
% cnf(1449,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)],[1448,theory(equality)])).
% cnf(1450,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)],[1449,19,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)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[26,1450,theory(equality)])).
% cnf(1573,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)],[1571,60,theory(equality)])).
% cnf(1574,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)],[1573,theory(equality)])).
% cnf(1575,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)],[1574,19,theory(equality)])).
% cnf(1585,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))),inference(spm,[status(thm)],[58,1575,theory(equality)])).
% cnf(1590,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|~distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[26,1585,theory(equality)])).
% cnf(1592,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|$false),inference(rw,[status(thm)],[1590,75,theory(equality)])).
% cnf(1593,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))),inference(cn,[status(thm)],[1592,theory(equality)])).
% cnf(1594,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))),inference(sr,[status(thm)],[1593,19,theory(equality)])).
% cnf(1603,negated_conjecture,(distinct_points(esk2_0,esk2_0)|~distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[27,1594,theory(equality)])).
% cnf(1608,negated_conjecture,(distinct_points(esk2_0,esk2_0)|$false),inference(rw,[status(thm)],[1603,75,theory(equality)])).
% cnf(1609,negated_conjecture,(distinct_points(esk2_0,esk2_0)),inference(cn,[status(thm)],[1608,theory(equality)])).
% cnf(1610,negated_conjecture,($false),inference(sr,[status(thm)],[1609,19,theory(equality)])).
% cnf(1611,negated_conjecture,($false),1610,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 471
% # ...of these trivial : 0
% # ...subsumed : 340
% # ...remaining for further processing: 131
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 1
% # Generated clauses : 1095
% # ...of the previous two non-trivial : 856
% # Contextual simplify-reflections : 106
% # Paramodulations : 745
% # Factorizations : 350
% # Equation resolutions : 0
% # Current number of processed clauses: 111
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 99
% # Current number of unprocessed clauses: 393
% # ...number of literals in the above : 2284
% # Clause-clause subsumption calls (NU) : 5923
% # Rec. Clause-clause subsumption calls : 3143
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 47 leaves, 1.96+/-1.978 terms/leaf
% # Paramod-from index: 28 leaves, 1.43+/-1.015 terms/leaf
% # Paramod-into index: 43 leaves, 1.65+/-1.199 terms/leaf
% # -------------------------------------------------
% # User time : 0.115 s
% # System time : 0.005 s
% # Total time : 0.120 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP21301/GEO182+2.tptp
%
%------------------------------------------------------------------------------