TSTP Solution File: GEO203+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO203+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 : art01.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:09:09 EST 2010
% Result : Theorem 1.46s
% Output : Solution 1.46s
% 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/SystemOnTPTP4508/GEO203+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4508/GEO203+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4508/GEO203+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 4604
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(6, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(7, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(9, axiom,![X1]:![X2]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),file('/tmp/SRASS.s.p', ax2)).
% fof(25, axiom,![X1]:![X2]:![X9]:![X10]:((distinct_points(X1,X2)&distinct_lines(X9,X10))=>(((apart_point_and_line(X1,X9)|apart_point_and_line(X1,X10))|apart_point_and_line(X2,X9))|apart_point_and_line(X2,X10))),file('/tmp/SRASS.s.p', cu1)).
% fof(36, conjecture,![X1]:![X2]:![X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))=>equal_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1)),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))=>equal_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1))),inference(assume_negation,[status(cth)],[36])).
% fof(40, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(42, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(44, plain,![X1]:![X2]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(67, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(68, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(70, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[41])).
% fof(71, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(73, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[42])).
% fof(74, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(79, plain,![X1]:![X2]:((~(equal_lines(X1,X2))|~(distinct_lines(X1,X2)))&(distinct_lines(X1,X2)|equal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[44])).
% fof(80, plain,![X3]:![X4]:((~(equal_lines(X3,X4))|~(distinct_lines(X3,X4)))&(distinct_lines(X3,X4)|equal_lines(X3,X4))),inference(variable_rename,[status(thm)],[79])).
% cnf(81,plain,(equal_lines(X1,X2)|distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[80])).
% fof(135, plain,![X1]:![X2]:![X9]:![X10]:((~(distinct_points(X1,X2))|~(distinct_lines(X9,X10)))|(((apart_point_and_line(X1,X9)|apart_point_and_line(X1,X10))|apart_point_and_line(X2,X9))|apart_point_and_line(X2,X10))),inference(fof_nnf,[status(thm)],[25])).
% fof(136, plain,![X11]:![X12]:![X13]:![X14]:((~(distinct_points(X11,X12))|~(distinct_lines(X13,X14)))|(((apart_point_and_line(X11,X13)|apart_point_and_line(X11,X14))|apart_point_and_line(X12,X13))|apart_point_and_line(X12,X14))),inference(variable_rename,[status(thm)],[135])).
% cnf(137,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)],[136])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))&~(equal_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X4]:?[X5]:?[X6]:(((convergent_lines(X4,X5)&convergent_lines(X4,X6))&distinct_points(intersection_point(X4,X5),intersection_point(X4,X6)))&~(equal_lines(line_connecting(intersection_point(X4,X5),intersection_point(X4,X6)),X4))),inference(variable_rename,[status(thm)],[167])).
% fof(169, 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)))&~(equal_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(convergent_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(173,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(181,negated_conjecture,(distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0)),inference(spm,[status(thm)],[170,81,theory(equality)])).
% cnf(199,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(X2,esk1_0)|apart_point_and_line(X2,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|~distinct_points(X2,X1)),inference(spm,[status(thm)],[137,181,theory(equality)])).
% cnf(325,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,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),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)),inference(spm,[status(thm)],[199,171,theory(equality)])).
% cnf(7181,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,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)],[72,325,theory(equality)])).
% cnf(7182,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,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|$false),inference(rw,[status(thm)],[7181,171,theory(equality)])).
% cnf(7183,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,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(cn,[status(thm)],[7182,theory(equality)])).
% cnf(7254,negated_conjecture,(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)],[69,7183,theory(equality)])).
% cnf(7255,negated_conjecture,(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)],[7254,171,theory(equality)])).
% cnf(7256,negated_conjecture,(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)],[7255,theory(equality)])).
% cnf(7285,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[75,7256,theory(equality)])).
% cnf(7286,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|$false),inference(rw,[status(thm)],[7285,172,theory(equality)])).
% cnf(7287,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(cn,[status(thm)],[7286,theory(equality)])).
% cnf(7290,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[75,7287,theory(equality)])).
% cnf(7292,negated_conjecture,($false),inference(rw,[status(thm)],[7290,173,theory(equality)])).
% cnf(7293,negated_conjecture,($false),inference(cn,[status(thm)],[7292,theory(equality)])).
% cnf(7294,negated_conjecture,($false),7293,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 741
% # ...of these trivial : 5
% # ...subsumed : 268
% # ...remaining for further processing: 468
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 13
% # Backward-rewritten : 12
% # Generated clauses : 5947
% # ...of the previous two non-trivial : 4994
% # Contextual simplify-reflections : 6
% # Paramodulations : 5735
% # Factorizations : 212
% # Equation resolutions : 0
% # Current number of processed clauses: 443
% # Positive orientable unit clauses: 63
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 372
% # Current number of unprocessed clauses: 4051
% # ...number of literals in the above : 18045
% # Clause-clause subsumption calls (NU) : 7003
% # Rec. Clause-clause subsumption calls : 4642
% # Unit Clause-clause subsumption calls : 368
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 116
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 205 leaves, 2.04+/-2.150 terms/leaf
% # Paramod-from index: 147 leaves, 1.75+/-1.702 terms/leaf
% # Paramod-into index: 187 leaves, 1.92+/-1.876 terms/leaf
% # -------------------------------------------------
% # User time : 0.297 s
% # System time : 0.005 s
% # Total time : 0.302 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.49 CPU 0.58 WC
% FINAL PrfWatch: 0.49 CPU 0.58 WC
% SZS output end Solution for /tmp/SystemOnTPTP4508/GEO203+3.tptp
%
%------------------------------------------------------------------------------