TSTP Solution File: GEO179+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO179+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 : art01.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:01:34 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP2892/GEO179+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2892/GEO179+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2892/GEO179+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 2989
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 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(5, 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]:![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)))=>(distinct_lines(line_connecting(X1,X2),line_connecting(X3,X1))&distinct_lines(line_connecting(X1,X2),line_connecting(X3,X2)))),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)))=>(distinct_lines(line_connecting(X1,X2),line_connecting(X3,X1))&distinct_lines(line_connecting(X1,X2),line_connecting(X3,X2))))),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(28, 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)],[5])).
% fof(29, 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)],[28])).
% fof(30, 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)],[29])).
% cnf(31,plain,(distinct_points(X3,X2)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(distinct_points(X3,X1)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[30])).
% fof(39, 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)],[8])).
% fof(40, 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)],[39])).
% cnf(41,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[40])).
% fof(55, negated_conjecture,?[X1]:?[X2]:?[X3]:((distinct_points(X1,X2)&apart_point_and_line(X3,line_connecting(X1,X2)))&(~(distinct_lines(line_connecting(X1,X2),line_connecting(X3,X1)))|~(distinct_lines(line_connecting(X1,X2),line_connecting(X3,X2))))),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)))&(~(distinct_lines(line_connecting(X4,X5),line_connecting(X6,X4)))|~(distinct_lines(line_connecting(X4,X5),line_connecting(X6,X5))))),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)))&(~(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk1_0)))|~(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0))))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0))|~distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_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(63,negated_conjecture,(apart_point_and_line(esk3_0,X1)|distinct_lines(line_connecting(esk1_0,esk2_0),X1)),inference(spm,[status(thm)],[41,59,theory(equality)])).
% cnf(64,negated_conjecture,(distinct_points(esk3_0,esk2_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[31,59,theory(equality)])).
% cnf(65,negated_conjecture,(distinct_points(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[64,60,theory(equality)])).
% cnf(66,negated_conjecture,(distinct_points(esk3_0,esk2_0)),inference(cn,[status(thm)],[65,theory(equality)])).
% cnf(67,negated_conjecture,(distinct_points(esk3_0,esk1_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[32,59,theory(equality)])).
% cnf(68,negated_conjecture,(distinct_points(esk3_0,esk1_0)|$false),inference(rw,[status(thm)],[67,60,theory(equality)])).
% cnf(69,negated_conjecture,(distinct_points(esk3_0,esk1_0)),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(107,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk3_0,esk1_0))|~distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0))),inference(spm,[status(thm)],[58,63,theory(equality)])).
% cnf(444,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk3_0,esk1_0))|apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))),inference(spm,[status(thm)],[107,63,theory(equality)])).
% cnf(452,negated_conjecture,(distinct_points(esk3_0,esk3_0)|apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))|~distinct_points(esk3_0,esk1_0)),inference(spm,[status(thm)],[32,444,theory(equality)])).
% cnf(456,negated_conjecture,(distinct_points(esk3_0,esk3_0)|apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))|$false),inference(rw,[status(thm)],[452,69,theory(equality)])).
% cnf(457,negated_conjecture,(distinct_points(esk3_0,esk3_0)|apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))),inference(cn,[status(thm)],[456,theory(equality)])).
% cnf(458,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))),inference(sr,[status(thm)],[457,19,theory(equality)])).
% cnf(464,negated_conjecture,(distinct_points(esk3_0,esk3_0)|~distinct_points(esk3_0,esk2_0)),inference(spm,[status(thm)],[32,458,theory(equality)])).
% cnf(469,negated_conjecture,(distinct_points(esk3_0,esk3_0)|$false),inference(rw,[status(thm)],[464,66,theory(equality)])).
% cnf(470,negated_conjecture,(distinct_points(esk3_0,esk3_0)),inference(cn,[status(thm)],[469,theory(equality)])).
% cnf(471,negated_conjecture,($false),inference(sr,[status(thm)],[470,19,theory(equality)])).
% cnf(472,negated_conjecture,($false),471,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 113
% # ...of these trivial : 0
% # ...subsumed : 33
% # ...remaining for further processing: 80
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 296
% # ...of the previous two non-trivial : 203
% # Contextual simplify-reflections : 0
% # Paramodulations : 240
% # Factorizations : 56
% # Equation resolutions : 0
% # Current number of processed clauses: 62
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 51
% # Current number of unprocessed clauses: 120
% # ...number of literals in the above : 591
% # Clause-clause subsumption calls (NU) : 406
% # Rec. Clause-clause subsumption calls : 278
% # 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: 45 leaves, 1.71+/-1.628 terms/leaf
% # Paramod-from index: 24 leaves, 1.21+/-0.406 terms/leaf
% # Paramod-into index: 39 leaves, 1.51+/-0.957 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.005 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP2892/GEO179+2.tptp
%
%------------------------------------------------------------------------------