TSTP Solution File: GEO200+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO200+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 : 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:12:38 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP10477/GEO200+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10477/GEO200+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10477/GEO200+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 10609
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 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(3, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(5, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(apart_point_and_line(X3,line_connecting(X1,X2))=>(distinct_points(X3,X1)&distinct_points(X3,X2)))),file('/tmp/SRASS.s.p', con1)).
% fof(6, 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]:(distinct_points(X1,X2)=>~(distinct_lines(line_connecting(X1,X2),line_connecting(X2,X1)))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:(distinct_points(X1,X2)=>~(distinct_lines(line_connecting(X1,X2),line_connecting(X2,X1))))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, negated_conjecture,~(![X1]:![X2]:(distinct_points(X1,X2)=>~(distinct_lines(line_connecting(X1,X2),line_connecting(X2,X1))))),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(23, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(29, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(~(apart_point_and_line(X3,line_connecting(X1,X2)))|(distinct_points(X3,X1)&distinct_points(X3,X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(30, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(~(apart_point_and_line(X6,line_connecting(X4,X5)))|(distinct_points(X6,X4)&distinct_points(X6,X5)))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:(((distinct_points(X6,X4)|~(apart_point_and_line(X6,line_connecting(X4,X5))))|~(distinct_points(X4,X5)))&((distinct_points(X6,X5)|~(apart_point_and_line(X6,line_connecting(X4,X5))))|~(distinct_points(X4,X5)))),inference(distribute,[status(thm)],[30])).
% cnf(32,plain,(distinct_points(X3,X2)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(distinct_points(X3,X1)|~distinct_points(X1,X2)|~apart_point_and_line(X3,line_connecting(X1,X2))),inference(split_conjunct,[status(thm)],[31])).
% fof(34, 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)],[6])).
% fof(35, 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)],[34])).
% cnf(36,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)],[35])).
% fof(56, negated_conjecture,?[X1]:?[X2]:(distinct_points(X1,X2)&distinct_lines(line_connecting(X1,X2),line_connecting(X2,X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(57, negated_conjecture,?[X3]:?[X4]:(distinct_points(X3,X4)&distinct_lines(line_connecting(X3,X4),line_connecting(X4,X3))),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,(distinct_points(esk1_0,esk2_0)&distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0))),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(distinct_points(esk1_0,X1)|distinct_points(esk2_0,X1)),inference(spm,[status(thm)],[25,60,theory(equality)])).
% cnf(67,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X1,line_connecting(esk2_0,esk1_0))|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,line_connecting(esk2_0,esk1_0))|~distinct_points(X1,X2)),inference(spm,[status(thm)],[36,59,theory(equality)])).
% cnf(68,negated_conjecture,(distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[20,61,theory(equality)])).
% cnf(166,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_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(spm,[status(thm)],[67,68,theory(equality)])).
% cnf(800,negated_conjecture,(distinct_points(esk1_0,esk1_0)|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(esk2_0,esk1_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[33,166,theory(equality)])).
% cnf(804,negated_conjecture,(distinct_points(esk1_0,esk1_0)|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(esk2_0,esk1_0))|$false),inference(rw,[status(thm)],[800,60,theory(equality)])).
% cnf(805,negated_conjecture,(distinct_points(esk1_0,esk1_0)|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(esk2_0,esk1_0))),inference(cn,[status(thm)],[804,theory(equality)])).
% cnf(806,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(esk2_0,esk1_0))),inference(sr,[status(thm)],[805,20,theory(equality)])).
% cnf(1135,negated_conjecture,(distinct_points(esk1_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(esk2_0,esk1_0)),inference(spm,[status(thm)],[32,806,theory(equality)])).
% cnf(1137,negated_conjecture,(distinct_points(esk1_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)],[1135,68,theory(equality)])).
% cnf(1138,negated_conjecture,(distinct_points(esk1_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)],[1137,theory(equality)])).
% cnf(1139,negated_conjecture,(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(sr,[status(thm)],[1138,20,theory(equality)])).
% cnf(1147,negated_conjecture,(distinct_points(esk2_0,esk2_0)|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[32,1139,theory(equality)])).
% cnf(1149,negated_conjecture,(distinct_points(esk2_0,esk2_0)|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))|$false),inference(rw,[status(thm)],[1147,60,theory(equality)])).
% cnf(1150,negated_conjecture,(distinct_points(esk2_0,esk2_0)|apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))),inference(cn,[status(thm)],[1149,theory(equality)])).
% cnf(1151,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))),inference(sr,[status(thm)],[1150,20,theory(equality)])).
% cnf(1160,negated_conjecture,(distinct_points(esk2_0,esk2_0)|~distinct_points(esk2_0,esk1_0)),inference(spm,[status(thm)],[33,1151,theory(equality)])).
% cnf(1165,negated_conjecture,(distinct_points(esk2_0,esk2_0)|$false),inference(rw,[status(thm)],[1160,68,theory(equality)])).
% cnf(1166,negated_conjecture,(distinct_points(esk2_0,esk2_0)),inference(cn,[status(thm)],[1165,theory(equality)])).
% cnf(1167,negated_conjecture,($false),inference(sr,[status(thm)],[1166,20,theory(equality)])).
% cnf(1168,negated_conjecture,($false),1167,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 273
% # ...of these trivial : 0
% # ...subsumed : 188
% # ...remaining for further processing: 85
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 1
% # Generated clauses : 818
% # ...of the previous two non-trivial : 703
% # Contextual simplify-reflections : 60
% # Paramodulations : 572
% # Factorizations : 246
% # Equation resolutions : 0
% # Current number of processed clauses: 61
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 53
% # Current number of unprocessed clauses: 337
% # ...number of literals in the above : 2119
% # Clause-clause subsumption calls (NU) : 3381
% # Rec. Clause-clause subsumption calls : 1797
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 32 leaves, 2.19+/-2.228 terms/leaf
% # Paramod-from index: 18 leaves, 1.89+/-2.258 terms/leaf
% # Paramod-into index: 28 leaves, 2.04+/-2.096 terms/leaf
% # -------------------------------------------------
% # User time : 0.058 s
% # System time : 0.004 s
% # Total time : 0.062 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP10477/GEO200+2.tptp
%
%------------------------------------------------------------------------------