TSTP Solution File: NUM601+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM601+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 20:34:16 EST 2010
% Result : Theorem 1.69s
% Output : Solution 1.69s
% 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/SystemOnTPTP21266/NUM601+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21266/NUM601+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21266/NUM601+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 21362
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(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(14, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>sdtlseqdt0(sz00,X1)),file('/tmp/SRASS.s.p', mZeroLess)).
% fof(32, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(38, axiom,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X1]:(aElementOf0(X1,szNzAzT0)=>((aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))=>(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))))))),file('/tmp/SRASS.s.p', m__3623)).
% fof(39, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))),file('/tmp/SRASS.s.p', m__3671)).
% fof(40, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(sdtlseqdt0(X2,X1)=>aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)))),file('/tmp/SRASS.s.p', m__3754)).
% 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(52, axiom,(aSet0(xO)&xO=sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),file('/tmp/SRASS.s.p', m__4891)).
% fof(54, axiom,![X1]:(aElementOf0(X1,xO)=>?[X2]:((aElementOf0(X2,szNzAzT0)&aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X2)=X1)),file('/tmp/SRASS.s.p', m__4982)).
% fof(60, 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(81, axiom,![X1]:((aSet0(X1)&isCountable0(X1))=>~(X1=slcrc0)),file('/tmp/SRASS.s.p', mCountNFin_01)).
% fof(86, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(98, conjecture,aSubsetOf0(xO,xS),file('/tmp/SRASS.s.p', m__)).
% fof(99, negated_conjecture,~(aSubsetOf0(xO,xS)),inference(assume_negation,[status(cth)],[98])).
% fof(112, negated_conjecture,~(aSubsetOf0(xO,xS)),inference(fof_simplification,[status(thm)],[99,theory(equality)])).
% fof(116, 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(117, 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)],[116])).
% fof(118, 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)],[117])).
% fof(119, 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)],[118])).
% fof(120, 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)],[119])).
% cnf(121,plain,(aSubsetOf0(X2,X1)|~aSet0(X1)|~aSet0(X2)|~aElementOf0(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(aSubsetOf0(X2,X1)|aElementOf0(esk1_2(X1,X2),X2)|~aSet0(X1)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(123,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[120])).
% cnf(124,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(143,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(144,plain,(aElementOf0(sz00,szNzAzT0)),inference(split_conjunct,[status(thm)],[9])).
% fof(162, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|sdtlseqdt0(sz00,X1)),inference(fof_nnf,[status(thm)],[14])).
% fof(163, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|sdtlseqdt0(sz00,X2)),inference(variable_rename,[status(thm)],[162])).
% cnf(164,plain,(sdtlseqdt0(sz00,X1)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[163])).
% cnf(239,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[32])).
% fof(256, plain,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X1]:(~(aElementOf0(X1,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X1))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))))))),inference(fof_nnf,[status(thm)],[38])).
% fof(257, plain,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X2]:(~(aElementOf0(X2,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))))))),inference(variable_rename,[status(thm)],[256])).
% fof(258, plain,![X2]:((~(aElementOf0(X2,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))))))&((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)),inference(shift_quantors,[status(thm)],[257])).
% fof(259, plain,![X2]:((((aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))|(~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2)))))|~(aElementOf0(X2,szNzAzT0)))&((isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2)))|(~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2)))))|~(aElementOf0(X2,szNzAzT0))))&((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)),inference(distribute,[status(thm)],[258])).
% cnf(260,plain,(sdtlpdtrp0(xN,sz00)=xS),inference(split_conjunct,[status(thm)],[259])).
% fof(265, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))),inference(fof_nnf,[status(thm)],[39])).
% fof(266, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X2)))),inference(variable_rename,[status(thm)],[265])).
% fof(267, plain,![X2]:((aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)|~(aElementOf0(X2,szNzAzT0)))&(isCountable0(sdtlpdtrp0(xN,X2))|~(aElementOf0(X2,szNzAzT0)))),inference(distribute,[status(thm)],[266])).
% cnf(268,plain,(isCountable0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(269,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[267])).
% fof(270, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(~(sdtlseqdt0(X2,X1))|aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(271, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(sdtlseqdt0(X4,X3))|aSubsetOf0(sdtlpdtrp0(xN,X3),sdtlpdtrp0(xN,X4)))),inference(variable_rename,[status(thm)],[270])).
% cnf(272,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))|~sdtlseqdt0(X2,X1)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[271])).
% fof(312, plain,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X1]:(~(aElementOf0(X1,szNzAzT0))|sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1)))),inference(fof_nnf,[status(thm)],[48])).
% fof(313, plain,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X2]:(~(aElementOf0(X2,szNzAzT0))|sdtlpdtrp0(xe,X2)=szmzizndt0(sdtlpdtrp0(xN,X2)))),inference(variable_rename,[status(thm)],[312])).
% fof(314, plain,![X2]:((~(aElementOf0(X2,szNzAzT0))|sdtlpdtrp0(xe,X2)=szmzizndt0(sdtlpdtrp0(xN,X2)))&(aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)),inference(shift_quantors,[status(thm)],[313])).
% cnf(317,plain,(sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[314])).
% cnf(328,plain,(aSet0(xO)),inference(split_conjunct,[status(thm)],[52])).
% fof(331, plain,![X1]:(~(aElementOf0(X1,xO))|?[X2]:((aElementOf0(X2,szNzAzT0)&aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X2)=X1)),inference(fof_nnf,[status(thm)],[54])).
% fof(332, plain,![X3]:(~(aElementOf0(X3,xO))|?[X4]:((aElementOf0(X4,szNzAzT0)&aElementOf0(X4,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X4)=X3)),inference(variable_rename,[status(thm)],[331])).
% fof(333, plain,![X3]:(~(aElementOf0(X3,xO))|((aElementOf0(esk14_1(X3),szNzAzT0)&aElementOf0(esk14_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,esk14_1(X3))=X3)),inference(skolemize,[status(esa)],[332])).
% fof(334, plain,![X3]:(((aElementOf0(esk14_1(X3),szNzAzT0)|~(aElementOf0(X3,xO)))&(aElementOf0(esk14_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd)))|~(aElementOf0(X3,xO))))&(sdtlpdtrp0(xe,esk14_1(X3))=X3|~(aElementOf0(X3,xO)))),inference(distribute,[status(thm)],[333])).
% cnf(335,plain,(sdtlpdtrp0(xe,esk14_1(X1))=X1|~aElementOf0(X1,xO)),inference(split_conjunct,[status(thm)],[334])).
% cnf(337,plain,(aElementOf0(esk14_1(X1),szNzAzT0)|~aElementOf0(X1,xO)),inference(split_conjunct,[status(thm)],[334])).
% fof(369, 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)],[60])).
% fof(370, 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)],[369])).
% fof(371, 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)],[370])).
% fof(372, 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)],[371])).
% fof(373, 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)],[372])).
% cnf(376,plain,(X1=slcrc0|aElementOf0(X2,X1)|~aSubsetOf0(X1,szNzAzT0)|X2!=szmzizndt0(X1)),inference(split_conjunct,[status(thm)],[373])).
% fof(503, plain,![X1]:((~(aSet0(X1))|~(isCountable0(X1)))|~(X1=slcrc0)),inference(fof_nnf,[status(thm)],[81])).
% fof(504, plain,![X2]:((~(aSet0(X2))|~(isCountable0(X2)))|~(X2=slcrc0)),inference(variable_rename,[status(thm)],[503])).
% cnf(505,plain,(X1!=slcrc0|~isCountable0(X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[504])).
% fof(522, plain,![X1]:((~(X1=slcrc0)|(aSet0(X1)&![X2]:~(aElementOf0(X2,X1))))&((~(aSet0(X1))|?[X2]:aElementOf0(X2,X1))|X1=slcrc0)),inference(fof_nnf,[status(thm)],[86])).
% fof(523, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[522])).
% fof(524, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk25_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[523])).
% fof(525, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk25_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[524])).
% fof(526, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))|~(X3=slcrc0))&(aSet0(X3)|~(X3=slcrc0)))&((~(aSet0(X3))|aElementOf0(esk25_1(X3),X3))|X3=slcrc0)),inference(distribute,[status(thm)],[525])).
% cnf(528,plain,(aSet0(X1)|X1!=slcrc0),inference(split_conjunct,[status(thm)],[526])).
% cnf(557,negated_conjecture,(~aSubsetOf0(xO,xS)),inference(split_conjunct,[status(thm)],[112])).
% cnf(623,plain,(aSet0(xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[123,239,theory(equality)])).
% cnf(625,plain,(aSet0(xS)|$false),inference(rw,[status(thm)],[623,143,theory(equality)])).
% cnf(626,plain,(aSet0(xS)),inference(cn,[status(thm)],[625,theory(equality)])).
% cnf(684,plain,(slcrc0!=sdtlpdtrp0(xN,X1)|~aSet0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[505,268,theory(equality)])).
% cnf(815,plain,(slcrc0=sdtlpdtrp0(xN,X1)|aElementOf0(X2,sdtlpdtrp0(xN,X1))|sdtlpdtrp0(xe,X1)!=X2|~aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[376,317,theory(equality)])).
% cnf(1190,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),xS)|~sdtlseqdt0(sz00,X1)|~aElementOf0(sz00,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[272,260,theory(equality)])).
% cnf(1192,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),xS)|~sdtlseqdt0(sz00,X1)|$false|~aElementOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[1190,144,theory(equality)])).
% cnf(1193,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),xS)|~sdtlseqdt0(sz00,X1)|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[1192,theory(equality)])).
% cnf(1912,plain,(sdtlpdtrp0(xN,X1)!=slcrc0|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[684,528])).
% cnf(3028,plain,(sdtlpdtrp0(xN,X1)=slcrc0|aElementOf0(X2,sdtlpdtrp0(xN,X1))|sdtlpdtrp0(xe,X1)!=X2|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[815,269])).
% cnf(3029,plain,(aElementOf0(X2,sdtlpdtrp0(xN,X1))|sdtlpdtrp0(xe,X1)!=X2|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[3028,1912])).
% cnf(5527,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),xS)|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[1193,164])).
% cnf(5535,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtlpdtrp0(xN,X2))|~aSet0(xS)|~aElementOf0(X2,szNzAzT0)),inference(spm,[status(thm)],[124,5527,theory(equality)])).
% cnf(5546,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtlpdtrp0(xN,X2))|$false|~aElementOf0(X2,szNzAzT0)),inference(rw,[status(thm)],[5535,626,theory(equality)])).
% cnf(5547,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtlpdtrp0(xN,X2))|~aElementOf0(X2,szNzAzT0)),inference(cn,[status(thm)],[5546,theory(equality)])).
% cnf(9825,plain,(aElementOf0(X1,xS)|~aElementOf0(X2,szNzAzT0)|sdtlpdtrp0(xe,X2)!=X1),inference(spm,[status(thm)],[5547,3029,theory(equality)])).
% cnf(9876,plain,(aElementOf0(X1,xS)|X2!=X1|~aElementOf0(esk14_1(X2),szNzAzT0)|~aElementOf0(X2,xO)),inference(spm,[status(thm)],[9825,335,theory(equality)])).
% cnf(9884,plain,(aElementOf0(X1,xS)|~aElementOf0(esk14_1(X1),szNzAzT0)|~aElementOf0(X1,xO)),inference(er,[status(thm)],[9876,theory(equality)])).
% cnf(9947,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,xO)),inference(csr,[status(thm)],[9884,337])).
% cnf(9953,plain,(aSubsetOf0(X1,xS)|~aSet0(X1)|~aSet0(xS)|~aElementOf0(esk1_2(xS,X1),xO)),inference(spm,[status(thm)],[121,9947,theory(equality)])).
% cnf(9975,plain,(aSubsetOf0(X1,xS)|~aSet0(X1)|$false|~aElementOf0(esk1_2(xS,X1),xO)),inference(rw,[status(thm)],[9953,626,theory(equality)])).
% cnf(9976,plain,(aSubsetOf0(X1,xS)|~aSet0(X1)|~aElementOf0(esk1_2(xS,X1),xO)),inference(cn,[status(thm)],[9975,theory(equality)])).
% cnf(10099,plain,(aSubsetOf0(xO,xS)|~aSet0(xO)|~aSet0(xS)),inference(spm,[status(thm)],[9976,122,theory(equality)])).
% cnf(10100,plain,(aSubsetOf0(xO,xS)|$false|~aSet0(xS)),inference(rw,[status(thm)],[10099,328,theory(equality)])).
% cnf(10101,plain,(aSubsetOf0(xO,xS)|$false|$false),inference(rw,[status(thm)],[10100,626,theory(equality)])).
% cnf(10102,plain,(aSubsetOf0(xO,xS)),inference(cn,[status(thm)],[10101,theory(equality)])).
% cnf(10103,plain,($false),inference(sr,[status(thm)],[10102,557,theory(equality)])).
% cnf(10104,plain,($false),10103,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2041
% # ...of these trivial : 29
% # ...subsumed : 951
% # ...remaining for further processing: 1061
% # Other redundant clauses eliminated : 19
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 72
% # Backward-rewritten : 4
% # Generated clauses : 4908
% # ...of the previous two non-trivial : 4572
% # Contextual simplify-reflections : 714
% # Paramodulations : 4829
% # Factorizations : 0
% # Equation resolutions : 77
% # Current number of processed clauses: 789
% # Positive orientable unit clauses: 77
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 55
% # Non-unit-clauses : 657
% # Current number of unprocessed clauses: 2641
% # ...number of literals in the above : 15325
% # Clause-clause subsumption calls (NU) : 28628
% # Rec. Clause-clause subsumption calls : 10471
% # Unit Clause-clause subsumption calls : 3984
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 690 leaves, 1.25+/-0.825 terms/leaf
% # Paramod-from index: 303 leaves, 1.02+/-0.150 terms/leaf
% # Paramod-into index: 599 leaves, 1.17+/-0.590 terms/leaf
% # -------------------------------------------------
% # User time : 0.442 s
% # System time : 0.016 s
% # Total time : 0.458 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.69 CPU 0.78 WC
% FINAL PrfWatch: 0.69 CPU 0.78 WC
% SZS output end Solution for /tmp/SystemOnTPTP21266/NUM601+1.tptp
%
%------------------------------------------------------------------------------