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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO177+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:02 EST 2010

% Result   : Theorem 3.11s
% Output   : Solution 3.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/SystemOnTPTP29487/GEO177+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP29487/GEO177+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29487/GEO177+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 29583
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.02 WC
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(8, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% 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(12, axiom,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),file('/tmp/SRASS.s.p', cp2)).
% fof(23, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(25, axiom,![X1]:![X2]:(distinct_lines(X1,X2)=>convergent_lines(X1,X2)),file('/tmp/SRASS.s.p', p1)).
% fof(36, conjecture,![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_points(X4,X5))=>((apart_point_and_line(X1,line_connecting(X4,X5))|apart_point_and_line(X2,line_connecting(X4,X5)))=>(apart_point_and_line(X4,line_connecting(X1,X2))|apart_point_and_line(X5,line_connecting(X1,X2))))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_points(X4,X5))=>((apart_point_and_line(X1,line_connecting(X4,X5))|apart_point_and_line(X2,line_connecting(X4,X5)))=>(apart_point_and_line(X4,line_connecting(X1,X2))|apart_point_and_line(X5,line_connecting(X1,X2)))))),inference(assume_negation,[status(cth)],[36])).
% fof(41, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(43, plain,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(49, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[23,theory(equality)])).
% fof(74, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[41])).
% cnf(75,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(76, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(77, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[76])).
% cnf(78,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[77])).
% fof(82, 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(83, 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)],[82])).
% cnf(84,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[83])).
% fof(89, plain,![X3]:![X4]:~(apart_point_and_line(X3,parallel_through_point(X4,X3))),inference(variable_rename,[status(thm)],[43])).
% cnf(90,plain,(~apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[89])).
% fof(120, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[49])).
% cnf(121,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(125, plain,![X1]:![X2]:(~(distinct_lines(X1,X2))|convergent_lines(X1,X2)),inference(fof_nnf,[status(thm)],[25])).
% fof(126, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(variable_rename,[status(thm)],[125])).
% cnf(127,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[126])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:((distinct_points(X1,X2)&distinct_points(X4,X5))&((apart_point_and_line(X1,line_connecting(X4,X5))|apart_point_and_line(X2,line_connecting(X4,X5)))&(~(apart_point_and_line(X4,line_connecting(X1,X2)))&~(apart_point_and_line(X5,line_connecting(X1,X2)))))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:((distinct_points(X6,X7)&distinct_points(X8,X9))&((apart_point_and_line(X6,line_connecting(X8,X9))|apart_point_and_line(X7,line_connecting(X8,X9)))&(~(apart_point_and_line(X8,line_connecting(X6,X7)))&~(apart_point_and_line(X9,line_connecting(X6,X7)))))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((distinct_points(esk1_0,esk2_0)&distinct_points(esk3_0,esk4_0))&((apart_point_and_line(esk1_0,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk2_0,line_connecting(esk3_0,esk4_0)))&(~(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)))&~(apart_point_and_line(esk4_0,line_connecting(esk1_0,esk2_0)))))),inference(skolemize,[status(esa)],[168])).
% cnf(172,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk1_0,line_connecting(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(184,negated_conjecture,(distinct_lines(line_connecting(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,line_connecting(esk3_0,esk4_0))),inference(spm,[status(thm)],[84,172,theory(equality)])).
% cnf(268,negated_conjecture,(distinct_lines(X1,X2)|distinct_lines(line_connecting(esk3_0,esk4_0),X2)|apart_point_and_line(esk2_0,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk1_0,X1)),inference(spm,[status(thm)],[78,184,theory(equality)])).
% cnf(2362,negated_conjecture,(distinct_lines(X1,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk2_0,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk1_0,X1)),inference(spm,[status(thm)],[75,268,theory(equality)])).
% cnf(27613,negated_conjecture,(convergent_lines(X1,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk2_0,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk1_0,X1)),inference(spm,[status(thm)],[127,2362,theory(equality)])).
% cnf(27978,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk1_0,parallel_through_point(line_connecting(esk3_0,esk4_0),X1))),inference(spm,[status(thm)],[121,27613,theory(equality)])).
% cnf(27995,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk3_0,esk4_0))),inference(spm,[status(thm)],[90,27978,theory(equality)])).
% cnf(27997,negated_conjecture,(distinct_lines(line_connecting(esk3_0,esk4_0),X1)|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[84,27995,theory(equality)])).
% cnf(28010,negated_conjecture,(distinct_lines(X1,X2)|distinct_lines(line_connecting(esk3_0,esk4_0),X2)|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[78,27997,theory(equality)])).
% cnf(29061,negated_conjecture,(distinct_lines(X1,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[75,28010,theory(equality)])).
% cnf(29500,negated_conjecture,(convergent_lines(X1,line_connecting(esk3_0,esk4_0))|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[127,29061,theory(equality)])).
% cnf(29517,negated_conjecture,(apart_point_and_line(esk2_0,parallel_through_point(line_connecting(esk3_0,esk4_0),X1))),inference(spm,[status(thm)],[121,29500,theory(equality)])).
% cnf(29790,negated_conjecture,($false),inference(spm,[status(thm)],[90,29517,theory(equality)])).
% cnf(29791,negated_conjecture,($false),29790,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1865
% # ...of these trivial                : 13
% # ...subsumed                        : 1139
% # ...remaining for further processing: 713
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 60
% # Backward-rewritten                 : 43
% # Generated clauses                  : 28245
% # ...of the previous two non-trivial : 27403
% # Contextual simplify-reflections    : 251
% # Paramodulations                    : 27095
% # Factorizations                     : 1150
% # Equation resolutions               : 0
% # Current number of processed clauses: 610
% #    Positive orientable unit clauses: 66
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 9
% #    Non-unit-clauses                : 535
% # Current number of unprocessed clauses: 22835
% # ...number of literals in the above : 141914
% # Clause-clause subsumption calls (NU) : 42772
% # Rec. Clause-clause subsumption calls : 23340
% # Unit Clause-clause subsumption calls : 934
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 177
% # Indexed BW rewrite successes       : 15
% # Backwards rewriting index:   136 leaves,   3.87+/-4.948 terms/leaf
% # Paramod-from index:           94 leaves,   3.56+/-4.533 terms/leaf
% # Paramod-into index:          123 leaves,   3.77+/-4.657 terms/leaf
% # -------------------------------------------------
% # User time              : 1.803 s
% # System time            : 0.029 s
% # Total time             : 1.832 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.28 CPU 2.38 WC
% FINAL PrfWatch: 2.28 CPU 2.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP29487/GEO177+3.tptp
% 
%------------------------------------------------------------------------------