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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO255+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 : art09.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:24:01 EST 2010

% Result   : Theorem 0.98s
% Output   : Solution 0.98s
% 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/SystemOnTPTP23800/GEO255+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP23800/GEO255+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23800/GEO255+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 23896
% 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(3, axiom,![X4]:equally_directed_lines(X4,X4),file('/tmp/SRASS.s.p', ax5_basics)).
% fof(5, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>equally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1)))),file('/tmp/SRASS.s.p', ax9_cons_objs)).
% fof(8, axiom,![X4]:![X5]:![X6]:(unequally_directed_lines(X4,X5)=>(unequally_directed_lines(X4,X6)|unequally_directed_lines(X5,X6))),file('/tmp/SRASS.s.p', ax6_basics)).
% fof(11, axiom,![X7]:![X8]:(equally_directed_lines(X7,X8)<=>~(unequally_directed_lines(X7,X8))),file('/tmp/SRASS.s.p', a4_defns)).
% fof(16, axiom,![X4]:![X1]:![X2]:(before_on_line(X4,X1,X2)<=>(((distinct_points(X1,X2)&incident_point_and_line(X1,X4))&incident_point_and_line(X2,X4))&equally_directed_lines(X4,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ax4_defns)).
% fof(17, axiom,![X4]:![X5]:~((left_convergent_lines(X4,X5)|left_convergent_lines(X4,reverse_line(X5)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(20, axiom,![X4]:![X5]:(unequally_directed_lines(X4,X5)|unequally_directed_lines(X4,reverse_line(X5))),file('/tmp/SRASS.s.p', ax8_basics)).
% fof(30, axiom,![X4]:![X5]:((unequally_directed_lines(X4,X5)&unequally_directed_lines(X4,reverse_line(X5)))=>(left_convergent_lines(X4,X5)|left_convergent_lines(X4,reverse_line(X5)))),file('/tmp/SRASS.s.p', ax9_basics)).
% fof(37, conjecture,![X4]:![X1]:![X2]:~((before_on_line(X4,X1,X2)&before_on_line(X4,X2,X1))),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X4]:![X1]:![X2]:~((before_on_line(X4,X1,X2)&before_on_line(X4,X2,X1)))),inference(assume_negation,[status(cth)],[37])).
% fof(43, plain,![X7]:![X8]:(equally_directed_lines(X7,X8)<=>~(unequally_directed_lines(X7,X8))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(52, plain,![X5]:equally_directed_lines(X5,X5),inference(variable_rename,[status(thm)],[3])).
% cnf(53,plain,(equally_directed_lines(X1,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(63, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|equally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(64, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|equally_directed_lines(line_connecting(X3,X4),reverse_line(line_connecting(X4,X3)))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(equally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1)))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(71, plain,![X4]:![X5]:![X6]:(~(unequally_directed_lines(X4,X5))|(unequally_directed_lines(X4,X6)|unequally_directed_lines(X5,X6))),inference(fof_nnf,[status(thm)],[8])).
% fof(72, plain,![X7]:![X8]:![X9]:(~(unequally_directed_lines(X7,X8))|(unequally_directed_lines(X7,X9)|unequally_directed_lines(X8,X9))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(unequally_directed_lines(X1,X2)|unequally_directed_lines(X3,X2)|~unequally_directed_lines(X3,X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(81, plain,![X7]:![X8]:((~(equally_directed_lines(X7,X8))|~(unequally_directed_lines(X7,X8)))&(unequally_directed_lines(X7,X8)|equally_directed_lines(X7,X8))),inference(fof_nnf,[status(thm)],[43])).
% fof(82, plain,![X9]:![X10]:((~(equally_directed_lines(X9,X10))|~(unequally_directed_lines(X9,X10)))&(unequally_directed_lines(X9,X10)|equally_directed_lines(X9,X10))),inference(variable_rename,[status(thm)],[81])).
% cnf(84,plain,(~unequally_directed_lines(X1,X2)|~equally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[82])).
% fof(96, plain,![X4]:![X1]:![X2]:((~(before_on_line(X4,X1,X2))|(((distinct_points(X1,X2)&incident_point_and_line(X1,X4))&incident_point_and_line(X2,X4))&equally_directed_lines(X4,line_connecting(X1,X2))))&((((~(distinct_points(X1,X2))|~(incident_point_and_line(X1,X4)))|~(incident_point_and_line(X2,X4)))|~(equally_directed_lines(X4,line_connecting(X1,X2))))|before_on_line(X4,X1,X2))),inference(fof_nnf,[status(thm)],[16])).
% fof(97, plain,![X5]:![X6]:![X7]:((~(before_on_line(X5,X6,X7))|(((distinct_points(X6,X7)&incident_point_and_line(X6,X5))&incident_point_and_line(X7,X5))&equally_directed_lines(X5,line_connecting(X6,X7))))&((((~(distinct_points(X6,X7))|~(incident_point_and_line(X6,X5)))|~(incident_point_and_line(X7,X5)))|~(equally_directed_lines(X5,line_connecting(X6,X7))))|before_on_line(X5,X6,X7))),inference(variable_rename,[status(thm)],[96])).
% fof(98, plain,![X5]:![X6]:![X7]:(((((distinct_points(X6,X7)|~(before_on_line(X5,X6,X7)))&(incident_point_and_line(X6,X5)|~(before_on_line(X5,X6,X7))))&(incident_point_and_line(X7,X5)|~(before_on_line(X5,X6,X7))))&(equally_directed_lines(X5,line_connecting(X6,X7))|~(before_on_line(X5,X6,X7))))&((((~(distinct_points(X6,X7))|~(incident_point_and_line(X6,X5)))|~(incident_point_and_line(X7,X5)))|~(equally_directed_lines(X5,line_connecting(X6,X7))))|before_on_line(X5,X6,X7))),inference(distribute,[status(thm)],[97])).
% cnf(100,plain,(equally_directed_lines(X1,line_connecting(X2,X3))|~before_on_line(X1,X2,X3)),inference(split_conjunct,[status(thm)],[98])).
% cnf(103,plain,(distinct_points(X2,X3)|~before_on_line(X1,X2,X3)),inference(split_conjunct,[status(thm)],[98])).
% fof(104, plain,![X4]:![X5]:(~(left_convergent_lines(X4,X5))&~(left_convergent_lines(X4,reverse_line(X5)))),inference(fof_nnf,[status(thm)],[17])).
% fof(105, plain,![X6]:![X7]:(~(left_convergent_lines(X6,X7))&~(left_convergent_lines(X6,reverse_line(X7)))),inference(variable_rename,[status(thm)],[104])).
% cnf(107,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[105])).
% fof(119, plain,![X6]:![X7]:(unequally_directed_lines(X6,X7)|unequally_directed_lines(X6,reverse_line(X7))),inference(variable_rename,[status(thm)],[20])).
% cnf(120,plain,(unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[119])).
% fof(151, plain,![X4]:![X5]:((~(unequally_directed_lines(X4,X5))|~(unequally_directed_lines(X4,reverse_line(X5))))|(left_convergent_lines(X4,X5)|left_convergent_lines(X4,reverse_line(X5)))),inference(fof_nnf,[status(thm)],[30])).
% fof(152, plain,![X6]:![X7]:((~(unequally_directed_lines(X6,X7))|~(unequally_directed_lines(X6,reverse_line(X7))))|(left_convergent_lines(X6,X7)|left_convergent_lines(X6,reverse_line(X7)))),inference(variable_rename,[status(thm)],[151])).
% cnf(153,plain,(left_convergent_lines(X1,reverse_line(X2))|left_convergent_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[152])).
% fof(186, negated_conjecture,?[X4]:?[X1]:?[X2]:(before_on_line(X4,X1,X2)&before_on_line(X4,X2,X1)),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X5]:?[X6]:?[X7]:(before_on_line(X5,X6,X7)&before_on_line(X5,X7,X6)),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,(before_on_line(esk1_0,esk2_0,esk3_0)&before_on_line(esk1_0,esk3_0,esk2_0)),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(before_on_line(esk1_0,esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(190,negated_conjecture,(before_on_line(esk1_0,esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(213,plain,(left_convergent_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[153,107,theory(equality)])).
% cnf(214,plain,(~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[213,107,theory(equality)])).
% cnf(232,negated_conjecture,(distinct_points(esk3_0,esk2_0)),inference(spm,[status(thm)],[103,189,theory(equality)])).
% cnf(235,plain,(~unequally_directed_lines(X1,X1)),inference(spm,[status(thm)],[84,53,theory(equality)])).
% cnf(242,plain,(~unequally_directed_lines(X1,line_connecting(X2,X3))|~before_on_line(X1,X2,X3)),inference(spm,[status(thm)],[84,100,theory(equality)])).
% cnf(256,plain,(unequally_directed_lines(X1,X2)|unequally_directed_lines(reverse_line(X3),X2)|unequally_directed_lines(X1,X3)),inference(spm,[status(thm)],[73,120,theory(equality)])).
% cnf(257,plain,(~unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1)))|~distinct_points(X1,X2)),inference(spm,[status(thm)],[84,65,theory(equality)])).
% cnf(262,plain,(unequally_directed_lines(reverse_line(X1),X1)),inference(spm,[status(thm)],[235,120,theory(equality)])).
% cnf(270,plain,(~unequally_directed_lines(reverse_line(reverse_line(X1)),X1)),inference(spm,[status(thm)],[214,262,theory(equality)])).
% cnf(271,plain,(unequally_directed_lines(reverse_line(X1),X2)|unequally_directed_lines(X1,X2)),inference(spm,[status(thm)],[73,262,theory(equality)])).
% cnf(274,plain,(unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_lines(reverse_line(X1),X2)),inference(spm,[status(thm)],[214,271,theory(equality)])).
% cnf(304,plain,(unequally_directed_lines(reverse_line(X4),line_connecting(X2,X3))|unequally_directed_lines(X1,X4)|~before_on_line(X1,X2,X3)),inference(spm,[status(thm)],[242,256,theory(equality)])).
% cnf(306,plain,(unequally_directed_lines(reverse_line(X2),X1)|unequally_directed_lines(X1,X2)),inference(spm,[status(thm)],[235,256,theory(equality)])).
% cnf(532,plain,(unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X2,X1)),inference(spm,[status(thm)],[274,306,theory(equality)])).
% cnf(547,plain,(unequally_directed_lines(X2,X1)|~unequally_directed_lines(X1,X2)),inference(spm,[status(thm)],[214,532,theory(equality)])).
% cnf(890,negated_conjecture,(unequally_directed_lines(reverse_line(X1),line_connecting(esk3_0,esk2_0))|unequally_directed_lines(esk1_0,X1)),inference(spm,[status(thm)],[304,189,theory(equality)])).
% cnf(891,negated_conjecture,(unequally_directed_lines(reverse_line(X1),line_connecting(esk2_0,esk3_0))|unequally_directed_lines(esk1_0,X1)),inference(spm,[status(thm)],[304,190,theory(equality)])).
% cnf(894,negated_conjecture,(unequally_directed_lines(line_connecting(esk3_0,esk2_0),reverse_line(X1))|unequally_directed_lines(esk1_0,X1)),inference(spm,[status(thm)],[547,890,theory(equality)])).
% cnf(1012,negated_conjecture,(unequally_directed_lines(esk1_0,reverse_line(line_connecting(esk2_0,esk3_0)))),inference(spm,[status(thm)],[270,891,theory(equality)])).
% cnf(1018,negated_conjecture,(~unequally_directed_lines(esk1_0,line_connecting(esk2_0,esk3_0))),inference(spm,[status(thm)],[214,1012,theory(equality)])).
% cnf(1076,negated_conjecture,(unequally_directed_lines(esk1_0,line_connecting(esk2_0,esk3_0))|~distinct_points(esk3_0,esk2_0)),inference(spm,[status(thm)],[257,894,theory(equality)])).
% cnf(1079,negated_conjecture,(unequally_directed_lines(esk1_0,line_connecting(esk2_0,esk3_0))|$false),inference(rw,[status(thm)],[1076,232,theory(equality)])).
% cnf(1080,negated_conjecture,(unequally_directed_lines(esk1_0,line_connecting(esk2_0,esk3_0))),inference(cn,[status(thm)],[1079,theory(equality)])).
% cnf(1081,negated_conjecture,($false),inference(sr,[status(thm)],[1080,1018,theory(equality)])).
% cnf(1082,negated_conjecture,($false),1081,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 280
% # ...of these trivial                : 4
% # ...subsumed                        : 69
% # ...remaining for further processing: 207
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 3
% # Generated clauses                  : 703
% # ...of the previous two non-trivial : 558
% # Contextual simplify-reflections    : 9
% # Paramodulations                    : 652
% # Factorizations                     : 48
% # Equation resolutions               : 0
% # Current number of processed clauses: 152
% #    Positive orientable unit clauses: 53
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 28
% #    Non-unit-clauses                : 71
% # Current number of unprocessed clauses: 391
% # ...number of literals in the above : 949
% # Clause-clause subsumption calls (NU) : 691
% # Rec. Clause-clause subsumption calls : 579
% # Unit Clause-clause subsumption calls : 151
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 51
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:   117 leaves,   1.77+/-1.640 terms/leaf
% # Paramod-from index:           57 leaves,   1.63+/-1.209 terms/leaf
% # Paramod-into index:          109 leaves,   1.66+/-1.403 terms/leaf
% # -------------------------------------------------
% # User time              : 0.044 s
% # System time            : 0.005 s
% # Total time             : 0.049 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP23800/GEO255+3.tptp
% 
%------------------------------------------------------------------------------