TSTP Solution File: GEO202+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO202+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 : art06.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:38 EST 2010
% Result : Theorem 6.35s
% Output : Solution 6.35s
% 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/SystemOnTPTP11685/GEO202+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11685/GEO202+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11685/GEO202+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 11781
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(3, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(5, 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(6, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(apart_point_and_line(X3,line_connecting(X1,X2))=>(distinct_points(X3,X1)&distinct_points(X3,X2)))),file('/tmp/SRASS.s.p', con1)).
% fof(7, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', ceq3)).
% fof(11, 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(13, conjecture,![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&distinct_points(X1,X3))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)))=>~(distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&distinct_points(X1,X3))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)))=>~(distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1)))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&distinct_points(X1,X3))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)))=>~(distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1)))),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(23, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(29, 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)],[5])).
% fof(30, 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)],[29])).
% fof(31, 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)],[30])).
% cnf(32,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(34, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(~(apart_point_and_line(X3,line_connecting(X1,X2)))|(distinct_points(X3,X1)&distinct_points(X3,X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(35, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(~(apart_point_and_line(X6,line_connecting(X4,X5)))|(distinct_points(X6,X4)&distinct_points(X6,X5)))),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:(((distinct_points(X6,X4)|~(apart_point_and_line(X6,line_connecting(X4,X5))))|~(distinct_points(X4,X5)))&((distinct_points(X6,X5)|~(apart_point_and_line(X6,line_connecting(X4,X5))))|~(distinct_points(X4,X5)))),inference(distribute,[status(thm)],[35])).
% cnf(38,plain,(distinct_points(X3,X1)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[36])).
% fof(39, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(40, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(50, 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)],[11])).
% fof(51, 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)],[50])).
% cnf(52,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)],[51])).
% fof(56, negated_conjecture,?[X1]:?[X2]:?[X3]:(((distinct_points(X1,X2)&distinct_points(X1,X3))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)))&distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1)),inference(fof_nnf,[status(thm)],[18])).
% fof(57, negated_conjecture,?[X4]:?[X5]:?[X6]:(((distinct_points(X4,X5)&distinct_points(X4,X6))&convergent_lines(line_connecting(X4,X5),line_connecting(X4,X6)))&distinct_points(intersection_point(line_connecting(X4,X5),line_connecting(X4,X6)),X4)),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&distinct_points(esk1_0,esk3_0))&convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)))&distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0)),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(distinct_points(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(66,negated_conjecture,(distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),X1)|distinct_points(esk1_0,X1)),inference(spm,[status(thm)],[25,59,theory(equality)])).
% cnf(68,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[20,32,theory(equality)])).
% cnf(70,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[20,33,theory(equality)])).
% cnf(73,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_points(X1,X4)|~convergent_lines(X2,X3)),inference(spm,[status(thm)],[52,41,theory(equality)])).
% cnf(92,negated_conjecture,(distinct_points(esk1_0,intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)))),inference(spm,[status(thm)],[20,66,theory(equality)])).
% cnf(189,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk3_0))|apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,line_connecting(esk1_0,esk3_0))|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|~distinct_points(X2,X1)),inference(spm,[status(thm)],[73,60,theory(equality)])).
% cnf(765,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[189,92,theory(equality)])).
% cnf(12029,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|~convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[68,765,theory(equality)])).
% cnf(12035,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[12029,60,theory(equality)])).
% cnf(12036,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[12035,theory(equality)])).
% cnf(42015,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|~convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[70,12036,theory(equality)])).
% cnf(42021,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|$false),inference(rw,[status(thm)],[42015,60,theory(equality)])).
% cnf(42022,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))),inference(cn,[status(thm)],[42021,theory(equality)])).
% cnf(42032,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk3_0)),inference(spm,[status(thm)],[38,42022,theory(equality)])).
% cnf(42036,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[42032,61,theory(equality)])).
% cnf(42037,negated_conjecture,(distinct_points(esk1_0,esk1_0)|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[42036,theory(equality)])).
% cnf(42038,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(sr,[status(thm)],[42037,20,theory(equality)])).
% cnf(42048,negated_conjecture,(distinct_points(esk1_0,esk1_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[38,42038,theory(equality)])).
% cnf(42055,negated_conjecture,(distinct_points(esk1_0,esk1_0)|$false),inference(rw,[status(thm)],[42048,62,theory(equality)])).
% cnf(42056,negated_conjecture,(distinct_points(esk1_0,esk1_0)),inference(cn,[status(thm)],[42055,theory(equality)])).
% cnf(42057,negated_conjecture,($false),inference(sr,[status(thm)],[42056,20,theory(equality)])).
% cnf(42058,negated_conjecture,($false),42057,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3693
% # ...of these trivial : 0
% # ...subsumed : 3054
% # ...remaining for further processing: 639
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 32
% # Backward-rewritten : 2
% # Generated clauses : 37178
% # ...of the previous two non-trivial : 35891
% # Contextual simplify-reflections : 1338
% # Paramodulations : 33946
% # Factorizations : 3232
% # Equation resolutions : 0
% # Current number of processed clauses: 587
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 569
% # Current number of unprocessed clauses: 30662
% # ...number of literals in the above : 273417
% # Clause-clause subsumption calls (NU) : 150844
% # Rec. Clause-clause subsumption calls : 44122
% # Unit Clause-clause subsumption calls : 237
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 77 leaves, 2.35+/-2.112 terms/leaf
% # Paramod-from index: 52 leaves, 2.40+/-1.873 terms/leaf
% # Paramod-into index: 67 leaves, 2.30+/-2.000 terms/leaf
% # -------------------------------------------------
% # User time : 4.822 s
% # System time : 0.062 s
% # Total time : 4.884 s
% # Maximum resident set size: 0 pages
% PrfWatch: 5.55 CPU 5.65 WC
% FINAL PrfWatch: 5.55 CPU 5.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP11685/GEO202+2.tptp
%
%------------------------------------------------------------------------------