TSTP Solution File: GEO205+2 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO205+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 : art05.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:09:42 EST 2010

% Result   : Theorem 2.98s
% Output   : Solution 2.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/SystemOnTPTP10474/GEO205+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP10474/GEO205+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10474/GEO205+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 10570
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.91 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(2, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(5, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(6, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', apart6)).
% fof(7, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', ceq3)).
% fof(8, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>((apart_point_and_line(X3,X1)|apart_point_and_line(X3,X2))=>distinct_points(X3,intersection_point(X1,X2)))),file('/tmp/SRASS.s.p', con2)).
% fof(9, 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(10, 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(11, 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(13, conjecture,![X1]:![X2]:![X3]:((convergent_lines(X1,X2)&~(distinct_lines(X2,X3)))=>(convergent_lines(X1,X3)&~(distinct_points(intersection_point(X1,X2),intersection_point(X1,X3))))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:((convergent_lines(X1,X2)&~(distinct_lines(X2,X3)))=>(convergent_lines(X1,X3)&~(distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(16, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:((convergent_lines(X1,X2)&~(distinct_lines(X2,X3)))=>(convergent_lines(X1,X3)&~(distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))))),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(21, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(22,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(28, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[5])).
% fof(29, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(32, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(35, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|((~(apart_point_and_line(X3,X1))&~(apart_point_and_line(X3,X2)))|distinct_points(X3,intersection_point(X1,X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(38, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|((~(apart_point_and_line(X6,X4))&~(apart_point_and_line(X6,X5)))|distinct_points(X6,intersection_point(X4,X5)))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:(((~(apart_point_and_line(X6,X4))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))&((~(apart_point_and_line(X6,X5))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))),inference(distribute,[status(thm)],[38])).
% cnf(40,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(42, 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)],[9])).
% fof(43, 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)],[42])).
% cnf(44,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)],[43])).
% fof(45, 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)],[10])).
% fof(46, 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)],[45])).
% cnf(47,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, 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)],[11])).
% fof(49, 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)],[48])).
% cnf(50,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[49])).
% fof(56, negated_conjecture,?[X1]:?[X2]:?[X3]:((convergent_lines(X1,X2)&~(distinct_lines(X2,X3)))&(~(convergent_lines(X1,X3))|distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))),inference(fof_nnf,[status(thm)],[18])).
% fof(57, negated_conjecture,?[X4]:?[X5]:?[X6]:((convergent_lines(X4,X5)&~(distinct_lines(X5,X6)))&(~(convergent_lines(X4,X6))|distinct_points(intersection_point(X4,X5),intersection_point(X4,X6)))),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,((convergent_lines(esk1_0,esk2_0)&~(distinct_lines(esk2_0,esk3_0)))&(~(convergent_lines(esk1_0,esk3_0))|distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))|~convergent_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(~distinct_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,negated_conjecture,(~convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[60,36,theory(equality)])).
% cnf(65,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(spm,[status(thm)],[30,36,theory(equality)])).
% cnf(66,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[33,61,theory(equality)])).
% cnf(67,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[20,40,theory(equality)])).
% cnf(69,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[20,41,theory(equality)])).
% cnf(74,negated_conjecture,(convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[62,66,theory(equality)])).
% cnf(77,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))|$false),inference(rw,[status(thm)],[59,74,theory(equality)])).
% cnf(78,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(cn,[status(thm)],[77,theory(equality)])).
% cnf(88,negated_conjecture,(distinct_lines(esk3_0,X1)|distinct_lines(esk1_0,X1)),inference(spm,[status(thm)],[65,74,theory(equality)])).
% cnf(90,negated_conjecture,(distinct_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[22,88,theory(equality)])).
% cnf(94,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X2,esk1_0)|apart_point_and_line(X2,esk3_0)|~distinct_points(X1,X2)),inference(spm,[status(thm)],[44,90,theory(equality)])).
% cnf(305,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(spm,[status(thm)],[94,78,theory(equality)])).
% cnf(3423,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[67,305,theory(equality)])).
% cnf(3424,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|$false),inference(rw,[status(thm)],[3423,74,theory(equality)])).
% cnf(3425,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)),inference(cn,[status(thm)],[3424,theory(equality)])).
% cnf(18396,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[69,3425,theory(equality)])).
% cnf(18397,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|$false),inference(rw,[status(thm)],[18396,74,theory(equality)])).
% cnf(18398,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(cn,[status(thm)],[18397,theory(equality)])).
% cnf(18399,negated_conjecture,(apart_point_and_line(X1,esk3_0)|distinct_points(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(spm,[status(thm)],[47,18398,theory(equality)])).
% cnf(18626,negated_conjecture,(apart_point_and_line(X1,esk3_0)|distinct_points(intersection_point(esk1_0,esk2_0),X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[69,18399,theory(equality)])).
% cnf(18627,negated_conjecture,(apart_point_and_line(X1,esk3_0)|distinct_points(intersection_point(esk1_0,esk2_0),X1)|$false),inference(rw,[status(thm)],[18626,61,theory(equality)])).
% cnf(18628,negated_conjecture,(apart_point_and_line(X1,esk3_0)|distinct_points(intersection_point(esk1_0,esk2_0),X1)),inference(cn,[status(thm)],[18627,theory(equality)])).
% cnf(18629,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(spm,[status(thm)],[20,18628,theory(equality)])).
% cnf(18739,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[50,18629,theory(equality)])).
% cnf(18785,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,18739,theory(equality)])).
% cnf(18795,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[18785,61,theory(equality)])).
% cnf(18796,negated_conjecture,(distinct_lines(esk3_0,esk2_0)),inference(cn,[status(thm)],[18795,theory(equality)])).
% cnf(18800,negated_conjecture,(distinct_lines(esk3_0,X1)|distinct_lines(esk2_0,X1)),inference(spm,[status(thm)],[30,18796,theory(equality)])).
% cnf(18802,negated_conjecture,(distinct_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[22,18800,theory(equality)])).
% cnf(18805,negated_conjecture,($false),inference(sr,[status(thm)],[18802,60,theory(equality)])).
% cnf(18806,negated_conjecture,($false),18805,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 2662
% # ...of these trivial                : 2
% # ...subsumed                        : 2074
% # ...remaining for further processing: 586
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 18
% # Backward-rewritten                 : 4
% # Generated clauses                  : 16875
% # ...of the previous two non-trivial : 16076
% # Contextual simplify-reflections    : 611
% # Paramodulations                    : 15079
% # Factorizations                     : 1796
% # Equation resolutions               : 0
% # Current number of processed clauses: 547
% #    Positive orientable unit clauses: 12
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 5
% #    Non-unit-clauses                : 530
% # Current number of unprocessed clauses: 9987
% # ...number of literals in the above : 89002
% # Clause-clause subsumption calls (NU) : 101087
% # Rec. Clause-clause subsumption calls : 27251
% # Unit Clause-clause subsumption calls : 93
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 2
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:    59 leaves,   2.98+/-3.510 terms/leaf
% # Paramod-from index:           40 leaves,   2.60+/-2.557 terms/leaf
% # Paramod-into index:           51 leaves,   2.49+/-2.796 terms/leaf
% # -------------------------------------------------
% # User time              : 1.820 s
% # System time            : 0.026 s
% # Total time             : 1.846 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.18 CPU 2.28 WC
% FINAL PrfWatch: 2.18 CPU 2.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP10474/GEO205+2.tptp
% 
%------------------------------------------------------------------------------