TSTP Solution File: NUM556+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM556+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:05:37 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP15191/NUM556+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15191/NUM556+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15191/NUM556+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 15287
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.026 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(4, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(8, axiom,![X1]:![X2]:![X3]:(((aSet0(X1)&aSet0(X2))&aSet0(X3))=>((aSubsetOf0(X1,X2)&aSubsetOf0(X2,X3))=>aSubsetOf0(X1,X3))),file('/tmp/SRASS.s.p', mSubTrans)).
% fof(12, axiom,![X1]:![X2]:((aElement0(X1)&aSet0(X2))=>(~(aElementOf0(X1,X2))=>sdtmndt0(sdtpldt0(X2,X1),X1)=X2)),file('/tmp/SRASS.s.p', mDiffCons)).
% fof(13, axiom,![X1]:(aElement0(X1)=>![X2]:((aSet0(X2)&isFinite0(X2))=>isFinite0(sdtpldt0(X2,X1)))),file('/tmp/SRASS.s.p', mFConsSet)).
% fof(14, axiom,![X1]:(aElement0(X1)=>![X2]:((aSet0(X2)&isFinite0(X2))=>isFinite0(sdtmndt0(X2,X1)))),file('/tmp/SRASS.s.p', mFDiffSet)).
% fof(23, axiom,((aSet0(xS)&aSet0(xT))&~(xk=sz00)),file('/tmp/SRASS.s.p', m__2202_02)).
% fof(25, axiom,aElementOf0(xx,xS),file('/tmp/SRASS.s.p', m__2256)).
% fof(26, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),file('/tmp/SRASS.s.p', m__2270)).
% fof(27, axiom,((aSet0(xQ)&isFinite0(xQ))&sbrdtbr0(xQ)=xk),file('/tmp/SRASS.s.p', m__2291)).
% fof(28, axiom,(aElement0(xy)&aElementOf0(xy,xQ)),file('/tmp/SRASS.s.p', m__2304)).
% fof(31, axiom,((((aSet0(sdtmndt0(xQ,xy))&![X1]:(aElementOf0(X1,sdtmndt0(xQ,xy))<=>((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=xy))))&aSet0(xP))&![X1]:(aElementOf0(X1,xP)<=>(aElement0(X1)&(aElementOf0(X1,sdtmndt0(xQ,xy))|X1=xx))))&xP=sdtpldt0(sdtmndt0(xQ,xy),xx)),file('/tmp/SRASS.s.p', m__2357)).
% fof(32, axiom,((~(aElementOf0(xx,sdtmndt0(xQ,xy)))&aSet0(sdtmndt0(xQ,xy)))&![X1]:(aElementOf0(X1,sdtmndt0(xQ,xy))<=>((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=xy)))),file('/tmp/SRASS.s.p', m__2411)).
% fof(35, axiom,![X1]:(aSet0(X1)=>![X2]:((isFinite0(X1)&aElementOf0(X2,X1))=>szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1))),file('/tmp/SRASS.s.p', mCardDiff)).
% fof(72, conjecture,((![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xS))|aSubsetOf0(xP,xS))&sbrdtbr0(xP)=xk),file('/tmp/SRASS.s.p', m__)).
% fof(73, negated_conjecture,~(((![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xS))|aSubsetOf0(xP,xS))&sbrdtbr0(xP)=xk)),inference(assume_negation,[status(cth)],[72])).
% fof(74, plain,![X1]:![X2]:((aElement0(X1)&aSet0(X2))=>(~(aElementOf0(X1,X2))=>sdtmndt0(sdtpldt0(X2,X1),X1)=X2)),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(78, plain,((~(aElementOf0(xx,sdtmndt0(xQ,xy)))&aSet0(sdtmndt0(xQ,xy)))&![X1]:(aElementOf0(X1,sdtmndt0(xQ,xy))<=>((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=xy)))),inference(fof_simplification,[status(thm)],[32,theory(equality)])).
% fof(88, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(89, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[89])).
% cnf(91,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[90])).
% fof(101, 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)],[4])).
% fof(102, 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)],[101])).
% fof(103, 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)],[102])).
% fof(104, 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)],[103])).
% fof(105, 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)],[104])).
% cnf(106,plain,(aSubsetOf0(X2,X1)|~aSet0(X1)|~aSet0(X2)|~aElementOf0(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[105])).
% cnf(107,plain,(aSubsetOf0(X2,X1)|aElementOf0(esk2_2(X1,X2),X2)|~aSet0(X1)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[105])).
% cnf(108,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[105])).
% cnf(109,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[105])).
% fof(120, plain,![X1]:![X2]:![X3]:(((~(aSet0(X1))|~(aSet0(X2)))|~(aSet0(X3)))|((~(aSubsetOf0(X1,X2))|~(aSubsetOf0(X2,X3)))|aSubsetOf0(X1,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(121, plain,![X4]:![X5]:![X6]:(((~(aSet0(X4))|~(aSet0(X5)))|~(aSet0(X6)))|((~(aSubsetOf0(X4,X5))|~(aSubsetOf0(X5,X6)))|aSubsetOf0(X4,X6))),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2)|~aSet0(X3)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[121])).
% fof(155, plain,![X1]:![X2]:((~(aElement0(X1))|~(aSet0(X2)))|(aElementOf0(X1,X2)|sdtmndt0(sdtpldt0(X2,X1),X1)=X2)),inference(fof_nnf,[status(thm)],[74])).
% fof(156, plain,![X3]:![X4]:((~(aElement0(X3))|~(aSet0(X4)))|(aElementOf0(X3,X4)|sdtmndt0(sdtpldt0(X4,X3),X3)=X4)),inference(variable_rename,[status(thm)],[155])).
% cnf(157,plain,(sdtmndt0(sdtpldt0(X1,X2),X2)=X1|aElementOf0(X2,X1)|~aSet0(X1)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[156])).
% fof(158, plain,![X1]:(~(aElement0(X1))|![X2]:((~(aSet0(X2))|~(isFinite0(X2)))|isFinite0(sdtpldt0(X2,X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(159, plain,![X3]:(~(aElement0(X3))|![X4]:((~(aSet0(X4))|~(isFinite0(X4)))|isFinite0(sdtpldt0(X4,X3)))),inference(variable_rename,[status(thm)],[158])).
% fof(160, plain,![X3]:![X4]:(((~(aSet0(X4))|~(isFinite0(X4)))|isFinite0(sdtpldt0(X4,X3)))|~(aElement0(X3))),inference(shift_quantors,[status(thm)],[159])).
% cnf(161,plain,(isFinite0(sdtpldt0(X2,X1))|~aElement0(X1)|~isFinite0(X2)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[160])).
% fof(162, plain,![X1]:(~(aElement0(X1))|![X2]:((~(aSet0(X2))|~(isFinite0(X2)))|isFinite0(sdtmndt0(X2,X1)))),inference(fof_nnf,[status(thm)],[14])).
% fof(163, plain,![X3]:(~(aElement0(X3))|![X4]:((~(aSet0(X4))|~(isFinite0(X4)))|isFinite0(sdtmndt0(X4,X3)))),inference(variable_rename,[status(thm)],[162])).
% fof(164, plain,![X3]:![X4]:(((~(aSet0(X4))|~(isFinite0(X4)))|isFinite0(sdtmndt0(X4,X3)))|~(aElement0(X3))),inference(shift_quantors,[status(thm)],[163])).
% cnf(165,plain,(isFinite0(sdtmndt0(X2,X1))|~aElement0(X1)|~isFinite0(X2)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[164])).
% cnf(203,plain,(aSet0(xS)),inference(split_conjunct,[status(thm)],[23])).
% cnf(236,plain,(aElementOf0(xx,xS)),inference(split_conjunct,[status(thm)],[25])).
% fof(237, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(fof_nnf,[status(thm)],[26])).
% fof(238, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(variable_rename,[status(thm)],[237])).
% fof(239, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xS))&aSet0(xQ))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(shift_quantors,[status(thm)],[238])).
% cnf(241,plain,(sbrdtbr0(xQ)=xk),inference(split_conjunct,[status(thm)],[239])).
% cnf(242,plain,(aSubsetOf0(xQ,xS)),inference(split_conjunct,[status(thm)],[239])).
% cnf(243,plain,(aSet0(xQ)),inference(split_conjunct,[status(thm)],[239])).
% cnf(246,plain,(isFinite0(xQ)),inference(split_conjunct,[status(thm)],[27])).
% cnf(248,plain,(aElementOf0(xy,xQ)),inference(split_conjunct,[status(thm)],[28])).
% cnf(249,plain,(aElement0(xy)),inference(split_conjunct,[status(thm)],[28])).
% fof(252, plain,((((aSet0(sdtmndt0(xQ,xy))&![X1]:((~(aElementOf0(X1,sdtmndt0(xQ,xy)))|((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=xy)))&(((~(aElement0(X1))|~(aElementOf0(X1,xQ)))|X1=xy)|aElementOf0(X1,sdtmndt0(xQ,xy)))))&aSet0(xP))&![X1]:((~(aElementOf0(X1,xP))|(aElement0(X1)&(aElementOf0(X1,sdtmndt0(xQ,xy))|X1=xx)))&((~(aElement0(X1))|(~(aElementOf0(X1,sdtmndt0(xQ,xy)))&~(X1=xx)))|aElementOf0(X1,xP))))&xP=sdtpldt0(sdtmndt0(xQ,xy),xx)),inference(fof_nnf,[status(thm)],[31])).
% fof(253, plain,((((aSet0(sdtmndt0(xQ,xy))&![X2]:((~(aElementOf0(X2,sdtmndt0(xQ,xy)))|((aElement0(X2)&aElementOf0(X2,xQ))&~(X2=xy)))&(((~(aElement0(X2))|~(aElementOf0(X2,xQ)))|X2=xy)|aElementOf0(X2,sdtmndt0(xQ,xy)))))&aSet0(xP))&![X3]:((~(aElementOf0(X3,xP))|(aElement0(X3)&(aElementOf0(X3,sdtmndt0(xQ,xy))|X3=xx)))&((~(aElement0(X3))|(~(aElementOf0(X3,sdtmndt0(xQ,xy)))&~(X3=xx)))|aElementOf0(X3,xP))))&xP=sdtpldt0(sdtmndt0(xQ,xy),xx)),inference(variable_rename,[status(thm)],[252])).
% fof(254, plain,![X2]:![X3]:((((~(aElementOf0(X3,xP))|(aElement0(X3)&(aElementOf0(X3,sdtmndt0(xQ,xy))|X3=xx)))&((~(aElement0(X3))|(~(aElementOf0(X3,sdtmndt0(xQ,xy)))&~(X3=xx)))|aElementOf0(X3,xP)))&((((~(aElementOf0(X2,sdtmndt0(xQ,xy)))|((aElement0(X2)&aElementOf0(X2,xQ))&~(X2=xy)))&(((~(aElement0(X2))|~(aElementOf0(X2,xQ)))|X2=xy)|aElementOf0(X2,sdtmndt0(xQ,xy))))&aSet0(sdtmndt0(xQ,xy)))&aSet0(xP)))&xP=sdtpldt0(sdtmndt0(xQ,xy),xx)),inference(shift_quantors,[status(thm)],[253])).
% fof(255, plain,![X2]:![X3]:(((((aElement0(X3)|~(aElementOf0(X3,xP)))&((aElementOf0(X3,sdtmndt0(xQ,xy))|X3=xx)|~(aElementOf0(X3,xP))))&(((~(aElementOf0(X3,sdtmndt0(xQ,xy)))|~(aElement0(X3)))|aElementOf0(X3,xP))&((~(X3=xx)|~(aElement0(X3)))|aElementOf0(X3,xP))))&((((((aElement0(X2)|~(aElementOf0(X2,sdtmndt0(xQ,xy))))&(aElementOf0(X2,xQ)|~(aElementOf0(X2,sdtmndt0(xQ,xy)))))&(~(X2=xy)|~(aElementOf0(X2,sdtmndt0(xQ,xy)))))&(((~(aElement0(X2))|~(aElementOf0(X2,xQ)))|X2=xy)|aElementOf0(X2,sdtmndt0(xQ,xy))))&aSet0(sdtmndt0(xQ,xy)))&aSet0(xP)))&xP=sdtpldt0(sdtmndt0(xQ,xy),xx)),inference(distribute,[status(thm)],[254])).
% cnf(256,plain,(xP=sdtpldt0(sdtmndt0(xQ,xy),xx)),inference(split_conjunct,[status(thm)],[255])).
% cnf(257,plain,(aSet0(xP)),inference(split_conjunct,[status(thm)],[255])).
% cnf(258,plain,(aSet0(sdtmndt0(xQ,xy))),inference(split_conjunct,[status(thm)],[255])).
% cnf(261,plain,(aElementOf0(X1,xQ)|~aElementOf0(X1,sdtmndt0(xQ,xy))),inference(split_conjunct,[status(thm)],[255])).
% cnf(263,plain,(aElementOf0(X1,xP)|~aElement0(X1)|X1!=xx),inference(split_conjunct,[status(thm)],[255])).
% cnf(265,plain,(X1=xx|aElementOf0(X1,sdtmndt0(xQ,xy))|~aElementOf0(X1,xP)),inference(split_conjunct,[status(thm)],[255])).
% fof(267, plain,((~(aElementOf0(xx,sdtmndt0(xQ,xy)))&aSet0(sdtmndt0(xQ,xy)))&![X1]:((~(aElementOf0(X1,sdtmndt0(xQ,xy)))|((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=xy)))&(((~(aElement0(X1))|~(aElementOf0(X1,xQ)))|X1=xy)|aElementOf0(X1,sdtmndt0(xQ,xy))))),inference(fof_nnf,[status(thm)],[78])).
% fof(268, plain,((~(aElementOf0(xx,sdtmndt0(xQ,xy)))&aSet0(sdtmndt0(xQ,xy)))&![X2]:((~(aElementOf0(X2,sdtmndt0(xQ,xy)))|((aElement0(X2)&aElementOf0(X2,xQ))&~(X2=xy)))&(((~(aElement0(X2))|~(aElementOf0(X2,xQ)))|X2=xy)|aElementOf0(X2,sdtmndt0(xQ,xy))))),inference(variable_rename,[status(thm)],[267])).
% fof(269, plain,![X2]:(((~(aElementOf0(X2,sdtmndt0(xQ,xy)))|((aElement0(X2)&aElementOf0(X2,xQ))&~(X2=xy)))&(((~(aElement0(X2))|~(aElementOf0(X2,xQ)))|X2=xy)|aElementOf0(X2,sdtmndt0(xQ,xy))))&(~(aElementOf0(xx,sdtmndt0(xQ,xy)))&aSet0(sdtmndt0(xQ,xy)))),inference(shift_quantors,[status(thm)],[268])).
% fof(270, plain,![X2]:(((((aElement0(X2)|~(aElementOf0(X2,sdtmndt0(xQ,xy))))&(aElementOf0(X2,xQ)|~(aElementOf0(X2,sdtmndt0(xQ,xy)))))&(~(X2=xy)|~(aElementOf0(X2,sdtmndt0(xQ,xy)))))&(((~(aElement0(X2))|~(aElementOf0(X2,xQ)))|X2=xy)|aElementOf0(X2,sdtmndt0(xQ,xy))))&(~(aElementOf0(xx,sdtmndt0(xQ,xy)))&aSet0(sdtmndt0(xQ,xy)))),inference(distribute,[status(thm)],[269])).
% cnf(272,plain,(~aElementOf0(xx,sdtmndt0(xQ,xy))),inference(split_conjunct,[status(thm)],[270])).
% fof(287, plain,![X1]:(~(aSet0(X1))|![X2]:((~(isFinite0(X1))|~(aElementOf0(X2,X1)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1))),inference(fof_nnf,[status(thm)],[35])).
% fof(288, plain,![X3]:(~(aSet0(X3))|![X4]:((~(isFinite0(X3))|~(aElementOf0(X4,X3)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4)))=sbrdtbr0(X3))),inference(variable_rename,[status(thm)],[287])).
% fof(289, plain,![X3]:![X4]:(((~(isFinite0(X3))|~(aElementOf0(X4,X3)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4)))=sbrdtbr0(X3))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[288])).
% cnf(290,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|~aSet0(X1)|~aElementOf0(X2,X1)|~isFinite0(X1)),inference(split_conjunct,[status(thm)],[289])).
% fof(430, negated_conjecture,((?[X1]:(aElementOf0(X1,xP)&~(aElementOf0(X1,xS)))&~(aSubsetOf0(xP,xS)))|~(sbrdtbr0(xP)=xk)),inference(fof_nnf,[status(thm)],[73])).
% fof(431, negated_conjecture,((?[X2]:(aElementOf0(X2,xP)&~(aElementOf0(X2,xS)))&~(aSubsetOf0(xP,xS)))|~(sbrdtbr0(xP)=xk)),inference(variable_rename,[status(thm)],[430])).
% fof(432, negated_conjecture,(((aElementOf0(esk16_0,xP)&~(aElementOf0(esk16_0,xS)))&~(aSubsetOf0(xP,xS)))|~(sbrdtbr0(xP)=xk)),inference(skolemize,[status(esa)],[431])).
% fof(433, negated_conjecture,(((aElementOf0(esk16_0,xP)|~(sbrdtbr0(xP)=xk))&(~(aElementOf0(esk16_0,xS))|~(sbrdtbr0(xP)=xk)))&(~(aSubsetOf0(xP,xS))|~(sbrdtbr0(xP)=xk))),inference(distribute,[status(thm)],[432])).
% cnf(435,negated_conjecture,(sbrdtbr0(xP)!=xk|~aElementOf0(esk16_0,xS)),inference(split_conjunct,[status(thm)],[433])).
% cnf(436,negated_conjecture,(aElementOf0(esk16_0,xP)|sbrdtbr0(xP)!=xk),inference(split_conjunct,[status(thm)],[433])).
% cnf(449,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X3)|~aSet0(X2)),inference(csr,[status(thm)],[122,108])).
% cnf(450,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2)),inference(csr,[status(thm)],[449,108])).
% cnf(537,plain,(aElement0(xx)|~aSet0(xS)),inference(spm,[status(thm)],[91,236,theory(equality)])).
% cnf(550,plain,(aElement0(xx)|$false),inference(rw,[status(thm)],[537,203,theory(equality)])).
% cnf(551,plain,(aElement0(xx)),inference(cn,[status(thm)],[550,theory(equality)])).
% cnf(661,plain,(isFinite0(xP)|~isFinite0(sdtmndt0(xQ,xy))|~aElement0(xx)|~aSet0(sdtmndt0(xQ,xy))),inference(spm,[status(thm)],[161,256,theory(equality)])).
% cnf(662,plain,(isFinite0(xP)|~isFinite0(sdtmndt0(xQ,xy))|~aElement0(xx)|$false),inference(rw,[status(thm)],[661,258,theory(equality)])).
% cnf(663,plain,(isFinite0(xP)|~isFinite0(sdtmndt0(xQ,xy))|~aElement0(xx)),inference(cn,[status(thm)],[662,theory(equality)])).
% cnf(665,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,xQ)|~aSet0(xS)),inference(spm,[status(thm)],[450,242,theory(equality)])).
% cnf(668,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,xQ)|$false),inference(rw,[status(thm)],[665,203,theory(equality)])).
% cnf(669,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,xQ)),inference(cn,[status(thm)],[668,theory(equality)])).
% cnf(721,plain,(aElementOf0(esk2_2(X1,sdtmndt0(xQ,xy)),xQ)|aSubsetOf0(sdtmndt0(xQ,xy),X1)|~aSet0(sdtmndt0(xQ,xy))|~aSet0(X1)),inference(spm,[status(thm)],[261,107,theory(equality)])).
% cnf(745,plain,(aElementOf0(esk2_2(X1,sdtmndt0(xQ,xy)),xQ)|aSubsetOf0(sdtmndt0(xQ,xy),X1)|$false|~aSet0(X1)),inference(rw,[status(thm)],[721,258,theory(equality)])).
% cnf(746,plain,(aElementOf0(esk2_2(X1,sdtmndt0(xQ,xy)),xQ)|aSubsetOf0(sdtmndt0(xQ,xy),X1)|~aSet0(X1)),inference(cn,[status(thm)],[745,theory(equality)])).
% cnf(969,plain,(sdtmndt0(xP,xx)=sdtmndt0(xQ,xy)|aElementOf0(xx,sdtmndt0(xQ,xy))|~aElement0(xx)|~aSet0(sdtmndt0(xQ,xy))),inference(spm,[status(thm)],[157,256,theory(equality)])).
% cnf(972,plain,(sdtmndt0(xP,xx)=sdtmndt0(xQ,xy)|aElementOf0(xx,sdtmndt0(xQ,xy))|~aElement0(xx)|$false),inference(rw,[status(thm)],[969,258,theory(equality)])).
% cnf(973,plain,(sdtmndt0(xP,xx)=sdtmndt0(xQ,xy)|aElementOf0(xx,sdtmndt0(xQ,xy))|~aElement0(xx)),inference(cn,[status(thm)],[972,theory(equality)])).
% cnf(974,plain,(sdtmndt0(xP,xx)=sdtmndt0(xQ,xy)|~aElement0(xx)),inference(sr,[status(thm)],[973,272,theory(equality)])).
% cnf(1473,plain,(aElementOf0(xx,xP)),inference(spm,[status(thm)],[263,551,theory(equality)])).
% cnf(2871,plain,(isFinite0(xP)|~isFinite0(sdtmndt0(xQ,xy))|$false),inference(rw,[status(thm)],[663,551,theory(equality)])).
% cnf(2872,plain,(isFinite0(xP)|~isFinite0(sdtmndt0(xQ,xy))),inference(cn,[status(thm)],[2871,theory(equality)])).
% cnf(2874,plain,(isFinite0(xP)|~isFinite0(xQ)|~aElement0(xy)|~aSet0(xQ)),inference(spm,[status(thm)],[2872,165,theory(equality)])).
% cnf(2877,plain,(isFinite0(xP)|$false|~aElement0(xy)|~aSet0(xQ)),inference(rw,[status(thm)],[2874,246,theory(equality)])).
% cnf(2878,plain,(isFinite0(xP)|$false|$false|~aSet0(xQ)),inference(rw,[status(thm)],[2877,249,theory(equality)])).
% cnf(2879,plain,(isFinite0(xP)|$false|$false|$false),inference(rw,[status(thm)],[2878,243,theory(equality)])).
% cnf(2880,plain,(isFinite0(xP)),inference(cn,[status(thm)],[2879,theory(equality)])).
% cnf(4250,plain,(aSubsetOf0(sdtmndt0(xQ,xy),xQ)|~aSet0(sdtmndt0(xQ,xy))|~aSet0(xQ)),inference(spm,[status(thm)],[106,746,theory(equality)])).
% cnf(4265,plain,(aSubsetOf0(sdtmndt0(xQ,xy),xQ)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[4250,258,theory(equality)])).
% cnf(4266,plain,(aSubsetOf0(sdtmndt0(xQ,xy),xQ)|$false|$false),inference(rw,[status(thm)],[4265,243,theory(equality)])).
% cnf(4267,plain,(aSubsetOf0(sdtmndt0(xQ,xy),xQ)),inference(cn,[status(thm)],[4266,theory(equality)])).
% cnf(4276,plain,(aSubsetOf0(sdtmndt0(xQ,xy),xS)),inference(spm,[status(thm)],[669,4267,theory(equality)])).
% cnf(4299,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtmndt0(xQ,xy))|~aSet0(xS)),inference(spm,[status(thm)],[109,4276,theory(equality)])).
% cnf(4309,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtmndt0(xQ,xy))|$false),inference(rw,[status(thm)],[4299,203,theory(equality)])).
% cnf(4310,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtmndt0(xQ,xy))),inference(cn,[status(thm)],[4309,theory(equality)])).
% cnf(4479,plain,(aElementOf0(X1,xS)|xx=X1|~aElementOf0(X1,xP)),inference(spm,[status(thm)],[4310,265,theory(equality)])).
% cnf(5445,plain,(sdtmndt0(xP,xx)=sdtmndt0(xQ,xy)|$false),inference(rw,[status(thm)],[974,551,theory(equality)])).
% cnf(5446,plain,(sdtmndt0(xP,xx)=sdtmndt0(xQ,xy)),inference(cn,[status(thm)],[5445,theory(equality)])).
% cnf(5452,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xQ,xy)))=sbrdtbr0(xP)|~isFinite0(xP)|~aElementOf0(xx,xP)|~aSet0(xP)),inference(spm,[status(thm)],[290,5446,theory(equality)])).
% cnf(5489,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xQ,xy)))=sbrdtbr0(xP)|$false|~aElementOf0(xx,xP)|~aSet0(xP)),inference(rw,[status(thm)],[5452,2880,theory(equality)])).
% cnf(5490,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xQ,xy)))=sbrdtbr0(xP)|$false|$false|~aSet0(xP)),inference(rw,[status(thm)],[5489,1473,theory(equality)])).
% cnf(5491,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xQ,xy)))=sbrdtbr0(xP)|$false|$false|$false),inference(rw,[status(thm)],[5490,257,theory(equality)])).
% cnf(5492,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xQ,xy)))=sbrdtbr0(xP)),inference(cn,[status(thm)],[5491,theory(equality)])).
% cnf(5620,plain,(sbrdtbr0(xP)=sbrdtbr0(xQ)|~isFinite0(xQ)|~aElementOf0(xy,xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[290,5492,theory(equality)])).
% cnf(5664,plain,(sbrdtbr0(xP)=xk|~isFinite0(xQ)|~aElementOf0(xy,xQ)|~aSet0(xQ)),inference(rw,[status(thm)],[5620,241,theory(equality)])).
% cnf(5665,plain,(sbrdtbr0(xP)=xk|$false|~aElementOf0(xy,xQ)|~aSet0(xQ)),inference(rw,[status(thm)],[5664,246,theory(equality)])).
% cnf(5666,plain,(sbrdtbr0(xP)=xk|$false|$false|~aSet0(xQ)),inference(rw,[status(thm)],[5665,248,theory(equality)])).
% cnf(5667,plain,(sbrdtbr0(xP)=xk|$false|$false|$false),inference(rw,[status(thm)],[5666,243,theory(equality)])).
% cnf(5668,plain,(sbrdtbr0(xP)=xk),inference(cn,[status(thm)],[5667,theory(equality)])).
% cnf(5704,negated_conjecture,($false|~aElementOf0(esk16_0,xS)),inference(rw,[status(thm)],[435,5668,theory(equality)])).
% cnf(5705,negated_conjecture,(~aElementOf0(esk16_0,xS)),inference(cn,[status(thm)],[5704,theory(equality)])).
% cnf(5706,negated_conjecture,(aElementOf0(esk16_0,xP)|$false),inference(rw,[status(thm)],[436,5668,theory(equality)])).
% cnf(5707,negated_conjecture,(aElementOf0(esk16_0,xP)),inference(cn,[status(thm)],[5706,theory(equality)])).
% cnf(5759,negated_conjecture,(xx=esk16_0|aElementOf0(esk16_0,xS)),inference(spm,[status(thm)],[4479,5707,theory(equality)])).
% cnf(5793,negated_conjecture,(esk16_0=xx),inference(sr,[status(thm)],[5759,5705,theory(equality)])).
% cnf(5864,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5705,5793,theory(equality)]),236,theory(equality)])).
% cnf(5865,negated_conjecture,($false),inference(cn,[status(thm)],[5864,theory(equality)])).
% cnf(5866,negated_conjecture,($false),5865,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1202
% # ...of these trivial : 20
% # ...subsumed : 494
% # ...remaining for further processing: 688
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 25
% # Backward-rewritten : 23
% # Generated clauses : 2782
% # ...of the previous two non-trivial : 2448
% # Contextual simplify-reflections : 241
% # Paramodulations : 2746
% # Factorizations : 0
% # Equation resolutions : 35
% # Current number of processed clauses: 481
% # Positive orientable unit clauses: 67
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 30
% # Non-unit-clauses : 384
% # Current number of unprocessed clauses: 1458
% # ...number of literals in the above : 7009
% # Clause-clause subsumption calls (NU) : 7932
% # Rec. Clause-clause subsumption calls : 3931
% # Unit Clause-clause subsumption calls : 664
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 381 leaves, 1.22+/-0.666 terms/leaf
% # Paramod-from index: 192 leaves, 1.08+/-0.268 terms/leaf
% # Paramod-into index: 328 leaves, 1.16+/-0.525 terms/leaf
% # -------------------------------------------------
% # User time : 0.211 s
% # System time : 0.009 s
% # Total time : 0.220 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.39 CPU 0.47 WC
% FINAL PrfWatch: 0.39 CPU 0.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP15191/NUM556+3.tptp
%
%------------------------------------------------------------------------------