TSTP Solution File: GEO179+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO179+3 : TPTP v5.0.0. Released v4.0.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:01:40 EST 2010

% Result   : Theorem 0.99s
% Output   : Solution 0.99s
% 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/SystemOnTPTP30005/GEO179+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP30005/GEO179+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30005/GEO179+3.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 30101
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(6, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(8, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),file('/tmp/SRASS.s.p', ceq1)).
% fof(9, 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(36, 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(37, 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)],[36])).
% fof(40, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(67, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(68, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(70, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[41])).
% fof(71, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(76, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(77, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_points(X4,X6)|apart_point_and_line(X6,X5))),inference(variable_rename,[status(thm)],[76])).
% cnf(78,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[77])).
% fof(79, 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)],[9])).
% fof(80, 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)],[79])).
% cnf(81,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[80])).
% fof(167, 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)],[37])).
% fof(168, 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)],[167])).
% fof(169, 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)],[168])).
% cnf(170,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)],[169])).
% cnf(171,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(180,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|distinct_points(esk3_0,X1)),inference(spm,[status(thm)],[78,171,theory(equality)])).
% cnf(182,negated_conjecture,(apart_point_and_line(esk3_0,X1)|distinct_lines(line_connecting(esk1_0,esk2_0),X1)),inference(spm,[status(thm)],[81,171,theory(equality)])).
% cnf(208,negated_conjecture,(distinct_points(esk3_0,esk2_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[72,180,theory(equality)])).
% cnf(209,negated_conjecture,(distinct_points(esk3_0,esk1_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[69,180,theory(equality)])).
% cnf(210,negated_conjecture,(distinct_points(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[208,172,theory(equality)])).
% cnf(211,negated_conjecture,(distinct_points(esk3_0,esk2_0)),inference(cn,[status(thm)],[210,theory(equality)])).
% cnf(212,negated_conjecture,(distinct_points(esk3_0,esk1_0)|$false),inference(rw,[status(thm)],[209,172,theory(equality)])).
% cnf(213,negated_conjecture,(distinct_points(esk3_0,esk1_0)),inference(cn,[status(thm)],[212,theory(equality)])).
% cnf(237,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)],[170,182,theory(equality)])).
% cnf(1525,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)],[237,182,theory(equality)])).
% cnf(1529,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))|~distinct_points(esk3_0,esk1_0)),inference(spm,[status(thm)],[69,1525,theory(equality)])).
% cnf(1530,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))|$false),inference(rw,[status(thm)],[1529,213,theory(equality)])).
% cnf(1531,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))),inference(cn,[status(thm)],[1530,theory(equality)])).
% cnf(1534,negated_conjecture,(~distinct_points(esk3_0,esk2_0)),inference(spm,[status(thm)],[69,1531,theory(equality)])).
% cnf(1536,negated_conjecture,($false),inference(rw,[status(thm)],[1534,211,theory(equality)])).
% cnf(1537,negated_conjecture,($false),inference(cn,[status(thm)],[1536,theory(equality)])).
% cnf(1538,negated_conjecture,($false),1537,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 246
% # ...of these trivial                : 4
% # ...subsumed                        : 84
% # ...remaining for further processing: 158
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 2
% # Generated clauses                  : 1189
% # ...of the previous two non-trivial : 1024
% # Contextual simplify-reflections    : 4
% # Paramodulations                    : 1111
% # Factorizations                     : 78
% # Equation resolutions               : 0
% # Current number of processed clauses: 154
% #    Positive orientable unit clauses: 24
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 7
% #    Non-unit-clauses                : 123
% # Current number of unprocessed clauses: 792
% # ...number of literals in the above : 3377
% # Clause-clause subsumption calls (NU) : 1082
% # Rec. Clause-clause subsumption calls : 846
% # Unit Clause-clause subsumption calls : 52
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 30
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:    88 leaves,   2.19+/-2.266 terms/leaf
% # Paramod-from index:           52 leaves,   1.79+/-1.432 terms/leaf
% # Paramod-into index:           80 leaves,   2.04+/-1.880 terms/leaf
% # -------------------------------------------------
% # User time              : 0.064 s
% # System time            : 0.002 s
% # Total time             : 0.066 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP30005/GEO179+3.tptp
% 
%------------------------------------------------------------------------------