TSTP Solution File: RNG119+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG119+4 : 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:23 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/SystemOnTPTP16422/RNG119+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16422/RNG119+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16422/RNG119+4.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 16518
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.026 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(12, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(26, axiom,((((((aSet0(xI)&![X1]:(aElementOf0(X1,xI)=>(![X2]:(aElementOf0(X2,xI)=>aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&![X1]:(aElementOf0(X1,slsdtgt0(xa))<=>?[X2]:(aElement0(X2)&sdtasdt0(xa,X2)=X1)))&![X1]:(aElementOf0(X1,slsdtgt0(xb))<=>?[X2]:(aElement0(X2)&sdtasdt0(xb,X2)=X1)))&![X1]:(aElementOf0(X1,xI)<=>?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1)))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(29, axiom,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1)|aElementOf0(X1,xI))&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),file('/tmp/SRASS.s.p', m__2273)).
% fof(33, axiom,~((?[X1]:(aElement0(X1)&sdtasdt0(xu,X1)=xb)|doDivides0(xu,xb))),file('/tmp/SRASS.s.p', m__2612)).
% fof(34, 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(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,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1)|aElementOf0(X1,xI))&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(58, negated_conjecture,xr=sz00,inference(fof_simplification,[status(thm)],[52,theory(equality)])).
% fof(63, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(64, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(72, plain,![X1]:(~(aElement0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(73, plain,![X2]:(~(aElement0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aElement0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[73])).
% cnf(76,plain,(sdtpldt0(X1,sz00)=X1|~aElement0(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(77, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(78, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(96, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(97, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[96])).
% fof(98, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[97])).
% cnf(99,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(233, plain,((((((aSet0(xI)&![X1]:(~(aElementOf0(X1,xI))|(![X2]:(~(aElementOf0(X2,xI))|aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&![X1]:((~(aElementOf0(X1,slsdtgt0(xa)))|?[X2]:(aElement0(X2)&sdtasdt0(xa,X2)=X1))&(![X2]:(~(aElement0(X2))|~(sdtasdt0(xa,X2)=X1))|aElementOf0(X1,slsdtgt0(xa)))))&![X1]:((~(aElementOf0(X1,slsdtgt0(xb)))|?[X2]:(aElement0(X2)&sdtasdt0(xb,X2)=X1))&(![X2]:(~(aElement0(X2))|~(sdtasdt0(xb,X2)=X1))|aElementOf0(X1,slsdtgt0(xb)))))&![X1]:((~(aElementOf0(X1,xI))|?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1))&(![X2]:![X3]:((~(aElementOf0(X2,slsdtgt0(xa)))|~(aElementOf0(X3,slsdtgt0(xb))))|~(sdtpldt0(X2,X3)=X1))|aElementOf0(X1,xI))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(fof_nnf,[status(thm)],[26])).
% fof(234, plain,((((((aSet0(xI)&![X4]:(~(aElementOf0(X4,xI))|(![X5]:(~(aElementOf0(X5,xI))|aElementOf0(sdtpldt0(X4,X5),xI))&![X6]:(~(aElement0(X6))|aElementOf0(sdtasdt0(X6,X4),xI)))))&aIdeal0(xI))&![X7]:((~(aElementOf0(X7,slsdtgt0(xa)))|?[X8]:(aElement0(X8)&sdtasdt0(xa,X8)=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(xa,X9)=X7))|aElementOf0(X7,slsdtgt0(xa)))))&![X10]:((~(aElementOf0(X10,slsdtgt0(xb)))|?[X11]:(aElement0(X11)&sdtasdt0(xb,X11)=X10))&(![X12]:(~(aElement0(X12))|~(sdtasdt0(xb,X12)=X10))|aElementOf0(X10,slsdtgt0(xb)))))&![X13]:((~(aElementOf0(X13,xI))|?[X14]:?[X15]:((aElementOf0(X14,slsdtgt0(xa))&aElementOf0(X15,slsdtgt0(xb)))&sdtpldt0(X14,X15)=X13))&(![X16]:![X17]:((~(aElementOf0(X16,slsdtgt0(xa)))|~(aElementOf0(X17,slsdtgt0(xb))))|~(sdtpldt0(X16,X17)=X13))|aElementOf0(X13,xI))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(variable_rename,[status(thm)],[233])).
% fof(235, plain,((((((aSet0(xI)&![X4]:(~(aElementOf0(X4,xI))|(![X5]:(~(aElementOf0(X5,xI))|aElementOf0(sdtpldt0(X4,X5),xI))&![X6]:(~(aElement0(X6))|aElementOf0(sdtasdt0(X6,X4),xI)))))&aIdeal0(xI))&![X7]:((~(aElementOf0(X7,slsdtgt0(xa)))|(aElement0(esk21_1(X7))&sdtasdt0(xa,esk21_1(X7))=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(xa,X9)=X7))|aElementOf0(X7,slsdtgt0(xa)))))&![X10]:((~(aElementOf0(X10,slsdtgt0(xb)))|(aElement0(esk22_1(X10))&sdtasdt0(xb,esk22_1(X10))=X10))&(![X12]:(~(aElement0(X12))|~(sdtasdt0(xb,X12)=X10))|aElementOf0(X10,slsdtgt0(xb)))))&![X13]:((~(aElementOf0(X13,xI))|((aElementOf0(esk23_1(X13),slsdtgt0(xa))&aElementOf0(esk24_1(X13),slsdtgt0(xb)))&sdtpldt0(esk23_1(X13),esk24_1(X13))=X13))&(![X16]:![X17]:((~(aElementOf0(X16,slsdtgt0(xa)))|~(aElementOf0(X17,slsdtgt0(xb))))|~(sdtpldt0(X16,X17)=X13))|aElementOf0(X13,xI))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(skolemize,[status(esa)],[234])).
% fof(236, plain,![X4]:![X5]:![X6]:![X7]:![X9]:![X10]:![X12]:![X13]:![X16]:![X17]:((((((~(aElementOf0(X16,slsdtgt0(xa)))|~(aElementOf0(X17,slsdtgt0(xb))))|~(sdtpldt0(X16,X17)=X13))|aElementOf0(X13,xI))&(~(aElementOf0(X13,xI))|((aElementOf0(esk23_1(X13),slsdtgt0(xa))&aElementOf0(esk24_1(X13),slsdtgt0(xb)))&sdtpldt0(esk23_1(X13),esk24_1(X13))=X13)))&((((~(aElement0(X12))|~(sdtasdt0(xb,X12)=X10))|aElementOf0(X10,slsdtgt0(xb)))&(~(aElementOf0(X10,slsdtgt0(xb)))|(aElement0(esk22_1(X10))&sdtasdt0(xb,esk22_1(X10))=X10)))&((((~(aElement0(X9))|~(sdtasdt0(xa,X9)=X7))|aElementOf0(X7,slsdtgt0(xa)))&(~(aElementOf0(X7,slsdtgt0(xa)))|(aElement0(esk21_1(X7))&sdtasdt0(xa,esk21_1(X7))=X7)))&(((((~(aElement0(X6))|aElementOf0(sdtasdt0(X6,X4),xI))&(~(aElementOf0(X5,xI))|aElementOf0(sdtpldt0(X4,X5),xI)))|~(aElementOf0(X4,xI)))&aSet0(xI))&aIdeal0(xI)))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(shift_quantors,[status(thm)],[235])).
% fof(237, plain,![X4]:![X5]:![X6]:![X7]:![X9]:![X10]:![X12]:![X13]:![X16]:![X17]:((((((~(aElementOf0(X16,slsdtgt0(xa)))|~(aElementOf0(X17,slsdtgt0(xb))))|~(sdtpldt0(X16,X17)=X13))|aElementOf0(X13,xI))&(((aElementOf0(esk23_1(X13),slsdtgt0(xa))|~(aElementOf0(X13,xI)))&(aElementOf0(esk24_1(X13),slsdtgt0(xb))|~(aElementOf0(X13,xI))))&(sdtpldt0(esk23_1(X13),esk24_1(X13))=X13|~(aElementOf0(X13,xI)))))&((((~(aElement0(X12))|~(sdtasdt0(xb,X12)=X10))|aElementOf0(X10,slsdtgt0(xb)))&((aElement0(esk22_1(X10))|~(aElementOf0(X10,slsdtgt0(xb))))&(sdtasdt0(xb,esk22_1(X10))=X10|~(aElementOf0(X10,slsdtgt0(xb))))))&((((~(aElement0(X9))|~(sdtasdt0(xa,X9)=X7))|aElementOf0(X7,slsdtgt0(xa)))&((aElement0(esk21_1(X7))|~(aElementOf0(X7,slsdtgt0(xa))))&(sdtasdt0(xa,esk21_1(X7))=X7|~(aElementOf0(X7,slsdtgt0(xa))))))&(((((~(aElement0(X6))|aElementOf0(sdtasdt0(X6,X4),xI))|~(aElementOf0(X4,xI)))&((~(aElementOf0(X5,xI))|aElementOf0(sdtpldt0(X4,X5),xI))|~(aElementOf0(X4,xI))))&aSet0(xI))&aIdeal0(xI)))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(distribute,[status(thm)],[236])).
% cnf(240,plain,(aSet0(xI)),inference(split_conjunct,[status(thm)],[237])).
% fof(283, plain,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((![X2]:![X3]:((~(aElementOf0(X2,slsdtgt0(xa)))|~(aElementOf0(X3,slsdtgt0(xb))))|~(sdtpldt0(X2,X3)=X1))&~(aElementOf0(X1,xI)))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[53])).
% fof(284, plain,(((?[X4]:?[X5]:((aElementOf0(X4,slsdtgt0(xa))&aElementOf0(X5,slsdtgt0(xb)))&sdtpldt0(X4,X5)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X6]:(((![X7]:![X8]:((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[283])).
% fof(285, plain,(((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X6]:(((![X7]:![X8]:((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))),inference(skolemize,[status(esa)],[284])).
% fof(286, plain,![X6]:![X7]:![X8]:((((((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))&((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))),inference(shift_quantors,[status(thm)],[285])).
% fof(287, plain,![X6]:![X7]:![X8]:((((((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))&((~(aElementOf0(X6,xI))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu)))))&((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))),inference(distribute,[status(thm)],[286])).
% cnf(289,plain,(aElementOf0(xu,xI)),inference(split_conjunct,[status(thm)],[287])).
% fof(319, plain,(![X1]:(~(aElement0(X1))|~(sdtasdt0(xu,X1)=xb))&~(doDivides0(xu,xb))),inference(fof_nnf,[status(thm)],[33])).
% fof(320, plain,(![X2]:(~(aElement0(X2))|~(sdtasdt0(xu,X2)=xb))&~(doDivides0(xu,xb))),inference(variable_rename,[status(thm)],[319])).
% fof(321, plain,![X2]:((~(aElement0(X2))|~(sdtasdt0(xu,X2)=xb))&~(doDivides0(xu,xb))),inference(shift_quantors,[status(thm)],[320])).
% cnf(323,plain,(sdtasdt0(xu,X1)!=xb|~aElement0(X1)),inference(split_conjunct,[status(thm)],[321])).
% cnf(325,plain,(xb=sdtpldt0(sdtasdt0(xq,xu),xr)),inference(split_conjunct,[status(thm)],[34])).
% cnf(327,plain,(aElement0(xq)),inference(split_conjunct,[status(thm)],[34])).
% cnf(395,negated_conjecture,(xr=sz00),inference(split_conjunct,[status(thm)],[58])).
% cnf(404,plain,(sdtpldt0(sdtasdt0(xq,xu),sz00)=xb),inference(rw,[status(thm)],[325,395,theory(equality)])).
% cnf(426,plain,(xb=sdtasdt0(xq,xu)|~aElement0(sdtasdt0(xq,xu))),inference(spm,[status(thm)],[76,404,theory(equality)])).
% cnf(550,plain,(aElement0(xu)|~aSet0(xI)),inference(spm,[status(thm)],[99,289,theory(equality)])).
% cnf(557,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[550,240,theory(equality)])).
% cnf(558,plain,(aElement0(xu)),inference(cn,[status(thm)],[557,theory(equality)])).
% cnf(592,plain,(sdtasdt0(X1,xu)!=xb|~aElement0(X1)|~aElement0(xu)),inference(spm,[status(thm)],[323,79,theory(equality)])).
% cnf(2412,plain,(sdtasdt0(X1,xu)!=xb|~aElement0(X1)|$false),inference(rw,[status(thm)],[592,558,theory(equality)])).
% cnf(2413,plain,(sdtasdt0(X1,xu)!=xb|~aElement0(X1)),inference(cn,[status(thm)],[2412,theory(equality)])).
% cnf(2739,plain,(sdtasdt0(xq,xu)=xb|~aElement0(xu)|~aElement0(xq)),inference(spm,[status(thm)],[426,65,theory(equality)])).
% cnf(2746,plain,(sdtasdt0(xq,xu)=xb|$false|~aElement0(xq)),inference(rw,[status(thm)],[2739,558,theory(equality)])).
% cnf(2747,plain,(sdtasdt0(xq,xu)=xb|$false|$false),inference(rw,[status(thm)],[2746,327,theory(equality)])).
% cnf(2748,plain,(sdtasdt0(xq,xu)=xb),inference(cn,[status(thm)],[2747,theory(equality)])).
% cnf(2806,plain,(~aElement0(xq)),inference(spm,[status(thm)],[2413,2748,theory(equality)])).
% cnf(2887,plain,($false),inference(rw,[status(thm)],[2806,327,theory(equality)])).
% cnf(2888,plain,($false),inference(cn,[status(thm)],[2887,theory(equality)])).
% cnf(2889,plain,($false),2888,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 428
% # ...of these trivial : 7
% # ...subsumed : 27
% # ...remaining for further processing: 394
% # Other redundant clauses eliminated : 29
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 1087
% # ...of the previous two non-trivial : 957
% # Contextual simplify-reflections : 6
% # Paramodulations : 1047
% # Factorizations : 0
% # Equation resolutions : 40
% # Current number of processed clauses: 202
% # Positive orientable unit clauses: 52
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 141
% # Current number of unprocessed clauses: 880
% # ...number of literals in the above : 3949
% # Clause-clause subsumption calls (NU) : 699
% # Rec. Clause-clause subsumption calls : 313
% # Unit Clause-clause subsumption calls : 74
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 223 leaves, 1.25+/-0.942 terms/leaf
% # Paramod-from index: 115 leaves, 1.04+/-0.204 terms/leaf
% # Paramod-into index: 202 leaves, 1.12+/-0.466 terms/leaf
% # -------------------------------------------------
% # User time : 0.090 s
% # System time : 0.004 s
% # Total time : 0.094 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.31 WC
% FINAL PrfWatch: 0.22 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP16422/RNG119+4.tptp
%
%------------------------------------------------------------------------------