TSTP Solution File: NUM563+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM563+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 : art02.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:07:15 EST 2010

% Result   : Theorem 1.42s
% Output   : Solution 1.42s
% 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/SystemOnTPTP22574/NUM563+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP22574/NUM563+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22574/NUM563+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 22670
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.027 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(4, axiom,![X1]:(aSet0(X1)=>aSubsetOf0(X1,X1)),file('/tmp/SRASS.s.p', mSubRefl)).
% fof(7, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(8, axiom,aElementOf0(sz00,szNzAzT0),file('/tmp/SRASS.s.p', mZeroNum)).
% fof(14, axiom,![X1]:(aFunction0(X1)=>![X2]:(aElementOf0(X2,szDzozmdt0(X1))=>aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))))),file('/tmp/SRASS.s.p', mImgRng)).
% fof(16, axiom,(aSet0(xT)&isFinite0(xT)),file('/tmp/SRASS.s.p', m__3291)).
% fof(18, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(19, axiom,((aFunction0(xc)&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),file('/tmp/SRASS.s.p', m__3453)).
% fof(22, axiom,![X1]:((aSet0(X1)&~(isFinite0(X1)))=>![X2]:(aElementOf0(X2,szNzAzT0)=>~(slbdtsldtrb0(X1,X2)=slcrc0))),file('/tmp/SRASS.s.p', mSelNSet)).
% fof(24, axiom,![X1]:![X2]:((aSet0(X1)&aElementOf0(X2,szNzAzT0))=>![X3]:(X3=slbdtsldtrb0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))),file('/tmp/SRASS.s.p', mDefSel)).
% fof(40, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(51, axiom,![X1]:(aSet0(X1)=>(sbrdtbr0(X1)=sz00<=>X1=slcrc0)),file('/tmp/SRASS.s.p', mCardEmpty)).
% fof(78, conjecture,(xK=sz00=>?[X1]:(aElementOf0(X1,xT)&?[X2]:((aSubsetOf0(X2,xS)&isCountable0(X2))&![X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))=>sdtlpdtrp0(xc,X3)=X1)))),file('/tmp/SRASS.s.p', m__)).
% fof(79, negated_conjecture,~((xK=sz00=>?[X1]:(aElementOf0(X1,xT)&?[X2]:((aSubsetOf0(X2,xS)&isCountable0(X2))&![X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))=>sdtlpdtrp0(xc,X3)=X1))))),inference(assume_negation,[status(cth)],[78])).
% fof(80, plain,![X1]:((aSet0(X1)&isCountable0(X1))=>~(isFinite0(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(81, plain,![X1]:((aSet0(X1)&~(isFinite0(X1)))=>![X2]:(aElementOf0(X2,szNzAzT0)=>~(slbdtsldtrb0(X1,X2)=slcrc0))),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% fof(92, plain,![X1]:((~(aSet0(X1))|~(isCountable0(X1)))|~(isFinite0(X1))),inference(fof_nnf,[status(thm)],[80])).
% fof(93, plain,![X2]:((~(aSet0(X2))|~(isCountable0(X2)))|~(isFinite0(X2))),inference(variable_rename,[status(thm)],[92])).
% cnf(94,plain,(~isFinite0(X1)|~isCountable0(X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[93])).
% fof(95, 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(96, 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)],[95])).
% fof(97, 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)],[96])).
% fof(98, 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)],[97])).
% fof(99, 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)],[98])).
% cnf(102,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[99])).
% cnf(103,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[99])).
% fof(108, plain,![X1]:(~(aSet0(X1))|aSubsetOf0(X1,X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(109, plain,![X2]:(~(aSet0(X2))|aSubsetOf0(X2,X2)),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(aSubsetOf0(X1,X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[109])).
% cnf(118,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(119,plain,(aElementOf0(sz00,szNzAzT0)),inference(split_conjunct,[status(thm)],[8])).
% fof(151, plain,![X1]:(~(aFunction0(X1))|![X2]:(~(aElementOf0(X2,szDzozmdt0(X1)))|aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))))),inference(fof_nnf,[status(thm)],[14])).
% fof(152, plain,![X3]:(~(aFunction0(X3))|![X4]:(~(aElementOf0(X4,szDzozmdt0(X3)))|aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3))))),inference(variable_rename,[status(thm)],[151])).
% fof(153, plain,![X3]:![X4]:((~(aElementOf0(X4,szDzozmdt0(X3)))|aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3))))|~(aFunction0(X3))),inference(shift_quantors,[status(thm)],[152])).
% cnf(154,plain,(aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))|~aFunction0(X1)|~aElementOf0(X2,szDzozmdt0(X1))),inference(split_conjunct,[status(thm)],[153])).
% cnf(165,plain,(aSet0(xT)),inference(split_conjunct,[status(thm)],[16])).
% cnf(167,plain,(isCountable0(xS)),inference(split_conjunct,[status(thm)],[18])).
% cnf(168,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(169,plain,(aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),inference(split_conjunct,[status(thm)],[19])).
% cnf(170,plain,(szDzozmdt0(xc)=slbdtsldtrb0(xS,xK)),inference(split_conjunct,[status(thm)],[19])).
% cnf(171,plain,(aFunction0(xc)),inference(split_conjunct,[status(thm)],[19])).
% fof(185, plain,![X1]:((~(aSet0(X1))|isFinite0(X1))|![X2]:(~(aElementOf0(X2,szNzAzT0))|~(slbdtsldtrb0(X1,X2)=slcrc0))),inference(fof_nnf,[status(thm)],[81])).
% fof(186, plain,![X3]:((~(aSet0(X3))|isFinite0(X3))|![X4]:(~(aElementOf0(X4,szNzAzT0))|~(slbdtsldtrb0(X3,X4)=slcrc0))),inference(variable_rename,[status(thm)],[185])).
% fof(187, plain,![X3]:![X4]:((~(aElementOf0(X4,szNzAzT0))|~(slbdtsldtrb0(X3,X4)=slcrc0))|(~(aSet0(X3))|isFinite0(X3))),inference(shift_quantors,[status(thm)],[186])).
% cnf(188,plain,(isFinite0(X1)|~aSet0(X1)|slbdtsldtrb0(X1,X2)!=slcrc0|~aElementOf0(X2,szNzAzT0)),inference(split_conjunct,[status(thm)],[187])).
% fof(199, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElementOf0(X2,szNzAzT0)))|![X3]:((~(X3=slbdtsldtrb0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))&((~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2))|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|(~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2)))&(aElementOf0(X4,X3)|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))|X3=slbdtsldtrb0(X1,X2)))),inference(fof_nnf,[status(thm)],[24])).
% fof(200, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|(~(aSubsetOf0(X9,X5))|~(sbrdtbr0(X9)=X6)))&(aElementOf0(X9,X7)|(aSubsetOf0(X9,X5)&sbrdtbr0(X9)=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(variable_rename,[status(thm)],[199])).
% fof(201, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk11_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk11_3(X5,X6,X7),X5))|~(sbrdtbr0(esk11_3(X5,X6,X7))=X6)))&(aElementOf0(esk11_3(X5,X6,X7),X7)|(aSubsetOf0(esk11_3(X5,X6,X7),X5)&sbrdtbr0(esk11_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(skolemize,[status(esa)],[200])).
% fof(202, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=slbdtsldtrb0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk11_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk11_3(X5,X6,X7),X5))|~(sbrdtbr0(esk11_3(X5,X6,X7))=X6)))&(aElementOf0(esk11_3(X5,X6,X7),X7)|(aSubsetOf0(esk11_3(X5,X6,X7),X5)&sbrdtbr0(esk11_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))),inference(shift_quantors,[status(thm)],[201])).
% fof(203, plain,![X5]:![X6]:![X7]:![X8]:(((((((aSubsetOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((sbrdtbr0(X8)=X6|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((aSet0(X7)|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&(((((~(aElementOf0(esk11_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk11_3(X5,X6,X7),X5))|~(sbrdtbr0(esk11_3(X5,X6,X7))=X6)))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((((aSubsetOf0(esk11_3(X5,X6,X7),X5)|aElementOf0(esk11_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&((((sbrdtbr0(esk11_3(X5,X6,X7))=X6|aElementOf0(esk11_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))))),inference(distribute,[status(thm)],[202])).
% cnf(207,plain,(aSet0(X3)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)),inference(split_conjunct,[status(thm)],[203])).
% cnf(209,plain,(sbrdtbr0(X4)=X1|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[203])).
% cnf(210,plain,(aSubsetOf0(X4,X2)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[203])).
% fof(278, plain,![X1]:((~(X1=slcrc0)|(aSet0(X1)&![X2]:~(aElementOf0(X2,X1))))&((~(aSet0(X1))|?[X2]:aElementOf0(X2,X1))|X1=slcrc0)),inference(fof_nnf,[status(thm)],[40])).
% fof(279, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[278])).
% fof(280, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk16_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[279])).
% fof(281, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk16_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[280])).
% fof(282, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))|~(X3=slcrc0))&(aSet0(X3)|~(X3=slcrc0)))&((~(aSet0(X3))|aElementOf0(esk16_1(X3),X3))|X3=slcrc0)),inference(distribute,[status(thm)],[281])).
% cnf(283,plain,(X1=slcrc0|aElementOf0(esk16_1(X1),X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[282])).
% fof(323, plain,![X1]:(~(aSet0(X1))|((~(sbrdtbr0(X1)=sz00)|X1=slcrc0)&(~(X1=slcrc0)|sbrdtbr0(X1)=sz00))),inference(fof_nnf,[status(thm)],[51])).
% fof(324, plain,![X2]:(~(aSet0(X2))|((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)&(~(X2=slcrc0)|sbrdtbr0(X2)=sz00))),inference(variable_rename,[status(thm)],[323])).
% fof(325, plain,![X2]:(((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)|~(aSet0(X2)))&((~(X2=slcrc0)|sbrdtbr0(X2)=sz00)|~(aSet0(X2)))),inference(distribute,[status(thm)],[324])).
% cnf(327,plain,(X1=slcrc0|~aSet0(X1)|sbrdtbr0(X1)!=sz00),inference(split_conjunct,[status(thm)],[325])).
% fof(450, negated_conjecture,(xK=sz00&![X1]:(~(aElementOf0(X1,xT))|![X2]:((~(aSubsetOf0(X2,xS))|~(isCountable0(X2)))|?[X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))&~(sdtlpdtrp0(xc,X3)=X1))))),inference(fof_nnf,[status(thm)],[79])).
% fof(451, negated_conjecture,(xK=sz00&![X4]:(~(aElementOf0(X4,xT))|![X5]:((~(aSubsetOf0(X5,xS))|~(isCountable0(X5)))|?[X6]:(aElementOf0(X6,slbdtsldtrb0(X5,xK))&~(sdtlpdtrp0(xc,X6)=X4))))),inference(variable_rename,[status(thm)],[450])).
% fof(452, negated_conjecture,(xK=sz00&![X4]:(~(aElementOf0(X4,xT))|![X5]:((~(aSubsetOf0(X5,xS))|~(isCountable0(X5)))|(aElementOf0(esk22_2(X4,X5),slbdtsldtrb0(X5,xK))&~(sdtlpdtrp0(xc,esk22_2(X4,X5))=X4))))),inference(skolemize,[status(esa)],[451])).
% fof(453, negated_conjecture,![X4]:![X5]:((((~(aSubsetOf0(X5,xS))|~(isCountable0(X5)))|(aElementOf0(esk22_2(X4,X5),slbdtsldtrb0(X5,xK))&~(sdtlpdtrp0(xc,esk22_2(X4,X5))=X4)))|~(aElementOf0(X4,xT)))&xK=sz00),inference(shift_quantors,[status(thm)],[452])).
% fof(454, negated_conjecture,![X4]:![X5]:((((aElementOf0(esk22_2(X4,X5),slbdtsldtrb0(X5,xK))|(~(aSubsetOf0(X5,xS))|~(isCountable0(X5))))|~(aElementOf0(X4,xT)))&((~(sdtlpdtrp0(xc,esk22_2(X4,X5))=X4)|(~(aSubsetOf0(X5,xS))|~(isCountable0(X5))))|~(aElementOf0(X4,xT))))&xK=sz00),inference(distribute,[status(thm)],[453])).
% cnf(455,negated_conjecture,(xK=sz00),inference(split_conjunct,[status(thm)],[454])).
% cnf(456,negated_conjecture,(~aElementOf0(X1,xT)|~isCountable0(X2)|~aSubsetOf0(X2,xS)|sdtlpdtrp0(xc,esk22_2(X1,X2))!=X1),inference(split_conjunct,[status(thm)],[454])).
% cnf(457,negated_conjecture,(aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xK))|~aElementOf0(X1,xT)|~isCountable0(X2)|~aSubsetOf0(X2,xS)),inference(split_conjunct,[status(thm)],[454])).
% cnf(459,plain,(slbdtsldtrb0(xS,sz00)=szDzozmdt0(xc)),inference(rw,[status(thm)],[170,455,theory(equality)])).
% cnf(462,negated_conjecture,(aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,sz00))|~isCountable0(X2)|~aSubsetOf0(X2,xS)|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[457,455,theory(equality)])).
% cnf(491,plain,(~isFinite0(xS)|~aSet0(xS)),inference(spm,[status(thm)],[94,167,theory(equality)])).
% cnf(498,plain,(aSet0(xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[102,168,theory(equality)])).
% cnf(501,plain,(aSet0(xS)|$false),inference(rw,[status(thm)],[498,118,theory(equality)])).
% cnf(502,plain,(aSet0(xS)),inference(cn,[status(thm)],[501,theory(equality)])).
% cnf(539,negated_conjecture,(aElementOf0(esk22_2(X1,xS),szDzozmdt0(xc))|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)|~isCountable0(xS)),inference(spm,[status(thm)],[462,459,theory(equality)])).
% cnf(540,negated_conjecture,(aElementOf0(esk22_2(X1,xS),szDzozmdt0(xc))|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)|$false),inference(rw,[status(thm)],[539,167,theory(equality)])).
% cnf(541,negated_conjecture,(aElementOf0(esk22_2(X1,xS),szDzozmdt0(xc))|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)),inference(cn,[status(thm)],[540,theory(equality)])).
% cnf(557,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))|~aSet0(xT)),inference(spm,[status(thm)],[103,169,theory(equality)])).
% cnf(561,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))|$false),inference(rw,[status(thm)],[557,165,theory(equality)])).
% cnf(562,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))),inference(cn,[status(thm)],[561,theory(equality)])).
% cnf(592,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0|~aElementOf0(sz00,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[188,459,theory(equality)])).
% cnf(593,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0|$false|~aSet0(xS)),inference(rw,[status(thm)],[592,119,theory(equality)])).
% cnf(594,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0|~aSet0(xS)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(611,plain,(aSet0(X1)|szDzozmdt0(xc)!=X1|~aElementOf0(sz00,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[207,459,theory(equality)])).
% cnf(612,plain,(aSet0(X1)|szDzozmdt0(xc)!=X1|$false|~aSet0(xS)),inference(rw,[status(thm)],[611,119,theory(equality)])).
% cnf(613,plain,(aSet0(X1)|szDzozmdt0(xc)!=X1|~aSet0(xS)),inference(cn,[status(thm)],[612,theory(equality)])).
% cnf(635,plain,(aSubsetOf0(X1,X2)|~aElementOf0(X3,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X2,X3))|~aSet0(X2)),inference(er,[status(thm)],[210,theory(equality)])).
% cnf(727,plain,(sbrdtbr0(X1)=X2|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X3,X2))|~aSet0(X3)),inference(er,[status(thm)],[209,theory(equality)])).
% cnf(1044,plain,(~isFinite0(xS)|$false),inference(rw,[status(thm)],[491,502,theory(equality)])).
% cnf(1045,plain,(~isFinite0(xS)),inference(cn,[status(thm)],[1044,theory(equality)])).
% cnf(1698,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|~aFunction0(xc)|~aElementOf0(X1,szDzozmdt0(xc))),inference(spm,[status(thm)],[562,154,theory(equality)])).
% cnf(1707,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|$false|~aElementOf0(X1,szDzozmdt0(xc))),inference(rw,[status(thm)],[1698,171,theory(equality)])).
% cnf(1708,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|~aElementOf0(X1,szDzozmdt0(xc))),inference(cn,[status(thm)],[1707,theory(equality)])).
% cnf(1908,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0|$false),inference(rw,[status(thm)],[594,502,theory(equality)])).
% cnf(1909,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0),inference(cn,[status(thm)],[1908,theory(equality)])).
% cnf(1910,plain,(szDzozmdt0(xc)!=slcrc0),inference(sr,[status(thm)],[1909,1045,theory(equality)])).
% cnf(2064,plain,(aSet0(X1)|szDzozmdt0(xc)!=X1|$false),inference(rw,[status(thm)],[613,502,theory(equality)])).
% cnf(2065,plain,(aSet0(X1)|szDzozmdt0(xc)!=X1),inference(cn,[status(thm)],[2064,theory(equality)])).
% cnf(2066,plain,(aSet0(szDzozmdt0(xc))),inference(er,[status(thm)],[2065,theory(equality)])).
% cnf(2865,plain,(aSubsetOf0(X1,xS)|~aElementOf0(X1,szDzozmdt0(xc))|~aElementOf0(sz00,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[635,459,theory(equality)])).
% cnf(2875,plain,(aSubsetOf0(X1,xS)|~aElementOf0(X1,szDzozmdt0(xc))|$false|~aSet0(xS)),inference(rw,[status(thm)],[2865,119,theory(equality)])).
% cnf(2876,plain,(aSubsetOf0(X1,xS)|~aElementOf0(X1,szDzozmdt0(xc))|$false|$false),inference(rw,[status(thm)],[2875,502,theory(equality)])).
% cnf(2877,plain,(aSubsetOf0(X1,xS)|~aElementOf0(X1,szDzozmdt0(xc))),inference(cn,[status(thm)],[2876,theory(equality)])).
% cnf(2880,negated_conjecture,(aSubsetOf0(esk22_2(X1,xS),xS)|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)),inference(spm,[status(thm)],[2877,541,theory(equality)])).
% cnf(2884,plain,(aSubsetOf0(esk16_1(szDzozmdt0(xc)),xS)|slcrc0=szDzozmdt0(xc)|~aSet0(szDzozmdt0(xc))),inference(spm,[status(thm)],[2877,283,theory(equality)])).
% cnf(2893,plain,(aSubsetOf0(esk16_1(szDzozmdt0(xc)),xS)|slcrc0=szDzozmdt0(xc)|$false),inference(rw,[status(thm)],[2884,2066,theory(equality)])).
% cnf(2894,plain,(aSubsetOf0(esk16_1(szDzozmdt0(xc)),xS)|slcrc0=szDzozmdt0(xc)),inference(cn,[status(thm)],[2893,theory(equality)])).
% cnf(2895,plain,(aSubsetOf0(esk16_1(szDzozmdt0(xc)),xS)),inference(sr,[status(thm)],[2894,1910,theory(equality)])).
% cnf(2904,plain,(aSet0(esk16_1(szDzozmdt0(xc)))|~aSet0(xS)),inference(spm,[status(thm)],[102,2895,theory(equality)])).
% cnf(2913,plain,(aSet0(esk16_1(szDzozmdt0(xc)))|$false),inference(rw,[status(thm)],[2904,502,theory(equality)])).
% cnf(2914,plain,(aSet0(esk16_1(szDzozmdt0(xc)))),inference(cn,[status(thm)],[2913,theory(equality)])).
% cnf(2944,negated_conjecture,(aSet0(esk22_2(X1,xS))|~aSet0(xS)|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)),inference(spm,[status(thm)],[102,2880,theory(equality)])).
% cnf(2953,negated_conjecture,(aSet0(esk22_2(X1,xS))|$false|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)),inference(rw,[status(thm)],[2944,502,theory(equality)])).
% cnf(2954,negated_conjecture,(aSet0(esk22_2(X1,xS))|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)),inference(cn,[status(thm)],[2953,theory(equality)])).
% cnf(5599,plain,(sbrdtbr0(X1)=sz00|~aElementOf0(X1,szDzozmdt0(xc))|~aElementOf0(sz00,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[727,459,theory(equality)])).
% cnf(5611,plain,(sbrdtbr0(X1)=sz00|~aElementOf0(X1,szDzozmdt0(xc))|$false|~aSet0(xS)),inference(rw,[status(thm)],[5599,119,theory(equality)])).
% cnf(5612,plain,(sbrdtbr0(X1)=sz00|~aElementOf0(X1,szDzozmdt0(xc))|$false|$false),inference(rw,[status(thm)],[5611,502,theory(equality)])).
% cnf(5613,plain,(sbrdtbr0(X1)=sz00|~aElementOf0(X1,szDzozmdt0(xc))),inference(cn,[status(thm)],[5612,theory(equality)])).
% cnf(5629,plain,(slcrc0=X1|~aSet0(X1)|~aElementOf0(X1,szDzozmdt0(xc))),inference(spm,[status(thm)],[327,5613,theory(equality)])).
% cnf(5656,negated_conjecture,(slcrc0=esk22_2(X1,xS)|~aSet0(esk22_2(X1,xS))|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)),inference(spm,[status(thm)],[5629,541,theory(equality)])).
% cnf(5660,plain,(slcrc0=esk16_1(szDzozmdt0(xc))|slcrc0=szDzozmdt0(xc)|~aSet0(esk16_1(szDzozmdt0(xc)))|~aSet0(szDzozmdt0(xc))),inference(spm,[status(thm)],[5629,283,theory(equality)])).
% cnf(5670,plain,(slcrc0=esk16_1(szDzozmdt0(xc))|slcrc0=szDzozmdt0(xc)|$false|~aSet0(szDzozmdt0(xc))),inference(rw,[status(thm)],[5660,2914,theory(equality)])).
% cnf(5671,plain,(slcrc0=esk16_1(szDzozmdt0(xc))|slcrc0=szDzozmdt0(xc)|$false|$false),inference(rw,[status(thm)],[5670,2066,theory(equality)])).
% cnf(5672,plain,(slcrc0=esk16_1(szDzozmdt0(xc))|slcrc0=szDzozmdt0(xc)),inference(cn,[status(thm)],[5671,theory(equality)])).
% cnf(5673,plain,(esk16_1(szDzozmdt0(xc))=slcrc0),inference(sr,[status(thm)],[5672,1910,theory(equality)])).
% cnf(5682,plain,(slcrc0=szDzozmdt0(xc)|aElementOf0(slcrc0,szDzozmdt0(xc))|~aSet0(szDzozmdt0(xc))),inference(spm,[status(thm)],[283,5673,theory(equality)])).
% cnf(5709,plain,(slcrc0=szDzozmdt0(xc)|aElementOf0(slcrc0,szDzozmdt0(xc))|$false),inference(rw,[status(thm)],[5682,2066,theory(equality)])).
% cnf(5710,plain,(slcrc0=szDzozmdt0(xc)|aElementOf0(slcrc0,szDzozmdt0(xc))),inference(cn,[status(thm)],[5709,theory(equality)])).
% cnf(5711,plain,(aElementOf0(slcrc0,szDzozmdt0(xc))),inference(sr,[status(thm)],[5710,1910,theory(equality)])).
% cnf(5750,negated_conjecture,(esk22_2(X1,xS)=slcrc0|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)),inference(csr,[status(thm)],[5656,2954])).
% cnf(5751,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)|~isCountable0(xS)),inference(spm,[status(thm)],[456,5750,theory(equality)])).
% cnf(5767,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)|$false),inference(rw,[status(thm)],[5751,167,theory(equality)])).
% cnf(5768,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aElementOf0(X1,xT)|~aSubsetOf0(xS,xS)),inference(cn,[status(thm)],[5767,theory(equality)])).
% cnf(5829,negated_conjecture,(~aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)|~aSubsetOf0(xS,xS)),inference(er,[status(thm)],[5768,theory(equality)])).
% cnf(5831,negated_conjecture,(~aSubsetOf0(xS,xS)|~aElementOf0(slcrc0,szDzozmdt0(xc))),inference(spm,[status(thm)],[5829,1708,theory(equality)])).
% cnf(5832,negated_conjecture,(~aSubsetOf0(xS,xS)|$false),inference(rw,[status(thm)],[5831,5711,theory(equality)])).
% cnf(5833,negated_conjecture,(~aSubsetOf0(xS,xS)),inference(cn,[status(thm)],[5832,theory(equality)])).
% cnf(5834,negated_conjecture,(~aSet0(xS)),inference(spm,[status(thm)],[5833,110,theory(equality)])).
% cnf(5838,negated_conjecture,($false),inference(rw,[status(thm)],[5834,502,theory(equality)])).
% cnf(5839,negated_conjecture,($false),inference(cn,[status(thm)],[5838,theory(equality)])).
% cnf(5840,negated_conjecture,($false),5839,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1255
% # ...of these trivial                : 16
% # ...subsumed                        : 544
% # ...remaining for further processing: 695
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 28
% # Backward-rewritten                 : 51
% # Generated clauses                  : 2967
% # ...of the previous two non-trivial : 2654
% # Contextual simplify-reflections    : 465
% # Paramodulations                    : 2897
% # Factorizations                     : 0
% # Equation resolutions               : 63
% # Current number of processed clauses: 459
% #    Positive orientable unit clauses: 34
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 14
% #    Non-unit-clauses                : 411
% # Current number of unprocessed clauses: 1445
% # ...number of literals in the above : 8859
% # Clause-clause subsumption calls (NU) : 7725
% # Rec. Clause-clause subsumption calls : 5171
% # Unit Clause-clause subsumption calls : 480
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 7
% # Indexed BW rewrite successes       : 7
% # Backwards rewriting index:   386 leaves,   1.34+/-0.940 terms/leaf
% # Paramod-from index:          193 leaves,   1.03+/-0.159 terms/leaf
% # Paramod-into index:          332 leaves,   1.23+/-0.688 terms/leaf
% # -------------------------------------------------
% # User time              : 0.249 s
% # System time            : 0.010 s
% # Total time             : 0.259 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.52 WC
% FINAL PrfWatch: 0.43 CPU 0.52 WC
% SZS output end Solution for /tmp/SystemOnTPTP22574/NUM563+1.tptp
% 
%------------------------------------------------------------------------------