TSTP Solution File: GEO172+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO172+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 04:59:49 EST 2010
% Result : Theorem 2.10s
% Output : Solution 2.10s
% 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/SystemOnTPTP8364/GEO172+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8364/GEO172+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8364/GEO172+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 8460
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 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]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),file('/tmp/SRASS.s.p', a4)).
% fof(6, axiom,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),file('/tmp/SRASS.s.p', ax1)).
% fof(10, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(11, axiom,![X1]:![X2]:(distinct_lines(X1,X2)=>convergent_lines(X1,X2)),file('/tmp/SRASS.s.p', p1)).
% fof(17, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(19, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(20, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(30, 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)&incident_point_and_line(X3,X1))&incident_point_and_line(X3,X2))=>equal_points(X3,intersection_point(X1,X2))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X3]:(((convergent_lines(X1,X2)&incident_point_and_line(X3,X1))&incident_point_and_line(X3,X2))=>equal_points(X3,intersection_point(X1,X2)))),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]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(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(47, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(49, plain,![X1]:~(distinct_lines(X1,X1)),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]:((~(incident_point_and_line(X1,X2))|~(apart_point_and_line(X1,X2)))&(apart_point_and_line(X1,X2)|incident_point_and_line(X1,X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(69, plain,![X3]:![X4]:((~(incident_point_and_line(X3,X4))|~(apart_point_and_line(X3,X4)))&(apart_point_and_line(X3,X4)|incident_point_and_line(X3,X4))),inference(variable_rename,[status(thm)],[68])).
% cnf(71,plain,(~apart_point_and_line(X1,X2)|~incident_point_and_line(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(84, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[10])).
% fof(85, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[84])).
% cnf(86,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[85])).
% fof(87, plain,![X1]:![X2]:(~(distinct_lines(X1,X2))|convergent_lines(X1,X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(88, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(variable_rename,[status(thm)],[87])).
% cnf(89,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[88])).
% fof(112, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[47])).
% cnf(113,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[112])).
% fof(118, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[49])).
% cnf(119,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[118])).
% fof(120, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[20])).
% fof(121, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[121])).
% fof(151, 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)],[30])).
% fof(152, 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)],[151])).
% cnf(153,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)],[152])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X3]:(((convergent_lines(X1,X2)&incident_point_and_line(X3,X1))&incident_point_and_line(X3,X2))&~(equal_points(X3,intersection_point(X1,X2)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X4]:?[X5]:?[X6]:(((convergent_lines(X4,X5)&incident_point_and_line(X6,X4))&incident_point_and_line(X6,X5))&~(equal_points(X6,intersection_point(X4,X5)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((convergent_lines(esk1_0,esk2_0)&incident_point_and_line(esk3_0,esk1_0))&incident_point_and_line(esk3_0,esk2_0))&~(equal_points(esk3_0,intersection_point(esk1_0,esk2_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_points(esk3_0,intersection_point(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(incident_point_and_line(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(incident_point_and_line(esk3_0,esk1_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(173,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(175,negated_conjecture,(distinct_points(esk3_0,intersection_point(esk1_0,esk2_0))),inference(spm,[status(thm)],[170,74,theory(equality)])).
% cnf(177,negated_conjecture,(~apart_point_and_line(esk3_0,esk2_0)),inference(spm,[status(thm)],[71,171,theory(equality)])).
% cnf(178,negated_conjecture,(~apart_point_and_line(esk3_0,esk1_0)),inference(spm,[status(thm)],[71,172,theory(equality)])).
% cnf(183,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[61,173,theory(equality)])).
% cnf(236,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[58,183,theory(equality)])).
% cnf(247,negated_conjecture,(distinct_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[86,236,theory(equality)])).
% cnf(252,negated_conjecture,(distinct_lines(X1,X2)|distinct_lines(esk1_0,X2)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[122,247,theory(equality)])).
% cnf(309,negated_conjecture,(distinct_lines(X1,esk1_0)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[119,252,theory(equality)])).
% cnf(317,negated_conjecture,(convergent_lines(X1,esk1_0)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[89,309,theory(equality)])).
% cnf(371,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(esk2_0,X2)|convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[61,317,theory(equality)])).
% cnf(471,negated_conjecture,(convergent_lines(X1,esk1_0)|convergent_lines(X1,esk2_0)),inference(spm,[status(thm)],[58,371,theory(equality)])).
% cnf(517,negated_conjecture,(convergent_lines(parallel_through_point(esk1_0,X1),esk2_0)),inference(spm,[status(thm)],[113,471,theory(equality)])).
% cnf(529,negated_conjecture,(distinct_lines(esk2_0,X1)|convergent_lines(parallel_through_point(esk1_0,X2),X1)),inference(spm,[status(thm)],[86,517,theory(equality)])).
% cnf(540,negated_conjecture,(distinct_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[113,529,theory(equality)])).
% cnf(542,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)],[153,540,theory(equality)])).
% cnf(16161,negated_conjecture,(apart_point_and_line(esk3_0,esk2_0)|apart_point_and_line(esk3_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)],[542,175,theory(equality)])).
% cnf(16181,negated_conjecture,(apart_point_and_line(esk3_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(sr,[status(thm)],[16161,177,theory(equality)])).
% cnf(16182,negated_conjecture,(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(sr,[status(thm)],[16181,178,theory(equality)])).
% cnf(16197,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[64,16182,theory(equality)])).
% cnf(16198,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|$false),inference(rw,[status(thm)],[16197,173,theory(equality)])).
% cnf(16199,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(cn,[status(thm)],[16198,theory(equality)])).
% cnf(16202,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,16199,theory(equality)])).
% cnf(16204,negated_conjecture,($false),inference(rw,[status(thm)],[16202,173,theory(equality)])).
% cnf(16205,negated_conjecture,($false),inference(cn,[status(thm)],[16204,theory(equality)])).
% cnf(16206,negated_conjecture,($false),16205,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1379
% # ...of these trivial : 18
% # ...subsumed : 664
% # ...remaining for further processing: 697
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 13
% # Backward-rewritten : 15
% # Generated clauses : 14252
% # ...of the previous two non-trivial : 12910
% # Contextual simplify-reflections : 114
% # Paramodulations : 13752
% # Factorizations : 500
% # Equation resolutions : 0
% # Current number of processed clauses: 669
% # Positive orientable unit clauses: 76
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 583
% # Current number of unprocessed clauses: 11293
% # ...number of literals in the above : 57775
% # Clause-clause subsumption calls (NU) : 27659
% # Rec. Clause-clause subsumption calls : 14741
% # Unit Clause-clause subsumption calls : 988
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 275
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 170 leaves, 3.42+/-3.869 terms/leaf
% # Paramod-from index: 125 leaves, 3.11+/-3.416 terms/leaf
% # Paramod-into index: 161 leaves, 3.25+/-3.519 terms/leaf
% # -------------------------------------------------
% # User time : 0.959 s
% # System time : 0.026 s
% # Total time : 0.985 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.25 CPU 1.34 WC
% FINAL PrfWatch: 1.25 CPU 1.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP8364/GEO172+3.tptp
%
%------------------------------------------------------------------------------