TSTP Solution File: NUM604+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM604+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 : art03.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 20:35:21 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP15087/NUM604+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15087/NUM604+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15087/NUM604+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 15183
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:((aSet0(X1)&isCountable0(X1))=>~(isFinite0(X1))),file('/tmp/SRASS.s.p', mCountNFin)).
% fof(2, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(6, axiom,![X1]:![X2]:![X3]:(((aSet0(X1)&aSet0(X2))&aSet0(X3))=>((aSubsetOf0(X1,X2)&aSubsetOf0(X2,X3))=>aSubsetOf0(X1,X3))),file('/tmp/SRASS.s.p', mSubTrans)).
% fof(8, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(9, axiom,aElementOf0(sz00,szNzAzT0),file('/tmp/SRASS.s.p', mZeroNum)).
% fof(32, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(39, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))),file('/tmp/SRASS.s.p', m__3671)).
% fof(48, axiom,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X1]:(aElementOf0(X1,szNzAzT0)=>sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1)))),file('/tmp/SRASS.s.p', m__4660)).
% fof(56, axiom,(aElementOf0(xi,szNzAzT0)&sdtlpdtrp0(xe,xi)=xx),file('/tmp/SRASS.s.p', m__5034)).
% fof(57, axiom,aSubsetOf0(sdtlpdtrp0(xN,xi),xS),file('/tmp/SRASS.s.p', m__5045)).
% fof(63, axiom,![X1]:((aSubsetOf0(X1,szNzAzT0)&~(X1=slcrc0))=>![X2]:(X2=szmzizndt0(X1)<=>(aElementOf0(X2,X1)&![X3]:(aElementOf0(X3,X1)=>sdtlseqdt0(X2,X3))))),file('/tmp/SRASS.s.p', mDefMin)).
% fof(68, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>![X2]:(X2=slbdtrb0(X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)<=>(aElementOf0(X3,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X3),X1)))))),file('/tmp/SRASS.s.p', mDefSeg)).
% fof(94, axiom,isFinite0(slcrc0),file('/tmp/SRASS.s.p', mEmpFin)).
% fof(97, axiom,slbdtrb0(sz00)=slcrc0,file('/tmp/SRASS.s.p', mSegZero)).
% fof(101, conjecture,aElementOf0(xx,xS),file('/tmp/SRASS.s.p', m__)).
% fof(102, negated_conjecture,~(aElementOf0(xx,xS)),inference(assume_negation,[status(cth)],[101])).
% fof(103, plain,![X1]:((aSet0(X1)&isCountable0(X1))=>~(isFinite0(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(115, negated_conjecture,~(aElementOf0(xx,xS)),inference(fof_simplification,[status(thm)],[102,theory(equality)])).
% fof(116, plain,![X1]:((~(aSet0(X1))|~(isCountable0(X1)))|~(isFinite0(X1))),inference(fof_nnf,[status(thm)],[103])).
% fof(117, plain,![X2]:((~(aSet0(X2))|~(isCountable0(X2)))|~(isFinite0(X2))),inference(variable_rename,[status(thm)],[116])).
% cnf(118,plain,(~isFinite0(X1)|~isCountable0(X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[117])).
% fof(119, plain,![X1]:(~(aSet0(X1))|![X2]:((~(aSubsetOf0(X2,X1))|(aSet0(X2)&![X3]:(~(aElementOf0(X3,X2))|aElementOf0(X3,X1))))&((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,X1))))|aSubsetOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(120, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|?[X7]:(aElementOf0(X7,X5)&~(aElementOf0(X7,X4))))|aSubsetOf0(X5,X4)))),inference(variable_rename,[status(thm)],[119])).
% fof(121, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[120])).
% fof(122, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[121])).
% fof(123, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk1_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk1_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[122])).
% cnf(126,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[123])).
% cnf(127,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[123])).
% fof(138, plain,![X1]:![X2]:![X3]:(((~(aSet0(X1))|~(aSet0(X2)))|~(aSet0(X3)))|((~(aSubsetOf0(X1,X2))|~(aSubsetOf0(X2,X3)))|aSubsetOf0(X1,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(139, plain,![X4]:![X5]:![X6]:(((~(aSet0(X4))|~(aSet0(X5)))|~(aSet0(X6)))|((~(aSubsetOf0(X4,X5))|~(aSubsetOf0(X5,X6)))|aSubsetOf0(X4,X6))),inference(variable_rename,[status(thm)],[138])).
% cnf(140,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2)|~aSet0(X3)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[139])).
% cnf(146,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(147,plain,(aElementOf0(sz00,szNzAzT0)),inference(split_conjunct,[status(thm)],[9])).
% cnf(242,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[32])).
% fof(268, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))),inference(fof_nnf,[status(thm)],[39])).
% fof(269, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X2)))),inference(variable_rename,[status(thm)],[268])).
% fof(270, plain,![X2]:((aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)|~(aElementOf0(X2,szNzAzT0)))&(isCountable0(sdtlpdtrp0(xN,X2))|~(aElementOf0(X2,szNzAzT0)))),inference(distribute,[status(thm)],[269])).
% cnf(271,plain,(isCountable0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[270])).
% fof(315, plain,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X1]:(~(aElementOf0(X1,szNzAzT0))|sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1)))),inference(fof_nnf,[status(thm)],[48])).
% fof(316, plain,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X2]:(~(aElementOf0(X2,szNzAzT0))|sdtlpdtrp0(xe,X2)=szmzizndt0(sdtlpdtrp0(xN,X2)))),inference(variable_rename,[status(thm)],[315])).
% fof(317, plain,![X2]:((~(aElementOf0(X2,szNzAzT0))|sdtlpdtrp0(xe,X2)=szmzizndt0(sdtlpdtrp0(xN,X2)))&(aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)),inference(shift_quantors,[status(thm)],[316])).
% cnf(320,plain,(sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[317])).
% cnf(342,plain,(sdtlpdtrp0(xe,xi)=xx),inference(split_conjunct,[status(thm)],[56])).
% cnf(343,plain,(aElementOf0(xi,szNzAzT0)),inference(split_conjunct,[status(thm)],[56])).
% cnf(344,plain,(aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),inference(split_conjunct,[status(thm)],[57])).
% fof(376, plain,![X1]:((~(aSubsetOf0(X1,szNzAzT0))|X1=slcrc0)|![X2]:((~(X2=szmzizndt0(X1))|(aElementOf0(X2,X1)&![X3]:(~(aElementOf0(X3,X1))|sdtlseqdt0(X2,X3))))&((~(aElementOf0(X2,X1))|?[X3]:(aElementOf0(X3,X1)&~(sdtlseqdt0(X2,X3))))|X2=szmzizndt0(X1)))),inference(fof_nnf,[status(thm)],[63])).
% fof(377, plain,![X4]:((~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)|![X5]:((~(X5=szmzizndt0(X4))|(aElementOf0(X5,X4)&![X6]:(~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))))&((~(aElementOf0(X5,X4))|?[X7]:(aElementOf0(X7,X4)&~(sdtlseqdt0(X5,X7))))|X5=szmzizndt0(X4)))),inference(variable_rename,[status(thm)],[376])).
% fof(378, plain,![X4]:((~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)|![X5]:((~(X5=szmzizndt0(X4))|(aElementOf0(X5,X4)&![X6]:(~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))))&((~(aElementOf0(X5,X4))|(aElementOf0(esk17_2(X4,X5),X4)&~(sdtlseqdt0(X5,esk17_2(X4,X5)))))|X5=szmzizndt0(X4)))),inference(skolemize,[status(esa)],[377])).
% fof(379, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))&aElementOf0(X5,X4))|~(X5=szmzizndt0(X4)))&((~(aElementOf0(X5,X4))|(aElementOf0(esk17_2(X4,X5),X4)&~(sdtlseqdt0(X5,esk17_2(X4,X5)))))|X5=szmzizndt0(X4)))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)),inference(shift_quantors,[status(thm)],[378])).
% fof(380, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))|~(X5=szmzizndt0(X4)))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0))&((aElementOf0(X5,X4)|~(X5=szmzizndt0(X4)))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)))&((((aElementOf0(esk17_2(X4,X5),X4)|~(aElementOf0(X5,X4)))|X5=szmzizndt0(X4))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0))&(((~(sdtlseqdt0(X5,esk17_2(X4,X5)))|~(aElementOf0(X5,X4)))|X5=szmzizndt0(X4))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)))),inference(distribute,[status(thm)],[379])).
% cnf(383,plain,(X1=slcrc0|aElementOf0(X2,X1)|~aSubsetOf0(X1,szNzAzT0)|X2!=szmzizndt0(X1)),inference(split_conjunct,[status(thm)],[380])).
% fof(405, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|![X2]:((~(X2=slbdtrb0(X1))|(aSet0(X2)&![X3]:((~(aElementOf0(X3,X2))|(aElementOf0(X3,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X3),X1)))&((~(aElementOf0(X3,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X3),X1)))|aElementOf0(X3,X2)))))&((~(aSet0(X2))|?[X3]:((~(aElementOf0(X3,X2))|(~(aElementOf0(X3,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X3),X1))))&(aElementOf0(X3,X2)|(aElementOf0(X3,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X3),X1)))))|X2=slbdtrb0(X1)))),inference(fof_nnf,[status(thm)],[68])).
% fof(406, plain,![X4]:(~(aElementOf0(X4,szNzAzT0))|![X5]:((~(X5=slbdtrb0(X4))|(aSet0(X5)&![X6]:((~(aElementOf0(X6,X5))|(aElementOf0(X6,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X6),X4)))&((~(aElementOf0(X6,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X6),X4)))|aElementOf0(X6,X5)))))&((~(aSet0(X5))|?[X7]:((~(aElementOf0(X7,X5))|(~(aElementOf0(X7,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X7),X4))))&(aElementOf0(X7,X5)|(aElementOf0(X7,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X7),X4)))))|X5=slbdtrb0(X4)))),inference(variable_rename,[status(thm)],[405])).
% fof(407, plain,![X4]:(~(aElementOf0(X4,szNzAzT0))|![X5]:((~(X5=slbdtrb0(X4))|(aSet0(X5)&![X6]:((~(aElementOf0(X6,X5))|(aElementOf0(X6,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X6),X4)))&((~(aElementOf0(X6,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X6),X4)))|aElementOf0(X6,X5)))))&((~(aSet0(X5))|((~(aElementOf0(esk19_2(X4,X5),X5))|(~(aElementOf0(esk19_2(X4,X5),szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(esk19_2(X4,X5)),X4))))&(aElementOf0(esk19_2(X4,X5),X5)|(aElementOf0(esk19_2(X4,X5),szNzAzT0)&sdtlseqdt0(szszuzczcdt0(esk19_2(X4,X5)),X4)))))|X5=slbdtrb0(X4)))),inference(skolemize,[status(esa)],[406])).
% fof(408, plain,![X4]:![X5]:![X6]:((((((~(aElementOf0(X6,X5))|(aElementOf0(X6,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X6),X4)))&((~(aElementOf0(X6,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X6),X4)))|aElementOf0(X6,X5)))&aSet0(X5))|~(X5=slbdtrb0(X4)))&((~(aSet0(X5))|((~(aElementOf0(esk19_2(X4,X5),X5))|(~(aElementOf0(esk19_2(X4,X5),szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(esk19_2(X4,X5)),X4))))&(aElementOf0(esk19_2(X4,X5),X5)|(aElementOf0(esk19_2(X4,X5),szNzAzT0)&sdtlseqdt0(szszuzczcdt0(esk19_2(X4,X5)),X4)))))|X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0))),inference(shift_quantors,[status(thm)],[407])).
% fof(409, plain,![X4]:![X5]:![X6]:(((((((aElementOf0(X6,szNzAzT0)|~(aElementOf0(X6,X5)))|~(X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0)))&(((sdtlseqdt0(szszuzczcdt0(X6),X4)|~(aElementOf0(X6,X5)))|~(X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0))))&((((~(aElementOf0(X6,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X6),X4)))|aElementOf0(X6,X5))|~(X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0))))&((aSet0(X5)|~(X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0))))&(((((~(aElementOf0(esk19_2(X4,X5),X5))|(~(aElementOf0(esk19_2(X4,X5),szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(esk19_2(X4,X5)),X4))))|~(aSet0(X5)))|X5=slbdtrb0(X4))|~(aElementOf0(X4,szNzAzT0)))&(((((aElementOf0(esk19_2(X4,X5),szNzAzT0)|aElementOf0(esk19_2(X4,X5),X5))|~(aSet0(X5)))|X5=slbdtrb0(X4))|~(aElementOf0(X4,szNzAzT0)))&((((sdtlseqdt0(szszuzczcdt0(esk19_2(X4,X5)),X4)|aElementOf0(esk19_2(X4,X5),X5))|~(aSet0(X5)))|X5=slbdtrb0(X4))|~(aElementOf0(X4,szNzAzT0)))))),inference(distribute,[status(thm)],[408])).
% cnf(413,plain,(aSet0(X2)|~aElementOf0(X1,szNzAzT0)|X2!=slbdtrb0(X1)),inference(split_conjunct,[status(thm)],[409])).
% cnf(550,plain,(isFinite0(slcrc0)),inference(split_conjunct,[status(thm)],[94])).
% cnf(556,plain,(slbdtrb0(sz00)=slcrc0),inference(split_conjunct,[status(thm)],[97])).
% cnf(564,negated_conjecture,(~aElementOf0(xx,xS)),inference(split_conjunct,[status(thm)],[115])).
% cnf(578,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X3)|~aSet0(X2)),inference(csr,[status(thm)],[140,126])).
% cnf(579,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2)),inference(csr,[status(thm)],[578,126])).
% cnf(609,plain,(~isCountable0(slcrc0)|~aSet0(slcrc0)),inference(spm,[status(thm)],[118,550,theory(equality)])).
% cnf(646,plain,(aSet0(xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[126,242,theory(equality)])).
% cnf(650,plain,(aSet0(xS)|$false),inference(rw,[status(thm)],[646,146,theory(equality)])).
% cnf(651,plain,(aSet0(xS)),inference(cn,[status(thm)],[650,theory(equality)])).
% cnf(672,plain,(aSet0(slbdtrb0(X1))|~aElementOf0(X1,szNzAzT0)),inference(er,[status(thm)],[413,theory(equality)])).
% cnf(785,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtlpdtrp0(xN,xi))|~aSet0(xS)),inference(spm,[status(thm)],[127,344,theory(equality)])).
% cnf(806,plain,(slcrc0=X1|aElementOf0(szmzizndt0(X1),X1)|~aSubsetOf0(X1,szNzAzT0)),inference(er,[status(thm)],[383,theory(equality)])).
% cnf(904,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[579,242,theory(equality)])).
% cnf(911,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xS)|$false),inference(rw,[status(thm)],[904,146,theory(equality)])).
% cnf(912,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xS)),inference(cn,[status(thm)],[911,theory(equality)])).
% cnf(2034,plain,(aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)),inference(spm,[status(thm)],[912,344,theory(equality)])).
% cnf(2092,plain,(aSet0(slcrc0)|~aElementOf0(sz00,szNzAzT0)),inference(spm,[status(thm)],[672,556,theory(equality)])).
% cnf(2093,plain,(aSet0(slcrc0)|$false),inference(rw,[status(thm)],[2092,147,theory(equality)])).
% cnf(2094,plain,(aSet0(slcrc0)),inference(cn,[status(thm)],[2093,theory(equality)])).
% cnf(2095,plain,(~isCountable0(slcrc0)|$false),inference(rw,[status(thm)],[609,2094,theory(equality)])).
% cnf(2096,plain,(~isCountable0(slcrc0)),inference(cn,[status(thm)],[2095,theory(equality)])).
% cnf(2679,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtlpdtrp0(xN,xi))|$false),inference(rw,[status(thm)],[785,651,theory(equality)])).
% cnf(2680,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtlpdtrp0(xN,xi))),inference(cn,[status(thm)],[2679,theory(equality)])).
% cnf(2688,plain,(aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS)|slcrc0=sdtlpdtrp0(xN,xi)|~aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)),inference(spm,[status(thm)],[2680,806,theory(equality)])).
% cnf(2699,plain,(aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS)|slcrc0=sdtlpdtrp0(xN,xi)|$false),inference(rw,[status(thm)],[2688,2034,theory(equality)])).
% cnf(2700,plain,(aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS)|slcrc0=sdtlpdtrp0(xN,xi)),inference(cn,[status(thm)],[2699,theory(equality)])).
% cnf(2776,plain,(sdtlpdtrp0(xN,xi)=slcrc0|aElementOf0(sdtlpdtrp0(xe,xi),xS)|~aElementOf0(xi,szNzAzT0)),inference(spm,[status(thm)],[2700,320,theory(equality)])).
% cnf(2791,plain,(sdtlpdtrp0(xN,xi)=slcrc0|aElementOf0(xx,xS)|~aElementOf0(xi,szNzAzT0)),inference(rw,[status(thm)],[2776,342,theory(equality)])).
% cnf(2792,plain,(sdtlpdtrp0(xN,xi)=slcrc0|aElementOf0(xx,xS)|$false),inference(rw,[status(thm)],[2791,343,theory(equality)])).
% cnf(2793,plain,(sdtlpdtrp0(xN,xi)=slcrc0|aElementOf0(xx,xS)),inference(cn,[status(thm)],[2792,theory(equality)])).
% cnf(2794,plain,(sdtlpdtrp0(xN,xi)=slcrc0),inference(sr,[status(thm)],[2793,564,theory(equality)])).
% cnf(2797,plain,(isCountable0(slcrc0)|~aElementOf0(xi,szNzAzT0)),inference(spm,[status(thm)],[271,2794,theory(equality)])).
% cnf(2829,plain,(isCountable0(slcrc0)|$false),inference(rw,[status(thm)],[2797,343,theory(equality)])).
% cnf(2830,plain,(isCountable0(slcrc0)),inference(cn,[status(thm)],[2829,theory(equality)])).
% cnf(2831,plain,($false),inference(sr,[status(thm)],[2830,2096,theory(equality)])).
% cnf(2832,plain,($false),2831,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 647
% # ...of these trivial : 6
% # ...subsumed : 99
% # ...remaining for further processing: 542
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 9
% # Generated clauses : 1257
% # ...of the previous two non-trivial : 1167
% # Contextual simplify-reflections : 94
% # Paramodulations : 1213
% # Factorizations : 0
% # Equation resolutions : 44
% # Current number of processed clauses: 327
% # Positive orientable unit clauses: 63
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 22
% # Non-unit-clauses : 242
% # Current number of unprocessed clauses: 866
% # ...number of literals in the above : 4791
% # Clause-clause subsumption calls (NU) : 4056
% # Rec. Clause-clause subsumption calls : 1386
% # Unit Clause-clause subsumption calls : 1165
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 347 leaves, 1.29+/-0.894 terms/leaf
% # Paramod-from index: 167 leaves, 1.01+/-0.109 terms/leaf
% # Paramod-into index: 302 leaves, 1.17+/-0.569 terms/leaf
% # -------------------------------------------------
% # User time : 0.133 s
% # System time : 0.009 s
% # Total time : 0.142 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.28 CPU 0.36 WC
% FINAL PrfWatch: 0.28 CPU 0.36 WC
% SZS output end Solution for /tmp/SystemOnTPTP15087/NUM604+1.tptp
%
%------------------------------------------------------------------------------