TSTP Solution File: GEO170+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO170+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 : 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:03:34 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP6584/GEO170+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6584/GEO170+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6584/GEO170+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 6716
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(4, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% 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_lines(X1,X2)<=>~(distinct_lines(X1,X2))),file('/tmp/SRASS.s.p', ax2)).
% fof(14, axiom,![X1]:![X2]:![X6]:![X7]:((distinct_points(X1,X2)&distinct_lines(X6,X7))=>(((apart_point_and_line(X1,X6)|apart_point_and_line(X1,X7))|apart_point_and_line(X2,X6))|apart_point_and_line(X2,X7))),file('/tmp/SRASS.s.p', cu1)).
% fof(36, conjecture,![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&incident_point_and_line(X1,X3))&incident_point_and_line(X2,X3))=>equal_lines(X3,line_connecting(X1,X2))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&incident_point_and_line(X1,X3))&incident_point_and_line(X2,X3))=>equal_lines(X3,line_connecting(X1,X2)))),inference(assume_negation,[status(cth)],[36])).
% fof(39, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(40, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,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_lines(X1,X2)<=>~(distinct_lines(X1,X2))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(62, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[39])).
% fof(63, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[63])).
% fof(65, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(66, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),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_lines(X1,X2))|~(distinct_lines(X1,X2)))&(distinct_lines(X1,X2)|equal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[42])).
% fof(73, plain,![X3]:![X4]:((~(equal_lines(X3,X4))|~(distinct_lines(X3,X4)))&(distinct_lines(X3,X4)|equal_lines(X3,X4))),inference(variable_rename,[status(thm)],[72])).
% cnf(74,plain,(equal_lines(X1,X2)|distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(96, plain,![X1]:![X2]:![X6]:![X7]:((~(distinct_points(X1,X2))|~(distinct_lines(X6,X7)))|(((apart_point_and_line(X1,X6)|apart_point_and_line(X1,X7))|apart_point_and_line(X2,X6))|apart_point_and_line(X2,X7))),inference(fof_nnf,[status(thm)],[14])).
% fof(97, plain,![X8]:![X9]:![X10]:![X11]:((~(distinct_points(X8,X9))|~(distinct_lines(X10,X11)))|(((apart_point_and_line(X8,X10)|apart_point_and_line(X8,X11))|apart_point_and_line(X9,X10))|apart_point_and_line(X9,X11))),inference(variable_rename,[status(thm)],[96])).
% cnf(98,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)],[97])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X3]:(((distinct_points(X1,X2)&incident_point_and_line(X1,X3))&incident_point_and_line(X2,X3))&~(equal_lines(X3,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X4]:?[X5]:?[X6]:(((distinct_points(X4,X5)&incident_point_and_line(X4,X6))&incident_point_and_line(X5,X6))&~(equal_lines(X6,line_connecting(X4,X5)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&incident_point_and_line(esk1_0,esk3_0))&incident_point_and_line(esk2_0,esk3_0))&~(equal_lines(esk3_0,line_connecting(esk1_0,esk2_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(incident_point_and_line(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(incident_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(173,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(175,negated_conjecture,(distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[170,74,theory(equality)])).
% cnf(177,negated_conjecture,(~apart_point_and_line(esk2_0,esk3_0)),inference(spm,[status(thm)],[71,171,theory(equality)])).
% cnf(178,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(spm,[status(thm)],[71,172,theory(equality)])).
% cnf(195,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,esk3_0)|~distinct_points(X2,X1)),inference(spm,[status(thm)],[98,175,theory(equality)])).
% cnf(241,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,esk3_0)|apart_point_and_line(esk2_0,esk3_0)),inference(spm,[status(thm)],[195,173,theory(equality)])).
% cnf(243,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,esk3_0)),inference(sr,[status(thm)],[241,178,theory(equality)])).
% cnf(244,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(sr,[status(thm)],[243,177,theory(equality)])).
% cnf(263,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[64,244,theory(equality)])).
% cnf(264,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[263,173,theory(equality)])).
% cnf(265,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[264,theory(equality)])).
% cnf(268,negated_conjecture,(~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,265,theory(equality)])).
% cnf(270,negated_conjecture,($false),inference(rw,[status(thm)],[268,173,theory(equality)])).
% cnf(271,negated_conjecture,($false),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(272,negated_conjecture,($false),271,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 71
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 65
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 80
% # ...of the previous two non-trivial : 64
% # Contextual simplify-reflections : 4
% # Paramodulations : 80
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 64
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 43
% # Current number of unprocessed clauses: 41
% # ...number of literals in the above : 135
% # Clause-clause subsumption calls (NU) : 61
% # Rec. Clause-clause subsumption calls : 57
% # 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: 56 leaves, 1.61+/-1.385 terms/leaf
% # Paramod-from index: 25 leaves, 1.04+/-0.196 terms/leaf
% # Paramod-into index: 47 leaves, 1.40+/-0.891 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.22 WC
% FINAL PrfWatch: 0.11 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP6584/GEO170+3.tptp
%
%------------------------------------------------------------------------------