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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO209+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 : 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:15:48 EST 2010

% Result   : Theorem 1.15s
% Output   : Solution 1.15s
% 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/SystemOnTPTP12571/GEO209+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP12571/GEO209+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12571/GEO209+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 12703
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(parallel_lines(X1,X2)<=>~(convergent_lines(X1,X2))),file('/tmp/SRASS.s.p', a3)).
% fof(3, axiom,![X1]:![X2]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),file('/tmp/SRASS.s.p', ax2)).
% fof(9, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(23, axiom,![X1]:![X2]:(distinct_lines(X1,X2)=>convergent_lines(X1,X2)),file('/tmp/SRASS.s.p', p1)).
% fof(36, conjecture,![X4]:![X5]:![X8]:![X9]:(((((apart_point_and_line(X4,X5)&incident_point_and_line(X4,X8))&incident_point_and_line(X4,X9))¶llel_lines(X8,X5))¶llel_lines(X9,X5))=>equal_lines(X8,X9)),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X4]:![X5]:![X8]:![X9]:(((((apart_point_and_line(X4,X5)&incident_point_and_line(X4,X8))&incident_point_and_line(X4,X9))¶llel_lines(X8,X5))¶llel_lines(X9,X5))=>equal_lines(X8,X9))),inference(assume_negation,[status(cth)],[36])).
% fof(39, plain,![X1]:![X2]:(parallel_lines(X1,X2)<=>~(convergent_lines(X1,X2))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(40, plain,![X1]:![X2]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(61, plain,![X1]:![X2]:((~(parallel_lines(X1,X2))|~(convergent_lines(X1,X2)))&(convergent_lines(X1,X2)|parallel_lines(X1,X2))),inference(fof_nnf,[status(thm)],[39])).
% fof(62, plain,![X3]:![X4]:((~(parallel_lines(X3,X4))|~(convergent_lines(X3,X4)))&(convergent_lines(X3,X4)|parallel_lines(X3,X4))),inference(variable_rename,[status(thm)],[61])).
% cnf(64,plain,(~convergent_lines(X1,X2)|~parallel_lines(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(65, plain,![X1]:![X2]:((~(equal_lines(X1,X2))|~(distinct_lines(X1,X2)))&(distinct_lines(X1,X2)|equal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[40])).
% fof(66, plain,![X3]:![X4]:((~(equal_lines(X3,X4))|~(distinct_lines(X3,X4)))&(distinct_lines(X3,X4)|equal_lines(X3,X4))),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(equal_lines(X1,X2)|distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(81, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(82, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(120, plain,![X1]:![X2]:(~(distinct_lines(X1,X2))|convergent_lines(X1,X2)),inference(fof_nnf,[status(thm)],[23])).
% fof(121, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[121])).
% fof(167, negated_conjecture,?[X4]:?[X5]:?[X8]:?[X9]:(((((apart_point_and_line(X4,X5)&incident_point_and_line(X4,X8))&incident_point_and_line(X4,X9))¶llel_lines(X8,X5))¶llel_lines(X9,X5))&~(equal_lines(X8,X9))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X10]:?[X11]:?[X12]:?[X13]:(((((apart_point_and_line(X10,X11)&incident_point_and_line(X10,X12))&incident_point_and_line(X10,X13))¶llel_lines(X12,X11))¶llel_lines(X13,X11))&~(equal_lines(X12,X13))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((((apart_point_and_line(esk1_0,esk2_0)&incident_point_and_line(esk1_0,esk3_0))&incident_point_and_line(esk1_0,esk4_0))¶llel_lines(esk3_0,esk2_0))¶llel_lines(esk4_0,esk2_0))&~(equal_lines(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(parallel_lines(esk4_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(parallel_lines(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(180,negated_conjecture,(distinct_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[170,67,theory(equality)])).
% cnf(181,negated_conjecture,(~convergent_lines(esk4_0,esk2_0)),inference(spm,[status(thm)],[64,171,theory(equality)])).
% cnf(182,negated_conjecture,(~convergent_lines(esk3_0,esk2_0)),inference(spm,[status(thm)],[64,172,theory(equality)])).
% cnf(199,negated_conjecture,(convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[122,180,theory(equality)])).
% cnf(202,negated_conjecture,(convergent_lines(esk4_0,X1)|convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[83,199,theory(equality)])).
% cnf(217,negated_conjecture,(convergent_lines(esk3_0,esk2_0)),inference(spm,[status(thm)],[181,202,theory(equality)])).
% cnf(219,negated_conjecture,($false),inference(sr,[status(thm)],[217,182,theory(equality)])).
% cnf(220,negated_conjecture,($false),219,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 61
% # ...of these trivial                : 0
% # ...subsumed                        : 4
% # ...remaining for further processing: 57
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 37
% # ...of the previous two non-trivial : 23
% # Contextual simplify-reflections    : 4
% # Paramodulations                    : 37
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 57
% #    Positive orientable unit clauses: 8
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 12
% #    Non-unit-clauses                : 37
% # Current number of unprocessed clauses: 14
% # ...number of literals in the above : 37
% # Clause-clause subsumption calls (NU) : 50
% # Rec. Clause-clause subsumption calls : 50
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    48 leaves,   1.60+/-1.468 terms/leaf
% # Paramod-from index:           20 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           43 leaves,   1.35+/-0.804 terms/leaf
% # -------------------------------------------------
% # User time              : 0.014 s
% # System time            : 0.005 s
% # Total time             : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP12571/GEO209+3.tptp
% 
%------------------------------------------------------------------------------