TSTP Solution File: GEO172+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO172+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 : art07.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:43 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP31574/GEO172+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31574/GEO172+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31574/GEO172+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 31670
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(2, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(4, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', apart6)).
% 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(7, 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(9, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', ceq3)).
% fof(10, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(11, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(13, conjecture,![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', con)).
% fof(14, negated_conjecture,~(![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(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(16, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(17, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(18, negated_conjecture,~(![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_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(21, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(22,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(26, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(27, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[27])).
% 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(37, 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)],[7])).
% fof(38, 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)],[37])).
% cnf(39,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)],[38])).
% fof(45, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(46, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(49,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[11])).
% fof(51, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(56, negated_conjecture,?[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)],[18])).
% fof(57, negated_conjecture,?[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)],[56])).
% fof(58, negated_conjecture,(((convergent_lines(esk1_0,esk2_0)&~(apart_point_and_line(esk3_0,esk1_0)))&~(apart_point_and_line(esk3_0,esk2_0)))&distinct_points(esk3_0,intersection_point(esk1_0,esk2_0))),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(distinct_points(esk3_0,intersection_point(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(~apart_point_and_line(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(~apart_point_and_line(esk3_0,esk1_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(65,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[20,32,theory(equality)])).
% cnf(67,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[20,33,theory(equality)])).
% cnf(69,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[28,62,theory(equality)])).
% cnf(70,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(spm,[status(thm)],[52,47,theory(equality)])).
% cnf(72,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[22,69,theory(equality)])).
% cnf(78,negated_conjecture,(distinct_lines(esk1_0,X1)|distinct_lines(esk2_0,X1)),inference(spm,[status(thm)],[70,72,theory(equality)])).
% cnf(81,negated_conjecture,(distinct_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[49,78,theory(equality)])).
% cnf(85,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X2,esk2_0)|apart_point_and_line(X2,esk1_0)|~distinct_points(X1,X2)),inference(spm,[status(thm)],[39,81,theory(equality)])).
% cnf(316,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(esk3_0,esk1_0)|apart_point_and_line(esk3_0,esk2_0)),inference(spm,[status(thm)],[85,59,theory(equality)])).
% cnf(324,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(esk3_0,esk2_0)),inference(sr,[status(thm)],[316,61,theory(equality)])).
% cnf(325,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(sr,[status(thm)],[324,60,theory(equality)])).
% cnf(332,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,325,theory(equality)])).
% cnf(333,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|$false),inference(rw,[status(thm)],[332,62,theory(equality)])).
% cnf(334,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(cn,[status(thm)],[333,theory(equality)])).
% cnf(339,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[65,334,theory(equality)])).
% cnf(341,negated_conjecture,($false),inference(rw,[status(thm)],[339,62,theory(equality)])).
% cnf(342,negated_conjecture,($false),inference(cn,[status(thm)],[341,theory(equality)])).
% cnf(343,negated_conjecture,($false),342,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 92
% # ...of these trivial : 0
% # ...subsumed : 20
% # ...remaining for further processing: 72
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 221
% # ...of the previous two non-trivial : 176
% # Contextual simplify-reflections : 2
% # Paramodulations : 185
% # Factorizations : 36
% # Equation resolutions : 0
% # Current number of processed clauses: 53
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 43
% # Current number of unprocessed clauses: 116
% # ...number of literals in the above : 590
% # Clause-clause subsumption calls (NU) : 315
% # Rec. Clause-clause subsumption calls : 221
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 35 leaves, 2.11+/-2.081 terms/leaf
% # Paramod-from index: 20 leaves, 1.30+/-0.557 terms/leaf
% # Paramod-into index: 31 leaves, 1.71+/-1.275 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.003 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31574/GEO172+2.tptp
%
%------------------------------------------------------------------------------