%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM611+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 : art01.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:37:10 EST 2010
% Result : Theorem 1.83s
% Output : Solution 1.83s
% 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/SystemOnTPTP15495/NUM611+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15495/NUM611+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15495/NUM611+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 15591
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(6, axiom,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aSubsetOf0(X2,X1)=>isFinite0(X2))),file('/tmp/SRASS.s.p', mSubFSet)).
% fof(14, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(szszuzczcdt0(X1)=szszuzczcdt0(X2)=>X1=X2)),file('/tmp/SRASS.s.p', mSuccEquSucc)).
% fof(26, axiom,![X1]:(aSet0(X1)=>(aElementOf0(sbrdtbr0(X1),szNzAzT0)<=>isFinite0(X1))),file('/tmp/SRASS.s.p', mCardNum)).
% fof(28, axiom,![X1]:(aSet0(X1)=>![X2]:((isFinite0(X1)&aElementOf0(X2,X1))=>szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1))),file('/tmp/SRASS.s.p', mCardDiff)).
% fof(33, 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(44, axiom,aElementOf0(xK,szNzAzT0),file('/tmp/SRASS.s.p', m__3418)).
% fof(50, axiom,(aElementOf0(xk,szNzAzT0)&szszuzczcdt0(xk)=xK),file('/tmp/SRASS.s.p', m__3533)).
% fof(65, axiom,(aSet0(xO)&xO=sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),file('/tmp/SRASS.s.p', m__4891)).
% fof(69, axiom,aElementOf0(xQ,slbdtsldtrb0(xO,xK)),file('/tmp/SRASS.s.p', m__5078)).
% fof(70, axiom,(aSubsetOf0(xQ,xO)&~(xQ=slcrc0)),file('/tmp/SRASS.s.p', m__5093)).
% fof(73, axiom,xp=szmzizndt0(xQ),file('/tmp/SRASS.s.p', m__5147)).
% fof(74, axiom,(aSet0(xP)&xP=sdtmndt0(xQ,szmzizndt0(xQ))),file('/tmp/SRASS.s.p', m__5164)).
% fof(75, axiom,aElementOf0(xp,xQ),file('/tmp/SRASS.s.p', m__5173)).
% fof(77, axiom,aSubsetOf0(xP,xQ),file('/tmp/SRASS.s.p', m__5195)).
% fof(109, conjecture,sbrdtbr0(xP)=xk,file('/tmp/SRASS.s.p', m__)).
% fof(110, negated_conjecture,~(sbrdtbr0(xP)=xk),inference(assume_negation,[status(cth)],[109])).
% fof(123, negated_conjecture,~(sbrdtbr0(xP)=xk),inference(fof_simplification,[status(thm)],[110,theory(equality)])).
% fof(139, 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(140, 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)],[139])).
% fof(141, 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)],[140])).
% fof(142, 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)],[141])).
% fof(143, 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)],[142])).
% cnf(146,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[143])).
% fof(148, plain,![X1]:((~(aSet0(X1))|~(isFinite0(X1)))|![X2]:(~(aSubsetOf0(X2,X1))|isFinite0(X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(149, plain,![X3]:((~(aSet0(X3))|~(isFinite0(X3)))|![X4]:(~(aSubsetOf0(X4,X3))|isFinite0(X4))),inference(variable_rename,[status(thm)],[148])).
% fof(150, plain,![X3]:![X4]:((~(aSubsetOf0(X4,X3))|isFinite0(X4))|(~(aSet0(X3))|~(isFinite0(X3)))),inference(shift_quantors,[status(thm)],[149])).
% cnf(151,plain,(isFinite0(X2)|~isFinite0(X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[150])).
% fof(173, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(~(szszuzczcdt0(X1)=szszuzczcdt0(X2))|X1=X2)),inference(fof_nnf,[status(thm)],[14])).
% fof(174, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(szszuzczcdt0(X3)=szszuzczcdt0(X4))|X3=X4)),inference(variable_rename,[status(thm)],[173])).
% cnf(175,plain,(X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[174])).
% fof(214, plain,![X1]:(~(aSet0(X1))|((~(aElementOf0(sbrdtbr0(X1),szNzAzT0))|isFinite0(X1))&(~(isFinite0(X1))|aElementOf0(sbrdtbr0(X1),szNzAzT0)))),inference(fof_nnf,[status(thm)],[26])).
% fof(215, plain,![X2]:(~(aSet0(X2))|((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))&(~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0)))),inference(variable_rename,[status(thm)],[214])).
% fof(216, plain,![X2]:(((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))|~(aSet0(X2)))&((~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0))|~(aSet0(X2)))),inference(distribute,[status(thm)],[215])).
% cnf(217,plain,(aElementOf0(sbrdtbr0(X1),szNzAzT0)|~aSet0(X1)|~isFinite0(X1)),inference(split_conjunct,[status(thm)],[216])).
% cnf(218,plain,(isFinite0(X1)|~aSet0(X1)|~aElementOf0(sbrdtbr0(X1),szNzAzT0)),inference(split_conjunct,[status(thm)],[216])).
% fof(224, plain,![X1]:(~(aSet0(X1))|![X2]:((~(isFinite0(X1))|~(aElementOf0(X2,X1)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1))),inference(fof_nnf,[status(thm)],[28])).
% fof(225, plain,![X3]:(~(aSet0(X3))|![X4]:((~(isFinite0(X3))|~(aElementOf0(X4,X3)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4)))=sbrdtbr0(X3))),inference(variable_rename,[status(thm)],[224])).
% fof(226, plain,![X3]:![X4]:(((~(isFinite0(X3))|~(aElementOf0(X4,X3)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4)))=sbrdtbr0(X3))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[225])).
% cnf(227,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|~aSet0(X1)|~aElementOf0(X2,X1)|~isFinite0(X1)),inference(split_conjunct,[status(thm)],[226])).
% fof(250, 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)],[33])).
% fof(251, 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)],[250])).
% fof(252, 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(esk6_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk6_3(X5,X6,X7),X5))|~(sbrdtbr0(esk6_3(X5,X6,X7))=X6)))&(aElementOf0(esk6_3(X5,X6,X7),X7)|(aSubsetOf0(esk6_3(X5,X6,X7),X5)&sbrdtbr0(esk6_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(skolemize,[status(esa)],[251])).
% fof(253, 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(esk6_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk6_3(X5,X6,X7),X5))|~(sbrdtbr0(esk6_3(X5,X6,X7))=X6)))&(aElementOf0(esk6_3(X5,X6,X7),X7)|(aSubsetOf0(esk6_3(X5,X6,X7),X5)&sbrdtbr0(esk6_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))),inference(shift_quantors,[status(thm)],[252])).
% fof(254, 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(esk6_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk6_3(X5,X6,X7),X5))|~(sbrdtbr0(esk6_3(X5,X6,X7))=X6)))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((((aSubsetOf0(esk6_3(X5,X6,X7),X5)|aElementOf0(esk6_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&((((sbrdtbr0(esk6_3(X5,X6,X7))=X6|aElementOf0(esk6_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))))),inference(distribute,[status(thm)],[253])).
% cnf(260,plain,(sbrdtbr0(X4)=X1|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[254])).
% cnf(316,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(333,plain,(szszuzczcdt0(xk)=xK),inference(split_conjunct,[status(thm)],[50])).
% cnf(334,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[50])).
% cnf(407,plain,(aSet0(xO)),inference(split_conjunct,[status(thm)],[65])).
% cnf(418,plain,(aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(split_conjunct,[status(thm)],[69])).
% cnf(420,plain,(aSubsetOf0(xQ,xO)),inference(split_conjunct,[status(thm)],[70])).
% cnf(423,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[73])).
% cnf(424,plain,(xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(split_conjunct,[status(thm)],[74])).
% cnf(425,plain,(aSet0(xP)),inference(split_conjunct,[status(thm)],[74])).
% cnf(426,plain,(aElementOf0(xp,xQ)),inference(split_conjunct,[status(thm)],[75])).
% cnf(428,plain,(aSubsetOf0(xP,xQ)),inference(split_conjunct,[status(thm)],[77])).
% cnf(581,negated_conjecture,(sbrdtbr0(xP)!=xk),inference(split_conjunct,[status(thm)],[123])).
% cnf(584,plain,(sdtmndt0(xQ,xp)=xP),inference(rw,[status(thm)],[424,423,theory(equality)])).
% cnf(661,plain,(aSet0(xQ)|~aSet0(xO)),inference(spm,[status(thm)],[146,420,theory(equality)])).
% cnf(670,plain,(aSet0(xQ)|$false),inference(rw,[status(thm)],[661,407,theory(equality)])).
% cnf(671,plain,(aSet0(xQ)),inference(cn,[status(thm)],[670,theory(equality)])).
% cnf(808,plain,(isFinite0(xP)|~isFinite0(xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[151,428,theory(equality)])).
% cnf(874,plain,(X1=xk|szszuzczcdt0(X1)!=xK|~aElementOf0(xk,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[175,333,theory(equality)])).
% cnf(877,plain,(X1=xk|szszuzczcdt0(X1)!=xK|$false|~aElementOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[874,334,theory(equality)])).
% cnf(878,plain,(X1=xk|szszuzczcdt0(X1)!=xK|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[877,theory(equality)])).
% cnf(908,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)|~isFinite0(xQ)|~aElementOf0(xp,xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[227,584,theory(equality)])).
% cnf(911,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)|~isFinite0(xQ)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[908,426,theory(equality)])).
% cnf(912,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)|~isFinite0(xQ)|~aSet0(xQ)),inference(cn,[status(thm)],[911,theory(equality)])).
% cnf(1102,plain,(sbrdtbr0(X1)=X2|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X3,X2))|~aSet0(X3)),inference(er,[status(thm)],[260,theory(equality)])).
% cnf(2660,plain,(isFinite0(xP)|~isFinite0(xQ)|$false),inference(rw,[status(thm)],[808,671,theory(equality)])).
% cnf(2661,plain,(isFinite0(xP)|~isFinite0(xQ)),inference(cn,[status(thm)],[2660,theory(equality)])).
% cnf(4155,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)|~isFinite0(xQ)|$false),inference(rw,[status(thm)],[912,671,theory(equality)])).
% cnf(4156,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)|~isFinite0(xQ)),inference(cn,[status(thm)],[4155,theory(equality)])).
% cnf(4178,plain,(sbrdtbr0(xP)=xk|sbrdtbr0(xQ)!=xK|~aElementOf0(sbrdtbr0(xP),szNzAzT0)|~isFinite0(xQ)),inference(spm,[status(thm)],[878,4156,theory(equality)])).
% cnf(4185,plain,(sbrdtbr0(xQ)!=xK|~aElementOf0(sbrdtbr0(xP),szNzAzT0)|~isFinite0(xQ)),inference(sr,[status(thm)],[4178,581,theory(equality)])).
% cnf(4235,plain,(sbrdtbr0(xQ)!=xK|~isFinite0(xQ)|~isFinite0(xP)|~aSet0(xP)),inference(spm,[status(thm)],[4185,217,theory(equality)])).
% cnf(4238,plain,(sbrdtbr0(xQ)!=xK|~isFinite0(xQ)|~isFinite0(xP)|$false),inference(rw,[status(thm)],[4235,425,theory(equality)])).
% cnf(4239,plain,(sbrdtbr0(xQ)!=xK|~isFinite0(xQ)|~isFinite0(xP)),inference(cn,[status(thm)],[4238,theory(equality)])).
% cnf(4286,plain,(sbrdtbr0(xQ)!=xK|~isFinite0(xQ)),inference(csr,[status(thm)],[4239,2661])).
% cnf(8885,plain,(sbrdtbr0(xQ)=xK|~aElementOf0(xK,szNzAzT0)|~aSet0(xO)),inference(spm,[status(thm)],[1102,418,theory(equality)])).
% cnf(8893,plain,(sbrdtbr0(xQ)=xK|$false|~aSet0(xO)),inference(rw,[status(thm)],[8885,316,theory(equality)])).
% cnf(8894,plain,(sbrdtbr0(xQ)=xK|$false|$false),inference(rw,[status(thm)],[8893,407,theory(equality)])).
% cnf(8895,plain,(sbrdtbr0(xQ)=xK),inference(cn,[status(thm)],[8894,theory(equality)])).
% cnf(8900,plain,(isFinite0(xQ)|~aElementOf0(xK,szNzAzT0)|~aSet0(xQ)),inference(spm,[status(thm)],[218,8895,theory(equality)])).
% cnf(8954,plain,($false|~isFinite0(xQ)),inference(rw,[status(thm)],[4286,8895,theory(equality)])).
% cnf(8955,plain,(~isFinite0(xQ)),inference(cn,[status(thm)],[8954,theory(equality)])).
% cnf(8986,plain,(isFinite0(xQ)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[8900,316,theory(equality)])).
% cnf(8987,plain,(isFinite0(xQ)|$false|$false),inference(rw,[status(thm)],[8986,671,theory(equality)])).
% cnf(8988,plain,(isFinite0(xQ)),inference(cn,[status(thm)],[8987,theory(equality)])).
% cnf(9135,plain,($false),inference(rw,[status(thm)],[8955,8988,theory(equality)])).
% cnf(9136,plain,($false),inference(cn,[status(thm)],[9135,theory(equality)])).
% cnf(9137,plain,($false),9136,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1907
% # ...of these trivial : 25
% # ...subsumed : 863
% # ...remaining for further processing: 1019
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 57
% # Backward-rewritten : 91
% # Generated clauses : 4358
% # ...of the previous two non-trivial : 4167
% # Contextual simplify-reflections : 687
% # Paramodulations : 4295
% # Factorizations : 0
% # Equation resolutions : 63
% # Current number of processed clauses: 663
% # Positive orientable unit clauses: 93
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 37
% # Non-unit-clauses : 533
% # Current number of unprocessed clauses: 2235
% # ...number of literals in the above : 11956
% # Clause-clause subsumption calls (NU) : 39214
% # Rec. Clause-clause subsumption calls : 15236
% # Unit Clause-clause subsumption calls : 2824
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 581 leaves, 1.24+/-0.826 terms/leaf
% # Paramod-from index: 283 leaves, 1.02+/-0.132 terms/leaf
% # Paramod-into index: 499 leaves, 1.15+/-0.589 terms/leaf
% # -------------------------------------------------
% # User time : 0.396 s
% # System time : 0.017 s
% # Total time : 0.413 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.65 CPU 0.71 WC
% FINAL PrfWatch: 0.65 CPU 0.71 WC
% SZS output end Solution for /tmp/SystemOnTPTP15495/NUM611+1.tptp
%
%------------------------------------------------------------------------------