TSTP Solution File: GEO277+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO277+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:28:01 EST 2010
% Result : Theorem 1.95s
% Output : Solution 1.95s
% 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/SystemOnTPTP25276/GEO277+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25276/GEO277+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25276/GEO277+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 25372
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.075 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,((ron(vd1085,vd1099)&ron(vd1089,vd1099))&rline(vd1099)),file('/tmp/SRASS.s.p', 'and(pred(s2(plural(the(230))), 0), and(pred(s1(plural(the(230))), 0), pred(the(230), 0)))')).
% fof(3, axiom,![X6]:![X7]:![X8]:![X9]:(((((((((ron(X7,X9)&ron(X7,X8))&ron(X6,X9))&ron(X6,X8))&?[X10]:(X9=X10&rline(X10)))&?[X11]:(X8=X11&rline(X11)))&~(X6=X7))&?[X12]:(X7=X12&rpoint(X12)))&?[X13]:(X6=X13&rpoint(X13)))=>X8=X9),file('/tmp/SRASS.s.p', 'qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))')).
% fof(8, axiom,rpoint(vd1089),file('/tmp/SRASS.s.p', 'pred(226, 0)')).
% fof(9, axiom,~(vd1085=vd1080),file('/tmp/SRASS.s.p', 'holds(conjunct1(225), 1087, 0)')).
% fof(18, axiom,vd1085=vd1086,file('/tmp/SRASS.s.p', 'pred(225, 4)')).
% fof(19, axiom,vf(vd1089,vd1080)=vf(vd1085,vd1080),file('/tmp/SRASS.s.p', 'holds(226, 1090, 1)')).
% fof(20, axiom,vf(vd1089,vd1085)=vf(vd1089,vd1080),file('/tmp/SRASS.s.p', 'holds(226, 1090, 0)')).
% fof(43, axiom,rpoint(vd1086),file('/tmp/SRASS.s.p', 'pred(225, 1)')).
% fof(45, axiom,?[X253]:(vd1080=X253&rpoint(X253)),file('/tmp/SRASS.s.p', 'qe(s1(plural(224)))')).
% fof(46, axiom,![X254]:![X255]:((?[X256]:(X255=X256&rpoint(X256))&?[X257]:(X254=X257&rpoint(X257)))=>vf(X254,X255)=vf(X255,X254)),file('/tmp/SRASS.s.p', 'qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))')).
% fof(90, axiom,![X580]:![X581]:((?[X582]:(X581=X582&rpoint(X582))&?[X583]:(X580=X583&rpoint(X583)))=>(vf(X580,X581)=v0<=>X580=X581)),file('/tmp/SRASS.s.p', 'qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))')).
% fof(127, conjecture,![X105]:(((ron(vd1085,X105)&ron(vd1089,X105))&rline(X105))=>X105=vd1099),file('/tmp/SRASS.s.p', 'qu(theu(the(230), 1), imp(the(230)))')).
% fof(128, negated_conjecture,~(![X105]:(((ron(vd1085,X105)&ron(vd1089,X105))&rline(X105))=>X105=vd1099)),inference(assume_negation,[status(cth)],[127])).
% cnf(160,plain,(rline(vd1099)),inference(split_conjunct,[status(thm)],[1])).
% cnf(161,plain,(ron(vd1089,vd1099)),inference(split_conjunct,[status(thm)],[1])).
% cnf(162,plain,(ron(vd1085,vd1099)),inference(split_conjunct,[status(thm)],[1])).
% fof(171, plain,![X6]:![X7]:![X8]:![X9]:(((((((((~(ron(X7,X9))|~(ron(X7,X8)))|~(ron(X6,X9)))|~(ron(X6,X8)))|![X10]:(~(X9=X10)|~(rline(X10))))|![X11]:(~(X8=X11)|~(rline(X11))))|X6=X7)|![X12]:(~(X7=X12)|~(rpoint(X12))))|![X13]:(~(X6=X13)|~(rpoint(X13))))|X8=X9),inference(fof_nnf,[status(thm)],[3])).
% fof(172, plain,![X14]:![X15]:![X16]:![X17]:(((((((((~(ron(X15,X17))|~(ron(X15,X16)))|~(ron(X14,X17)))|~(ron(X14,X16)))|![X18]:(~(X17=X18)|~(rline(X18))))|![X19]:(~(X16=X19)|~(rline(X19))))|X14=X15)|![X20]:(~(X15=X20)|~(rpoint(X20))))|![X21]:(~(X14=X21)|~(rpoint(X21))))|X16=X17),inference(variable_rename,[status(thm)],[171])).
% fof(173, plain,![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:![X21]:(((~(X14=X21)|~(rpoint(X21)))|((~(X15=X20)|~(rpoint(X20)))|(((~(X16=X19)|~(rline(X19)))|((~(X17=X18)|~(rline(X18)))|(((~(ron(X15,X17))|~(ron(X15,X16)))|~(ron(X14,X17)))|~(ron(X14,X16)))))|X14=X15)))|X16=X17),inference(shift_quantors,[status(thm)],[172])).
% cnf(174,plain,(X1=X2|X3=X4|~ron(X3,X1)|~ron(X3,X2)|~ron(X4,X1)|~ron(X4,X2)|~rline(X5)|X2!=X5|~rline(X6)|X1!=X6|~rpoint(X7)|X4!=X7|~rpoint(X8)|X3!=X8),inference(split_conjunct,[status(thm)],[173])).
% cnf(205,plain,(rpoint(vd1089)),inference(split_conjunct,[status(thm)],[8])).
% cnf(206,plain,(vd1085!=vd1080),inference(split_conjunct,[status(thm)],[9])).
% cnf(258,plain,(vd1085=vd1086),inference(split_conjunct,[status(thm)],[18])).
% cnf(259,plain,(vf(vd1089,vd1080)=vf(vd1085,vd1080)),inference(split_conjunct,[status(thm)],[19])).
% cnf(260,plain,(vf(vd1089,vd1085)=vf(vd1089,vd1080)),inference(split_conjunct,[status(thm)],[20])).
% cnf(381,plain,(rpoint(vd1086)),inference(split_conjunct,[status(thm)],[43])).
% fof(386, plain,?[X254]:(vd1080=X254&rpoint(X254)),inference(variable_rename,[status(thm)],[45])).
% fof(387, plain,(vd1080=esk21_0&rpoint(esk21_0)),inference(skolemize,[status(esa)],[386])).
% cnf(388,plain,(rpoint(esk21_0)),inference(split_conjunct,[status(thm)],[387])).
% cnf(389,plain,(vd1080=esk21_0),inference(split_conjunct,[status(thm)],[387])).
% fof(390, plain,![X254]:![X255]:((![X256]:(~(X255=X256)|~(rpoint(X256)))|![X257]:(~(X254=X257)|~(rpoint(X257))))|vf(X254,X255)=vf(X255,X254)),inference(fof_nnf,[status(thm)],[46])).
% fof(391, plain,![X258]:![X259]:((![X260]:(~(X259=X260)|~(rpoint(X260)))|![X261]:(~(X258=X261)|~(rpoint(X261))))|vf(X258,X259)=vf(X259,X258)),inference(variable_rename,[status(thm)],[390])).
% fof(392, plain,![X258]:![X259]:![X260]:![X261]:(((~(X258=X261)|~(rpoint(X261)))|(~(X259=X260)|~(rpoint(X260))))|vf(X258,X259)=vf(X259,X258)),inference(shift_quantors,[status(thm)],[391])).
% cnf(393,plain,(vf(X1,X2)=vf(X2,X1)|~rpoint(X3)|X2!=X3|~rpoint(X4)|X1!=X4),inference(split_conjunct,[status(thm)],[392])).
% fof(654, plain,![X580]:![X581]:((![X582]:(~(X581=X582)|~(rpoint(X582)))|![X583]:(~(X580=X583)|~(rpoint(X583))))|((~(vf(X580,X581)=v0)|X580=X581)&(~(X580=X581)|vf(X580,X581)=v0))),inference(fof_nnf,[status(thm)],[90])).
% fof(655, plain,![X584]:![X585]:((![X586]:(~(X585=X586)|~(rpoint(X586)))|![X587]:(~(X584=X587)|~(rpoint(X587))))|((~(vf(X584,X585)=v0)|X584=X585)&(~(X584=X585)|vf(X584,X585)=v0))),inference(variable_rename,[status(thm)],[654])).
% fof(656, plain,![X584]:![X585]:![X586]:![X587]:(((~(X584=X587)|~(rpoint(X587)))|(~(X585=X586)|~(rpoint(X586))))|((~(vf(X584,X585)=v0)|X584=X585)&(~(X584=X585)|vf(X584,X585)=v0))),inference(shift_quantors,[status(thm)],[655])).
% fof(657, plain,![X584]:![X585]:![X586]:![X587]:(((~(vf(X584,X585)=v0)|X584=X585)|((~(X584=X587)|~(rpoint(X587)))|(~(X585=X586)|~(rpoint(X586)))))&((~(X584=X585)|vf(X584,X585)=v0)|((~(X584=X587)|~(rpoint(X587)))|(~(X585=X586)|~(rpoint(X586)))))),inference(distribute,[status(thm)],[656])).
% cnf(658,plain,(vf(X4,X2)=v0|~rpoint(X1)|X2!=X1|~rpoint(X3)|X4!=X3|X4!=X2),inference(split_conjunct,[status(thm)],[657])).
% cnf(659,plain,(X4=X2|~rpoint(X1)|X2!=X1|~rpoint(X3)|X4!=X3|vf(X4,X2)!=v0),inference(split_conjunct,[status(thm)],[657])).
% fof(809, negated_conjecture,?[X105]:(((ron(vd1085,X105)&ron(vd1089,X105))&rline(X105))&~(X105=vd1099)),inference(fof_nnf,[status(thm)],[128])).
% fof(810, negated_conjecture,?[X106]:(((ron(vd1085,X106)&ron(vd1089,X106))&rline(X106))&~(X106=vd1099)),inference(variable_rename,[status(thm)],[809])).
% fof(811, negated_conjecture,(((ron(vd1085,esk51_0)&ron(vd1089,esk51_0))&rline(esk51_0))&~(esk51_0=vd1099)),inference(skolemize,[status(esa)],[810])).
% cnf(812,negated_conjecture,(esk51_0!=vd1099),inference(split_conjunct,[status(thm)],[811])).
% cnf(813,negated_conjecture,(rline(esk51_0)),inference(split_conjunct,[status(thm)],[811])).
% cnf(814,negated_conjecture,(ron(vd1089,esk51_0)),inference(split_conjunct,[status(thm)],[811])).
% cnf(815,negated_conjecture,(ron(vd1085,esk51_0)),inference(split_conjunct,[status(thm)],[811])).
% cnf(816,plain,(rpoint(vd1085)),inference(rw,[status(thm)],[381,258,theory(equality)])).
% cnf(818,plain,(rpoint(vd1080)),inference(rw,[status(thm)],[388,389,theory(equality)])).
% cnf(847,plain,(vf(X1,X2)=v0|X2!=X1|X3!=X2|~rpoint(X1)|~rpoint(X3)),inference(er,[status(thm)],[658,theory(equality)])).
% cnf(848,plain,(vf(X1,X1)=v0|X2!=X1|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[847,theory(equality)])).
% cnf(849,plain,(vf(X1,X1)=v0|~rpoint(X1)),inference(er,[status(thm)],[848,theory(equality)])).
% cnf(863,plain,(X1=X2|vf(X2,X1)!=v0|X3!=X1|~rpoint(X2)|~rpoint(X3)),inference(er,[status(thm)],[659,theory(equality)])).
% cnf(864,plain,(X1=X2|vf(X2,X1)!=v0|~rpoint(X2)|~rpoint(X1)),inference(er,[status(thm)],[863,theory(equality)])).
% cnf(865,plain,(vf(X1,X2)=vf(X2,X1)|X1!=X3|~rpoint(X3)|~rpoint(X2)),inference(er,[status(thm)],[393,theory(equality)])).
% cnf(866,plain,(vf(X1,X2)=vf(X2,X1)|~rpoint(X1)|~rpoint(X2)),inference(er,[status(thm)],[865,theory(equality)])).
% cnf(1102,plain,(X1=X2|X3=X4|X3!=X5|X2!=X6|X1!=X7|~rpoint(X5)|~rpoint(X4)|~rline(X7)|~rline(X6)|~ron(X4,X2)|~ron(X4,X1)|~ron(X3,X2)|~ron(X3,X1)),inference(er,[status(thm)],[174,theory(equality)])).
% cnf(1103,plain,(X1=X2|X3=X4|X2!=X5|X1!=X6|~rpoint(X3)|~rpoint(X4)|~rline(X6)|~rline(X5)|~ron(X4,X2)|~ron(X4,X1)|~ron(X3,X2)|~ron(X3,X1)),inference(er,[status(thm)],[1102,theory(equality)])).
% cnf(1104,plain,(X1=X2|X3=X4|X1!=X5|~rpoint(X3)|~rpoint(X4)|~rline(X5)|~rline(X2)|~ron(X4,X2)|~ron(X4,X1)|~ron(X3,X2)|~ron(X3,X1)),inference(er,[status(thm)],[1103,theory(equality)])).
% cnf(1105,plain,(X1=X2|X3=X4|~rpoint(X3)|~rpoint(X4)|~rline(X1)|~rline(X2)|~ron(X4,X2)|~ron(X4,X1)|~ron(X3,X2)|~ron(X3,X1)),inference(er,[status(thm)],[1104,theory(equality)])).
% cnf(1943,plain,(vd1080=vd1085|vf(vd1089,vd1080)!=v0|~rpoint(vd1085)|~rpoint(vd1080)),inference(spm,[status(thm)],[864,259,theory(equality)])).
% cnf(1947,plain,(vd1080=vd1085|vf(vd1089,vd1080)!=v0|$false|~rpoint(vd1080)),inference(rw,[status(thm)],[1943,816,theory(equality)])).
% cnf(1948,plain,(vd1080=vd1085|vf(vd1089,vd1080)!=v0|$false|$false),inference(rw,[status(thm)],[1947,818,theory(equality)])).
% cnf(1949,plain,(vd1080=vd1085|vf(vd1089,vd1080)!=v0),inference(cn,[status(thm)],[1948,theory(equality)])).
% cnf(1950,plain,(vf(vd1089,vd1080)!=v0),inference(sr,[status(thm)],[1949,206,theory(equality)])).
% cnf(1978,plain,(vf(vd1080,vd1089)!=v0|~rpoint(vd1080)|~rpoint(vd1089)),inference(spm,[status(thm)],[1950,866,theory(equality)])).
% cnf(1981,plain,(vf(vd1080,vd1085)=vf(vd1089,vd1080)|~rpoint(vd1080)|~rpoint(vd1085)),inference(spm,[status(thm)],[259,866,theory(equality)])).
% cnf(1994,plain,(vf(vd1080,vd1089)!=v0|$false|~rpoint(vd1089)),inference(rw,[status(thm)],[1978,818,theory(equality)])).
% cnf(1995,plain,(vf(vd1080,vd1089)!=v0|$false|$false),inference(rw,[status(thm)],[1994,205,theory(equality)])).
% cnf(1996,plain,(vf(vd1080,vd1089)!=v0),inference(cn,[status(thm)],[1995,theory(equality)])).
% cnf(2003,plain,(vf(vd1080,vd1085)=vf(vd1089,vd1080)|$false|~rpoint(vd1085)),inference(rw,[status(thm)],[1981,818,theory(equality)])).
% cnf(2004,plain,(vf(vd1080,vd1085)=vf(vd1089,vd1080)|$false|$false),inference(rw,[status(thm)],[2003,816,theory(equality)])).
% cnf(2005,plain,(vf(vd1080,vd1085)=vf(vd1089,vd1080)),inference(cn,[status(thm)],[2004,theory(equality)])).
% cnf(2019,plain,(vf(vd1080,vd1085)=vf(vd1080,vd1089)|~rpoint(vd1089)|~rpoint(vd1080)),inference(spm,[status(thm)],[866,2005,theory(equality)])).
% cnf(2027,plain,(vf(vd1089,vd1085)=vf(vd1080,vd1085)),inference(rw,[status(thm)],[260,2005,theory(equality)])).
% cnf(2029,plain,(vf(vd1080,vd1085)=vf(vd1080,vd1089)|$false|~rpoint(vd1080)),inference(rw,[status(thm)],[2019,205,theory(equality)])).
% cnf(2030,plain,(vf(vd1080,vd1085)=vf(vd1080,vd1089)|$false|$false),inference(rw,[status(thm)],[2029,818,theory(equality)])).
% cnf(2031,plain,(vf(vd1080,vd1085)=vf(vd1080,vd1089)),inference(cn,[status(thm)],[2030,theory(equality)])).
% cnf(2078,plain,(vf(vd1089,vd1085)=vf(vd1080,vd1089)),inference(rw,[status(thm)],[2027,2031,theory(equality)])).
% cnf(5407,negated_conjecture,(X1=vd1089|X2=esk51_0|~rpoint(X1)|~rpoint(vd1089)|~rline(X2)|~rline(esk51_0)|~ron(vd1089,X2)|~ron(X1,esk51_0)|~ron(X1,X2)),inference(spm,[status(thm)],[1105,814,theory(equality)])).
% cnf(5553,negated_conjecture,(X1=vd1089|X2=esk51_0|~rpoint(X1)|$false|~rline(X2)|~rline(esk51_0)|~ron(vd1089,X2)|~ron(X1,esk51_0)|~ron(X1,X2)),inference(rw,[status(thm)],[5407,205,theory(equality)])).
% cnf(5554,negated_conjecture,(X1=vd1089|X2=esk51_0|~rpoint(X1)|$false|~rline(X2)|$false|~ron(vd1089,X2)|~ron(X1,esk51_0)|~ron(X1,X2)),inference(rw,[status(thm)],[5553,813,theory(equality)])).
% cnf(5555,negated_conjecture,(X1=vd1089|X2=esk51_0|~rpoint(X1)|~rline(X2)|~ron(vd1089,X2)|~ron(X1,esk51_0)|~ron(X1,X2)),inference(cn,[status(thm)],[5554,theory(equality)])).
% cnf(5623,negated_conjecture,(vd1099=esk51_0|X1=vd1089|~rpoint(X1)|~rline(vd1099)|~ron(X1,esk51_0)|~ron(X1,vd1099)),inference(spm,[status(thm)],[5555,161,theory(equality)])).
% cnf(5632,negated_conjecture,(vd1099=esk51_0|X1=vd1089|~rpoint(X1)|$false|~ron(X1,esk51_0)|~ron(X1,vd1099)),inference(rw,[status(thm)],[5623,160,theory(equality)])).
% cnf(5633,negated_conjecture,(vd1099=esk51_0|X1=vd1089|~rpoint(X1)|~ron(X1,esk51_0)|~ron(X1,vd1099)),inference(cn,[status(thm)],[5632,theory(equality)])).
% cnf(5634,negated_conjecture,(X1=vd1089|~rpoint(X1)|~ron(X1,esk51_0)|~ron(X1,vd1099)),inference(sr,[status(thm)],[5633,812,theory(equality)])).
% cnf(5641,negated_conjecture,(vd1085=vd1089|~rpoint(vd1085)|~ron(vd1085,vd1099)),inference(spm,[status(thm)],[5634,815,theory(equality)])).
% cnf(5652,negated_conjecture,(vd1085=vd1089|$false|~ron(vd1085,vd1099)),inference(rw,[status(thm)],[5641,816,theory(equality)])).
% cnf(5653,negated_conjecture,(vd1085=vd1089|$false|$false),inference(rw,[status(thm)],[5652,162,theory(equality)])).
% cnf(5654,negated_conjecture,(vd1085=vd1089),inference(cn,[status(thm)],[5653,theory(equality)])).
% cnf(5707,plain,(vf(vd1089,vd1089)=vf(vd1080,vd1089)),inference(rw,[status(thm)],[2078,5654,theory(equality)])).
% cnf(5761,plain,(vf(vd1080,vd1089)=v0|~rpoint(vd1089)),inference(spm,[status(thm)],[849,5707,theory(equality)])).
% cnf(5782,plain,(vf(vd1080,vd1089)=v0|$false),inference(rw,[status(thm)],[5761,205,theory(equality)])).
% cnf(5783,plain,(vf(vd1080,vd1089)=v0),inference(cn,[status(thm)],[5782,theory(equality)])).
% cnf(5784,plain,($false),inference(sr,[status(thm)],[5783,1996,theory(equality)])).
% cnf(5785,plain,($false),5784,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 820
% # ...of these trivial : 11
% # ...subsumed : 91
% # ...remaining for further processing: 718
% # Other redundant clauses eliminated : 1094
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 70
% # Generated clauses : 1542
% # ...of the previous two non-trivial : 1508
% # Contextual simplify-reflections : 19
% # Paramodulations : 1285
% # Factorizations : 2
% # Equation resolutions : 1110
% # Current number of processed clauses: 394
% # Positive orientable unit clauses: 145
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 238
% # Current number of unprocessed clauses: 829
% # ...number of literals in the above : 3970
% # Clause-clause subsumption calls (NU) : 2835
% # Rec. Clause-clause subsumption calls : 1028
% # Unit Clause-clause subsumption calls : 147
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 686
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 299 leaves, 1.79+/-2.667 terms/leaf
% # Paramod-from index: 114 leaves, 1.77+/-3.049 terms/leaf
% # Paramod-into index: 204 leaves, 1.80+/-2.853 terms/leaf
% # -------------------------------------------------
% # User time : 0.263 s
% # System time : 0.004 s
% # Total time : 0.267 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.50 CPU 0.59 WC
% FINAL PrfWatch: 0.50 CPU 0.59 WC
% SZS output end Solution for /tmp/SystemOnTPTP25276/GEO277+1.tptp
%
%------------------------------------------------------------------------------