TSTP Solution File: GEO205+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO205+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 : art04.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:49 EST 2010
% Result : Theorem 3.07s
% Output : Solution 3.07s
% 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/SystemOnTPTP13080/GEO205+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13080/GEO205+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13080/GEO205+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 13176
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 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]:~(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_lines(X1,X2)<=>~(distinct_lines(X1,X2))),file('/tmp/SRASS.s.p', ax2)).
% fof(6, axiom,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),file('/tmp/SRASS.s.p', ax1)).
% fof(8, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(10, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(12, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(19, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(25, 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(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]:![X3]:((convergent_lines(X1,X2)&equal_lines(X2,X3))=>(convergent_lines(X1,X3)&equal_points(intersection_point(X1,X2),intersection_point(X1,X3)))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X3]:((convergent_lines(X1,X2)&equal_lines(X2,X3))=>(convergent_lines(X1,X3)&equal_points(intersection_point(X1,X2),intersection_point(X1,X3))))),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_lines(X1,X2)<=>~(distinct_lines(X1,X2))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(42, plain,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(44, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(48, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[19,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_lines(X1,X2))|~(distinct_lines(X1,X2)))&(distinct_lines(X1,X2)|equal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(69, plain,![X3]:![X4]:((~(equal_lines(X3,X4))|~(distinct_lines(X3,X4)))&(distinct_lines(X3,X4)|equal_lines(X3,X4))),inference(variable_rename,[status(thm)],[68])).
% cnf(71,plain,(~distinct_lines(X1,X2)|~equal_lines(X1,X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(72, plain,![X1]:![X2]:((~(equal_points(X1,X2))|~(distinct_points(X1,X2)))&(distinct_points(X1,X2)|equal_points(X1,X2))),inference(fof_nnf,[status(thm)],[42])).
% fof(73, plain,![X3]:![X4]:((~(equal_points(X3,X4))|~(distinct_points(X3,X4)))&(distinct_points(X3,X4)|equal_points(X3,X4))),inference(variable_rename,[status(thm)],[72])).
% cnf(74,plain,(equal_points(X1,X2)|distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(78, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[44])).
% cnf(79,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(83, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[10])).
% fof(84, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[83])).
% cnf(85,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[84])).
% fof(89, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[12])).
% fof(90, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[89])).
% cnf(91,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[90])).
% fof(117, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[48])).
% cnf(118,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[117])).
% fof(135, 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)],[25])).
% fof(136, 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)],[135])).
% cnf(137,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[136])).
% 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]:?[X3]:((convergent_lines(X1,X2)&equal_lines(X2,X3))&(~(convergent_lines(X1,X3))|~(equal_points(intersection_point(X1,X2),intersection_point(X1,X3))))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X4]:?[X5]:?[X6]:((convergent_lines(X4,X5)&equal_lines(X5,X6))&(~(convergent_lines(X4,X6))|~(equal_points(intersection_point(X4,X5),intersection_point(X4,X6))))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((convergent_lines(esk1_0,esk2_0)&equal_lines(esk2_0,esk3_0))&(~(convergent_lines(esk1_0,esk3_0))|~(equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))|~convergent_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(equal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(175,negated_conjecture,(~distinct_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[71,171,theory(equality)])).
% cnf(181,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))|~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[170,74,theory(equality)])).
% cnf(182,negated_conjecture,(distinct_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[91,172,theory(equality)])).
% cnf(247,negated_conjecture,(convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[175,182,theory(equality)])).
% cnf(251,negated_conjecture,(convergent_lines(esk3_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[61,247,theory(equality)])).
% cnf(254,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))|$false),inference(rw,[status(thm)],[181,247,theory(equality)])).
% cnf(255,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(259,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(esk3_0,X2)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[61,251,theory(equality)])).
% cnf(269,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),X1)|apart_point_and_line(intersection_point(esk1_0,esk3_0),X2)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X2)|~distinct_lines(X2,X1)),inference(spm,[status(thm)],[149,255,theory(equality)])).
% cnf(303,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(X1,esk3_0)),inference(spm,[status(thm)],[58,259,theory(equality)])).
% cnf(312,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(esk1_0,X2)|convergent_lines(X1,esk3_0)),inference(spm,[status(thm)],[61,303,theory(equality)])).
% cnf(553,negated_conjecture,(convergent_lines(X1,esk3_0)|convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[58,312,theory(equality)])).
% cnf(629,negated_conjecture,(distinct_lines(esk3_0,X1)|convergent_lines(X2,X1)|convergent_lines(X2,esk1_0)),inference(spm,[status(thm)],[91,553,theory(equality)])).
% cnf(784,negated_conjecture,(distinct_lines(esk3_0,esk1_0)|convergent_lines(X3,esk1_0)),inference(ef,[status(thm)],[629,theory(equality)])).
% cnf(874,negated_conjecture,(distinct_lines(esk3_0,esk1_0)),inference(spm,[status(thm)],[118,784,theory(equality)])).
% cnf(2824,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)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)),inference(spm,[status(thm)],[269,874,theory(equality)])).
% cnf(31184,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[67,2824,theory(equality)])).
% cnf(31185,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|$false),inference(rw,[status(thm)],[31184,247,theory(equality)])).
% cnf(31186,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(cn,[status(thm)],[31185,theory(equality)])).
% cnf(31189,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)],[64,31186,theory(equality)])).
% cnf(31190,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)],[31189,247,theory(equality)])).
% cnf(31191,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)],[31190,theory(equality)])).
% cnf(31193,negated_conjecture,(distinct_lines(esk3_0,X1)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(spm,[status(thm)],[137,31191,theory(equality)])).
% cnf(31255,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,31193,theory(equality)])).
% cnf(31261,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|$false),inference(rw,[status(thm)],[31255,172,theory(equality)])).
% cnf(31262,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(cn,[status(thm)],[31261,theory(equality)])).
% cnf(31267,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[64,31262,theory(equality)])).
% cnf(31268,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[31267,172,theory(equality)])).
% cnf(31269,negated_conjecture,(distinct_lines(esk3_0,esk2_0)),inference(cn,[status(thm)],[31268,theory(equality)])).
% cnf(31705,negated_conjecture,(distinct_lines(esk2_0,X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[85,31269,theory(equality)])).
% cnf(31798,negated_conjecture,(distinct_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[79,31705,theory(equality)])).
% cnf(31808,negated_conjecture,($false),inference(sr,[status(thm)],[31798,175,theory(equality)])).
% cnf(31809,negated_conjecture,($false),31808,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2147
% # ...of these trivial : 41
% # ...subsumed : 1075
% # ...remaining for further processing: 1031
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 21
% # Backward-rewritten : 8
% # Generated clauses : 27366
% # ...of the previous two non-trivial : 23927
% # Contextual simplify-reflections : 216
% # Paramodulations : 26648
% # Factorizations : 718
% # Equation resolutions : 0
% # Current number of processed clauses: 1002
% # Positive orientable unit clauses: 108
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 885
% # Current number of unprocessed clauses: 21349
% # ...number of literals in the above : 112701
% # Clause-clause subsumption calls (NU) : 42230
% # Rec. Clause-clause subsumption calls : 22415
% # Unit Clause-clause subsumption calls : 1222
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 454
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 235 leaves, 3.07+/-3.474 terms/leaf
% # Paramod-from index: 179 leaves, 2.79+/-3.150 terms/leaf
% # Paramod-into index: 223 leaves, 2.94+/-3.324 terms/leaf
% # -------------------------------------------------
% # User time : 1.742 s
% # System time : 0.036 s
% # Total time : 1.778 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.22 CPU 2.33 WC
% FINAL PrfWatch: 2.22 CPU 2.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP13080/GEO205+3.tptp
%
%------------------------------------------------------------------------------