TSTP Solution File: GEO170+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO170+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 05:03:28 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP6235/GEO170+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6235/GEO170+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6235/GEO170+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 6367
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(3, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% 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(6, 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(13, conjecture,![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&~(apart_point_and_line(X1,X3)))&~(apart_point_and_line(X2,X3)))=>~(distinct_lines(X3,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&~(apart_point_and_line(X1,X3)))&~(apart_point_and_line(X2,X3)))=>~(distinct_lines(X3,line_connecting(X1,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, negated_conjecture,~(![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&~(apart_point_and_line(X1,X3)))&~(apart_point_and_line(X2,X3)))=>~(distinct_lines(X3,line_connecting(X1,X2))))),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(23, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(29, 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(30, 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)],[29])).
% fof(31, 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)],[30])).
% cnf(32,plain,(distinct_points(X3,X2)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(distinct_points(X3,X1)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[31])).
% fof(34, 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)],[6])).
% fof(35, 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)],[34])).
% cnf(36,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)],[35])).
% fof(56, negated_conjecture,?[X1]:?[X2]:?[X3]:(((distinct_points(X1,X2)&~(apart_point_and_line(X1,X3)))&~(apart_point_and_line(X2,X3)))&distinct_lines(X3,line_connecting(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(57, negated_conjecture,?[X4]:?[X5]:?[X6]:(((distinct_points(X4,X5)&~(apart_point_and_line(X4,X6)))&~(apart_point_and_line(X5,X6)))&distinct_lines(X6,line_connecting(X4,X5))),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&~(apart_point_and_line(esk1_0,esk3_0)))&~(apart_point_and_line(esk2_0,esk3_0)))&distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(~apart_point_and_line(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(63,negated_conjecture,(distinct_points(esk1_0,X1)|distinct_points(esk2_0,X1)),inference(spm,[status(thm)],[25,62,theory(equality)])).
% cnf(69,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,esk3_0)|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|~distinct_points(X1,X2)),inference(spm,[status(thm)],[36,59,theory(equality)])).
% cnf(70,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[20,63,theory(equality)])).
% cnf(161,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(esk1_0,esk3_0)|apart_point_and_line(esk2_0,esk3_0)),inference(spm,[status(thm)],[69,70,theory(equality)])).
% cnf(183,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(esk2_0,esk3_0)),inference(sr,[status(thm)],[161,61,theory(equality)])).
% cnf(184,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))),inference(sr,[status(thm)],[183,60,theory(equality)])).
% cnf(206,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[33,184,theory(equality)])).
% cnf(210,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[206,62,theory(equality)])).
% cnf(211,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[210,theory(equality)])).
% cnf(212,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(sr,[status(thm)],[211,20,theory(equality)])).
% cnf(217,negated_conjecture,(distinct_points(esk2_0,esk2_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[32,212,theory(equality)])).
% cnf(220,negated_conjecture,(distinct_points(esk2_0,esk2_0)|$false),inference(rw,[status(thm)],[217,62,theory(equality)])).
% cnf(221,negated_conjecture,(distinct_points(esk2_0,esk2_0)),inference(cn,[status(thm)],[220,theory(equality)])).
% cnf(222,negated_conjecture,($false),inference(sr,[status(thm)],[221,20,theory(equality)])).
% cnf(223,negated_conjecture,($false),222,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 65
% # ...of these trivial : 0
% # ...subsumed : 10
% # ...remaining for further processing: 55
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 107
% # ...of the previous two non-trivial : 79
% # Contextual simplify-reflections : 0
% # Paramodulations : 87
% # Factorizations : 20
% # Equation resolutions : 0
% # Current number of processed clauses: 36
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 27
% # Current number of unprocessed clauses: 46
% # ...number of literals in the above : 208
% # Clause-clause subsumption calls (NU) : 138
% # Rec. Clause-clause subsumption calls : 96
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 30 leaves, 2.03+/-1.888 terms/leaf
% # Paramod-from index: 14 leaves, 1.14+/-0.350 terms/leaf
% # Paramod-into index: 26 leaves, 1.65+/-0.998 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.006 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP6235/GEO170+2.tptp
%
%------------------------------------------------------------------------------