TSTP Solution File: NUM566+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM566+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art06.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:08:03 EST 2010

% Result   : Theorem 10.32s
% Output   : Solution 10.32s
% 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/SystemOnTPTP16227/NUM566+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP16227/NUM566+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16227/NUM566+3.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 16323
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.02 WC
% PrfWatch: 5.53 CPU 6.03 WC
% # Preprocessing time     : 0.538 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.17 CPU 8.03 WC
% PrfWatch: 9.17 CPU 10.04 WC
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:(aSet0(X1)=>aSubsetOf0(X1,X1)),file('/tmp/SRASS.s.p', mSubRefl)).
% fof(22, axiom,![X1]:(aFunction0(X1)=>![X2]:(aElementOf0(X2,szDzozmdt0(X1))=>aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))))),file('/tmp/SRASS.s.p', mImgRng)).
% fof(26, axiom,(((aSet0(xS)&![X1]:(aElementOf0(X1,xS)=>aElementOf0(X1,szNzAzT0)))&aSubsetOf0(xS,szNzAzT0))&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(27, axiom,((((((aFunction0(xc)&![X1]:((aElementOf0(X1,szDzozmdt0(xc))=>(((aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>aElementOf0(X2,xS)))&aSubsetOf0(X1,xS))&sbrdtbr0(X1)=xK))&((((aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>aElementOf0(X2,xS)))|aSubsetOf0(X1,xS))&sbrdtbr0(X1)=xK)=>aElementOf0(X1,szDzozmdt0(xc)))))&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc))))&![X1]:(aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))<=>?[X2]:(aElementOf0(X2,szDzozmdt0(xc))&sdtlpdtrp0(xc,X2)=X1)))&![X1]:(aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))=>aElementOf0(X1,xT)))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),file('/tmp/SRASS.s.p', m__3453)).
% fof(29, axiom,xK=sz00,file('/tmp/SRASS.s.p', m__3462)).
% fof(30, axiom,((((aSet0(slcrc0)&~(?[X1]:aElementOf0(X1,slcrc0)))&![X1]:(aElementOf0(X1,slcrc0)=>aElementOf0(X1,xS)))&aSubsetOf0(slcrc0,xS))&aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),file('/tmp/SRASS.s.p', m__3476)).
% fof(31, axiom,![X1]:(((((aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>aElementOf0(X2,xS)))|aSubsetOf0(X1,xS))&sbrdtbr0(X1)=sz00)|aElementOf0(X1,slbdtsldtrb0(xS,sz00)))=>((aSet0(slcrc0)&~(?[X2]:aElementOf0(X2,slcrc0)))&sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0))),file('/tmp/SRASS.s.p', m__3507)).
% fof(81, conjecture,?[X1]:(aElementOf0(X1,xT)&?[X2]:((((aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,xS)))|aSubsetOf0(X2,xS))&isCountable0(X2))&![X3]:(((((aSet0(X3)&![X4]:(aElementOf0(X4,X3)=>aElementOf0(X4,X2)))&aSubsetOf0(X3,X2))&sbrdtbr0(X3)=xK)&aElementOf0(X3,slbdtsldtrb0(X2,xK)))=>sdtlpdtrp0(xc,X3)=X1))),file('/tmp/SRASS.s.p', m__)).
% fof(82, negated_conjecture,~(?[X1]:(aElementOf0(X1,xT)&?[X2]:((((aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,xS)))|aSubsetOf0(X2,xS))&isCountable0(X2))&![X3]:(((((aSet0(X3)&![X4]:(aElementOf0(X4,X3)=>aElementOf0(X4,X2)))&aSubsetOf0(X3,X2))&sbrdtbr0(X3)=xK)&aElementOf0(X3,slbdtsldtrb0(X2,xK)))=>sdtlpdtrp0(xc,X3)=X1)))),inference(assume_negation,[status(cth)],[81])).
% fof(123, plain,![X1]:(~(aSet0(X1))|aSubsetOf0(X1,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(124, plain,![X2]:(~(aSet0(X2))|aSubsetOf0(X2,X2)),inference(variable_rename,[status(thm)],[123])).
% cnf(125,plain,(aSubsetOf0(X1,X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[124])).
% fof(196, plain,![X1]:(~(aFunction0(X1))|![X2]:(~(aElementOf0(X2,szDzozmdt0(X1)))|aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))))),inference(fof_nnf,[status(thm)],[22])).
% fof(197, plain,![X3]:(~(aFunction0(X3))|![X4]:(~(aElementOf0(X4,szDzozmdt0(X3)))|aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3))))),inference(variable_rename,[status(thm)],[196])).
% fof(198, plain,![X3]:![X4]:((~(aElementOf0(X4,szDzozmdt0(X3)))|aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3))))|~(aFunction0(X3))),inference(shift_quantors,[status(thm)],[197])).
% cnf(199,plain,(aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))|~aFunction0(X1)|~aElementOf0(X2,szDzozmdt0(X1))),inference(split_conjunct,[status(thm)],[198])).
% fof(212, plain,(((aSet0(xS)&![X1]:(~(aElementOf0(X1,xS))|aElementOf0(X1,szNzAzT0)))&aSubsetOf0(xS,szNzAzT0))&isCountable0(xS)),inference(fof_nnf,[status(thm)],[26])).
% fof(213, plain,(((aSet0(xS)&![X2]:(~(aElementOf0(X2,xS))|aElementOf0(X2,szNzAzT0)))&aSubsetOf0(xS,szNzAzT0))&isCountable0(xS)),inference(variable_rename,[status(thm)],[212])).
% fof(214, plain,![X2]:((((~(aElementOf0(X2,xS))|aElementOf0(X2,szNzAzT0))&aSet0(xS))&aSubsetOf0(xS,szNzAzT0))&isCountable0(xS)),inference(shift_quantors,[status(thm)],[213])).
% cnf(215,plain,(isCountable0(xS)),inference(split_conjunct,[status(thm)],[214])).
% cnf(217,plain,(aSet0(xS)),inference(split_conjunct,[status(thm)],[214])).
% fof(219, plain,((((((aFunction0(xc)&![X1]:((~(aElementOf0(X1,szDzozmdt0(xc)))|(((aSet0(X1)&![X2]:(~(aElementOf0(X2,X1))|aElementOf0(X2,xS)))&aSubsetOf0(X1,xS))&sbrdtbr0(X1)=xK))&((((~(aSet0(X1))|?[X2]:(aElementOf0(X2,X1)&~(aElementOf0(X2,xS))))&~(aSubsetOf0(X1,xS)))|~(sbrdtbr0(X1)=xK))|aElementOf0(X1,szDzozmdt0(xc)))))&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc))))&![X1]:((~(aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))))|?[X2]:(aElementOf0(X2,szDzozmdt0(xc))&sdtlpdtrp0(xc,X2)=X1))&(![X2]:(~(aElementOf0(X2,szDzozmdt0(xc)))|~(sdtlpdtrp0(xc,X2)=X1))|aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))))))&![X1]:(~(aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))))|aElementOf0(X1,xT)))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),inference(fof_nnf,[status(thm)],[27])).
% fof(220, plain,((((((aFunction0(xc)&![X3]:((~(aElementOf0(X3,szDzozmdt0(xc)))|(((aSet0(X3)&![X4]:(~(aElementOf0(X4,X3))|aElementOf0(X4,xS)))&aSubsetOf0(X3,xS))&sbrdtbr0(X3)=xK))&((((~(aSet0(X3))|?[X5]:(aElementOf0(X5,X3)&~(aElementOf0(X5,xS))))&~(aSubsetOf0(X3,xS)))|~(sbrdtbr0(X3)=xK))|aElementOf0(X3,szDzozmdt0(xc)))))&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc))))&![X6]:((~(aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))))|?[X7]:(aElementOf0(X7,szDzozmdt0(xc))&sdtlpdtrp0(xc,X7)=X6))&(![X8]:(~(aElementOf0(X8,szDzozmdt0(xc)))|~(sdtlpdtrp0(xc,X8)=X6))|aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))))))&![X9]:(~(aElementOf0(X9,sdtlcdtrc0(xc,szDzozmdt0(xc))))|aElementOf0(X9,xT)))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),inference(variable_rename,[status(thm)],[219])).
% fof(221, plain,((((((aFunction0(xc)&![X3]:((~(aElementOf0(X3,szDzozmdt0(xc)))|(((aSet0(X3)&![X4]:(~(aElementOf0(X4,X3))|aElementOf0(X4,xS)))&aSubsetOf0(X3,xS))&sbrdtbr0(X3)=xK))&((((~(aSet0(X3))|(aElementOf0(esk10_1(X3),X3)&~(aElementOf0(esk10_1(X3),xS))))&~(aSubsetOf0(X3,xS)))|~(sbrdtbr0(X3)=xK))|aElementOf0(X3,szDzozmdt0(xc)))))&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc))))&![X6]:((~(aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))))|(aElementOf0(esk11_1(X6),szDzozmdt0(xc))&sdtlpdtrp0(xc,esk11_1(X6))=X6))&(![X8]:(~(aElementOf0(X8,szDzozmdt0(xc)))|~(sdtlpdtrp0(xc,X8)=X6))|aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))))))&![X9]:(~(aElementOf0(X9,sdtlcdtrc0(xc,szDzozmdt0(xc))))|aElementOf0(X9,xT)))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),inference(skolemize,[status(esa)],[220])).
% fof(222, plain,![X3]:![X4]:![X6]:![X8]:![X9]:(((~(aElementOf0(X9,sdtlcdtrc0(xc,szDzozmdt0(xc))))|aElementOf0(X9,xT))&((((~(aElementOf0(X8,szDzozmdt0(xc)))|~(sdtlpdtrp0(xc,X8)=X6))|aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))))&(~(aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))))|(aElementOf0(esk11_1(X6),szDzozmdt0(xc))&sdtlpdtrp0(xc,esk11_1(X6))=X6)))&(((((((((~(aElementOf0(X4,X3))|aElementOf0(X4,xS))&aSet0(X3))&aSubsetOf0(X3,xS))&sbrdtbr0(X3)=xK)|~(aElementOf0(X3,szDzozmdt0(xc))))&((((~(aSet0(X3))|(aElementOf0(esk10_1(X3),X3)&~(aElementOf0(esk10_1(X3),xS))))&~(aSubsetOf0(X3,xS)))|~(sbrdtbr0(X3)=xK))|aElementOf0(X3,szDzozmdt0(xc))))&aFunction0(xc))&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc))))))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),inference(shift_quantors,[status(thm)],[221])).
% fof(223, plain,![X3]:![X4]:![X6]:![X8]:![X9]:(((~(aElementOf0(X9,sdtlcdtrc0(xc,szDzozmdt0(xc))))|aElementOf0(X9,xT))&((((~(aElementOf0(X8,szDzozmdt0(xc)))|~(sdtlpdtrp0(xc,X8)=X6))|aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc))))&((aElementOf0(esk11_1(X6),szDzozmdt0(xc))|~(aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc)))))&(sdtlpdtrp0(xc,esk11_1(X6))=X6|~(aElementOf0(X6,sdtlcdtrc0(xc,szDzozmdt0(xc)))))))&(((((((((~(aElementOf0(X4,X3))|aElementOf0(X4,xS))|~(aElementOf0(X3,szDzozmdt0(xc))))&(aSet0(X3)|~(aElementOf0(X3,szDzozmdt0(xc)))))&(aSubsetOf0(X3,xS)|~(aElementOf0(X3,szDzozmdt0(xc)))))&(sbrdtbr0(X3)=xK|~(aElementOf0(X3,szDzozmdt0(xc)))))&(((((aElementOf0(esk10_1(X3),X3)|~(aSet0(X3)))|~(sbrdtbr0(X3)=xK))|aElementOf0(X3,szDzozmdt0(xc)))&(((~(aElementOf0(esk10_1(X3),xS))|~(aSet0(X3)))|~(sbrdtbr0(X3)=xK))|aElementOf0(X3,szDzozmdt0(xc))))&((~(aSubsetOf0(X3,xS))|~(sbrdtbr0(X3)=xK))|aElementOf0(X3,szDzozmdt0(xc)))))&aFunction0(xc))&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc))))))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),inference(distribute,[status(thm)],[222])).
% cnf(226,plain,(szDzozmdt0(xc)=slbdtsldtrb0(xS,xK)),inference(split_conjunct,[status(thm)],[223])).
% cnf(227,plain,(aFunction0(xc)),inference(split_conjunct,[status(thm)],[223])).
% cnf(238,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))),inference(split_conjunct,[status(thm)],[223])).
% cnf(4213,plain,(xK=sz00),inference(split_conjunct,[status(thm)],[29])).
% fof(4214, plain,((((aSet0(slcrc0)&![X1]:~(aElementOf0(X1,slcrc0)))&![X1]:(~(aElementOf0(X1,slcrc0))|aElementOf0(X1,xS)))&aSubsetOf0(slcrc0,xS))&aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),inference(fof_nnf,[status(thm)],[30])).
% fof(4215, plain,((((aSet0(slcrc0)&![X2]:~(aElementOf0(X2,slcrc0)))&![X3]:(~(aElementOf0(X3,slcrc0))|aElementOf0(X3,xS)))&aSubsetOf0(slcrc0,xS))&aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),inference(variable_rename,[status(thm)],[4214])).
% fof(4216, plain,![X2]:![X3]:((((~(aElementOf0(X3,slcrc0))|aElementOf0(X3,xS))&(~(aElementOf0(X2,slcrc0))&aSet0(slcrc0)))&aSubsetOf0(slcrc0,xS))&aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),inference(shift_quantors,[status(thm)],[4215])).
% cnf(4217,plain,(aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),inference(split_conjunct,[status(thm)],[4216])).
% fof(4222, plain,![X1]:(((((~(aSet0(X1))|?[X2]:(aElementOf0(X2,X1)&~(aElementOf0(X2,xS))))&~(aSubsetOf0(X1,xS)))|~(sbrdtbr0(X1)=sz00))&~(aElementOf0(X1,slbdtsldtrb0(xS,sz00))))|((aSet0(slcrc0)&![X2]:~(aElementOf0(X2,slcrc0)))&sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0))),inference(fof_nnf,[status(thm)],[31])).
% fof(4223, plain,![X3]:(((((~(aSet0(X3))|?[X4]:(aElementOf0(X4,X3)&~(aElementOf0(X4,xS))))&~(aSubsetOf0(X3,xS)))|~(sbrdtbr0(X3)=sz00))&~(aElementOf0(X3,slbdtsldtrb0(xS,sz00))))|((aSet0(slcrc0)&![X5]:~(aElementOf0(X5,slcrc0)))&sdtlpdtrp0(xc,X3)=sdtlpdtrp0(xc,slcrc0))),inference(variable_rename,[status(thm)],[4222])).
% fof(4224, plain,![X3]:(((((~(aSet0(X3))|(aElementOf0(esk20_1(X3),X3)&~(aElementOf0(esk20_1(X3),xS))))&~(aSubsetOf0(X3,xS)))|~(sbrdtbr0(X3)=sz00))&~(aElementOf0(X3,slbdtsldtrb0(xS,sz00))))|((aSet0(slcrc0)&![X5]:~(aElementOf0(X5,slcrc0)))&sdtlpdtrp0(xc,X3)=sdtlpdtrp0(xc,slcrc0))),inference(skolemize,[status(esa)],[4223])).
% fof(4225, plain,![X3]:![X5]:(((~(aElementOf0(X5,slcrc0))&aSet0(slcrc0))&sdtlpdtrp0(xc,X3)=sdtlpdtrp0(xc,slcrc0))|((((~(aSet0(X3))|(aElementOf0(esk20_1(X3),X3)&~(aElementOf0(esk20_1(X3),xS))))&~(aSubsetOf0(X3,xS)))|~(sbrdtbr0(X3)=sz00))&~(aElementOf0(X3,slbdtsldtrb0(xS,sz00))))),inference(shift_quantors,[status(thm)],[4224])).
% fof(4226, plain,![X3]:![X5]:((((((((aElementOf0(esk20_1(X3),X3)|~(aSet0(X3)))|~(sbrdtbr0(X3)=sz00))|~(aElementOf0(X5,slcrc0)))&(((~(aElementOf0(esk20_1(X3),xS))|~(aSet0(X3)))|~(sbrdtbr0(X3)=sz00))|~(aElementOf0(X5,slcrc0))))&((~(aSubsetOf0(X3,xS))|~(sbrdtbr0(X3)=sz00))|~(aElementOf0(X5,slcrc0))))&(~(aElementOf0(X3,slbdtsldtrb0(xS,sz00)))|~(aElementOf0(X5,slcrc0))))&((((((aElementOf0(esk20_1(X3),X3)|~(aSet0(X3)))|~(sbrdtbr0(X3)=sz00))|aSet0(slcrc0))&(((~(aElementOf0(esk20_1(X3),xS))|~(aSet0(X3)))|~(sbrdtbr0(X3)=sz00))|aSet0(slcrc0)))&((~(aSubsetOf0(X3,xS))|~(sbrdtbr0(X3)=sz00))|aSet0(slcrc0)))&(~(aElementOf0(X3,slbdtsldtrb0(xS,sz00)))|aSet0(slcrc0))))&((((((aElementOf0(esk20_1(X3),X3)|~(aSet0(X3)))|~(sbrdtbr0(X3)=sz00))|sdtlpdtrp0(xc,X3)=sdtlpdtrp0(xc,slcrc0))&(((~(aElementOf0(esk20_1(X3),xS))|~(aSet0(X3)))|~(sbrdtbr0(X3)=sz00))|sdtlpdtrp0(xc,X3)=sdtlpdtrp0(xc,slcrc0)))&((~(aSubsetOf0(X3,xS))|~(sbrdtbr0(X3)=sz00))|sdtlpdtrp0(xc,X3)=sdtlpdtrp0(xc,slcrc0)))&(~(aElementOf0(X3,slbdtsldtrb0(xS,sz00)))|sdtlpdtrp0(xc,X3)=sdtlpdtrp0(xc,slcrc0)))),inference(distribute,[status(thm)],[4225])).
% cnf(4228,plain,(sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0)|sbrdtbr0(X1)!=sz00|~aSubsetOf0(X1,xS)),inference(split_conjunct,[status(thm)],[4226])).
% fof(4466, negated_conjecture,![X1]:(~(aElementOf0(X1,xT))|![X2]:((((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,xS))))&~(aSubsetOf0(X2,xS)))|~(isCountable0(X2)))|?[X3]:(((((aSet0(X3)&![X4]:(~(aElementOf0(X4,X3))|aElementOf0(X4,X2)))&aSubsetOf0(X3,X2))&sbrdtbr0(X3)=xK)&aElementOf0(X3,slbdtsldtrb0(X2,xK)))&~(sdtlpdtrp0(xc,X3)=X1)))),inference(fof_nnf,[status(thm)],[82])).
% fof(4467, negated_conjecture,![X5]:(~(aElementOf0(X5,xT))|![X6]:((((~(aSet0(X6))|?[X7]:(aElementOf0(X7,X6)&~(aElementOf0(X7,xS))))&~(aSubsetOf0(X6,xS)))|~(isCountable0(X6)))|?[X8]:(((((aSet0(X8)&![X9]:(~(aElementOf0(X9,X8))|aElementOf0(X9,X6)))&aSubsetOf0(X8,X6))&sbrdtbr0(X8)=xK)&aElementOf0(X8,slbdtsldtrb0(X6,xK)))&~(sdtlpdtrp0(xc,X8)=X5)))),inference(variable_rename,[status(thm)],[4466])).
% fof(4468, negated_conjecture,![X5]:(~(aElementOf0(X5,xT))|![X6]:((((~(aSet0(X6))|(aElementOf0(esk31_2(X5,X6),X6)&~(aElementOf0(esk31_2(X5,X6),xS))))&~(aSubsetOf0(X6,xS)))|~(isCountable0(X6)))|(((((aSet0(esk32_2(X5,X6))&![X9]:(~(aElementOf0(X9,esk32_2(X5,X6)))|aElementOf0(X9,X6)))&aSubsetOf0(esk32_2(X5,X6),X6))&sbrdtbr0(esk32_2(X5,X6))=xK)&aElementOf0(esk32_2(X5,X6),slbdtsldtrb0(X6,xK)))&~(sdtlpdtrp0(xc,esk32_2(X5,X6))=X5)))),inference(skolemize,[status(esa)],[4467])).
% fof(4469, negated_conjecture,![X5]:![X6]:![X9]:((((((((~(aElementOf0(X9,esk32_2(X5,X6)))|aElementOf0(X9,X6))&aSet0(esk32_2(X5,X6)))&aSubsetOf0(esk32_2(X5,X6),X6))&sbrdtbr0(esk32_2(X5,X6))=xK)&aElementOf0(esk32_2(X5,X6),slbdtsldtrb0(X6,xK)))&~(sdtlpdtrp0(xc,esk32_2(X5,X6))=X5))|(((~(aSet0(X6))|(aElementOf0(esk31_2(X5,X6),X6)&~(aElementOf0(esk31_2(X5,X6),xS))))&~(aSubsetOf0(X6,xS)))|~(isCountable0(X6))))|~(aElementOf0(X5,xT))),inference(shift_quantors,[status(thm)],[4468])).
% fof(4470, negated_conjecture,![X5]:![X6]:![X9]:(((((((((((aElementOf0(esk31_2(X5,X6),X6)|~(aSet0(X6)))|~(isCountable0(X6)))|(~(aElementOf0(X9,esk32_2(X5,X6)))|aElementOf0(X9,X6)))|~(aElementOf0(X5,xT)))&((((~(aElementOf0(esk31_2(X5,X6),xS))|~(aSet0(X6)))|~(isCountable0(X6)))|(~(aElementOf0(X9,esk32_2(X5,X6)))|aElementOf0(X9,X6)))|~(aElementOf0(X5,xT))))&(((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|(~(aElementOf0(X9,esk32_2(X5,X6)))|aElementOf0(X9,X6)))|~(aElementOf0(X5,xT))))&((((((aElementOf0(esk31_2(X5,X6),X6)|~(aSet0(X6)))|~(isCountable0(X6)))|aSet0(esk32_2(X5,X6)))|~(aElementOf0(X5,xT)))&((((~(aElementOf0(esk31_2(X5,X6),xS))|~(aSet0(X6)))|~(isCountable0(X6)))|aSet0(esk32_2(X5,X6)))|~(aElementOf0(X5,xT))))&(((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|aSet0(esk32_2(X5,X6)))|~(aElementOf0(X5,xT)))))&((((((aElementOf0(esk31_2(X5,X6),X6)|~(aSet0(X6)))|~(isCountable0(X6)))|aSubsetOf0(esk32_2(X5,X6),X6))|~(aElementOf0(X5,xT)))&((((~(aElementOf0(esk31_2(X5,X6),xS))|~(aSet0(X6)))|~(isCountable0(X6)))|aSubsetOf0(esk32_2(X5,X6),X6))|~(aElementOf0(X5,xT))))&(((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|aSubsetOf0(esk32_2(X5,X6),X6))|~(aElementOf0(X5,xT)))))&((((((aElementOf0(esk31_2(X5,X6),X6)|~(aSet0(X6)))|~(isCountable0(X6)))|sbrdtbr0(esk32_2(X5,X6))=xK)|~(aElementOf0(X5,xT)))&((((~(aElementOf0(esk31_2(X5,X6),xS))|~(aSet0(X6)))|~(isCountable0(X6)))|sbrdtbr0(esk32_2(X5,X6))=xK)|~(aElementOf0(X5,xT))))&(((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|sbrdtbr0(esk32_2(X5,X6))=xK)|~(aElementOf0(X5,xT)))))&((((((aElementOf0(esk31_2(X5,X6),X6)|~(aSet0(X6)))|~(isCountable0(X6)))|aElementOf0(esk32_2(X5,X6),slbdtsldtrb0(X6,xK)))|~(aElementOf0(X5,xT)))&((((~(aElementOf0(esk31_2(X5,X6),xS))|~(aSet0(X6)))|~(isCountable0(X6)))|aElementOf0(esk32_2(X5,X6),slbdtsldtrb0(X6,xK)))|~(aElementOf0(X5,xT))))&(((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|aElementOf0(esk32_2(X5,X6),slbdtsldtrb0(X6,xK)))|~(aElementOf0(X5,xT)))))&((((((aElementOf0(esk31_2(X5,X6),X6)|~(aSet0(X6)))|~(isCountable0(X6)))|~(sdtlpdtrp0(xc,esk32_2(X5,X6))=X5))|~(aElementOf0(X5,xT)))&((((~(aElementOf0(esk31_2(X5,X6),xS))|~(aSet0(X6)))|~(isCountable0(X6)))|~(sdtlpdtrp0(xc,esk32_2(X5,X6))=X5))|~(aElementOf0(X5,xT))))&(((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|~(sdtlpdtrp0(xc,esk32_2(X5,X6))=X5))|~(aElementOf0(X5,xT))))),inference(distribute,[status(thm)],[4469])).
% cnf(4471,negated_conjecture,(~aElementOf0(X1,xT)|sdtlpdtrp0(xc,esk32_2(X1,X2))!=X1|~isCountable0(X2)|~aSubsetOf0(X2,xS)),inference(split_conjunct,[status(thm)],[4470])).
% cnf(4477,negated_conjecture,(sbrdtbr0(esk32_2(X1,X2))=xK|~aElementOf0(X1,xT)|~isCountable0(X2)|~aSubsetOf0(X2,xS)),inference(split_conjunct,[status(thm)],[4470])).
% cnf(4480,negated_conjecture,(aSubsetOf0(esk32_2(X1,X2),X2)|~aElementOf0(X1,xT)|~isCountable0(X2)|~aSubsetOf0(X2,xS)),inference(split_conjunct,[status(thm)],[4470])).
% cnf(4491,plain,(slbdtsldtrb0(xS,sz00)=szDzozmdt0(xc)),inference(rw,[status(thm)],[226,4213,theory(equality)])).
% cnf(4492,plain,(aElementOf0(slcrc0,szDzozmdt0(xc))),inference(rw,[status(thm)],[4217,4491,theory(equality)])).
% cnf(4503,negated_conjecture,(sbrdtbr0(esk32_2(X1,X2))=sz00|~isCountable0(X2)|~aElementOf0(X1,xT)|~aSubsetOf0(X2,xS)),inference(rw,[status(thm)],[4477,4213,theory(equality)])).
% cnf(9728,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(X2,xS)|~isCountable0(X2)|~aElementOf0(X1,xT)|sbrdtbr0(esk32_2(X1,X2))!=sz00|~aSubsetOf0(esk32_2(X1,X2),xS)),inference(spm,[status(thm)],[4471,4228,theory(equality)])).
% cnf(10119,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|~aFunction0(xc)|~aElementOf0(X1,szDzozmdt0(xc))),inference(spm,[status(thm)],[238,199,theory(equality)])).
% cnf(10123,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|$false|~aElementOf0(X1,szDzozmdt0(xc))),inference(rw,[status(thm)],[10119,227,theory(equality)])).
% cnf(10124,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|~aElementOf0(X1,szDzozmdt0(xc))),inference(cn,[status(thm)],[10123,theory(equality)])).
% cnf(62179,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(esk32_2(X1,X2),xS)|~aSubsetOf0(X2,xS)|~isCountable0(X2)|~aElementOf0(X1,xT)),inference(csr,[status(thm)],[9728,4503])).
% cnf(62184,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(xS,xS)|~isCountable0(xS)|~aElementOf0(X1,xT)),inference(spm,[status(thm)],[62179,4480,theory(equality)])).
% cnf(62193,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(xS,xS)|$false|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[62184,215,theory(equality)])).
% cnf(62194,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(xS,xS)|~aElementOf0(X1,xT)),inference(cn,[status(thm)],[62193,theory(equality)])).
% cnf(62195,negated_conjecture,(~aSubsetOf0(xS,xS)|~aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)),inference(er,[status(thm)],[62194,theory(equality)])).
% cnf(62215,negated_conjecture,(~aSubsetOf0(xS,xS)|~aElementOf0(slcrc0,szDzozmdt0(xc))),inference(spm,[status(thm)],[62195,10124,theory(equality)])).
% cnf(62226,negated_conjecture,(~aSubsetOf0(xS,xS)|$false),inference(rw,[status(thm)],[62215,4492,theory(equality)])).
% cnf(62227,negated_conjecture,(~aSubsetOf0(xS,xS)),inference(cn,[status(thm)],[62226,theory(equality)])).
% cnf(62231,negated_conjecture,(~aSet0(xS)),inference(spm,[status(thm)],[62227,125,theory(equality)])).
% cnf(62234,negated_conjecture,($false),inference(rw,[status(thm)],[62231,217,theory(equality)])).
% cnf(62235,negated_conjecture,($false),inference(cn,[status(thm)],[62234,theory(equality)])).
% cnf(62236,negated_conjecture,($false),62235,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 5664
% # ...of these trivial                : 15
% # ...subsumed                        : 376
% # ...remaining for further processing: 5273
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 3
% # Backward-rewritten                 : 9
% # Generated clauses                  : 45459
% # ...of the previous two non-trivial : 35064
% # Contextual simplify-reflections    : 2506
% # Paramodulations                    : 45418
% # Factorizations                     : 0
% # Equation resolutions               : 41
% # Current number of processed clauses: 2679
% #    Positive orientable unit clauses: 29
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 14
% #    Non-unit-clauses                : 2636
% # Current number of unprocessed clauses: 34792
% # ...number of literals in the above : 553252
% # Clause-clause subsumption calls (NU) : 390497
% # Rec. Clause-clause subsumption calls : 38728
% # Unit Clause-clause subsumption calls : 4429
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 3
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:   287 leaves,   2.00+/-2.459 terms/leaf
% # Paramod-from index:          130 leaves,   1.02+/-0.150 terms/leaf
% # Paramod-into index:          255 leaves,   1.47+/-1.328 terms/leaf
% # -------------------------------------------------
% # User time              : 6.875 s
% # System time            : 0.152 s
% # Total time             : 7.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.30 CPU 10.17 WC
% FINAL PrfWatch: 9.30 CPU 10.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP16227/NUM566+3.tptp
% 
%------------------------------------------------------------------------------