TSTP Solution File: GEO203+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO203+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 05:13:43 EST 2010
% Result : Theorem 10.02s
% Output : Solution 10.02s
% 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/SystemOnTPTP10826/GEO203+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10826/GEO203+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10826/GEO203+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 10958
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.93 CPU 6.03 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.91 CPU 8.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% 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]:![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(10, 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]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))=>~(distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))=>~(distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(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]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))=>~(distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(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(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(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]:![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)],[9])).
% fof(43, 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)],[42])).
% fof(44, 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)],[43])).
% cnf(45,plain,(distinct_points(X3,X2)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(distinct_points(X3,X1)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[44])).
% fof(47, 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)],[10])).
% fof(48, 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)],[47])).
% cnf(49,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)],[48])).
% fof(56, negated_conjecture,?[X1]:?[X2]:?[X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))&distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1)),inference(fof_nnf,[status(thm)],[18])).
% fof(57, negated_conjecture,?[X4]:?[X5]:?[X6]:(((convergent_lines(X4,X5)&convergent_lines(X4,X6))&distinct_points(intersection_point(X4,X5),intersection_point(X4,X6)))&distinct_lines(line_connecting(intersection_point(X4,X5),intersection_point(X4,X6)),X4)),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,(((convergent_lines(esk1_0,esk2_0)&convergent_lines(esk1_0,esk3_0))&distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))&distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0)),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(convergent_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(71,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[20,41,theory(equality)])).
% cnf(73,negated_conjecture,(apart_point_and_line(X1,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X2,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(X2,esk1_0)|~distinct_points(X1,X2)),inference(spm,[status(thm)],[49,59,theory(equality)])).
% cnf(245,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_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),esk1_0)),inference(spm,[status(thm)],[73,60,theory(equality)])).
% cnf(2018,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk3_0),intersection_point(esk1_0,esk3_0))|apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_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),esk1_0)|~distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(spm,[status(thm)],[45,245,theory(equality)])).
% cnf(2020,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk3_0),intersection_point(esk1_0,esk3_0))|apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_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),esk1_0)|$false),inference(rw,[status(thm)],[2018,60,theory(equality)])).
% cnf(2021,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk3_0),intersection_point(esk1_0,esk3_0))|apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_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),esk1_0)),inference(cn,[status(thm)],[2020,theory(equality)])).
% cnf(2022,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_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),esk1_0)),inference(sr,[status(thm)],[2021,20,theory(equality)])).
% cnf(112962,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk2_0))|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|~distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(spm,[status(thm)],[46,2022,theory(equality)])).
% cnf(112980,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk2_0))|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|$false),inference(rw,[status(thm)],[112962,60,theory(equality)])).
% cnf(112981,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk2_0))|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(cn,[status(thm)],[112980,theory(equality)])).
% cnf(112982,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)),inference(sr,[status(thm)],[112981,20,theory(equality)])).
% cnf(113019,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[71,112982,theory(equality)])).
% cnf(113020,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|$false),inference(rw,[status(thm)],[113019,61,theory(equality)])).
% cnf(113021,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(cn,[status(thm)],[113020,theory(equality)])).
% cnf(113058,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[71,113021,theory(equality)])).
% cnf(113090,negated_conjecture,($false),inference(rw,[status(thm)],[113058,62,theory(equality)])).
% cnf(113091,negated_conjecture,($false),inference(cn,[status(thm)],[113090,theory(equality)])).
% cnf(113092,negated_conjecture,($false),113091,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6095
% # ...of these trivial : 17
% # ...subsumed : 4953
% # ...remaining for further processing: 1125
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 31
% # Backward-rewritten : 6
% # Generated clauses : 101181
% # ...of the previous two non-trivial : 92769
% # Contextual simplify-reflections : 2008
% # Paramodulations : 97545
% # Factorizations : 3636
% # Equation resolutions : 0
% # Current number of processed clauses: 1070
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 1049
% # Current number of unprocessed clauses: 76568
% # ...number of literals in the above : 678675
% # Clause-clause subsumption calls (NU) : 339389
% # Rec. Clause-clause subsumption calls : 68740
% # Unit Clause-clause subsumption calls : 396
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 86 leaves, 2.76+/-3.118 terms/leaf
% # Paramod-from index: 67 leaves, 2.13+/-1.931 terms/leaf
% # Paramod-into index: 80 leaves, 2.19+/-2.220 terms/leaf
% # -------------------------------------------------
% # User time : 7.269 s
% # System time : 0.124 s
% # Total time : 7.393 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.00 CPU 9.12 WC
% FINAL PrfWatch: 9.00 CPU 9.12 WC
% SZS output end Solution for /tmp/SystemOnTPTP10826/GEO203+2.tptp
%
%------------------------------------------------------------------------------