TSTP Solution File: NUM536+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM536+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 : 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 19:57:44 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP11973/NUM536+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11973/NUM536+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11973/NUM536+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 12069
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 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=sdtpldt0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>(aElement0(X4)&(aElementOf0(X4,X1)|X4=X2)))))),file('/tmp/SRASS.s.p', mDefCons)).
% fof(5, axiom,(aElement0(xx)&aSet0(xS)),file('/tmp/SRASS.s.p', m__679)).
% fof(6, axiom,~(aElementOf0(xx,xS)),file('/tmp/SRASS.s.p', m__679_02)).
% fof(8, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(9, axiom,![X1]:![X2]:((aSet0(X1)&aSet0(X2))=>((aSubsetOf0(X1,X2)&aSubsetOf0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mSubASymm)).
% fof(20, conjecture,((aSet0(sdtpldt0(xS,xx))&![X1]:(aElementOf0(X1,sdtpldt0(xS,xx))<=>(aElement0(X1)&(aElementOf0(X1,xS)|X1=xx))))=>((aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))&![X1]:(aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))<=>((aElement0(X1)&aElementOf0(X1,sdtpldt0(xS,xx)))&~(X1=xx))))=>sdtmndt0(sdtpldt0(xS,xx),xx)=xS)),file('/tmp/SRASS.s.p', m__)).
% fof(21, negated_conjecture,~(((aSet0(sdtpldt0(xS,xx))&![X1]:(aElementOf0(X1,sdtpldt0(xS,xx))<=>(aElement0(X1)&(aElementOf0(X1,xS)|X1=xx))))=>((aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))&![X1]:(aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))<=>((aElement0(X1)&aElementOf0(X1,sdtpldt0(xS,xx)))&~(X1=xx))))=>sdtmndt0(sdtpldt0(xS,xx),xx)=xS))),inference(assume_negation,[status(cth)],[20])).
% fof(22, plain,~(aElementOf0(xx,xS)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(28, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(29, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[29])).
% cnf(31,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElement0(X2)))|![X3]:((~(X3=sdtpldt0(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=sdtpldt0(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtpldt0(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=sdtpldt0(X5,X6)))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtpldt0(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=sdtpldt0(X5,X6)))),inference(skolemize,[status(esa)],[33])).
% fof(35, 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=sdtpldt0(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=sdtpldt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X5]:![X6]:![X7]:![X8]:(((((((aElement0(X8)|~(aElementOf0(X8,X7)))|~(X7=sdtpldt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6))))&((((aElementOf0(X8,X5)|X8=X6)|~(aElementOf0(X8,X7)))|~(X7=sdtpldt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElementOf0(X8,X5))|~(aElement0(X8)))|aElementOf0(X8,X7))|~(X7=sdtpldt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6))))&((((~(X8=X6)|~(aElement0(X8)))|aElementOf0(X8,X7))|~(X7=sdtpldt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6))))))&((aSet0(X7)|~(X7=sdtpldt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((((~(aElementOf0(esk1_3(X5,X6,X7),X5))|~(aElement0(esk1_3(X5,X6,X7))))|~(aElementOf0(esk1_3(X5,X6,X7),X7)))|~(aSet0(X7)))|X7=sdtpldt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&(((((~(esk1_3(X5,X6,X7)=X6)|~(aElement0(esk1_3(X5,X6,X7))))|~(aElementOf0(esk1_3(X5,X6,X7),X7)))|~(aSet0(X7)))|X7=sdtpldt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((aElement0(esk1_3(X5,X6,X7))|aElementOf0(esk1_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtpldt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&(((((aElementOf0(esk1_3(X5,X6,X7),X5)|esk1_3(X5,X6,X7)=X6)|aElementOf0(esk1_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtpldt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))))),inference(distribute,[status(thm)],[35])).
% cnf(43,plain,(aElementOf0(X4,X3)|~aElement0(X1)|~aSet0(X2)|X3!=sdtpldt0(X2,X1)|~aElement0(X4)|~aElementOf0(X4,X2)),inference(split_conjunct,[status(thm)],[36])).
% cnf(44,plain,(X4=X1|aElementOf0(X4,X2)|~aElement0(X1)|~aSet0(X2)|X3!=sdtpldt0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[36])).
% cnf(64,plain,(aSet0(xS)),inference(split_conjunct,[status(thm)],[5])).
% cnf(65,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[5])).
% cnf(66,plain,(~aElementOf0(xx,xS)),inference(split_conjunct,[status(thm)],[22])).
% fof(75, 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)],[8])).
% fof(76, 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)],[75])).
% fof(77, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk4_2(X4,X5),X5)&~(aElementOf0(esk4_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[76])).
% fof(78, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk4_2(X4,X5),X5)&~(aElementOf0(esk4_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[77])).
% fof(79, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk4_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk4_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[78])).
% cnf(80,plain,(aSubsetOf0(X2,X1)|~aSet0(X1)|~aSet0(X2)|~aElementOf0(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[79])).
% cnf(81,plain,(aSubsetOf0(X2,X1)|aElementOf0(esk4_2(X1,X2),X2)|~aSet0(X1)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[79])).
% cnf(82,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[79])).
% fof(84, plain,![X1]:![X2]:((~(aSet0(X1))|~(aSet0(X2)))|((~(aSubsetOf0(X1,X2))|~(aSubsetOf0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(85, plain,![X3]:![X4]:((~(aSet0(X3))|~(aSet0(X4)))|((~(aSubsetOf0(X3,X4))|~(aSubsetOf0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[84])).
% cnf(86,plain,(X1=X2|~aSubsetOf0(X2,X1)|~aSubsetOf0(X1,X2)|~aSet0(X2)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[85])).
% fof(112, negated_conjecture,((aSet0(sdtpldt0(xS,xx))&![X1]:((~(aElementOf0(X1,sdtpldt0(xS,xx)))|(aElement0(X1)&(aElementOf0(X1,xS)|X1=xx)))&((~(aElement0(X1))|(~(aElementOf0(X1,xS))&~(X1=xx)))|aElementOf0(X1,sdtpldt0(xS,xx)))))&((aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))&![X1]:((~(aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx)))|((aElement0(X1)&aElementOf0(X1,sdtpldt0(xS,xx)))&~(X1=xx)))&(((~(aElement0(X1))|~(aElementOf0(X1,sdtpldt0(xS,xx))))|X1=xx)|aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx)))))&~(sdtmndt0(sdtpldt0(xS,xx),xx)=xS))),inference(fof_nnf,[status(thm)],[21])).
% fof(113, negated_conjecture,((aSet0(sdtpldt0(xS,xx))&![X2]:((~(aElementOf0(X2,sdtpldt0(xS,xx)))|(aElement0(X2)&(aElementOf0(X2,xS)|X2=xx)))&((~(aElement0(X2))|(~(aElementOf0(X2,xS))&~(X2=xx)))|aElementOf0(X2,sdtpldt0(xS,xx)))))&((aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))&![X3]:((~(aElementOf0(X3,sdtmndt0(sdtpldt0(xS,xx),xx)))|((aElement0(X3)&aElementOf0(X3,sdtpldt0(xS,xx)))&~(X3=xx)))&(((~(aElement0(X3))|~(aElementOf0(X3,sdtpldt0(xS,xx))))|X3=xx)|aElementOf0(X3,sdtmndt0(sdtpldt0(xS,xx),xx)))))&~(sdtmndt0(sdtpldt0(xS,xx),xx)=xS))),inference(variable_rename,[status(thm)],[112])).
% fof(114, negated_conjecture,![X2]:![X3]:(((((~(aElementOf0(X3,sdtmndt0(sdtpldt0(xS,xx),xx)))|((aElement0(X3)&aElementOf0(X3,sdtpldt0(xS,xx)))&~(X3=xx)))&(((~(aElement0(X3))|~(aElementOf0(X3,sdtpldt0(xS,xx))))|X3=xx)|aElementOf0(X3,sdtmndt0(sdtpldt0(xS,xx),xx))))&aSet0(sdtmndt0(sdtpldt0(xS,xx),xx)))&~(sdtmndt0(sdtpldt0(xS,xx),xx)=xS))&(((~(aElementOf0(X2,sdtpldt0(xS,xx)))|(aElement0(X2)&(aElementOf0(X2,xS)|X2=xx)))&((~(aElement0(X2))|(~(aElementOf0(X2,xS))&~(X2=xx)))|aElementOf0(X2,sdtpldt0(xS,xx))))&aSet0(sdtpldt0(xS,xx)))),inference(shift_quantors,[status(thm)],[113])).
% fof(115, negated_conjecture,![X2]:![X3]:(((((((aElement0(X3)|~(aElementOf0(X3,sdtmndt0(sdtpldt0(xS,xx),xx))))&(aElementOf0(X3,sdtpldt0(xS,xx))|~(aElementOf0(X3,sdtmndt0(sdtpldt0(xS,xx),xx)))))&(~(X3=xx)|~(aElementOf0(X3,sdtmndt0(sdtpldt0(xS,xx),xx)))))&(((~(aElement0(X3))|~(aElementOf0(X3,sdtpldt0(xS,xx))))|X3=xx)|aElementOf0(X3,sdtmndt0(sdtpldt0(xS,xx),xx))))&aSet0(sdtmndt0(sdtpldt0(xS,xx),xx)))&~(sdtmndt0(sdtpldt0(xS,xx),xx)=xS))&((((aElement0(X2)|~(aElementOf0(X2,sdtpldt0(xS,xx))))&((aElementOf0(X2,xS)|X2=xx)|~(aElementOf0(X2,sdtpldt0(xS,xx)))))&(((~(aElementOf0(X2,xS))|~(aElement0(X2)))|aElementOf0(X2,sdtpldt0(xS,xx)))&((~(X2=xx)|~(aElement0(X2)))|aElementOf0(X2,sdtpldt0(xS,xx)))))&aSet0(sdtpldt0(xS,xx)))),inference(distribute,[status(thm)],[114])).
% cnf(120,negated_conjecture,(aElement0(X1)|~aElementOf0(X1,sdtpldt0(xS,xx))),inference(split_conjunct,[status(thm)],[115])).
% cnf(121,negated_conjecture,(sdtmndt0(sdtpldt0(xS,xx),xx)!=xS),inference(split_conjunct,[status(thm)],[115])).
% cnf(122,negated_conjecture,(aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))),inference(split_conjunct,[status(thm)],[115])).
% cnf(123,negated_conjecture,(aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|X1=xx|~aElementOf0(X1,sdtpldt0(xS,xx))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[115])).
% cnf(124,negated_conjecture,(~aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|X1!=xx),inference(split_conjunct,[status(thm)],[115])).
% cnf(125,negated_conjecture,(aElementOf0(X1,sdtpldt0(xS,xx))|~aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))),inference(split_conjunct,[status(thm)],[115])).
% cnf(128,plain,(X1=X2|~aSubsetOf0(X2,X1)|~aSubsetOf0(X1,X2)|~aSet0(X2)),inference(csr,[status(thm)],[86,82])).
% cnf(130,negated_conjecture,(xx=X1|aElementOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|~aElementOf0(X1,sdtpldt0(xS,xx))),inference(csr,[status(thm)],[123,120])).
% cnf(132,plain,(aElementOf0(X4,X3)|sdtpldt0(X2,X1)!=X3|~aElement0(X1)|~aElementOf0(X4,X2)|~aSet0(X2)),inference(csr,[status(thm)],[43,31])).
% cnf(191,negated_conjecture,(aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|xx!=esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(X1)),inference(spm,[status(thm)],[124,81,theory(equality)])).
% cnf(193,negated_conjecture,(aElementOf0(esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx)),sdtpldt0(xS,xx))|aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(X1)),inference(spm,[status(thm)],[125,81,theory(equality)])).
% cnf(198,negated_conjecture,(aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|xx!=esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|$false|~aSet0(X1)),inference(rw,[status(thm)],[191,122,theory(equality)])).
% cnf(199,negated_conjecture,(aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|xx!=esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(X1)),inference(cn,[status(thm)],[198,theory(equality)])).
% cnf(202,negated_conjecture,(aElementOf0(esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx)),sdtpldt0(xS,xx))|aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|$false|~aSet0(X1)),inference(rw,[status(thm)],[193,122,theory(equality)])).
% cnf(203,negated_conjecture,(aElementOf0(esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx)),sdtpldt0(xS,xx))|aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|~aSet0(X1)),inference(cn,[status(thm)],[202,theory(equality)])).
% cnf(208,negated_conjecture,(aSubsetOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|xx=esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|~aSet0(X1)|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))|~aElementOf0(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1),sdtpldt0(xS,xx))),inference(spm,[status(thm)],[80,130,theory(equality)])).
% cnf(212,negated_conjecture,(aSubsetOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|xx=esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|~aSet0(X1)|$false|~aElementOf0(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1),sdtpldt0(xS,xx))),inference(rw,[status(thm)],[208,122,theory(equality)])).
% cnf(213,negated_conjecture,(aSubsetOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|xx=esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|~aSet0(X1)|~aElementOf0(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1),sdtpldt0(xS,xx))),inference(cn,[status(thm)],[212,theory(equality)])).
% cnf(220,plain,(aElementOf0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElementOf0(X1,X2)|~aSet0(X2)),inference(er,[status(thm)],[132,theory(equality)])).
% cnf(224,plain,(X1=X2|aElementOf0(X2,X3)|~aElement0(X1)|~aElementOf0(X2,sdtpldt0(X3,X1))|~aSet0(X3)),inference(er,[status(thm)],[44,theory(equality)])).
% cnf(527,negated_conjecture,(xx=esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|aElementOf0(esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx)),xS)|aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|~aElement0(xx)|~aSet0(xS)|~aSet0(X1)),inference(spm,[status(thm)],[224,203,theory(equality)])).
% cnf(537,negated_conjecture,(xx=esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|aElementOf0(esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx)),xS)|aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|$false|~aSet0(xS)|~aSet0(X1)),inference(rw,[status(thm)],[527,65,theory(equality)])).
% cnf(538,negated_conjecture,(xx=esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|aElementOf0(esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx)),xS)|aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|$false|$false|~aSet0(X1)),inference(rw,[status(thm)],[537,64,theory(equality)])).
% cnf(539,negated_conjecture,(xx=esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|aElementOf0(esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx)),xS)|aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|~aSet0(X1)),inference(cn,[status(thm)],[538,theory(equality)])).
% cnf(682,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1)=xx|aSubsetOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(X1)|~aElement0(xx)|~aElementOf0(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1),xS)|~aSet0(xS)),inference(spm,[status(thm)],[213,220,theory(equality)])).
% cnf(687,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1)=xx|aSubsetOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(X1)|$false|~aElementOf0(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1),xS)|~aSet0(xS)),inference(rw,[status(thm)],[682,65,theory(equality)])).
% cnf(688,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1)=xx|aSubsetOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(X1)|$false|~aElementOf0(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1),xS)|$false),inference(rw,[status(thm)],[687,64,theory(equality)])).
% cnf(689,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1)=xx|aSubsetOf0(X1,sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(X1)|~aElementOf0(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),X1),xS)),inference(cn,[status(thm)],[688,theory(equality)])).
% cnf(3855,negated_conjecture,(aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),X1)|aElementOf0(esk4_2(X1,sdtmndt0(sdtpldt0(xS,xx),xx)),xS)|~aSet0(X1)),inference(csr,[status(thm)],[539,199])).
% cnf(3866,negated_conjecture,(aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),xS)|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(xS)),inference(spm,[status(thm)],[80,3855,theory(equality)])).
% cnf(3885,negated_conjecture,(aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),xS)|$false|~aSet0(xS)),inference(rw,[status(thm)],[3866,122,theory(equality)])).
% cnf(3886,negated_conjecture,(aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),xS)|$false|$false),inference(rw,[status(thm)],[3885,64,theory(equality)])).
% cnf(3887,negated_conjecture,(aSubsetOf0(sdtmndt0(sdtpldt0(xS,xx),xx),xS)),inference(cn,[status(thm)],[3886,theory(equality)])).
% cnf(3894,negated_conjecture,(xS=sdtmndt0(sdtpldt0(xS,xx),xx)|~aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))),inference(spm,[status(thm)],[128,3887,theory(equality)])).
% cnf(3911,negated_conjecture,(xS=sdtmndt0(sdtpldt0(xS,xx),xx)|~aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|$false),inference(rw,[status(thm)],[3894,122,theory(equality)])).
% cnf(3912,negated_conjecture,(xS=sdtmndt0(sdtpldt0(xS,xx),xx)|~aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))),inference(cn,[status(thm)],[3911,theory(equality)])).
% cnf(3913,negated_conjecture,(~aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))),inference(sr,[status(thm)],[3912,121,theory(equality)])).
% cnf(4202,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),xS)=xx|aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|~aSet0(xS)|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))),inference(spm,[status(thm)],[689,81,theory(equality)])).
% cnf(4213,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),xS)=xx|aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|$false|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))),inference(rw,[status(thm)],[4202,64,theory(equality)])).
% cnf(4214,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),xS)=xx|aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|$false|$false),inference(rw,[status(thm)],[4213,122,theory(equality)])).
% cnf(4215,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),xS)=xx|aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))),inference(cn,[status(thm)],[4214,theory(equality)])).
% cnf(4216,negated_conjecture,(esk4_2(sdtmndt0(sdtpldt0(xS,xx),xx),xS)=xx),inference(sr,[status(thm)],[4215,3913,theory(equality)])).
% cnf(4223,negated_conjecture,(aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|aElementOf0(xx,xS)|~aSet0(xS)|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))),inference(spm,[status(thm)],[81,4216,theory(equality)])).
% cnf(4231,negated_conjecture,(aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|aElementOf0(xx,xS)|$false|~aSet0(sdtmndt0(sdtpldt0(xS,xx),xx))),inference(rw,[status(thm)],[4223,64,theory(equality)])).
% cnf(4232,negated_conjecture,(aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|aElementOf0(xx,xS)|$false|$false),inference(rw,[status(thm)],[4231,122,theory(equality)])).
% cnf(4233,negated_conjecture,(aSubsetOf0(xS,sdtmndt0(sdtpldt0(xS,xx),xx))|aElementOf0(xx,xS)),inference(cn,[status(thm)],[4232,theory(equality)])).
% cnf(4234,negated_conjecture,(aElementOf0(xx,xS)),inference(sr,[status(thm)],[4233,3913,theory(equality)])).
% cnf(4235,negated_conjecture,($false),inference(sr,[status(thm)],[4234,66,theory(equality)])).
% cnf(4236,negated_conjecture,($false),4235,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 766
% # ...of these trivial : 16
% # ...subsumed : 404
% # ...remaining for further processing: 346
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 21
% # Backward-rewritten : 15
% # Generated clauses : 1912
% # ...of the previous two non-trivial : 1619
% # Contextual simplify-reflections : 336
% # Paramodulations : 1882
% # Factorizations : 0
% # Equation resolutions : 23
% # Current number of processed clauses: 255
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 225
% # Current number of unprocessed clauses: 783
% # ...number of literals in the above : 5141
% # Clause-clause subsumption calls (NU) : 3591
% # Rec. Clause-clause subsumption calls : 1957
% # Unit Clause-clause subsumption calls : 276
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 183 leaves, 1.57+/-1.353 terms/leaf
% # Paramod-from index: 77 leaves, 1.12+/-0.359 terms/leaf
% # Paramod-into index: 128 leaves, 1.48+/-1.192 terms/leaf
% # -------------------------------------------------
% # User time : 0.132 s
% # System time : 0.011 s
% # Total time : 0.143 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.28 CPU 0.39 WC
% FINAL PrfWatch: 0.28 CPU 0.39 WC
% SZS output end Solution for /tmp/SystemOnTPTP11973/NUM536+2.tptp
%
%------------------------------------------------------------------------------