TSTP Solution File: GEO183+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO183+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 : art02.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:53 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP30523/GEO183+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP30523/GEO183+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30523/GEO183+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 30619
% 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(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(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]:![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, 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_simplification,[status(thm)],[14,theory(equality)])).
% fof(19, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(20,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(34, 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(35, 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)],[34])).
% fof(36, 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)],[35])).
% cnf(37,plain,(distinct_points(X3,X2)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(distinct_points(X3,X1)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[36])).
% fof(45, 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(46, 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)],[45])).
% cnf(47,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[46])).
% fof(56, 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)],[18])).
% fof(57, 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)],[56])).
% fof(58, 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)],[57])).
% cnf(59,negated_conjecture,(apart_point_and_line(esk2_0,esk3_0)|apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(~distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(68,negated_conjecture,(apart_point_and_line(esk1_0,X1)|distinct_lines(esk3_0,X1)|apart_point_and_line(esk2_0,esk3_0)),inference(spm,[status(thm)],[47,59,theory(equality)])).
% cnf(86,negated_conjecture,(apart_point_and_line(esk2_0,esk3_0)|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[60,68,theory(equality)])).
% cnf(90,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,esk3_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[38,86,theory(equality)])).
% cnf(94,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[90,62,theory(equality)])).
% cnf(95,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,esk3_0)),inference(cn,[status(thm)],[94,theory(equality)])).
% cnf(96,negated_conjecture,(apart_point_and_line(esk2_0,esk3_0)),inference(sr,[status(thm)],[95,20,theory(equality)])).
% cnf(98,negated_conjecture,(apart_point_and_line(esk2_0,X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[47,96,theory(equality)])).
% cnf(109,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[60,98,theory(equality)])).
% cnf(113,negated_conjecture,(distinct_points(esk2_0,esk2_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[37,109,theory(equality)])).
% cnf(115,negated_conjecture,(distinct_points(esk2_0,esk2_0)|$false),inference(rw,[status(thm)],[113,62,theory(equality)])).
% cnf(116,negated_conjecture,(distinct_points(esk2_0,esk2_0)),inference(cn,[status(thm)],[115,theory(equality)])).
% cnf(117,negated_conjecture,($false),inference(sr,[status(thm)],[116,20,theory(equality)])).
% cnf(118,negated_conjecture,($false),117,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 53
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 49
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 39
% # ...of the previous two non-trivial : 33
% # Contextual simplify-reflections : 0
% # Paramodulations : 39
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 39
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 17
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 29 leaves, 1.76+/-1.568 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 25 leaves, 1.40+/-0.693 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP30523/GEO183+2.tptp
%
%------------------------------------------------------------------------------