TSTP Solution File: GEO201+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO201+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 : 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:08:24 EST 2010
% Result : Theorem 1.80s
% Output : Solution 1.80s
% 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/SystemOnTPTP10215/GEO201+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10215/GEO201+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10215/GEO201+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 10311
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(2, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(3, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(4, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(5, axiom,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),file('/tmp/SRASS.s.p', ax1)).
% fof(6, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(7, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(9, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(16, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(29, axiom,![X1]:![X2]:![X9]:![X10]:((distinct_points(X1,X2)&distinct_lines(X9,X10))=>(((apart_point_and_line(X1,X9)|apart_point_and_line(X1,X10))|apart_point_and_line(X2,X9))|apart_point_and_line(X2,X10))),file('/tmp/SRASS.s.p', cu1)).
% fof(36, conjecture,![X1]:![X2]:(convergent_lines(X1,X2)=>equal_points(intersection_point(X1,X2),intersection_point(X2,X1))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:(convergent_lines(X1,X2)=>equal_points(intersection_point(X1,X2),intersection_point(X2,X1)))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(39, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(40, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(42, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(46, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(57, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[38])).
% cnf(58,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(60, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[39])).
% fof(63, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[63])).
% fof(65, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[40])).
% fof(66, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(68, plain,![X1]:![X2]:((~(equal_points(X1,X2))|~(distinct_points(X1,X2)))&(distinct_points(X1,X2)|equal_points(X1,X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(69, plain,![X3]:![X4]:((~(equal_points(X3,X4))|~(distinct_points(X3,X4)))&(distinct_points(X3,X4)|equal_points(X3,X4))),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(equal_points(X1,X2)|distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(72, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[42])).
% cnf(73,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(74, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(75, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[74])).
% cnf(76,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(80, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(81, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[80])).
% cnf(82,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[81])).
% fof(108, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[46])).
% cnf(109,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[108])).
% fof(147, plain,![X1]:![X2]:![X9]:![X10]:((~(distinct_points(X1,X2))|~(distinct_lines(X9,X10)))|(((apart_point_and_line(X1,X9)|apart_point_and_line(X1,X10))|apart_point_and_line(X2,X9))|apart_point_and_line(X2,X10))),inference(fof_nnf,[status(thm)],[29])).
% fof(148, plain,![X11]:![X12]:![X13]:![X14]:((~(distinct_points(X11,X12))|~(distinct_lines(X13,X14)))|(((apart_point_and_line(X11,X13)|apart_point_and_line(X11,X14))|apart_point_and_line(X12,X13))|apart_point_and_line(X12,X14))),inference(variable_rename,[status(thm)],[147])).
% cnf(149,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)],[148])).
% fof(167, negated_conjecture,?[X1]:?[X2]:(convergent_lines(X1,X2)&~(equal_points(intersection_point(X1,X2),intersection_point(X2,X1)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X3]:?[X4]:(convergent_lines(X3,X4)&~(equal_points(intersection_point(X3,X4),intersection_point(X4,X3)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(convergent_lines(esk1_0,esk2_0)&~(equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(173,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0))),inference(spm,[status(thm)],[170,70,theory(equality)])).
% cnf(179,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[61,171,theory(equality)])).
% cnf(195,negated_conjecture,(distinct_points(intersection_point(esk2_0,esk1_0),X1)|distinct_points(intersection_point(esk1_0,esk2_0),X1)),inference(spm,[status(thm)],[76,173,theory(equality)])).
% cnf(209,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[58,179,theory(equality)])).
% cnf(210,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(esk1_0,X2)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[61,179,theory(equality)])).
% cnf(228,negated_conjecture,(distinct_points(intersection_point(esk2_0,esk1_0),intersection_point(esk1_0,esk2_0))),inference(spm,[status(thm)],[73,195,theory(equality)])).
% cnf(302,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[58,210,theory(equality)])).
% cnf(322,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(esk2_0,X2)|convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[61,302,theory(equality)])).
% cnf(396,negated_conjecture,(convergent_lines(X1,esk1_0)|convergent_lines(X1,esk2_0)),inference(spm,[status(thm)],[58,322,theory(equality)])).
% cnf(414,negated_conjecture,(convergent_lines(parallel_through_point(esk1_0,X1),esk2_0)),inference(spm,[status(thm)],[109,396,theory(equality)])).
% cnf(424,negated_conjecture,(distinct_lines(esk2_0,X1)|convergent_lines(parallel_through_point(esk1_0,X2),X1)),inference(spm,[status(thm)],[82,414,theory(equality)])).
% cnf(433,negated_conjecture,(distinct_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[109,424,theory(equality)])).
% cnf(435,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X2,esk1_0)|apart_point_and_line(X2,esk2_0)|~distinct_points(X2,X1)),inference(spm,[status(thm)],[149,433,theory(equality)])).
% cnf(8625,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(spm,[status(thm)],[435,228,theory(equality)])).
% cnf(11793,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[64,8625,theory(equality)])).
% cnf(11794,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|$false),inference(rw,[status(thm)],[11793,171,theory(equality)])).
% cnf(11795,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)),inference(cn,[status(thm)],[11794,theory(equality)])).
% cnf(11798,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,11795,theory(equality)])).
% cnf(11799,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)|$false),inference(rw,[status(thm)],[11798,171,theory(equality)])).
% cnf(11800,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)),inference(cn,[status(thm)],[11799,theory(equality)])).
% cnf(11807,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[67,11800,theory(equality)])).
% cnf(11808,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|$false),inference(rw,[status(thm)],[11807,209,theory(equality)])).
% cnf(11809,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)),inference(cn,[status(thm)],[11808,theory(equality)])).
% cnf(11812,negated_conjecture,(~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[64,11809,theory(equality)])).
% cnf(11814,negated_conjecture,($false),inference(rw,[status(thm)],[11812,209,theory(equality)])).
% cnf(11815,negated_conjecture,($false),inference(cn,[status(thm)],[11814,theory(equality)])).
% cnf(11816,negated_conjecture,($false),11815,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1253
% # ...of these trivial : 16
% # ...subsumed : 601
% # ...remaining for further processing: 636
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 13
% # Generated clauses : 10003
% # ...of the previous two non-trivial : 8732
% # Contextual simplify-reflections : 110
% # Paramodulations : 9535
% # Factorizations : 468
% # Equation resolutions : 0
% # Current number of processed clauses: 612
% # Positive orientable unit clauses: 72
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 532
% # Current number of unprocessed clauses: 7319
% # ...number of literals in the above : 35748
% # Clause-clause subsumption calls (NU) : 22769
% # Rec. Clause-clause subsumption calls : 12280
% # Unit Clause-clause subsumption calls : 816
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 270
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 164 leaves, 3.23+/-3.186 terms/leaf
% # Paramod-from index: 121 leaves, 2.92+/-2.848 terms/leaf
% # Paramod-into index: 154 leaves, 3.10+/-2.984 terms/leaf
% # -------------------------------------------------
% # User time : 0.720 s
% # System time : 0.019 s
% # Total time : 0.739 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.95 CPU 1.03 WC
% FINAL PrfWatch: 0.95 CPU 1.03 WC
% SZS output end Solution for /tmp/SystemOnTPTP10215/GEO201+3.tptp
%
%------------------------------------------------------------------------------