TSTP Solution File: GEO200+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO200+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 : 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:08:04 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP23633/GEO200+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23633/GEO200+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23633/GEO200+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 23729
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 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]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% 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]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),file('/tmp/SRASS.s.p', ax2)).
% fof(13, 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]:(distinct_points(X1,X2)=>equal_lines(line_connecting(X1,X2),line_connecting(X2,X1))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:(distinct_points(X1,X2)=>equal_lines(line_connecting(X1,X2),line_connecting(X2,X1)))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% 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]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(57, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[38])).
% cnf(58,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(60, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[60])).
% 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]:((~(equal_lines(X1,X2))|~(distinct_lines(X1,X2)))&(distinct_lines(X1,X2)|equal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(69, plain,![X3]:![X4]:((~(equal_lines(X3,X4))|~(distinct_lines(X3,X4)))&(distinct_lines(X3,X4)|equal_lines(X3,X4))),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(equal_lines(X1,X2)|distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(92, 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)],[13])).
% fof(93, 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)],[92])).
% cnf(94,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)],[93])).
% fof(167, negated_conjecture,?[X1]:?[X2]:(distinct_points(X1,X2)&~(equal_lines(line_connecting(X1,X2),line_connecting(X2,X1)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X3]:?[X4]:(distinct_points(X3,X4)&~(equal_lines(line_connecting(X3,X4),line_connecting(X4,X3)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(distinct_points(esk1_0,esk2_0)&~(equal_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(173,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0))),inference(spm,[status(thm)],[170,70,theory(equality)])).
% cnf(179,negated_conjecture,(distinct_points(esk2_0,X1)|distinct_points(esk1_0,X1)),inference(spm,[status(thm)],[61,171,theory(equality)])).
% cnf(194,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk2_0,esk1_0))|apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,line_connecting(esk2_0,esk1_0))|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|~distinct_points(X2,X1)),inference(spm,[status(thm)],[94,173,theory(equality)])).
% cnf(205,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[58,179,theory(equality)])).
% cnf(280,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))),inference(spm,[status(thm)],[194,205,theory(equality)])).
% cnf(3554,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[64,280,theory(equality)])).
% cnf(3555,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[3554,171,theory(equality)])).
% cnf(3556,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[3555,theory(equality)])).
% cnf(3561,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|~distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[67,3556,theory(equality)])).
% cnf(3562,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|$false),inference(rw,[status(thm)],[3561,205,theory(equality)])).
% cnf(3563,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))),inference(cn,[status(thm)],[3562,theory(equality)])).
% cnf(3566,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,3563,theory(equality)])).
% cnf(3567,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|$false),inference(rw,[status(thm)],[3566,171,theory(equality)])).
% cnf(3568,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))),inference(cn,[status(thm)],[3567,theory(equality)])).
% cnf(3571,negated_conjecture,(~distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[64,3568,theory(equality)])).
% cnf(3573,negated_conjecture,($false),inference(rw,[status(thm)],[3571,205,theory(equality)])).
% cnf(3574,negated_conjecture,($false),inference(cn,[status(thm)],[3573,theory(equality)])).
% cnf(3575,negated_conjecture,($false),3574,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 439
% # ...of these trivial : 3
% # ...subsumed : 217
% # ...remaining for further processing: 219
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 2
% # Generated clauses : 2981
% # ...of the previous two non-trivial : 2664
% # Contextual simplify-reflections : 43
% # Paramodulations : 2779
% # Factorizations : 202
% # Equation resolutions : 0
% # Current number of processed clauses: 213
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 183
% # Current number of unprocessed clauses: 2235
% # ...number of literals in the above : 11159
% # Clause-clause subsumption calls (NU) : 3557
% # Rec. Clause-clause subsumption calls : 2232
% # Unit Clause-clause subsumption calls : 47
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 100 leaves, 2.32+/-2.441 terms/leaf
% # Paramod-from index: 69 leaves, 1.91+/-1.783 terms/leaf
% # Paramod-into index: 91 leaves, 2.13+/-2.129 terms/leaf
% # -------------------------------------------------
% # User time : 0.140 s
% # System time : 0.006 s
% # Total time : 0.146 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.35 WC
% FINAL PrfWatch: 0.27 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP23633/GEO200+3.tptp
%
%------------------------------------------------------------------------------