TSTP Solution File: GEO197+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO197+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 : art03.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:07:03 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP23115/GEO197+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23115/GEO197+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23115/GEO197+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 23211
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 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', apart6)).
% fof(3, 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(4, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', ceq3)).
% fof(5, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(6, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% 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(8, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(10, 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(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]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X3,X2),X1))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X3,X2),X1)))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(16, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(17, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X3,X2),X1)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(19, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(20,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(22, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, 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)],[3])).
% fof(25, 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)],[24])).
% fof(26, 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)],[25])).
% cnf(27,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(29, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(30, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(33,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(35,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(37, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(40, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(45, 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)],[10])).
% fof(46, 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)],[45])).
% cnf(47,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, 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(49, 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)],[48])).
% cnf(50,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)],[49])).
% fof(56, negated_conjecture,?[X1]:?[X2]:?[X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))&apart_point_and_line(intersection_point(X3,X2),X1)),inference(fof_nnf,[status(thm)],[18])).
% fof(57, negated_conjecture,?[X4]:?[X5]:?[X6]:((((convergent_lines(X4,X5)&convergent_lines(X6,X5))&convergent_lines(X4,X6))&~(apart_point_and_line(intersection_point(X4,X5),X6)))&apart_point_and_line(intersection_point(X6,X5),X4)),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,((((convergent_lines(esk1_0,esk2_0)&convergent_lines(esk3_0,esk2_0))&convergent_lines(esk1_0,esk3_0))&~(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)))&apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0)),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(~apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,negated_conjecture,(convergent_lines(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(63,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(64,negated_conjecture,(convergent_lines(esk3_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[23,62,theory(equality)])).
% cnf(68,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[33,27,theory(equality)])).
% cnf(69,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[33,28,theory(equality)])).
% cnf(71,negated_conjecture,(distinct_lines(esk1_0,X1)|apart_point_and_line(intersection_point(esk3_0,esk2_0),X1)),inference(spm,[status(thm)],[47,59,theory(equality)])).
% cnf(73,plain,(distinct_points(X1,X2)|distinct_points(intersection_point(X3,X4),X2)|~apart_point_and_line(X1,X3)|~convergent_lines(X3,X4)),inference(spm,[status(thm)],[38,28,theory(equality)])).
% cnf(74,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(spm,[status(thm)],[41,31,theory(equality)])).
% cnf(76,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[20,64,theory(equality)])).
% cnf(140,negated_conjecture,(distinct_points(intersection_point(X1,X2),X3)|distinct_points(intersection_point(esk3_0,esk2_0),X3)|distinct_lines(esk1_0,X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[73,71,theory(equality)])).
% cnf(180,negated_conjecture,(distinct_lines(esk3_0,X1)|distinct_lines(esk2_0,X1)),inference(spm,[status(thm)],[74,76,theory(equality)])).
% cnf(202,negated_conjecture,(distinct_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[35,180,theory(equality)])).
% cnf(206,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X2,esk2_0)|apart_point_and_line(X2,esk3_0)|~distinct_points(X1,X2)),inference(spm,[status(thm)],[50,202,theory(equality)])).
% cnf(1214,negated_conjecture,(distinct_lines(esk1_0,esk1_0)|distinct_points(intersection_point(esk3_0,esk2_0),X1)|distinct_points(intersection_point(esk1_0,esk2_0),X1)),inference(spm,[status(thm)],[140,63,theory(equality)])).
% cnf(1305,negated_conjecture,(distinct_points(intersection_point(esk3_0,esk2_0),X1)|distinct_points(intersection_point(esk1_0,esk2_0),X1)),inference(sr,[status(thm)],[1214,35,theory(equality)])).
% cnf(1376,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk3_0,esk2_0))),inference(spm,[status(thm)],[33,1305,theory(equality)])).
% cnf(2129,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(spm,[status(thm)],[206,1376,theory(equality)])).
% cnf(2143,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(sr,[status(thm)],[2129,60,theory(equality)])).
% cnf(2153,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|~convergent_lines(esk3_0,esk2_0)),inference(spm,[status(thm)],[69,2143,theory(equality)])).
% cnf(2154,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|$false),inference(rw,[status(thm)],[2153,62,theory(equality)])).
% cnf(2155,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)),inference(cn,[status(thm)],[2154,theory(equality)])).
% cnf(2160,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|~convergent_lines(esk3_0,esk2_0)),inference(spm,[status(thm)],[68,2155,theory(equality)])).
% cnf(2161,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|$false),inference(rw,[status(thm)],[2160,62,theory(equality)])).
% cnf(2162,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(cn,[status(thm)],[2161,theory(equality)])).
% cnf(2167,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[68,2162,theory(equality)])).
% cnf(2169,negated_conjecture,($false),inference(rw,[status(thm)],[2167,63,theory(equality)])).
% cnf(2170,negated_conjecture,($false),inference(cn,[status(thm)],[2169,theory(equality)])).
% cnf(2171,negated_conjecture,($false),2170,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 430
% # ...of these trivial : 0
% # ...subsumed : 235
% # ...remaining for further processing: 195
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 1631
% # ...of the previous two non-trivial : 1291
% # Contextual simplify-reflections : 48
% # Paramodulations : 1367
% # Factorizations : 264
% # Equation resolutions : 0
% # Current number of processed clauses: 174
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 153
% # Current number of unprocessed clauses: 891
% # ...number of literals in the above : 4441
% # Clause-clause subsumption calls (NU) : 4067
% # Rec. Clause-clause subsumption calls : 2379
% # Unit Clause-clause subsumption calls : 51
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 64 leaves, 1.88+/-1.728 terms/leaf
% # Paramod-from index: 40 leaves, 1.52+/-1.000 terms/leaf
% # Paramod-into index: 54 leaves, 1.72+/-1.325 terms/leaf
% # -------------------------------------------------
% # User time : 0.099 s
% # System time : 0.005 s
% # Total time : 0.104 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP23115/GEO197+2.tptp
%
%------------------------------------------------------------------------------