TSTP Solution File: RNG119+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG119+1 : TPTP v5.0.0. Released v4.0.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 22:47:08 EST 2010
% Result : Theorem 1.01s
% Output : Solution 1.01s
% 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/SystemOnTPTP16163/RNG119+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16163/RNG119+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16163/RNG119+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 16259
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(6, axiom,![X1]:(aElement0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', mAddZero)).
% fof(7, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(14, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aElement0(X3)&sdtasdt0(X1,X3)=X2))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(18, axiom,(aElement0(xa)&aElement0(xb)),file('/tmp/SRASS.s.p', m__2091)).
% fof(21, axiom,(aIdeal0(xI)&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(24, axiom,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),file('/tmp/SRASS.s.p', m__2273)).
% fof(28, axiom,~(doDivides0(xu,xb)),file('/tmp/SRASS.s.p', m__2612)).
% fof(29, axiom,(((aElement0(xq)&aElement0(xr))&xb=sdtpldt0(sdtasdt0(xq,xu),xr))&(xr=sz00|iLess0(sbrdtbr0(xr),sbrdtbr0(xu)))),file('/tmp/SRASS.s.p', m__2666)).
% fof(30, axiom,![X1]:(aIdeal0(X1)<=>(aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>(![X3]:(aElementOf0(X3,X1)=>aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(aElement0(X3)=>aElementOf0(sdtasdt0(X3,X2),X1)))))),file('/tmp/SRASS.s.p', mDefIdeal)).
% fof(40, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(51, conjecture,~(xr=sz00),file('/tmp/SRASS.s.p', m__)).
% fof(52, negated_conjecture,~(~(xr=sz00)),inference(assume_negation,[status(cth)],[51])).
% fof(53, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(55, plain,~(doDivides0(xu,xb)),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(60, negated_conjecture,xr=sz00,inference(fof_simplification,[status(thm)],[52,theory(equality)])).
% fof(65, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(66, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(74, plain,![X1]:(~(aElement0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(75, plain,![X2]:(~(aElement0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[74])).
% fof(76, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aElement0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[75])).
% cnf(78,plain,(sdtpldt0(X1,sz00)=X1|~aElement0(X1)),inference(split_conjunct,[status(thm)],[76])).
% fof(79, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(80, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[79])).
% cnf(81,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(109, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|((~(doDivides0(X1,X2))|?[X3]:(aElement0(X3)&sdtasdt0(X1,X3)=X2))&(![X3]:(~(aElement0(X3))|~(sdtasdt0(X1,X3)=X2))|doDivides0(X1,X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(110, plain,![X4]:![X5]:((~(aElement0(X4))|~(aElement0(X5)))|((~(doDivides0(X4,X5))|?[X6]:(aElement0(X6)&sdtasdt0(X4,X6)=X5))&(![X7]:(~(aElement0(X7))|~(sdtasdt0(X4,X7)=X5))|doDivides0(X4,X5)))),inference(variable_rename,[status(thm)],[109])).
% fof(111, plain,![X4]:![X5]:((~(aElement0(X4))|~(aElement0(X5)))|((~(doDivides0(X4,X5))|(aElement0(esk3_2(X4,X5))&sdtasdt0(X4,esk3_2(X4,X5))=X5))&(![X7]:(~(aElement0(X7))|~(sdtasdt0(X4,X7)=X5))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[110])).
% fof(112, plain,![X4]:![X5]:![X7]:((((~(aElement0(X7))|~(sdtasdt0(X4,X7)=X5))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aElement0(esk3_2(X4,X5))&sdtasdt0(X4,esk3_2(X4,X5))=X5)))|(~(aElement0(X4))|~(aElement0(X5)))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, plain,![X4]:![X5]:![X7]:((((~(aElement0(X7))|~(sdtasdt0(X4,X7)=X5))|doDivides0(X4,X5))|(~(aElement0(X4))|~(aElement0(X5))))&(((aElement0(esk3_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aElement0(X4))|~(aElement0(X5))))&((sdtasdt0(X4,esk3_2(X4,X5))=X5|~(doDivides0(X4,X5)))|(~(aElement0(X4))|~(aElement0(X5)))))),inference(distribute,[status(thm)],[112])).
% cnf(116,plain,(doDivides0(X2,X1)|~aElement0(X1)|~aElement0(X2)|sdtasdt0(X2,X3)!=X1|~aElement0(X3)),inference(split_conjunct,[status(thm)],[113])).
% cnf(138,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[18])).
% cnf(143,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[21])).
% fof(152, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((~(aElementOf0(X1,xI))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[53])).
% fof(153, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X2]:((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[152])).
% fof(154, plain,![X2]:(((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))&(aElementOf0(xu,xI)&~(xu=sz00))),inference(shift_quantors,[status(thm)],[153])).
% cnf(156,plain,(aElementOf0(xu,xI)),inference(split_conjunct,[status(thm)],[154])).
% cnf(166,plain,(~doDivides0(xu,xb)),inference(split_conjunct,[status(thm)],[55])).
% cnf(168,plain,(xb=sdtpldt0(sdtasdt0(xq,xu),xr)),inference(split_conjunct,[status(thm)],[29])).
% cnf(170,plain,(aElement0(xq)),inference(split_conjunct,[status(thm)],[29])).
% fof(171, plain,![X1]:((~(aIdeal0(X1))|(aSet0(X1)&![X2]:(~(aElementOf0(X2,X1))|(![X3]:(~(aElementOf0(X3,X1))|aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(~(aElement0(X3))|aElementOf0(sdtasdt0(X3,X2),X1))))))&((~(aSet0(X1))|?[X2]:(aElementOf0(X2,X1)&(?[X3]:(aElementOf0(X3,X1)&~(aElementOf0(sdtpldt0(X2,X3),X1)))|?[X3]:(aElement0(X3)&~(aElementOf0(sdtasdt0(X3,X2),X1))))))|aIdeal0(X1))),inference(fof_nnf,[status(thm)],[30])).
% fof(172, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|?[X8]:(aElementOf0(X8,X4)&(?[X9]:(aElementOf0(X9,X4)&~(aElementOf0(sdtpldt0(X8,X9),X4)))|?[X10]:(aElement0(X10)&~(aElementOf0(sdtasdt0(X10,X8),X4))))))|aIdeal0(X4))),inference(variable_rename,[status(thm)],[171])).
% fof(173, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|(aElementOf0(esk8_1(X4),X4)&((aElementOf0(esk9_1(X4),X4)&~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|(aElement0(esk10_1(X4))&~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[172])).
% fof(174, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))&(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4)))|~(aElementOf0(X5,X4)))&aSet0(X4))|~(aIdeal0(X4)))&((~(aSet0(X4))|(aElementOf0(esk8_1(X4),X4)&((aElementOf0(esk9_1(X4),X4)&~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|(aElement0(esk10_1(X4))&~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[173])).
% fof(175, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4)))&(((~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4))))&(aSet0(X4)|~(aIdeal0(X4))))&(((aElementOf0(esk8_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk10_1(X4))|aElementOf0(esk9_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))|aElementOf0(esk9_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk10_1(X4))|~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[174])).
% cnf(181,plain,(aSet0(X1)|~aIdeal0(X1)),inference(split_conjunct,[status(thm)],[175])).
% fof(248, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[40])).
% fof(249, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[248])).
% fof(250, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[249])).
% cnf(251,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[250])).
% cnf(289,negated_conjecture,(xr=sz00),inference(split_conjunct,[status(thm)],[60])).
% cnf(297,plain,(aSet0(xI)),inference(spm,[status(thm)],[181,143,theory(equality)])).
% cnf(298,plain,(aElement0(xu)|~aSet0(xI)),inference(spm,[status(thm)],[251,156,theory(equality)])).
% cnf(383,plain,(sdtpldt0(sdtasdt0(xq,xu),sz00)=xb),inference(rw,[status(thm)],[168,289,theory(equality)])).
% cnf(387,plain,(xb=sdtasdt0(xq,xu)|~aElement0(sdtasdt0(xq,xu))),inference(spm,[status(thm)],[78,383,theory(equality)])).
% cnf(809,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[298,297,theory(equality)])).
% cnf(810,plain,(aElement0(xu)),inference(cn,[status(thm)],[809,theory(equality)])).
% cnf(930,plain,(sdtasdt0(xq,xu)=xb|~aElement0(xu)|~aElement0(xq)),inference(spm,[status(thm)],[387,67,theory(equality)])).
% cnf(937,plain,(sdtasdt0(xq,xu)=xb|$false|~aElement0(xq)),inference(rw,[status(thm)],[930,810,theory(equality)])).
% cnf(938,plain,(sdtasdt0(xq,xu)=xb|$false|$false),inference(rw,[status(thm)],[937,170,theory(equality)])).
% cnf(939,plain,(sdtasdt0(xq,xu)=xb),inference(cn,[status(thm)],[938,theory(equality)])).
% cnf(941,plain,(sdtasdt0(xu,xq)=xb|~aElement0(xq)|~aElement0(xu)),inference(spm,[status(thm)],[81,939,theory(equality)])).
% cnf(963,plain,(sdtasdt0(xu,xq)=xb|$false|~aElement0(xu)),inference(rw,[status(thm)],[941,170,theory(equality)])).
% cnf(964,plain,(sdtasdt0(xu,xq)=xb|$false|$false),inference(rw,[status(thm)],[963,810,theory(equality)])).
% cnf(965,plain,(sdtasdt0(xu,xq)=xb),inference(cn,[status(thm)],[964,theory(equality)])).
% cnf(1035,plain,(doDivides0(xu,X1)|xb!=X1|~aElement0(xq)|~aElement0(xu)|~aElement0(X1)),inference(spm,[status(thm)],[116,965,theory(equality)])).
% cnf(1060,plain,(doDivides0(xu,X1)|xb!=X1|$false|~aElement0(xu)|~aElement0(X1)),inference(rw,[status(thm)],[1035,170,theory(equality)])).
% cnf(1061,plain,(doDivides0(xu,X1)|xb!=X1|$false|$false|~aElement0(X1)),inference(rw,[status(thm)],[1060,810,theory(equality)])).
% cnf(1062,plain,(doDivides0(xu,X1)|xb!=X1|~aElement0(X1)),inference(cn,[status(thm)],[1061,theory(equality)])).
% cnf(1134,plain,(~aElement0(xb)),inference(spm,[status(thm)],[166,1062,theory(equality)])).
% cnf(1137,plain,($false),inference(rw,[status(thm)],[1134,138,theory(equality)])).
% cnf(1138,plain,($false),inference(cn,[status(thm)],[1137,theory(equality)])).
% cnf(1139,plain,($false),1138,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 197
% # ...of these trivial : 7
% # ...subsumed : 28
% # ...remaining for further processing: 162
% # Other redundant clauses eliminated : 12
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 4
% # Generated clauses : 480
% # ...of the previous two non-trivial : 415
% # Contextual simplify-reflections : 6
% # Paramodulations : 452
% # Factorizations : 0
% # Equation resolutions : 28
% # Current number of processed clauses: 154
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 116
% # Current number of unprocessed clauses: 301
% # ...number of literals in the above : 1508
% # Clause-clause subsumption calls (NU) : 323
% # Rec. Clause-clause subsumption calls : 211
% # Unit Clause-clause subsumption calls : 36
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 172 leaves, 1.32+/-1.071 terms/leaf
% # Paramod-from index: 89 leaves, 1.09+/-0.286 terms/leaf
% # Paramod-into index: 154 leaves, 1.18+/-0.548 terms/leaf
% # -------------------------------------------------
% # User time : 0.044 s
% # System time : 0.006 s
% # Total time : 0.050 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.24 WC
% FINAL PrfWatch: 0.14 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP16163/RNG119+1.tptp
%
%------------------------------------------------------------------------------