TSTP Solution File: RNG126+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG126+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 : 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 22:54:09 EST 2010
% Result : Theorem 4.33s
% Output : Solution 4.33s
% 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/SystemOnTPTP26519/RNG126+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26519/RNG126+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26519/RNG126+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 26651
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(aElement0(X1)=>![X2]:(aDivisorOf0(X2,X1)<=>(aElement0(X2)&doDivides0(X2,X1)))),file('/tmp/SRASS.s.p', mDefDvs)).
% fof(4, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>![X3]:(aGcdOfAnd0(X3,X1,X2)<=>((aDivisorOf0(X3,X1)&aDivisorOf0(X3,X2))&![X4]:((aDivisorOf0(X4,X1)&aDivisorOf0(X4,X2))=>doDivides0(X4,X3))))),file('/tmp/SRASS.s.p', mDefGCD)).
% fof(6, axiom,(aElement0(xa)&aElement0(xb)),file('/tmp/SRASS.s.p', m__2091)).
% fof(8, axiom,aGcdOfAnd0(xc,xa,xb),file('/tmp/SRASS.s.p', m__2129)).
% fof(9, axiom,(aIdeal0(xI)&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(12, 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(13, axiom,(aDivisorOf0(xu,xa)&aDivisorOf0(xu,xb)),file('/tmp/SRASS.s.p', m__2373)).
% fof(14, axiom,doDivides0(xu,xc),file('/tmp/SRASS.s.p', m__2744)).
% fof(18, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aElement0(X3)&sdtasdt0(X1,X3)=X2))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(27, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(37, 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(48, conjecture,aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__)).
% fof(49, negated_conjecture,~(aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))),inference(assume_negation,[status(cth)],[48])).
% fof(50, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(55, negated_conjecture,~(aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))),inference(fof_simplification,[status(thm)],[49,theory(equality)])).
% fof(60, plain,![X1]:(~(aElement0(X1))|![X2]:((~(aDivisorOf0(X2,X1))|(aElement0(X2)&doDivides0(X2,X1)))&((~(aElement0(X2))|~(doDivides0(X2,X1)))|aDivisorOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(61, plain,![X3]:(~(aElement0(X3))|![X4]:((~(aDivisorOf0(X4,X3))|(aElement0(X4)&doDivides0(X4,X3)))&((~(aElement0(X4))|~(doDivides0(X4,X3)))|aDivisorOf0(X4,X3)))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X3]:![X4]:(((~(aDivisorOf0(X4,X3))|(aElement0(X4)&doDivides0(X4,X3)))&((~(aElement0(X4))|~(doDivides0(X4,X3)))|aDivisorOf0(X4,X3)))|~(aElement0(X3))),inference(shift_quantors,[status(thm)],[61])).
% fof(63, plain,![X3]:![X4]:((((aElement0(X4)|~(aDivisorOf0(X4,X3)))|~(aElement0(X3)))&((doDivides0(X4,X3)|~(aDivisorOf0(X4,X3)))|~(aElement0(X3))))&(((~(aElement0(X4))|~(doDivides0(X4,X3)))|aDivisorOf0(X4,X3))|~(aElement0(X3)))),inference(distribute,[status(thm)],[62])).
% cnf(66,plain,(aElement0(X2)|~aElement0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(67, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|![X3]:((~(aGcdOfAnd0(X3,X1,X2))|((aDivisorOf0(X3,X1)&aDivisorOf0(X3,X2))&![X4]:((~(aDivisorOf0(X4,X1))|~(aDivisorOf0(X4,X2)))|doDivides0(X4,X3))))&(((~(aDivisorOf0(X3,X1))|~(aDivisorOf0(X3,X2)))|?[X4]:((aDivisorOf0(X4,X1)&aDivisorOf0(X4,X2))&~(doDivides0(X4,X3))))|aGcdOfAnd0(X3,X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(68, plain,![X5]:![X6]:((~(aElement0(X5))|~(aElement0(X6)))|![X7]:((~(aGcdOfAnd0(X7,X5,X6))|((aDivisorOf0(X7,X5)&aDivisorOf0(X7,X6))&![X8]:((~(aDivisorOf0(X8,X5))|~(aDivisorOf0(X8,X6)))|doDivides0(X8,X7))))&(((~(aDivisorOf0(X7,X5))|~(aDivisorOf0(X7,X6)))|?[X9]:((aDivisorOf0(X9,X5)&aDivisorOf0(X9,X6))&~(doDivides0(X9,X7))))|aGcdOfAnd0(X7,X5,X6)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X5]:![X6]:((~(aElement0(X5))|~(aElement0(X6)))|![X7]:((~(aGcdOfAnd0(X7,X5,X6))|((aDivisorOf0(X7,X5)&aDivisorOf0(X7,X6))&![X8]:((~(aDivisorOf0(X8,X5))|~(aDivisorOf0(X8,X6)))|doDivides0(X8,X7))))&(((~(aDivisorOf0(X7,X5))|~(aDivisorOf0(X7,X6)))|((aDivisorOf0(esk1_3(X5,X6,X7),X5)&aDivisorOf0(esk1_3(X5,X6,X7),X6))&~(doDivides0(esk1_3(X5,X6,X7),X7))))|aGcdOfAnd0(X7,X5,X6)))),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aDivisorOf0(X8,X5))|~(aDivisorOf0(X8,X6)))|doDivides0(X8,X7))&(aDivisorOf0(X7,X5)&aDivisorOf0(X7,X6)))|~(aGcdOfAnd0(X7,X5,X6)))&(((~(aDivisorOf0(X7,X5))|~(aDivisorOf0(X7,X6)))|((aDivisorOf0(esk1_3(X5,X6,X7),X5)&aDivisorOf0(esk1_3(X5,X6,X7),X6))&~(doDivides0(esk1_3(X5,X6,X7),X7))))|aGcdOfAnd0(X7,X5,X6)))|(~(aElement0(X5))|~(aElement0(X6)))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aDivisorOf0(X8,X5))|~(aDivisorOf0(X8,X6)))|doDivides0(X8,X7))|~(aGcdOfAnd0(X7,X5,X6)))|(~(aElement0(X5))|~(aElement0(X6))))&(((aDivisorOf0(X7,X5)|~(aGcdOfAnd0(X7,X5,X6)))|(~(aElement0(X5))|~(aElement0(X6))))&((aDivisorOf0(X7,X6)|~(aGcdOfAnd0(X7,X5,X6)))|(~(aElement0(X5))|~(aElement0(X6))))))&(((((aDivisorOf0(esk1_3(X5,X6,X7),X5)|(~(aDivisorOf0(X7,X5))|~(aDivisorOf0(X7,X6))))|aGcdOfAnd0(X7,X5,X6))|(~(aElement0(X5))|~(aElement0(X6))))&(((aDivisorOf0(esk1_3(X5,X6,X7),X6)|(~(aDivisorOf0(X7,X5))|~(aDivisorOf0(X7,X6))))|aGcdOfAnd0(X7,X5,X6))|(~(aElement0(X5))|~(aElement0(X6)))))&(((~(doDivides0(esk1_3(X5,X6,X7),X7))|(~(aDivisorOf0(X7,X5))|~(aDivisorOf0(X7,X6))))|aGcdOfAnd0(X7,X5,X6))|(~(aElement0(X5))|~(aElement0(X6)))))),inference(distribute,[status(thm)],[70])).
% cnf(76,plain,(aDivisorOf0(X3,X2)|~aElement0(X1)|~aElement0(X2)|~aGcdOfAnd0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[71])).
% cnf(81,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[6])).
% cnf(82,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[6])).
% cnf(84,plain,(aGcdOfAnd0(xc,xa,xb)),inference(split_conjunct,[status(thm)],[8])).
% cnf(85,plain,(xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(split_conjunct,[status(thm)],[9])).
% cnf(86,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[9])).
% fof(95, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((~(aElementOf0(X1,xI))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[50])).
% fof(96, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X2]:((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[95])).
% fof(97, plain,![X2]:(((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))&(aElementOf0(xu,xI)&~(xu=sz00))),inference(shift_quantors,[status(thm)],[96])).
% cnf(99,plain,(aElementOf0(xu,xI)),inference(split_conjunct,[status(thm)],[97])).
% cnf(101,plain,(aDivisorOf0(xu,xb)),inference(split_conjunct,[status(thm)],[13])).
% cnf(103,plain,(doDivides0(xu,xc)),inference(split_conjunct,[status(thm)],[14])).
% fof(126, 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)],[18])).
% fof(127, 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)],[126])).
% fof(128, plain,![X4]:![X5]:((~(aElement0(X4))|~(aElement0(X5)))|((~(doDivides0(X4,X5))|(aElement0(esk7_2(X4,X5))&sdtasdt0(X4,esk7_2(X4,X5))=X5))&(![X7]:(~(aElement0(X7))|~(sdtasdt0(X4,X7)=X5))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[127])).
% fof(129, plain,![X4]:![X5]:![X7]:((((~(aElement0(X7))|~(sdtasdt0(X4,X7)=X5))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aElement0(esk7_2(X4,X5))&sdtasdt0(X4,esk7_2(X4,X5))=X5)))|(~(aElement0(X4))|~(aElement0(X5)))),inference(shift_quantors,[status(thm)],[128])).
% fof(130, plain,![X4]:![X5]:![X7]:((((~(aElement0(X7))|~(sdtasdt0(X4,X7)=X5))|doDivides0(X4,X5))|(~(aElement0(X4))|~(aElement0(X5))))&(((aElement0(esk7_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aElement0(X4))|~(aElement0(X5))))&((sdtasdt0(X4,esk7_2(X4,X5))=X5|~(doDivides0(X4,X5)))|(~(aElement0(X4))|~(aElement0(X5)))))),inference(distribute,[status(thm)],[129])).
% cnf(131,plain,(sdtasdt0(X2,esk7_2(X2,X1))=X1|~aElement0(X1)|~aElement0(X2)|~doDivides0(X2,X1)),inference(split_conjunct,[status(thm)],[130])).
% cnf(132,plain,(aElement0(esk7_2(X2,X1))|~aElement0(X1)|~aElement0(X2)|~doDivides0(X2,X1)),inference(split_conjunct,[status(thm)],[130])).
% fof(186, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[27])).
% fof(187, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[186])).
% cnf(188,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[187])).
% fof(220, 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)],[37])).
% fof(221, 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)],[220])).
% fof(222, 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(esk18_1(X4),X4)&((aElementOf0(esk19_1(X4),X4)&~(aElementOf0(sdtpldt0(esk18_1(X4),esk19_1(X4)),X4)))|(aElement0(esk20_1(X4))&~(aElementOf0(sdtasdt0(esk20_1(X4),esk18_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[221])).
% fof(223, 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(esk18_1(X4),X4)&((aElementOf0(esk19_1(X4),X4)&~(aElementOf0(sdtpldt0(esk18_1(X4),esk19_1(X4)),X4)))|(aElement0(esk20_1(X4))&~(aElementOf0(sdtasdt0(esk20_1(X4),esk18_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[222])).
% fof(224, 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(esk18_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk20_1(X4))|aElementOf0(esk19_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk20_1(X4),esk18_1(X4)),X4))|aElementOf0(esk19_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk20_1(X4))|~(aElementOf0(sdtpldt0(esk18_1(X4),esk19_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk20_1(X4),esk18_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk18_1(X4),esk19_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[223])).
% cnf(232,plain,(aElementOf0(sdtasdt0(X3,X2),X1)|~aIdeal0(X1)|~aElementOf0(X2,X1)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[224])).
% cnf(274,negated_conjecture,(~aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))),inference(split_conjunct,[status(thm)],[55])).
% cnf(275,negated_conjecture,(~aElementOf0(xc,xI)),inference(rw,[status(thm)],[274,85,theory(equality)])).
% cnf(290,plain,(aElement0(xu)|~aElement0(xb)),inference(spm,[status(thm)],[66,101,theory(equality)])).
% cnf(292,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[290,81,theory(equality)])).
% cnf(293,plain,(aElement0(xu)),inference(cn,[status(thm)],[292,theory(equality)])).
% cnf(403,plain,(aElementOf0(sdtasdt0(X2,X1),X3)|~aElementOf0(X2,X3)|~aIdeal0(X3)|~aElement0(X1)|~aElement0(X2)),inference(spm,[status(thm)],[232,188,theory(equality)])).
% cnf(421,plain,(aDivisorOf0(xc,xa)|~aElement0(xa)|~aElement0(xb)),inference(spm,[status(thm)],[76,84,theory(equality)])).
% cnf(422,plain,(aDivisorOf0(xc,xa)|$false|~aElement0(xb)),inference(rw,[status(thm)],[421,82,theory(equality)])).
% cnf(423,plain,(aDivisorOf0(xc,xa)|$false|$false),inference(rw,[status(thm)],[422,81,theory(equality)])).
% cnf(424,plain,(aDivisorOf0(xc,xa)),inference(cn,[status(thm)],[423,theory(equality)])).
% cnf(751,plain,(aElement0(xc)|~aElement0(xa)),inference(spm,[status(thm)],[66,424,theory(equality)])).
% cnf(752,plain,(aElement0(xc)|$false),inference(rw,[status(thm)],[751,82,theory(equality)])).
% cnf(753,plain,(aElement0(xc)),inference(cn,[status(thm)],[752,theory(equality)])).
% cnf(2096,plain,(aElementOf0(X2,X3)|~aElementOf0(X1,X3)|~aIdeal0(X3)|~aElement0(esk7_2(X1,X2))|~aElement0(X1)|~doDivides0(X1,X2)|~aElement0(X2)),inference(spm,[status(thm)],[403,131,theory(equality)])).
% cnf(95118,plain,(aElementOf0(X2,X3)|~aElementOf0(X1,X3)|~doDivides0(X1,X2)|~aIdeal0(X3)|~aElement0(X1)|~aElement0(X2)),inference(csr,[status(thm)],[2096,132])).
% cnf(95135,plain,(aElementOf0(xc,X1)|~aElementOf0(xu,X1)|~aIdeal0(X1)|~aElement0(xu)|~aElement0(xc)),inference(spm,[status(thm)],[95118,103,theory(equality)])).
% cnf(95193,plain,(aElementOf0(xc,X1)|~aElementOf0(xu,X1)|~aIdeal0(X1)|$false|~aElement0(xc)),inference(rw,[status(thm)],[95135,293,theory(equality)])).
% cnf(95194,plain,(aElementOf0(xc,X1)|~aElementOf0(xu,X1)|~aIdeal0(X1)|$false|$false),inference(rw,[status(thm)],[95193,753,theory(equality)])).
% cnf(95195,plain,(aElementOf0(xc,X1)|~aElementOf0(xu,X1)|~aIdeal0(X1)),inference(cn,[status(thm)],[95194,theory(equality)])).
% cnf(95660,negated_conjecture,(~aElementOf0(xu,xI)|~aIdeal0(xI)),inference(spm,[status(thm)],[275,95195,theory(equality)])).
% cnf(95821,negated_conjecture,($false|~aIdeal0(xI)),inference(rw,[status(thm)],[95660,99,theory(equality)])).
% cnf(95822,negated_conjecture,($false|$false),inference(rw,[status(thm)],[95821,86,theory(equality)])).
% cnf(95823,negated_conjecture,($false),inference(cn,[status(thm)],[95822,theory(equality)])).
% cnf(95824,negated_conjecture,($false),95823,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4777
% # ...of these trivial : 281
% # ...subsumed : 2830
% # ...remaining for further processing: 1666
% # Other redundant clauses eliminated : 41
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 107
% # Backward-rewritten : 68
% # Generated clauses : 46818
% # ...of the previous two non-trivial : 39791
% # Contextual simplify-reflections : 1219
% # Paramodulations : 46707
% # Factorizations : 0
% # Equation resolutions : 111
% # Current number of processed clauses: 1383
% # Positive orientable unit clauses: 308
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 1063
% # Current number of unprocessed clauses: 31985
% # ...number of literals in the above : 171704
% # Clause-clause subsumption calls (NU) : 60850
% # Rec. Clause-clause subsumption calls : 43997
% # Unit Clause-clause subsumption calls : 1528
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1538
% # Indexed BW rewrite successes : 54
% # Backwards rewriting index: 1296 leaves, 1.59+/-2.637 terms/leaf
% # Paramod-from index: 430 leaves, 1.87+/-3.017 terms/leaf
% # Paramod-into index: 985 leaves, 1.56+/-2.175 terms/leaf
% # -------------------------------------------------
% # User time : 1.939 s
% # System time : 0.061 s
% # Total time : 2.000 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.25 CPU 3.33 WC
% FINAL PrfWatch: 3.25 CPU 3.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP26519/RNG126+1.tptp
%
%------------------------------------------------------------------------------