%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM538+2 : 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 19:58:18 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP19008/NUM538+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19008/NUM538+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19008/NUM538+2.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 19104
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 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(2, 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(5, axiom,aSet0(xS),file('/tmp/SRASS.s.p', m__1522)).
% fof(6, axiom,(isFinite0(xS)&aElementOf0(xx,xS)),file('/tmp/SRASS.s.p', m__1522_02)).
% fof(7, 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(12, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>sdtpldt0(sdtmndt0(X1,X2),X2)=X1)),file('/tmp/SRASS.s.p', mConsDiff)).
% fof(19, axiom,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aSubsetOf0(X2,X1)=>isFinite0(X2))),file('/tmp/SRASS.s.p', mSubFSet)).
% fof(28, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(46, conjecture,((aSet0(sdtmndt0(xS,xx))&![X1]:(aElementOf0(X1,sdtmndt0(xS,xx))<=>((aElement0(X1)&aElementOf0(X1,xS))&~(X1=xx))))=>szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)),file('/tmp/SRASS.s.p', m__)).
% fof(47, negated_conjecture,~(((aSet0(sdtmndt0(xS,xx))&![X1]:(aElementOf0(X1,sdtmndt0(xS,xx))<=>((aElement0(X1)&aElementOf0(X1,xS))&~(X1=xx))))=>szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS))),inference(assume_negation,[status(cth)],[46])).
% fof(48, plain,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aElement0(X2)=>(~(aElementOf0(X2,X1))=>sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(58, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(59, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[59])).
% cnf(61,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, 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)],[2])).
% fof(63, 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)],[62])).
% fof(64, 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(esk1_3(X5,X6,X7),X7))|((~(aElement0(esk1_3(X5,X6,X7)))|~(aElementOf0(esk1_3(X5,X6,X7),X5)))|esk1_3(X5,X6,X7)=X6))&(aElementOf0(esk1_3(X5,X6,X7),X7)|((aElement0(esk1_3(X5,X6,X7))&aElementOf0(esk1_3(X5,X6,X7),X5))&~(esk1_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))),inference(skolemize,[status(esa)],[63])).
% fof(65, 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(esk1_3(X5,X6,X7),X7))|((~(aElement0(esk1_3(X5,X6,X7)))|~(aElementOf0(esk1_3(X5,X6,X7),X5)))|esk1_3(X5,X6,X7)=X6))&(aElementOf0(esk1_3(X5,X6,X7),X7)|((aElement0(esk1_3(X5,X6,X7))&aElementOf0(esk1_3(X5,X6,X7),X5))&~(esk1_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, 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(esk1_3(X5,X6,X7),X7))|((~(aElement0(esk1_3(X5,X6,X7)))|~(aElementOf0(esk1_3(X5,X6,X7),X5)))|esk1_3(X5,X6,X7)=X6))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((((aElement0(esk1_3(X5,X6,X7))|aElementOf0(esk1_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((aElementOf0(esk1_3(X5,X6,X7),X5)|aElementOf0(esk1_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6)))))&((((~(esk1_3(X5,X6,X7)=X6)|aElementOf0(esk1_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))))),inference(distribute,[status(thm)],[65])).
% cnf(71,plain,(aSet0(X3)|~aElement0(X1)|~aSet0(X2)|X3!=sdtmndt0(X2,X1)),inference(split_conjunct,[status(thm)],[66])).
% cnf(73,plain,(~aElement0(X1)|~aSet0(X2)|X3!=sdtmndt0(X2,X1)|~aElementOf0(X4,X3)|X4!=X1),inference(split_conjunct,[status(thm)],[66])).
% cnf(83,plain,(aSet0(xS)),inference(split_conjunct,[status(thm)],[5])).
% cnf(84,plain,(aElementOf0(xx,xS)),inference(split_conjunct,[status(thm)],[6])).
% cnf(85,plain,(isFinite0(xS)),inference(split_conjunct,[status(thm)],[6])).
% fof(86, plain,![X1]:((~(aSet0(X1))|~(isFinite0(X1)))|![X2]:(~(aElement0(X2))|(aElementOf0(X2,X1)|sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))))),inference(fof_nnf,[status(thm)],[48])).
% fof(87, plain,![X3]:((~(aSet0(X3))|~(isFinite0(X3)))|![X4]:(~(aElement0(X4))|(aElementOf0(X4,X3)|sbrdtbr0(sdtpldt0(X3,X4))=szszuzczcdt0(sbrdtbr0(X3))))),inference(variable_rename,[status(thm)],[86])).
% fof(88, plain,![X3]:![X4]:((~(aElement0(X4))|(aElementOf0(X4,X3)|sbrdtbr0(sdtpldt0(X3,X4))=szszuzczcdt0(sbrdtbr0(X3))))|(~(aSet0(X3))|~(isFinite0(X3)))),inference(shift_quantors,[status(thm)],[87])).
% cnf(89,plain,(sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))|aElementOf0(X2,X1)|~isFinite0(X1)|~aSet0(X1)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[88])).
% fof(104, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|sdtpldt0(sdtmndt0(X1,X2),X2)=X1)),inference(fof_nnf,[status(thm)],[12])).
% fof(105, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|sdtpldt0(sdtmndt0(X3,X4),X4)=X3)),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|sdtpldt0(sdtmndt0(X3,X4),X4)=X3)|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[105])).
% cnf(107,plain,(sdtpldt0(sdtmndt0(X1,X2),X2)=X1|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[106])).
% fof(143, plain,![X1]:((~(aSet0(X1))|~(isFinite0(X1)))|![X2]:(~(aSubsetOf0(X2,X1))|isFinite0(X2))),inference(fof_nnf,[status(thm)],[19])).
% fof(144, plain,![X3]:((~(aSet0(X3))|~(isFinite0(X3)))|![X4]:(~(aSubsetOf0(X4,X3))|isFinite0(X4))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X3]:![X4]:((~(aSubsetOf0(X4,X3))|isFinite0(X4))|(~(aSet0(X3))|~(isFinite0(X3)))),inference(shift_quantors,[status(thm)],[144])).
% cnf(146,plain,(isFinite0(X2)|~isFinite0(X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[145])).
% fof(175, 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)],[28])).
% fof(176, 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)],[175])).
% fof(177, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk5_2(X4,X5),X5)&~(aElementOf0(esk5_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[176])).
% fof(178, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk5_2(X4,X5),X5)&~(aElementOf0(esk5_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[177])).
% fof(179, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk5_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk5_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[178])).
% cnf(180,plain,(aSubsetOf0(X2,X1)|~aSet0(X1)|~aSet0(X2)|~aElementOf0(esk5_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[179])).
% cnf(181,plain,(aSubsetOf0(X2,X1)|aElementOf0(esk5_2(X1,X2),X2)|~aSet0(X1)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[179])).
% fof(231, negated_conjecture,((aSet0(sdtmndt0(xS,xx))&![X1]:((~(aElementOf0(X1,sdtmndt0(xS,xx)))|((aElement0(X1)&aElementOf0(X1,xS))&~(X1=xx)))&(((~(aElement0(X1))|~(aElementOf0(X1,xS)))|X1=xx)|aElementOf0(X1,sdtmndt0(xS,xx)))))&~(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS))),inference(fof_nnf,[status(thm)],[47])).
% fof(232, negated_conjecture,((aSet0(sdtmndt0(xS,xx))&![X2]:((~(aElementOf0(X2,sdtmndt0(xS,xx)))|((aElement0(X2)&aElementOf0(X2,xS))&~(X2=xx)))&(((~(aElement0(X2))|~(aElementOf0(X2,xS)))|X2=xx)|aElementOf0(X2,sdtmndt0(xS,xx)))))&~(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS))),inference(variable_rename,[status(thm)],[231])).
% fof(233, negated_conjecture,![X2]:((((~(aElementOf0(X2,sdtmndt0(xS,xx)))|((aElement0(X2)&aElementOf0(X2,xS))&~(X2=xx)))&(((~(aElement0(X2))|~(aElementOf0(X2,xS)))|X2=xx)|aElementOf0(X2,sdtmndt0(xS,xx))))&aSet0(sdtmndt0(xS,xx)))&~(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS))),inference(shift_quantors,[status(thm)],[232])).
% fof(234, negated_conjecture,![X2]:((((((aElement0(X2)|~(aElementOf0(X2,sdtmndt0(xS,xx))))&(aElementOf0(X2,xS)|~(aElementOf0(X2,sdtmndt0(xS,xx)))))&(~(X2=xx)|~(aElementOf0(X2,sdtmndt0(xS,xx)))))&(((~(aElement0(X2))|~(aElementOf0(X2,xS)))|X2=xx)|aElementOf0(X2,sdtmndt0(xS,xx))))&aSet0(sdtmndt0(xS,xx)))&~(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS))),inference(distribute,[status(thm)],[233])).
% cnf(235,negated_conjecture,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))!=sbrdtbr0(xS)),inference(split_conjunct,[status(thm)],[234])).
% cnf(236,negated_conjecture,(aSet0(sdtmndt0(xS,xx))),inference(split_conjunct,[status(thm)],[234])).
% cnf(239,negated_conjecture,(aElementOf0(X1,xS)|~aElementOf0(X1,sdtmndt0(xS,xx))),inference(split_conjunct,[status(thm)],[234])).
% cnf(243,plain,(sdtmndt0(X1,X2)!=X3|~aElement0(X2)|~aElementOf0(X2,X3)|~aSet0(X1)),inference(er,[status(thm)],[73,theory(equality)])).
% cnf(263,plain,(aElement0(xx)|~aSet0(xS)),inference(spm,[status(thm)],[61,84,theory(equality)])).
% cnf(268,plain,(aElement0(xx)|$false),inference(rw,[status(thm)],[263,83,theory(equality)])).
% cnf(269,plain,(aElement0(xx)),inference(cn,[status(thm)],[268,theory(equality)])).
% cnf(303,plain,(aSet0(sdtmndt0(X1,X2))|~aElement0(X2)|~aSet0(X1)),inference(er,[status(thm)],[71,theory(equality)])).
% cnf(310,plain,(~aElement0(X1)|~aElementOf0(X1,sdtmndt0(X2,X1))|~aSet0(X2)),inference(er,[status(thm)],[243,theory(equality)])).
% cnf(346,negated_conjecture,(aElementOf0(esk5_2(X1,sdtmndt0(xS,xx)),xS)|aSubsetOf0(sdtmndt0(xS,xx),X1)|~aSet0(sdtmndt0(xS,xx))|~aSet0(X1)),inference(spm,[status(thm)],[239,181,theory(equality)])).
% cnf(353,negated_conjecture,(aElementOf0(esk5_2(X1,sdtmndt0(xS,xx)),xS)|aSubsetOf0(sdtmndt0(xS,xx),X1)|$false|~aSet0(X1)),inference(rw,[status(thm)],[346,236,theory(equality)])).
% cnf(354,negated_conjecture,(aElementOf0(esk5_2(X1,sdtmndt0(xS,xx)),xS)|aSubsetOf0(sdtmndt0(xS,xx),X1)|~aSet0(X1)),inference(cn,[status(thm)],[353,theory(equality)])).
% cnf(377,plain,(sbrdtbr0(X1)=szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))|aElementOf0(X2,sdtmndt0(X1,X2))|~isFinite0(sdtmndt0(X1,X2))|~aElement0(X2)|~aSet0(sdtmndt0(X1,X2))|~aElementOf0(X2,X1)|~aSet0(X1)),inference(spm,[status(thm)],[89,107,theory(equality)])).
% cnf(660,negated_conjecture,(aSubsetOf0(sdtmndt0(xS,xx),xS)|~aSet0(sdtmndt0(xS,xx))|~aSet0(xS)),inference(spm,[status(thm)],[180,354,theory(equality)])).
% cnf(665,negated_conjecture,(aSubsetOf0(sdtmndt0(xS,xx),xS)|$false|~aSet0(xS)),inference(rw,[status(thm)],[660,236,theory(equality)])).
% cnf(666,negated_conjecture,(aSubsetOf0(sdtmndt0(xS,xx),xS)|$false|$false),inference(rw,[status(thm)],[665,83,theory(equality)])).
% cnf(667,negated_conjecture,(aSubsetOf0(sdtmndt0(xS,xx),xS)),inference(cn,[status(thm)],[666,theory(equality)])).
% cnf(670,negated_conjecture,(isFinite0(sdtmndt0(xS,xx))|~isFinite0(xS)|~aSet0(xS)),inference(spm,[status(thm)],[146,667,theory(equality)])).
% cnf(680,negated_conjecture,(isFinite0(sdtmndt0(xS,xx))|$false|~aSet0(xS)),inference(rw,[status(thm)],[670,85,theory(equality)])).
% cnf(681,negated_conjecture,(isFinite0(sdtmndt0(xS,xx))|$false|$false),inference(rw,[status(thm)],[680,83,theory(equality)])).
% cnf(682,negated_conjecture,(isFinite0(sdtmndt0(xS,xx))),inference(cn,[status(thm)],[681,theory(equality)])).
% cnf(1282,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|aElementOf0(X2,sdtmndt0(X1,X2))|~isFinite0(sdtmndt0(X1,X2))|~aElement0(X2)|~aElementOf0(X2,X1)|~aSet0(X1)),inference(csr,[status(thm)],[377,303])).
% cnf(1283,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|aElementOf0(X2,sdtmndt0(X1,X2))|~isFinite0(sdtmndt0(X1,X2))|~aElementOf0(X2,X1)|~aSet0(X1)),inference(csr,[status(thm)],[1282,61])).
% cnf(1286,negated_conjecture,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)|aElementOf0(xx,sdtmndt0(xS,xx))|~aElementOf0(xx,xS)|~aSet0(xS)),inference(spm,[status(thm)],[1283,682,theory(equality)])).
% cnf(1288,negated_conjecture,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)|aElementOf0(xx,sdtmndt0(xS,xx))|$false|~aSet0(xS)),inference(rw,[status(thm)],[1286,84,theory(equality)])).
% cnf(1289,negated_conjecture,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)|aElementOf0(xx,sdtmndt0(xS,xx))|$false|$false),inference(rw,[status(thm)],[1288,83,theory(equality)])).
% cnf(1290,negated_conjecture,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)|aElementOf0(xx,sdtmndt0(xS,xx))),inference(cn,[status(thm)],[1289,theory(equality)])).
% cnf(1291,negated_conjecture,(aElementOf0(xx,sdtmndt0(xS,xx))),inference(sr,[status(thm)],[1290,235,theory(equality)])).
% cnf(1295,negated_conjecture,(~aElement0(xx)|~aSet0(xS)),inference(spm,[status(thm)],[310,1291,theory(equality)])).
% cnf(1322,negated_conjecture,($false|~aSet0(xS)),inference(rw,[status(thm)],[1295,269,theory(equality)])).
% cnf(1323,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1322,83,theory(equality)])).
% cnf(1324,negated_conjecture,($false),inference(cn,[status(thm)],[1323,theory(equality)])).
% cnf(1325,negated_conjecture,($false),1324,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 388
% # ...of these trivial : 3
% # ...subsumed : 105
% # ...remaining for further processing: 280
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 12
% # Generated clauses : 563
% # ...of the previous two non-trivial : 471
% # Contextual simplify-reflections : 189
% # Paramodulations : 534
% # Factorizations : 0
% # Equation resolutions : 26
% # Current number of processed clauses: 190
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 168
% # Current number of unprocessed clauses: 210
% # ...number of literals in the above : 1308
% # Clause-clause subsumption calls (NU) : 1840
% # Rec. Clause-clause subsumption calls : 1065
% # Unit Clause-clause subsumption calls : 260
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 133 leaves, 1.49+/-1.087 terms/leaf
% # Paramod-from index: 71 leaves, 1.10+/-0.342 terms/leaf
% # Paramod-into index: 113 leaves, 1.35+/-0.921 terms/leaf
% # -------------------------------------------------
% # User time : 0.063 s
% # System time : 0.004 s
% # Total time : 0.067 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP19008/NUM538+2.tptp
%
%------------------------------------------------------------------------------