TSTP Solution File: GEO284+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO284+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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:29:01 EST 2010
% Result : Theorem 1.88s
% Output : Solution 1.88s
% 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/SystemOnTPTP25794/GEO284+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25794/GEO284+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25794/GEO284+1.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 25890
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.077 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X5]:![X6]:(((~(X5=X6)&?[X7]:(X6=X7&rpoint(X7)))&?[X8]:(X5=X8&rpoint(X8)))=>?[X9]:((ron(X6,X9)&rcenter(X5,X9))&rcircle(X9))),file('/tmp/SRASS.s.p', 'qu(cond(axiom(53), 0), imp(cond(axiom(53), 0)))')).
% fof(7, axiom,![X29]:![X30]:(((~(X29=X30)&?[X31]:(X30=X31&rpoint(X31)))&?[X32]:(X29=X32&rpoint(X32)))=>?[X33]:((ron(X30,X33)&ron(X29,X33))&rline(X33))),file('/tmp/SRASS.s.p', 'qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))')).
% fof(66, axiom,vd1123=vd1129,file('/tmp/SRASS.s.p', 'holds(258, 1150, 0)')).
% fof(101, axiom,((((((((((rless(vf(vd1127,vd1129),vf(vd1123,vd1125))&~(vd1127=vd1129))&~(vd1123=vd1125))&vd1129=vd1130)&rpoint(vd1130))&vd1127=vd1128)&rpoint(vd1128))&vd1125=vd1126)&rpoint(vd1126))&vd1123=vd1124)&rpoint(vd1124)),file('/tmp/SRASS.s.p', 'and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))')).
% fof(131, conjecture,?[X737]:?[X738]:(((((ron(vd1127,X738)&rcenter(vd1123,X738))&rcircle(X738))&ron(vd1125,X737))&ron(vd1123,X737))&rline(X737)),file('/tmp/SRASS.s.p', 'qe(259)')).
% fof(132, negated_conjecture,~(?[X737]:?[X738]:(((((ron(vd1127,X738)&rcenter(vd1123,X738))&rcircle(X738))&ron(vd1125,X737))&ron(vd1123,X737))&rline(X737))),inference(assume_negation,[status(cth)],[131])).
% fof(171, plain,![X5]:![X6]:(((X5=X6|![X7]:(~(X6=X7)|~(rpoint(X7))))|![X8]:(~(X5=X8)|~(rpoint(X8))))|?[X9]:((ron(X6,X9)&rcenter(X5,X9))&rcircle(X9))),inference(fof_nnf,[status(thm)],[2])).
% fof(172, plain,![X10]:![X11]:(((X10=X11|![X12]:(~(X11=X12)|~(rpoint(X12))))|![X13]:(~(X10=X13)|~(rpoint(X13))))|?[X14]:((ron(X11,X14)&rcenter(X10,X14))&rcircle(X14))),inference(variable_rename,[status(thm)],[171])).
% fof(173, plain,![X10]:![X11]:(((X10=X11|![X12]:(~(X11=X12)|~(rpoint(X12))))|![X13]:(~(X10=X13)|~(rpoint(X13))))|((ron(X11,esk1_2(X10,X11))&rcenter(X10,esk1_2(X10,X11)))&rcircle(esk1_2(X10,X11)))),inference(skolemize,[status(esa)],[172])).
% fof(174, plain,![X10]:![X11]:![X12]:![X13]:(((~(X10=X13)|~(rpoint(X13)))|((~(X11=X12)|~(rpoint(X12)))|X10=X11))|((ron(X11,esk1_2(X10,X11))&rcenter(X10,esk1_2(X10,X11)))&rcircle(esk1_2(X10,X11)))),inference(shift_quantors,[status(thm)],[173])).
% fof(175, plain,![X10]:![X11]:![X12]:![X13]:(((ron(X11,esk1_2(X10,X11))|((~(X10=X13)|~(rpoint(X13)))|((~(X11=X12)|~(rpoint(X12)))|X10=X11)))&(rcenter(X10,esk1_2(X10,X11))|((~(X10=X13)|~(rpoint(X13)))|((~(X11=X12)|~(rpoint(X12)))|X10=X11))))&(rcircle(esk1_2(X10,X11))|((~(X10=X13)|~(rpoint(X13)))|((~(X11=X12)|~(rpoint(X12)))|X10=X11)))),inference(distribute,[status(thm)],[174])).
% cnf(176,plain,(X1=X2|rcircle(esk1_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[175])).
% cnf(177,plain,(X1=X2|rcenter(X1,esk1_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[175])).
% cnf(178,plain,(X1=X2|ron(X2,esk1_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[175])).
% fof(209, plain,![X29]:![X30]:(((X29=X30|![X31]:(~(X30=X31)|~(rpoint(X31))))|![X32]:(~(X29=X32)|~(rpoint(X32))))|?[X33]:((ron(X30,X33)&ron(X29,X33))&rline(X33))),inference(fof_nnf,[status(thm)],[7])).
% fof(210, plain,![X34]:![X35]:(((X34=X35|![X36]:(~(X35=X36)|~(rpoint(X36))))|![X37]:(~(X34=X37)|~(rpoint(X37))))|?[X38]:((ron(X35,X38)&ron(X34,X38))&rline(X38))),inference(variable_rename,[status(thm)],[209])).
% fof(211, plain,![X34]:![X35]:(((X34=X35|![X36]:(~(X35=X36)|~(rpoint(X36))))|![X37]:(~(X34=X37)|~(rpoint(X37))))|((ron(X35,esk7_2(X34,X35))&ron(X34,esk7_2(X34,X35)))&rline(esk7_2(X34,X35)))),inference(skolemize,[status(esa)],[210])).
% fof(212, plain,![X34]:![X35]:![X36]:![X37]:(((~(X34=X37)|~(rpoint(X37)))|((~(X35=X36)|~(rpoint(X36)))|X34=X35))|((ron(X35,esk7_2(X34,X35))&ron(X34,esk7_2(X34,X35)))&rline(esk7_2(X34,X35)))),inference(shift_quantors,[status(thm)],[211])).
% fof(213, plain,![X34]:![X35]:![X36]:![X37]:(((ron(X35,esk7_2(X34,X35))|((~(X34=X37)|~(rpoint(X37)))|((~(X35=X36)|~(rpoint(X36)))|X34=X35)))&(ron(X34,esk7_2(X34,X35))|((~(X34=X37)|~(rpoint(X37)))|((~(X35=X36)|~(rpoint(X36)))|X34=X35))))&(rline(esk7_2(X34,X35))|((~(X34=X37)|~(rpoint(X37)))|((~(X35=X36)|~(rpoint(X36)))|X34=X35)))),inference(distribute,[status(thm)],[212])).
% cnf(214,plain,(X1=X2|rline(esk7_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[213])).
% cnf(215,plain,(X1=X2|ron(X1,esk7_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[213])).
% cnf(216,plain,(X1=X2|ron(X2,esk7_2(X1,X2))|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[213])).
% cnf(543,plain,(vd1123=vd1129),inference(split_conjunct,[status(thm)],[66])).
% cnf(688,plain,(rpoint(vd1126)),inference(split_conjunct,[status(thm)],[101])).
% cnf(689,plain,(vd1125=vd1126),inference(split_conjunct,[status(thm)],[101])).
% cnf(690,plain,(rpoint(vd1128)),inference(split_conjunct,[status(thm)],[101])).
% cnf(691,plain,(vd1127=vd1128),inference(split_conjunct,[status(thm)],[101])).
% cnf(692,plain,(rpoint(vd1130)),inference(split_conjunct,[status(thm)],[101])).
% cnf(693,plain,(vd1129=vd1130),inference(split_conjunct,[status(thm)],[101])).
% cnf(694,plain,(vd1123!=vd1125),inference(split_conjunct,[status(thm)],[101])).
% cnf(695,plain,(vd1127!=vd1129),inference(split_conjunct,[status(thm)],[101])).
% fof(852, negated_conjecture,![X737]:![X738]:(((((~(ron(vd1127,X738))|~(rcenter(vd1123,X738)))|~(rcircle(X738)))|~(ron(vd1125,X737)))|~(ron(vd1123,X737)))|~(rline(X737))),inference(fof_nnf,[status(thm)],[132])).
% fof(853, negated_conjecture,![X739]:![X740]:(((((~(ron(vd1127,X740))|~(rcenter(vd1123,X740)))|~(rcircle(X740)))|~(ron(vd1125,X739)))|~(ron(vd1123,X739)))|~(rline(X739))),inference(variable_rename,[status(thm)],[852])).
% cnf(854,negated_conjecture,(~rline(X1)|~ron(vd1123,X1)|~ron(vd1125,X1)|~rcircle(X2)|~rcenter(vd1123,X2)|~ron(vd1127,X2)),inference(split_conjunct,[status(thm)],[853])).
% cnf(855,plain,(vd1123!=vd1127),inference(rw,[status(thm)],[695,543,theory(equality)])).
% cnf(856,plain,(vd1130=vd1123),inference(rw,[status(thm)],[693,543,theory(equality)])).
% cnf(857,plain,(rpoint(vd1123)),inference(rw,[status(thm)],[692,856,theory(equality)])).
% cnf(858,plain,(rpoint(vd1127)),inference(rw,[status(thm)],[690,691,theory(equality)])).
% cnf(859,plain,(rpoint(vd1125)),inference(rw,[status(thm)],[688,689,theory(equality)])).
% fof(881, plain,(~(epred1_0)<=>![X1]:((~(rline(X1))|~(ron(vd1125,X1)))|~(ron(vd1123,X1)))),introduced(definition),['split']).
% cnf(882,plain,(epred1_0|~ron(vd1125,X1)|~ron(vd1123,X1)|~rline(X1)),inference(split_equiv,[status(thm)],[881])).
% fof(883, plain,(~(epred2_0)<=>![X2]:((~(ron(vd1127,X2))|~(rcircle(X2)))|~(rcenter(vd1123,X2)))),introduced(definition),['split']).
% cnf(884,plain,(epred2_0|~rcenter(vd1123,X2)|~rcircle(X2)|~ron(vd1127,X2)),inference(split_equiv,[status(thm)],[883])).
% cnf(885,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[854,881,theory(equality)]),883,theory(equality)]),['split']).
% cnf(944,plain,(X1=X2|rcircle(esk1_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[176,theory(equality)])).
% cnf(945,plain,(X1=X2|rcircle(esk1_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[944,theory(equality)])).
% cnf(948,plain,(X1=X2|rline(esk7_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[214,theory(equality)])).
% cnf(949,plain,(X1=X2|rline(esk7_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[948,theory(equality)])).
% cnf(977,plain,(X1=X2|rcenter(X1,esk1_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[177,theory(equality)])).
% cnf(978,plain,(X1=X2|rcenter(X1,esk1_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[977,theory(equality)])).
% cnf(979,plain,(X1=X2|ron(X2,esk1_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[178,theory(equality)])).
% cnf(980,plain,(X1=X2|ron(X2,esk1_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[979,theory(equality)])).
% cnf(981,plain,(X1=X2|ron(X2,esk7_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[216,theory(equality)])).
% cnf(982,plain,(X1=X2|ron(X2,esk7_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[981,theory(equality)])).
% cnf(983,plain,(X1=X2|ron(X1,esk7_2(X1,X2))|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[215,theory(equality)])).
% cnf(984,plain,(X1=X2|ron(X1,esk7_2(X1,X2))|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[983,theory(equality)])).
% cnf(2077,negated_conjecture,(epred2_0|X1=vd1127|~rcircle(esk1_2(X1,vd1127))|~rcenter(vd1123,esk1_2(X1,vd1127))|~rpoint(X1)|~rpoint(vd1127)),inference(spm,[status(thm)],[884,980,theory(equality)])).
% cnf(2080,negated_conjecture,(epred2_0|X1=vd1127|~rcircle(esk1_2(X1,vd1127))|~rcenter(vd1123,esk1_2(X1,vd1127))|~rpoint(X1)|$false),inference(rw,[status(thm)],[2077,858,theory(equality)])).
% cnf(2081,negated_conjecture,(epred2_0|X1=vd1127|~rcircle(esk1_2(X1,vd1127))|~rcenter(vd1123,esk1_2(X1,vd1127))|~rpoint(X1)),inference(cn,[status(thm)],[2080,theory(equality)])).
% cnf(2082,negated_conjecture,(X1=vd1127|epred2_0|~rpoint(X1)|~rcenter(vd1123,esk1_2(X1,vd1127))|~rpoint(vd1127)),inference(spm,[status(thm)],[2081,945,theory(equality)])).
% cnf(2083,negated_conjecture,(X1=vd1127|epred2_0|~rpoint(X1)|~rcenter(vd1123,esk1_2(X1,vd1127))|$false),inference(rw,[status(thm)],[2082,858,theory(equality)])).
% cnf(2084,negated_conjecture,(X1=vd1127|epred2_0|~rpoint(X1)|~rcenter(vd1123,esk1_2(X1,vd1127))),inference(cn,[status(thm)],[2083,theory(equality)])).
% cnf(2085,negated_conjecture,(vd1123=vd1127|epred2_0|~rpoint(vd1123)|~rpoint(vd1127)),inference(spm,[status(thm)],[2084,978,theory(equality)])).
% cnf(2086,negated_conjecture,(vd1123=vd1127|epred2_0|$false|~rpoint(vd1127)),inference(rw,[status(thm)],[2085,857,theory(equality)])).
% cnf(2087,negated_conjecture,(vd1123=vd1127|epred2_0|$false|$false),inference(rw,[status(thm)],[2086,858,theory(equality)])).
% cnf(2088,negated_conjecture,(vd1123=vd1127|epred2_0),inference(cn,[status(thm)],[2087,theory(equality)])).
% cnf(2089,negated_conjecture,(epred2_0),inference(sr,[status(thm)],[2088,855,theory(equality)])).
% cnf(2092,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[885,2089,theory(equality)])).
% cnf(2093,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[2092,theory(equality)])).
% cnf(2094,negated_conjecture,(epred1_0|X1=vd1125|~rline(esk7_2(X1,vd1125))|~ron(vd1123,esk7_2(X1,vd1125))|~rpoint(X1)|~rpoint(vd1125)),inference(spm,[status(thm)],[882,982,theory(equality)])).
% cnf(2095,negated_conjecture,(epred1_0|X1=vd1125|~rline(esk7_2(X1,vd1125))|~ron(vd1123,esk7_2(X1,vd1125))|~rpoint(X1)|$false),inference(rw,[status(thm)],[2094,859,theory(equality)])).
% cnf(2096,negated_conjecture,(epred1_0|X1=vd1125|~rline(esk7_2(X1,vd1125))|~ron(vd1123,esk7_2(X1,vd1125))|~rpoint(X1)),inference(cn,[status(thm)],[2095,theory(equality)])).
% cnf(2097,negated_conjecture,(X1=vd1125|~rline(esk7_2(X1,vd1125))|~ron(vd1123,esk7_2(X1,vd1125))|~rpoint(X1)),inference(sr,[status(thm)],[2096,2093,theory(equality)])).
% cnf(2098,negated_conjecture,(X1=vd1125|~ron(vd1123,esk7_2(X1,vd1125))|~rpoint(X1)|~rpoint(vd1125)),inference(spm,[status(thm)],[2097,949,theory(equality)])).
% cnf(2099,negated_conjecture,(X1=vd1125|~ron(vd1123,esk7_2(X1,vd1125))|~rpoint(X1)|$false),inference(rw,[status(thm)],[2098,859,theory(equality)])).
% cnf(2100,negated_conjecture,(X1=vd1125|~ron(vd1123,esk7_2(X1,vd1125))|~rpoint(X1)),inference(cn,[status(thm)],[2099,theory(equality)])).
% cnf(2102,negated_conjecture,(vd1123=vd1125|~rpoint(vd1123)|~rpoint(vd1125)),inference(spm,[status(thm)],[2100,984,theory(equality)])).
% cnf(2106,negated_conjecture,(vd1123=vd1125|$false|~rpoint(vd1125)),inference(rw,[status(thm)],[2102,857,theory(equality)])).
% cnf(2107,negated_conjecture,(vd1123=vd1125|$false|$false),inference(rw,[status(thm)],[2106,859,theory(equality)])).
% cnf(2108,negated_conjecture,(vd1123=vd1125),inference(cn,[status(thm)],[2107,theory(equality)])).
% cnf(2109,negated_conjecture,($false),inference(sr,[status(thm)],[2108,694,theory(equality)])).
% cnf(2110,negated_conjecture,($false),2109,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 391
% # ...of these trivial : 18
% # ...subsumed : 17
% # ...remaining for further processing: 356
% # Other redundant clauses eliminated : 1100
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 4
% # Generated clauses : 298
% # ...of the previous two non-trivial : 297
% # Contextual simplify-reflections : 4
% # Paramodulations : 49
% # Factorizations : 0
% # Equation resolutions : 1109
% # Current number of processed clauses: 110
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 90
% # Current number of unprocessed clauses: 197
% # ...number of literals in the above : 1918
% # Clause-clause subsumption calls (NU) : 755
% # Rec. Clause-clause subsumption calls : 239
% # Unit Clause-clause subsumption calls : 103
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 118 leaves, 1.25+/-0.640 terms/leaf
% # Paramod-from index: 39 leaves, 1.10+/-0.379 terms/leaf
% # Paramod-into index: 81 leaves, 1.17+/-0.562 terms/leaf
% # -------------------------------------------------
% # User time : 0.182 s
% # System time : 0.008 s
% # Total time : 0.190 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.38 CPU 0.46 WC
% FINAL PrfWatch: 0.38 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP25794/GEO284+1.tptp
%
%------------------------------------------------------------------------------