TSTP Solution File: NUM564+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM564+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 : art04.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:34 EST 2010
% Result : Theorem 1.25s
% Output : Solution 1.25s
% 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/SystemOnTPTP26589/NUM564+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26589/NUM564+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26589/NUM564+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 26685
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.028 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(3, axiom,![X1]:((aSet0(X1)&isCountable0(X1))=>~(isFinite0(X1))),file('/tmp/SRASS.s.p', mCountNFin)).
% fof(5, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(10, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(11, axiom,aElementOf0(sz00,szNzAzT0),file('/tmp/SRASS.s.p', mZeroNum)).
% fof(13, axiom,![X1]:((aSet0(X1)&~(isFinite0(X1)))=>![X2]:(aElementOf0(X2,szNzAzT0)=>~(slbdtsldtrb0(X1,X2)=slcrc0))),file('/tmp/SRASS.s.p', mSelNSet)).
% fof(23, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(24, axiom,((aFunction0(xc)&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),file('/tmp/SRASS.s.p', m__3453)).
% fof(26, axiom,xK=sz00,file('/tmp/SRASS.s.p', m__3462)).
% fof(28, 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(30, axiom,![X1]:(aSet0(X1)=>(sbrdtbr0(X1)=sz00<=>X1=slcrc0)),file('/tmp/SRASS.s.p', mCardEmpty)).
% fof(79, conjecture,aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),file('/tmp/SRASS.s.p', m__)).
% fof(80, negated_conjecture,~(aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),inference(assume_negation,[status(cth)],[79])).
% fof(81, plain,![X1]:((aSet0(X1)&isCountable0(X1))=>~(isFinite0(X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(82, plain,![X1]:((aSet0(X1)&~(isFinite0(X1)))=>![X2]:(aElementOf0(X2,szNzAzT0)=>~(slbdtsldtrb0(X1,X2)=slcrc0))),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(93, negated_conjecture,~(aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),inference(fof_simplification,[status(thm)],[80,theory(equality)])).
% fof(94, plain,![X1]:((~(X1=slcrc0)|(aSet0(X1)&![X2]:~(aElementOf0(X2,X1))))&((~(aSet0(X1))|?[X2]:aElementOf0(X2,X1))|X1=slcrc0)),inference(fof_nnf,[status(thm)],[1])).
% fof(95, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[95])).
% fof(97, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[96])).
% fof(98, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))|~(X3=slcrc0))&(aSet0(X3)|~(X3=slcrc0)))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(distribute,[status(thm)],[97])).
% cnf(99,plain,(X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(103, plain,![X1]:((~(aSet0(X1))|~(isCountable0(X1)))|~(isFinite0(X1))),inference(fof_nnf,[status(thm)],[81])).
% fof(104, plain,![X2]:((~(aSet0(X2))|~(isCountable0(X2)))|~(isFinite0(X2))),inference(variable_rename,[status(thm)],[103])).
% cnf(105,plain,(~isFinite0(X1)|~isCountable0(X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[104])).
% fof(109, 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)],[5])).
% fof(110, 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)],[109])).
% fof(111, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[110])).
% fof(112, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk2_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk2_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[112])).
% cnf(116,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[113])).
% cnf(132,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[10])).
% cnf(133,plain,(aElementOf0(sz00,szNzAzT0)),inference(split_conjunct,[status(thm)],[11])).
% fof(138, plain,![X1]:((~(aSet0(X1))|isFinite0(X1))|![X2]:(~(aElementOf0(X2,szNzAzT0))|~(slbdtsldtrb0(X1,X2)=slcrc0))),inference(fof_nnf,[status(thm)],[82])).
% fof(139, plain,![X3]:((~(aSet0(X3))|isFinite0(X3))|![X4]:(~(aElementOf0(X4,szNzAzT0))|~(slbdtsldtrb0(X3,X4)=slcrc0))),inference(variable_rename,[status(thm)],[138])).
% fof(140, plain,![X3]:![X4]:((~(aElementOf0(X4,szNzAzT0))|~(slbdtsldtrb0(X3,X4)=slcrc0))|(~(aSet0(X3))|isFinite0(X3))),inference(shift_quantors,[status(thm)],[139])).
% cnf(141,plain,(isFinite0(X1)|~aSet0(X1)|slbdtsldtrb0(X1,X2)!=slcrc0|~aElementOf0(X2,szNzAzT0)),inference(split_conjunct,[status(thm)],[140])).
% cnf(189,plain,(isCountable0(xS)),inference(split_conjunct,[status(thm)],[23])).
% cnf(190,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(192,plain,(szDzozmdt0(xc)=slbdtsldtrb0(xS,xK)),inference(split_conjunct,[status(thm)],[24])).
% cnf(203,plain,(xK=sz00),inference(split_conjunct,[status(thm)],[26])).
% fof(214, 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)],[28])).
% fof(215, 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)],[214])).
% fof(216, 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(esk12_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk12_3(X5,X6,X7),X5))|~(sbrdtbr0(esk12_3(X5,X6,X7))=X6)))&(aElementOf0(esk12_3(X5,X6,X7),X7)|(aSubsetOf0(esk12_3(X5,X6,X7),X5)&sbrdtbr0(esk12_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(skolemize,[status(esa)],[215])).
% fof(217, 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(esk12_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk12_3(X5,X6,X7),X5))|~(sbrdtbr0(esk12_3(X5,X6,X7))=X6)))&(aElementOf0(esk12_3(X5,X6,X7),X7)|(aSubsetOf0(esk12_3(X5,X6,X7),X5)&sbrdtbr0(esk12_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))),inference(shift_quantors,[status(thm)],[216])).
% fof(218, 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(esk12_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk12_3(X5,X6,X7),X5))|~(sbrdtbr0(esk12_3(X5,X6,X7))=X6)))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((((aSubsetOf0(esk12_3(X5,X6,X7),X5)|aElementOf0(esk12_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&((((sbrdtbr0(esk12_3(X5,X6,X7))=X6|aElementOf0(esk12_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))))),inference(distribute,[status(thm)],[217])).
% cnf(222,plain,(aSet0(X3)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)),inference(split_conjunct,[status(thm)],[218])).
% cnf(224,plain,(sbrdtbr0(X4)=X1|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[218])).
% cnf(225,plain,(aSubsetOf0(X4,X2)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[218])).
% fof(230, plain,![X1]:(~(aSet0(X1))|((~(sbrdtbr0(X1)=sz00)|X1=slcrc0)&(~(X1=slcrc0)|sbrdtbr0(X1)=sz00))),inference(fof_nnf,[status(thm)],[30])).
% fof(231, plain,![X2]:(~(aSet0(X2))|((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)&(~(X2=slcrc0)|sbrdtbr0(X2)=sz00))),inference(variable_rename,[status(thm)],[230])).
% fof(232, plain,![X2]:(((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)|~(aSet0(X2)))&((~(X2=slcrc0)|sbrdtbr0(X2)=sz00)|~(aSet0(X2)))),inference(distribute,[status(thm)],[231])).
% cnf(234,plain,(X1=slcrc0|~aSet0(X1)|sbrdtbr0(X1)!=sz00),inference(split_conjunct,[status(thm)],[232])).
% cnf(453,negated_conjecture,(~aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),inference(split_conjunct,[status(thm)],[93])).
% cnf(455,plain,(slbdtsldtrb0(xS,sz00)=szDzozmdt0(xc)),inference(rw,[status(thm)],[192,203,theory(equality)])).
% cnf(456,negated_conjecture,(~aElementOf0(slcrc0,szDzozmdt0(xc))),inference(rw,[status(thm)],[453,455,theory(equality)])).
% cnf(490,plain,(~isFinite0(xS)|~aSet0(xS)),inference(spm,[status(thm)],[105,189,theory(equality)])).
% cnf(516,plain,(aSet0(xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[116,190,theory(equality)])).
% cnf(519,plain,(aSet0(xS)|$false),inference(rw,[status(thm)],[516,132,theory(equality)])).
% cnf(520,plain,(aSet0(xS)),inference(cn,[status(thm)],[519,theory(equality)])).
% cnf(555,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0|~aElementOf0(sz00,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[141,455,theory(equality)])).
% cnf(556,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0|$false|~aSet0(xS)),inference(rw,[status(thm)],[555,133,theory(equality)])).
% cnf(557,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0|~aSet0(xS)),inference(cn,[status(thm)],[556,theory(equality)])).
% cnf(564,plain,(aSet0(slbdtsldtrb0(X1,X2))|~aElementOf0(X2,szNzAzT0)|~aSet0(X1)),inference(er,[status(thm)],[222,theory(equality)])).
% cnf(688,plain,(sbrdtbr0(X1)=X2|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X3,X2))|~aSet0(X3)),inference(er,[status(thm)],[224,theory(equality)])).
% cnf(692,plain,(aSubsetOf0(X1,X2)|~aElementOf0(X3,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X2,X3))|~aSet0(X2)),inference(er,[status(thm)],[225,theory(equality)])).
% cnf(1009,plain,(~isFinite0(xS)|$false),inference(rw,[status(thm)],[490,520,theory(equality)])).
% cnf(1010,plain,(~isFinite0(xS)),inference(cn,[status(thm)],[1009,theory(equality)])).
% cnf(1229,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0|$false),inference(rw,[status(thm)],[557,520,theory(equality)])).
% cnf(1230,plain,(isFinite0(xS)|szDzozmdt0(xc)!=slcrc0),inference(cn,[status(thm)],[1229,theory(equality)])).
% cnf(1231,plain,(szDzozmdt0(xc)!=slcrc0),inference(sr,[status(thm)],[1230,1010,theory(equality)])).
% cnf(1358,plain,(aSet0(szDzozmdt0(xc))|~aElementOf0(sz00,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[564,455,theory(equality)])).
% cnf(1359,plain,(aSet0(szDzozmdt0(xc))|$false|~aSet0(xS)),inference(rw,[status(thm)],[1358,133,theory(equality)])).
% cnf(1360,plain,(aSet0(szDzozmdt0(xc))|$false|$false),inference(rw,[status(thm)],[1359,520,theory(equality)])).
% cnf(1361,plain,(aSet0(szDzozmdt0(xc))),inference(cn,[status(thm)],[1360,theory(equality)])).
% cnf(2636,plain,(sbrdtbr0(X1)=sz00|~aElementOf0(X1,szDzozmdt0(xc))|~aElementOf0(sz00,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[688,455,theory(equality)])).
% cnf(2647,plain,(sbrdtbr0(X1)=sz00|~aElementOf0(X1,szDzozmdt0(xc))|$false|~aSet0(xS)),inference(rw,[status(thm)],[2636,133,theory(equality)])).
% cnf(2648,plain,(sbrdtbr0(X1)=sz00|~aElementOf0(X1,szDzozmdt0(xc))|$false|$false),inference(rw,[status(thm)],[2647,520,theory(equality)])).
% cnf(2649,plain,(sbrdtbr0(X1)=sz00|~aElementOf0(X1,szDzozmdt0(xc))),inference(cn,[status(thm)],[2648,theory(equality)])).
% cnf(2654,plain,(slcrc0=X1|~aSet0(X1)|~aElementOf0(X1,szDzozmdt0(xc))),inference(spm,[status(thm)],[234,2649,theory(equality)])).
% cnf(2711,plain,(slcrc0=esk1_1(szDzozmdt0(xc))|slcrc0=szDzozmdt0(xc)|~aSet0(esk1_1(szDzozmdt0(xc)))|~aSet0(szDzozmdt0(xc))),inference(spm,[status(thm)],[2654,99,theory(equality)])).
% cnf(2725,plain,(slcrc0=esk1_1(szDzozmdt0(xc))|slcrc0=szDzozmdt0(xc)|~aSet0(esk1_1(szDzozmdt0(xc)))|$false),inference(rw,[status(thm)],[2711,1361,theory(equality)])).
% cnf(2726,plain,(slcrc0=esk1_1(szDzozmdt0(xc))|slcrc0=szDzozmdt0(xc)|~aSet0(esk1_1(szDzozmdt0(xc)))),inference(cn,[status(thm)],[2725,theory(equality)])).
% cnf(2727,plain,(esk1_1(szDzozmdt0(xc))=slcrc0|~aSet0(esk1_1(szDzozmdt0(xc)))),inference(sr,[status(thm)],[2726,1231,theory(equality)])).
% cnf(2749,plain,(aSubsetOf0(X1,xS)|~aElementOf0(X1,szDzozmdt0(xc))|~aElementOf0(sz00,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[692,455,theory(equality)])).
% cnf(2760,plain,(aSubsetOf0(X1,xS)|~aElementOf0(X1,szDzozmdt0(xc))|$false|~aSet0(xS)),inference(rw,[status(thm)],[2749,133,theory(equality)])).
% cnf(2761,plain,(aSubsetOf0(X1,xS)|~aElementOf0(X1,szDzozmdt0(xc))|$false|$false),inference(rw,[status(thm)],[2760,520,theory(equality)])).
% cnf(2762,plain,(aSubsetOf0(X1,xS)|~aElementOf0(X1,szDzozmdt0(xc))),inference(cn,[status(thm)],[2761,theory(equality)])).
% cnf(2773,plain,(aSubsetOf0(esk1_1(szDzozmdt0(xc)),xS)|slcrc0=szDzozmdt0(xc)|~aSet0(szDzozmdt0(xc))),inference(spm,[status(thm)],[2762,99,theory(equality)])).
% cnf(2787,plain,(aSubsetOf0(esk1_1(szDzozmdt0(xc)),xS)|slcrc0=szDzozmdt0(xc)|$false),inference(rw,[status(thm)],[2773,1361,theory(equality)])).
% cnf(2788,plain,(aSubsetOf0(esk1_1(szDzozmdt0(xc)),xS)|slcrc0=szDzozmdt0(xc)),inference(cn,[status(thm)],[2787,theory(equality)])).
% cnf(2789,plain,(aSubsetOf0(esk1_1(szDzozmdt0(xc)),xS)),inference(sr,[status(thm)],[2788,1231,theory(equality)])).
% cnf(2792,plain,(aSet0(esk1_1(szDzozmdt0(xc)))|~aSet0(xS)),inference(spm,[status(thm)],[116,2789,theory(equality)])).
% cnf(2801,plain,(aSet0(esk1_1(szDzozmdt0(xc)))|$false),inference(rw,[status(thm)],[2792,520,theory(equality)])).
% cnf(2802,plain,(aSet0(esk1_1(szDzozmdt0(xc)))),inference(cn,[status(thm)],[2801,theory(equality)])).
% cnf(2809,plain,(esk1_1(szDzozmdt0(xc))=slcrc0|$false),inference(rw,[status(thm)],[2727,2802,theory(equality)])).
% cnf(2810,plain,(esk1_1(szDzozmdt0(xc))=slcrc0),inference(cn,[status(thm)],[2809,theory(equality)])).
% cnf(2813,plain,(slcrc0=szDzozmdt0(xc)|aElementOf0(slcrc0,szDzozmdt0(xc))|~aSet0(szDzozmdt0(xc))),inference(spm,[status(thm)],[99,2810,theory(equality)])).
% cnf(2817,plain,(slcrc0=szDzozmdt0(xc)|aElementOf0(slcrc0,szDzozmdt0(xc))|$false),inference(rw,[status(thm)],[2813,1361,theory(equality)])).
% cnf(2818,plain,(slcrc0=szDzozmdt0(xc)|aElementOf0(slcrc0,szDzozmdt0(xc))),inference(cn,[status(thm)],[2817,theory(equality)])).
% cnf(2819,plain,(aElementOf0(slcrc0,szDzozmdt0(xc))),inference(sr,[status(thm)],[2818,1231,theory(equality)])).
% cnf(2820,plain,($false),inference(sr,[status(thm)],[2819,456,theory(equality)])).
% cnf(2821,plain,($false),2820,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 648
% # ...of these trivial : 9
% # ...subsumed : 161
% # ...remaining for further processing: 478
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 7
% # Generated clauses : 1349
% # ...of the previous two non-trivial : 1199
% # Contextual simplify-reflections : 160
% # Paramodulations : 1300
% # Factorizations : 0
% # Equation resolutions : 49
% # Current number of processed clauses: 306
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 267
% # Current number of unprocessed clauses: 823
% # ...number of literals in the above : 4852
% # Clause-clause subsumption calls (NU) : 2210
% # Rec. Clause-clause subsumption calls : 1351
% # Unit Clause-clause subsumption calls : 88
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 276 leaves, 1.34+/-0.959 terms/leaf
% # Paramod-from index: 141 leaves, 1.01+/-0.118 terms/leaf
% # Paramod-into index: 240 leaves, 1.21+/-0.659 terms/leaf
% # -------------------------------------------------
% # User time : 0.129 s
% # System time : 0.006 s
% # Total time : 0.135 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.36 WC
% FINAL PrfWatch: 0.27 CPU 0.36 WC
% SZS output end Solution for /tmp/SystemOnTPTP26589/NUM564+1.tptp
%
%------------------------------------------------------------------------------