%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM612+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:29 EST 2010
% Result : Theorem 1.89s
% Output : Solution 1.89s
% 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/SystemOnTPTP15754/NUM612+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15754/NUM612+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15754/NUM612+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 15850
% 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(10, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>sdtpldt0(sdtmndt0(X1,X2),X2)=X1)),file('/tmp/SRASS.s.p', mConsDiff)).
% fof(26, axiom,![X1]:(aSet0(X1)=>(aElementOf0(sbrdtbr0(X1),szNzAzT0)<=>isFinite0(X1))),file('/tmp/SRASS.s.p', mCardNum)).
% 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(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(76, axiom,aElementOf0(xp,xO),file('/tmp/SRASS.s.p', m__5182)).
% fof(77, axiom,aSubsetOf0(xP,xQ),file('/tmp/SRASS.s.p', m__5195)).
% fof(80, axiom,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aElement0(X2)=>(~(aElementOf0(X2,X1))=>sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))))),file('/tmp/SRASS.s.p', mCardCons)).
% fof(89, axiom,![X1]:![X2]:((aSet0(X1)&aElement0(X2))=>![X3]:(X3=sdtmndt0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))))),file('/tmp/SRASS.s.p', mDefDiff)).
% fof(105, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(109, conjecture,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)&aElementOf0(sbrdtbr0(xP),szNzAzT0)),file('/tmp/SRASS.s.p', m__)).
% fof(110, negated_conjecture,~((szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)&aElementOf0(sbrdtbr0(xP),szNzAzT0))),inference(assume_negation,[status(cth)],[109])).
% fof(114, plain,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aElement0(X2)=>(~(aElementOf0(X2,X1))=>sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))))),inference(fof_simplification,[status(thm)],[80,theory(equality)])).
% fof(138, 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(139, 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)],[138])).
% fof(140, 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)],[139])).
% fof(141, 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)],[140])).
% fof(142, 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)],[141])).
% cnf(145,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[142])).
% fof(147, plain,![X1]:((~(aSet0(X1))|~(isFinite0(X1)))|![X2]:(~(aSubsetOf0(X2,X1))|isFinite0(X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(148, plain,![X3]:((~(aSet0(X3))|~(isFinite0(X3)))|![X4]:(~(aSubsetOf0(X4,X3))|isFinite0(X4))),inference(variable_rename,[status(thm)],[147])).
% fof(149, plain,![X3]:![X4]:((~(aSubsetOf0(X4,X3))|isFinite0(X4))|(~(aSet0(X3))|~(isFinite0(X3)))),inference(shift_quantors,[status(thm)],[148])).
% cnf(150,plain,(isFinite0(X2)|~isFinite0(X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[149])).
% fof(160, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|sdtpldt0(sdtmndt0(X1,X2),X2)=X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(161, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|sdtpldt0(sdtmndt0(X3,X4),X4)=X3)),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|sdtpldt0(sdtmndt0(X3,X4),X4)=X3)|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[161])).
% cnf(163,plain,(sdtpldt0(sdtmndt0(X1,X2),X2)=X1|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[162])).
% fof(213, plain,![X1]:(~(aSet0(X1))|((~(aElementOf0(sbrdtbr0(X1),szNzAzT0))|isFinite0(X1))&(~(isFinite0(X1))|aElementOf0(sbrdtbr0(X1),szNzAzT0)))),inference(fof_nnf,[status(thm)],[26])).
% fof(214, plain,![X2]:(~(aSet0(X2))|((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))&(~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0)))),inference(variable_rename,[status(thm)],[213])).
% fof(215, plain,![X2]:(((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))|~(aSet0(X2)))&((~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0))|~(aSet0(X2)))),inference(distribute,[status(thm)],[214])).
% cnf(216,plain,(aElementOf0(sbrdtbr0(X1),szNzAzT0)|~aSet0(X1)|~isFinite0(X1)),inference(split_conjunct,[status(thm)],[215])).
% cnf(217,plain,(isFinite0(X1)|~aSet0(X1)|~aElementOf0(sbrdtbr0(X1),szNzAzT0)),inference(split_conjunct,[status(thm)],[215])).
% fof(249, 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(250, 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)],[249])).
% 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))|((~(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)],[250])).
% fof(252, 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)],[251])).
% fof(253, 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)],[252])).
% cnf(259,plain,(sbrdtbr0(X4)=X1|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[253])).
% cnf(315,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(406,plain,(aSet0(xO)),inference(split_conjunct,[status(thm)],[65])).
% cnf(417,plain,(aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(split_conjunct,[status(thm)],[69])).
% cnf(419,plain,(aSubsetOf0(xQ,xO)),inference(split_conjunct,[status(thm)],[70])).
% cnf(422,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[73])).
% cnf(423,plain,(xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(split_conjunct,[status(thm)],[74])).
% cnf(424,plain,(aSet0(xP)),inference(split_conjunct,[status(thm)],[74])).
% cnf(425,plain,(aElementOf0(xp,xQ)),inference(split_conjunct,[status(thm)],[75])).
% cnf(426,plain,(aElementOf0(xp,xO)),inference(split_conjunct,[status(thm)],[76])).
% cnf(427,plain,(aSubsetOf0(xP,xQ)),inference(split_conjunct,[status(thm)],[77])).
% fof(434, plain,![X1]:((~(aSet0(X1))|~(isFinite0(X1)))|![X2]:(~(aElement0(X2))|(aElementOf0(X2,X1)|sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))))),inference(fof_nnf,[status(thm)],[114])).
% fof(435, plain,![X3]:((~(aSet0(X3))|~(isFinite0(X3)))|![X4]:(~(aElement0(X4))|(aElementOf0(X4,X3)|sbrdtbr0(sdtpldt0(X3,X4))=szszuzczcdt0(sbrdtbr0(X3))))),inference(variable_rename,[status(thm)],[434])).
% fof(436, plain,![X3]:![X4]:((~(aElement0(X4))|(aElementOf0(X4,X3)|sbrdtbr0(sdtpldt0(X3,X4))=szszuzczcdt0(sbrdtbr0(X3))))|(~(aSet0(X3))|~(isFinite0(X3)))),inference(shift_quantors,[status(thm)],[435])).
% cnf(437,plain,(sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))|aElementOf0(X2,X1)|~isFinite0(X1)|~aSet0(X1)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[436])).
% fof(505, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElement0(X2)))|![X3]:((~(X3=sdtmndt0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))&(((~(aElement0(X4))|~(aElementOf0(X4,X1)))|X4=X2)|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|((~(aElement0(X4))|~(aElementOf0(X4,X1)))|X4=X2))&(aElementOf0(X4,X3)|((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))))|X3=sdtmndt0(X1,X2)))),inference(fof_nnf,[status(thm)],[89])).
% fof(506, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtmndt0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|((~(aElement0(X9))|~(aElementOf0(X9,X5)))|X9=X6))&(aElementOf0(X9,X7)|((aElement0(X9)&aElementOf0(X9,X5))&~(X9=X6)))))|X7=sdtmndt0(X5,X6)))),inference(variable_rename,[status(thm)],[505])).
% fof(507, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtmndt0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk24_3(X5,X6,X7),X7))|((~(aElement0(esk24_3(X5,X6,X7)))|~(aElementOf0(esk24_3(X5,X6,X7),X5)))|esk24_3(X5,X6,X7)=X6))&(aElementOf0(esk24_3(X5,X6,X7),X7)|((aElement0(esk24_3(X5,X6,X7))&aElementOf0(esk24_3(X5,X6,X7),X5))&~(esk24_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))),inference(skolemize,[status(esa)],[506])).
% fof(508, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=sdtmndt0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk24_3(X5,X6,X7),X7))|((~(aElement0(esk24_3(X5,X6,X7)))|~(aElementOf0(esk24_3(X5,X6,X7),X5)))|esk24_3(X5,X6,X7)=X6))&(aElementOf0(esk24_3(X5,X6,X7),X7)|((aElement0(esk24_3(X5,X6,X7))&aElementOf0(esk24_3(X5,X6,X7),X5))&~(esk24_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))),inference(shift_quantors,[status(thm)],[507])).
% fof(509, plain,![X5]:![X6]:![X7]:![X8]:((((((((aElement0(X8)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6))))&(((aElementOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((~(X8=X6)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&((aSet0(X7)|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElementOf0(esk24_3(X5,X6,X7),X7))|((~(aElement0(esk24_3(X5,X6,X7)))|~(aElementOf0(esk24_3(X5,X6,X7),X5)))|esk24_3(X5,X6,X7)=X6))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((((aElement0(esk24_3(X5,X6,X7))|aElementOf0(esk24_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((aElementOf0(esk24_3(X5,X6,X7),X5)|aElementOf0(esk24_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6)))))&((((~(esk24_3(X5,X6,X7)=X6)|aElementOf0(esk24_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))))),inference(distribute,[status(thm)],[508])).
% cnf(516,plain,(~aElement0(X1)|~aSet0(X2)|X3!=sdtmndt0(X2,X1)|~aElementOf0(X4,X3)|X4!=X1),inference(split_conjunct,[status(thm)],[509])).
% fof(570, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[105])).
% fof(571, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[570])).
% fof(572, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[571])).
% cnf(573,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[572])).
% fof(580, negated_conjecture,(~(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ))|~(aElementOf0(sbrdtbr0(xP),szNzAzT0))),inference(fof_nnf,[status(thm)],[110])).
% cnf(581,negated_conjecture,(~aElementOf0(sbrdtbr0(xP),szNzAzT0)|szszuzczcdt0(sbrdtbr0(xP))!=sbrdtbr0(xQ)),inference(split_conjunct,[status(thm)],[580])).
% cnf(582,plain,(sdtmndt0(X1,X2)!=X3|~aElement0(X2)|~aElementOf0(X2,X3)|~aSet0(X1)),inference(er,[status(thm)],[516,theory(equality)])).
% cnf(584,plain,(sdtmndt0(xQ,xp)=xP),inference(rw,[status(thm)],[423,422,theory(equality)])).
% cnf(623,plain,(~aElement0(X1)|~aElementOf0(X1,sdtmndt0(X2,X1))|~aSet0(X2)),inference(er,[status(thm)],[582,theory(equality)])).
% cnf(708,plain,(aSet0(xQ)|~aSet0(xO)),inference(spm,[status(thm)],[145,419,theory(equality)])).
% cnf(718,plain,(aSet0(xQ)|$false),inference(rw,[status(thm)],[708,406,theory(equality)])).
% cnf(719,plain,(aSet0(xQ)),inference(cn,[status(thm)],[718,theory(equality)])).
% cnf(754,plain,(aElement0(xp)|~aSet0(xO)),inference(spm,[status(thm)],[573,426,theory(equality)])).
% cnf(772,plain,(aElement0(xp)|$false),inference(rw,[status(thm)],[754,406,theory(equality)])).
% cnf(773,plain,(aElement0(xp)),inference(cn,[status(thm)],[772,theory(equality)])).
% cnf(809,plain,(isFinite0(xP)|~isFinite0(xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[150,427,theory(equality)])).
% cnf(855,plain,(sdtpldt0(xP,xp)=xQ|~aElementOf0(xp,xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[163,584,theory(equality)])).
% cnf(856,plain,(sdtpldt0(xP,xp)=xQ|$false|~aSet0(xQ)),inference(rw,[status(thm)],[855,425,theory(equality)])).
% cnf(857,plain,(sdtpldt0(xP,xp)=xQ|~aSet0(xQ)),inference(cn,[status(thm)],[856,theory(equality)])).
% cnf(1122,plain,(sbrdtbr0(X1)=X2|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X3,X2))|~aSet0(X3)),inference(er,[status(thm)],[259,theory(equality)])).
% cnf(2011,plain,(~aElement0(xp)|~aElementOf0(xp,xP)|~aSet0(xQ)),inference(spm,[status(thm)],[623,584,theory(equality)])).
% cnf(2013,plain,($false|~aElementOf0(xp,xP)|~aSet0(xQ)),inference(rw,[status(thm)],[2011,773,theory(equality)])).
% cnf(2014,plain,($false|~aElementOf0(xp,xP)|$false),inference(rw,[status(thm)],[2013,719,theory(equality)])).
% cnf(2015,plain,(~aElementOf0(xp,xP)),inference(cn,[status(thm)],[2014,theory(equality)])).
% cnf(2510,plain,(sdtpldt0(xP,xp)=xQ|$false),inference(rw,[status(thm)],[857,719,theory(equality)])).
% cnf(2511,plain,(sdtpldt0(xP,xp)=xQ),inference(cn,[status(thm)],[2510,theory(equality)])).
% cnf(2515,plain,(sbrdtbr0(xQ)=szszuzczcdt0(sbrdtbr0(xP))|aElementOf0(xp,xP)|~aElement0(xp)|~isFinite0(xP)|~aSet0(xP)),inference(spm,[status(thm)],[437,2511,theory(equality)])).
% cnf(2531,plain,(sbrdtbr0(xQ)=szszuzczcdt0(sbrdtbr0(xP))|aElementOf0(xp,xP)|$false|~isFinite0(xP)|~aSet0(xP)),inference(rw,[status(thm)],[2515,773,theory(equality)])).
% cnf(2532,plain,(sbrdtbr0(xQ)=szszuzczcdt0(sbrdtbr0(xP))|aElementOf0(xp,xP)|$false|~isFinite0(xP)|$false),inference(rw,[status(thm)],[2531,424,theory(equality)])).
% cnf(2533,plain,(sbrdtbr0(xQ)=szszuzczcdt0(sbrdtbr0(xP))|aElementOf0(xp,xP)|~isFinite0(xP)),inference(cn,[status(thm)],[2532,theory(equality)])).
% cnf(2534,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)|~isFinite0(xP)),inference(sr,[status(thm)],[2533,2015,theory(equality)])).
% cnf(2607,negated_conjecture,(~aElementOf0(sbrdtbr0(xP),szNzAzT0)|~isFinite0(xP)),inference(spm,[status(thm)],[581,2534,theory(equality)])).
% cnf(2743,negated_conjecture,(~isFinite0(xP)|~aSet0(xP)),inference(spm,[status(thm)],[2607,216,theory(equality)])).
% cnf(2746,negated_conjecture,(~isFinite0(xP)|$false),inference(rw,[status(thm)],[2743,424,theory(equality)])).
% cnf(2747,negated_conjecture,(~isFinite0(xP)),inference(cn,[status(thm)],[2746,theory(equality)])).
% cnf(2796,plain,(isFinite0(xP)|~isFinite0(xQ)|$false),inference(rw,[status(thm)],[809,719,theory(equality)])).
% cnf(2797,plain,(isFinite0(xP)|~isFinite0(xQ)),inference(cn,[status(thm)],[2796,theory(equality)])).
% cnf(2798,plain,(~isFinite0(xQ)),inference(sr,[status(thm)],[2797,2747,theory(equality)])).
% cnf(10332,plain,(sbrdtbr0(xQ)=xK|~aElementOf0(xK,szNzAzT0)|~aSet0(xO)),inference(spm,[status(thm)],[1122,417,theory(equality)])).
% cnf(10344,plain,(sbrdtbr0(xQ)=xK|$false|~aSet0(xO)),inference(rw,[status(thm)],[10332,315,theory(equality)])).
% cnf(10345,plain,(sbrdtbr0(xQ)=xK|$false|$false),inference(rw,[status(thm)],[10344,406,theory(equality)])).
% cnf(10346,plain,(sbrdtbr0(xQ)=xK),inference(cn,[status(thm)],[10345,theory(equality)])).
% cnf(10351,plain,(isFinite0(xQ)|~aElementOf0(xK,szNzAzT0)|~aSet0(xQ)),inference(spm,[status(thm)],[217,10346,theory(equality)])).
% cnf(10395,plain,(isFinite0(xQ)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[10351,315,theory(equality)])).
% cnf(10396,plain,(isFinite0(xQ)|$false|$false),inference(rw,[status(thm)],[10395,719,theory(equality)])).
% cnf(10397,plain,(isFinite0(xQ)),inference(cn,[status(thm)],[10396,theory(equality)])).
% cnf(10398,plain,($false),inference(sr,[status(thm)],[10397,2798,theory(equality)])).
% cnf(10399,plain,($false),10398,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1958
% # ...of these trivial : 24
% # ...subsumed : 916
% # ...remaining for further processing: 1018
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 41
% # Backward-rewritten : 14
% # Generated clauses : 4975
% # ...of the previous two non-trivial : 4500
% # Contextual simplify-reflections : 719
% # Paramodulations : 4907
% # Factorizations : 0
% # Equation resolutions : 65
% # Current number of processed clauses: 753
% # Positive orientable unit clauses: 99
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 42
% # Non-unit-clauses : 612
% # Current number of unprocessed clauses: 2762
% # ...number of literals in the above : 15720
% # Clause-clause subsumption calls (NU) : 52063
% # Rec. Clause-clause subsumption calls : 19920
% # Unit Clause-clause subsumption calls : 2913
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 640 leaves, 1.23+/-0.780 terms/leaf
% # Paramod-from index: 320 leaves, 1.02+/-0.136 terms/leaf
% # Paramod-into index: 547 leaves, 1.14+/-0.511 terms/leaf
% # -------------------------------------------------
% # User time : 0.440 s
% # System time : 0.013 s
% # Total time : 0.453 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.71 CPU 0.78 WC
% FINAL PrfWatch: 0.71 CPU 0.78 WC
% SZS output end Solution for /tmp/SystemOnTPTP15754/NUM612+1.tptp
%
%------------------------------------------------------------------------------