TSTP Solution File: RNG109+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG109+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 22:43:50 EST 2010
% Result : Theorem 106.08s
% Output : Solution 106.98s
% 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/SystemOnTPTP13996/RNG109+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~m__:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mSortsC:
% CSA axiom mSortsC found
% Looking for CSA axiom ... mIdeSum:
% CSA axiom mIdeSum found
% Looking for CSA axiom ... mPrIdeal:
% CSA axiom mPrIdeal found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... m__2091:
% CSA axiom m__2091 found
% Looking for CSA axiom ... m__2110:
% CSA axiom m__2110 found
% Looking for CSA axiom ... m__2129:
% CSA axiom m__2129 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... m__2174:
% CSA axiom m__2174 found
% Looking for CSA axiom ... m__2203:
% CSA axiom m__2203 found
% Looking for CSA axiom ... mChineseRemainder:
% CSA axiom mChineseRemainder found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mMulZero:
% CSA axiom mMulZero found
% Looking for CSA axiom ... mCancel:
% CSA axiom mCancel found
% Looking for CSA axiom ... mAddZero:
% CSA axiom mAddZero found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mDefPrIdeal:
% CSA axiom mDefPrIdeal found
% Looking for CSA axiom ... mSetEq:
% CSA axiom mSetEq found
% Looking for CSA axiom ... mUnNeZr:
% CSA axiom mUnNeZr found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mDefSSum:
% CSA axiom mDefSSum found
% Looking for CSA axiom ... mEOfElem:
% CSA axiom mEOfElem found
% Looking for CSA axiom ... mMulComm:
% CSA axiom mMulComm found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :mMulComm:mEOfElem:mDefSSum:mUnNeZr:mSetEq:mDefPrIdeal:mAddZero:mCancel:mMulZero:mChineseRemainder:m__2203:m__2174:m__2129:m__2110:m__2091:mPrIdeal:mIdeSum:mSortsC (18)
% Unselected axioms are ... :mMulAsso:mSortsU:mSortsB:mSortsB_02:mAddComm:mAddAsso:mAddInvr:mIdeInt:mDefIdeal:mEucSort:mDefSInt:mSortsC_01:mDefGCD:mDefRel:mAMDistr:mDefMod:mDivision:mMulUnit:mDefDiv:mElmSort:mMulMnOne:mNatSort:mSetSort:mNatLess:mDefDvs (25)
% SZS status THM for /tmp/SystemOnTPTP13996/RNG109+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP13996/RNG109+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 18134
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(3, axiom,![X1]:![X2]:((aSet0(X1)&aSet0(X2))=>![X3]:(X3=sdtpldt1(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>?[X5]:?[X6]:((aElementOf0(X5,X1)&aElementOf0(X6,X2))&sdtpldt0(X5,X6)=X4))))),file('/tmp/SRASS.s.p', mDefSSum)).
% fof(6, axiom,![X1]:(aElement0(X1)=>![X2]:(X2=slsdtgt0(X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)<=>?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))),file('/tmp/SRASS.s.p', mDefPrIdeal)).
% fof(7, axiom,![X1]:(aElement0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', mAddZero)).
% fof(9, axiom,![X1]:(aElement0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', mMulZero)).
% fof(11, axiom,(((aElementOf0(sz00,slsdtgt0(xa))&aElementOf0(xa,slsdtgt0(xa)))&aElementOf0(sz00,slsdtgt0(xb)))&aElementOf0(xb,slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2203)).
% fof(12, axiom,(aIdeal0(xI)&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(14, axiom,(~(xa=sz00)|~(xb=sz00)),file('/tmp/SRASS.s.p', m__2110)).
% fof(15, axiom,(aElement0(xa)&aElement0(xb)),file('/tmp/SRASS.s.p', m__2091)).
% fof(18, axiom,aElement0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(19, conjecture,?[X1]:(aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))&~(X1=sz00)),file('/tmp/SRASS.s.p', m__)).
% fof(20, negated_conjecture,~(?[X1]:(aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))&~(X1=sz00))),inference(assume_negation,[status(cth)],[19])).
% fof(24, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(25, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[25])).
% cnf(27,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:![X2]:((~(aSet0(X1))|~(aSet0(X2)))|![X3]:((~(X3=sdtpldt1(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|?[X5]:?[X6]:((aElementOf0(X5,X1)&aElementOf0(X6,X2))&sdtpldt0(X5,X6)=X4))&(![X5]:![X6]:((~(aElementOf0(X5,X1))|~(aElementOf0(X6,X2)))|~(sdtpldt0(X5,X6)=X4))|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|![X5]:![X6]:((~(aElementOf0(X5,X1))|~(aElementOf0(X6,X2)))|~(sdtpldt0(X5,X6)=X4)))&(aElementOf0(X4,X3)|?[X5]:?[X6]:((aElementOf0(X5,X1)&aElementOf0(X6,X2))&sdtpldt0(X5,X6)=X4))))|X3=sdtpldt1(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X7]:![X8]:((~(aSet0(X7))|~(aSet0(X8)))|![X9]:((~(X9=sdtpldt1(X7,X8))|(aSet0(X9)&![X10]:((~(aElementOf0(X10,X9))|?[X11]:?[X12]:((aElementOf0(X11,X7)&aElementOf0(X12,X8))&sdtpldt0(X11,X12)=X10))&(![X13]:![X14]:((~(aElementOf0(X13,X7))|~(aElementOf0(X14,X8)))|~(sdtpldt0(X13,X14)=X10))|aElementOf0(X10,X9)))))&((~(aSet0(X9))|?[X15]:((~(aElementOf0(X15,X9))|![X16]:![X17]:((~(aElementOf0(X16,X7))|~(aElementOf0(X17,X8)))|~(sdtpldt0(X16,X17)=X15)))&(aElementOf0(X15,X9)|?[X18]:?[X19]:((aElementOf0(X18,X7)&aElementOf0(X19,X8))&sdtpldt0(X18,X19)=X15))))|X9=sdtpldt1(X7,X8)))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X7]:![X8]:((~(aSet0(X7))|~(aSet0(X8)))|![X9]:((~(X9=sdtpldt1(X7,X8))|(aSet0(X9)&![X10]:((~(aElementOf0(X10,X9))|((aElementOf0(esk1_4(X7,X8,X9,X10),X7)&aElementOf0(esk2_4(X7,X8,X9,X10),X8))&sdtpldt0(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))=X10))&(![X13]:![X14]:((~(aElementOf0(X13,X7))|~(aElementOf0(X14,X8)))|~(sdtpldt0(X13,X14)=X10))|aElementOf0(X10,X9)))))&((~(aSet0(X9))|((~(aElementOf0(esk3_3(X7,X8,X9),X9))|![X16]:![X17]:((~(aElementOf0(X16,X7))|~(aElementOf0(X17,X8)))|~(sdtpldt0(X16,X17)=esk3_3(X7,X8,X9))))&(aElementOf0(esk3_3(X7,X8,X9),X9)|((aElementOf0(esk4_3(X7,X8,X9),X7)&aElementOf0(esk5_3(X7,X8,X9),X8))&sdtpldt0(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))=esk3_3(X7,X8,X9)))))|X9=sdtpldt1(X7,X8)))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((((~(aElementOf0(X16,X7))|~(aElementOf0(X17,X8)))|~(sdtpldt0(X16,X17)=esk3_3(X7,X8,X9)))|~(aElementOf0(esk3_3(X7,X8,X9),X9)))&(aElementOf0(esk3_3(X7,X8,X9),X9)|((aElementOf0(esk4_3(X7,X8,X9),X7)&aElementOf0(esk5_3(X7,X8,X9),X8))&sdtpldt0(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))=esk3_3(X7,X8,X9))))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))&((((((~(aElementOf0(X13,X7))|~(aElementOf0(X14,X8)))|~(sdtpldt0(X13,X14)=X10))|aElementOf0(X10,X9))&(~(aElementOf0(X10,X9))|((aElementOf0(esk1_4(X7,X8,X9,X10),X7)&aElementOf0(esk2_4(X7,X8,X9,X10),X8))&sdtpldt0(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))=X10)))&aSet0(X9))|~(X9=sdtpldt1(X7,X8))))|(~(aSet0(X7))|~(aSet0(X8)))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((((~(aElementOf0(X16,X7))|~(aElementOf0(X17,X8)))|~(sdtpldt0(X16,X17)=esk3_3(X7,X8,X9)))|~(aElementOf0(esk3_3(X7,X8,X9),X9)))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))|(~(aSet0(X7))|~(aSet0(X8))))&((((((aElementOf0(esk4_3(X7,X8,X9),X7)|aElementOf0(esk3_3(X7,X8,X9),X9))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))|(~(aSet0(X7))|~(aSet0(X8))))&((((aElementOf0(esk5_3(X7,X8,X9),X8)|aElementOf0(esk3_3(X7,X8,X9),X9))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))|(~(aSet0(X7))|~(aSet0(X8)))))&((((sdtpldt0(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))=esk3_3(X7,X8,X9)|aElementOf0(esk3_3(X7,X8,X9),X9))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))|(~(aSet0(X7))|~(aSet0(X8))))))&(((((((~(aElementOf0(X13,X7))|~(aElementOf0(X14,X8)))|~(sdtpldt0(X13,X14)=X10))|aElementOf0(X10,X9))|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8))))&(((((aElementOf0(esk1_4(X7,X8,X9,X10),X7)|~(aElementOf0(X10,X9)))|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8))))&(((aElementOf0(esk2_4(X7,X8,X9,X10),X8)|~(aElementOf0(X10,X9)))|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8)))))&(((sdtpldt0(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))=X10|~(aElementOf0(X10,X9)))|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8))))))&((aSet0(X9)|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8)))))),inference(distribute,[status(thm)],[31])).
% cnf(37,plain,(aElementOf0(X4,X3)|~aSet0(X1)|~aSet0(X2)|X3!=sdtpldt1(X2,X1)|sdtpldt0(X5,X6)!=X4|~aElementOf0(X6,X1)|~aElementOf0(X5,X2)),inference(split_conjunct,[status(thm)],[32])).
% fof(51, plain,![X1]:(~(aElement0(X1))|![X2]:((~(X2=slsdtgt0(X1))|(aSet0(X2)&![X3]:((~(aElementOf0(X3,X2))|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))&(![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3))|aElementOf0(X3,X2)))))&((~(aSet0(X2))|?[X3]:((~(aElementOf0(X3,X2))|![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3)))&(aElementOf0(X3,X2)|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))|X2=slsdtgt0(X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(52, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|?[X8]:(aElement0(X8)&sdtasdt0(X5,X8)=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|?[X10]:((~(aElementOf0(X10,X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=X10)))&(aElementOf0(X10,X6)|?[X12]:(aElement0(X12)&sdtasdt0(X5,X12)=X10))))|X6=slsdtgt0(X5)))),inference(variable_rename,[status(thm)],[51])).
% fof(53, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|(aElement0(esk8_3(X5,X6,X7))&sdtasdt0(X5,esk8_3(X5,X6,X7))=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|((~(aElementOf0(esk9_2(X5,X6),X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk9_2(X5,X6))))&(aElementOf0(esk9_2(X5,X6),X6)|(aElement0(esk10_2(X5,X6))&sdtasdt0(X5,esk10_2(X5,X6))=esk9_2(X5,X6)))))|X6=slsdtgt0(X5)))),inference(skolemize,[status(esa)],[52])).
% fof(54, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk9_2(X5,X6)))|~(aElementOf0(esk9_2(X5,X6),X6)))&(aElementOf0(esk9_2(X5,X6),X6)|(aElement0(esk10_2(X5,X6))&sdtasdt0(X5,esk10_2(X5,X6))=esk9_2(X5,X6))))|~(aSet0(X6)))|X6=slsdtgt0(X5))&(((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))&(~(aElementOf0(X7,X6))|(aElement0(esk8_3(X5,X6,X7))&sdtasdt0(X5,esk8_3(X5,X6,X7))=X7)))&aSet0(X6))|~(X6=slsdtgt0(X5))))|~(aElement0(X5))),inference(shift_quantors,[status(thm)],[53])).
% fof(55, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk9_2(X5,X6)))|~(aElementOf0(esk9_2(X5,X6),X6)))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&(((((aElement0(esk10_2(X5,X6))|aElementOf0(esk9_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&((((sdtasdt0(X5,esk10_2(X5,X6))=esk9_2(X5,X6)|aElementOf0(esk9_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))))&((((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&((((aElement0(esk8_3(X5,X6,X7))|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&(((sdtasdt0(X5,esk8_3(X5,X6,X7))=X7|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))))&((aSet0(X6)|~(X6=slsdtgt0(X5)))|~(aElement0(X5))))),inference(distribute,[status(thm)],[54])).
% cnf(56,plain,(aSet0(X2)|~aElement0(X1)|X2!=slsdtgt0(X1)),inference(split_conjunct,[status(thm)],[55])).
% cnf(59,plain,(aElementOf0(X3,X2)|~aElement0(X1)|X2!=slsdtgt0(X1)|sdtasdt0(X1,X4)!=X3|~aElement0(X4)),inference(split_conjunct,[status(thm)],[55])).
% fof(63, plain,![X1]:(~(aElement0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(64, plain,![X2]:(~(aElement0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aElement0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(X1=sdtpldt0(sz00,X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,plain,(sdtpldt0(X1,sz00)=X1|~aElement0(X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(71, plain,![X1]:(~(aElement0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[9])).
% fof(72, plain,![X2]:(~(aElement0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[71])).
% fof(73, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aElement0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[72])).
% cnf(74,plain,(sz00=sdtasdt0(sz00,X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[73])).
% cnf(87,plain,(aElementOf0(xb,slsdtgt0(xb))),inference(split_conjunct,[status(thm)],[11])).
% cnf(89,plain,(aElementOf0(xa,slsdtgt0(xa))),inference(split_conjunct,[status(thm)],[11])).
% cnf(90,plain,(aElementOf0(sz00,slsdtgt0(xa))),inference(split_conjunct,[status(thm)],[11])).
% cnf(91,plain,(xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(split_conjunct,[status(thm)],[12])).
% cnf(94,plain,(xb!=sz00|xa!=sz00),inference(split_conjunct,[status(thm)],[14])).
% cnf(95,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[15])).
% cnf(96,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[15])).
% cnf(103,plain,(aElement0(sz00)),inference(split_conjunct,[status(thm)],[18])).
% fof(104, negated_conjecture,![X1]:(~(aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))))|X1=sz00),inference(fof_nnf,[status(thm)],[20])).
% fof(105, negated_conjecture,![X2]:(~(aElementOf0(X2,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))))|X2=sz00),inference(variable_rename,[status(thm)],[104])).
% cnf(106,negated_conjecture,(X1=sz00|~aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))),inference(split_conjunct,[status(thm)],[105])).
% cnf(107,negated_conjecture,(sz00=X1|~aElementOf0(X1,xI)),inference(rw,[status(thm)],[106,91,theory(equality)])).
% cnf(108,plain,(aSet0(slsdtgt0(X1))|~aElement0(X1)),inference(er,[status(thm)],[56,theory(equality)])).
% cnf(135,plain,(aElementOf0(sdtasdt0(X1,X2),X3)|slsdtgt0(X1)!=X3|~aElement0(X2)|~aElement0(X1)),inference(er,[status(thm)],[59,theory(equality)])).
% cnf(154,plain,(aElementOf0(X1,sdtpldt1(X2,X3))|sdtpldt0(X4,X5)!=X1|~aElementOf0(X5,X3)|~aElementOf0(X4,X2)|~aSet0(X2)|~aSet0(X3)),inference(er,[status(thm)],[37,theory(equality)])).
% cnf(198,plain,(aElementOf0(sz00,X2)|slsdtgt0(sz00)!=X2|~aElement0(X1)|~aElement0(sz00)),inference(spm,[status(thm)],[135,74,theory(equality)])).
% cnf(203,plain,(aElementOf0(sz00,X2)|slsdtgt0(sz00)!=X2|~aElement0(X1)|$false),inference(rw,[status(thm)],[198,103,theory(equality)])).
% cnf(204,plain,(aElementOf0(sz00,X2)|slsdtgt0(sz00)!=X2|~aElement0(X1)),inference(cn,[status(thm)],[203,theory(equality)])).
% cnf(210,plain,(aElementOf0(sz00,slsdtgt0(sz00))|~aElement0(X1)),inference(er,[status(thm)],[204,theory(equality)])).
% cnf(213,plain,(aElementOf0(sz00,slsdtgt0(sz00))),inference(spm,[status(thm)],[210,95,theory(equality)])).
% cnf(339,plain,(aElementOf0(X1,sdtpldt1(X2,X3))|X4!=X1|~aElementOf0(X4,X3)|~aElementOf0(sz00,X2)|~aSet0(X2)|~aSet0(X3)|~aElement0(X4)),inference(spm,[status(thm)],[154,66,theory(equality)])).
% cnf(340,plain,(aElementOf0(X1,sdtpldt1(X2,X3))|X4!=X1|~aElementOf0(sz00,X3)|~aElementOf0(X4,X2)|~aSet0(X2)|~aSet0(X3)|~aElement0(X4)),inference(spm,[status(thm)],[154,67,theory(equality)])).
% cnf(342,plain,(aElementOf0(X1,sdtpldt1(X2,X3))|~aElementOf0(X1,X3)|~aElementOf0(sz00,X2)|~aSet0(X2)|~aSet0(X3)|~aElement0(X1)),inference(er,[status(thm)],[339,theory(equality)])).
% cnf(343,plain,(aElementOf0(X1,sdtpldt1(X2,X3))|~aElementOf0(sz00,X3)|~aElementOf0(X1,X2)|~aSet0(X2)|~aSet0(X3)|~aElement0(X1)),inference(er,[status(thm)],[340,theory(equality)])).
% cnf(432,plain,(aElementOf0(X1,sdtpldt1(X2,X3))|~aElementOf0(sz00,X2)|~aElementOf0(X1,X3)|~aSet0(X2)|~aSet0(X3)),inference(csr,[status(thm)],[342,27])).
% cnf(444,plain,(aElementOf0(X1,xI)|~aElementOf0(sz00,slsdtgt0(xa))|~aElementOf0(X1,slsdtgt0(xb))|~aSet0(slsdtgt0(xa))|~aSet0(slsdtgt0(xb))),inference(spm,[status(thm)],[432,91,theory(equality)])).
% cnf(445,plain,(aElementOf0(X1,xI)|$false|~aElementOf0(X1,slsdtgt0(xb))|~aSet0(slsdtgt0(xa))|~aSet0(slsdtgt0(xb))),inference(rw,[status(thm)],[444,90,theory(equality)])).
% cnf(446,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xb))|~aSet0(slsdtgt0(xa))|~aSet0(slsdtgt0(xb))),inference(cn,[status(thm)],[445,theory(equality)])).
% cnf(448,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xb))|~aSet0(slsdtgt0(xa))|~aElement0(xb)),inference(spm,[status(thm)],[446,108,theory(equality)])).
% cnf(449,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xb))|~aSet0(slsdtgt0(xa))|$false),inference(rw,[status(thm)],[448,95,theory(equality)])).
% cnf(450,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xb))|~aSet0(slsdtgt0(xa))),inference(cn,[status(thm)],[449,theory(equality)])).
% cnf(455,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xb))|~aElement0(xa)),inference(spm,[status(thm)],[450,108,theory(equality)])).
% cnf(456,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xb))|$false),inference(rw,[status(thm)],[455,96,theory(equality)])).
% cnf(457,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xb))),inference(cn,[status(thm)],[456,theory(equality)])).
% cnf(462,plain,(aElementOf0(xb,xI)),inference(spm,[status(thm)],[457,87,theory(equality)])).
% cnf(475,negated_conjecture,(sz00=xb),inference(spm,[status(thm)],[107,462,theory(equality)])).
% cnf(504,plain,(sdtpldt1(slsdtgt0(xa),slsdtgt0(sz00))=xI),inference(rw,[status(thm)],[91,475,theory(equality)])).
% cnf(508,plain,(xa!=sz00|$false),inference(rw,[status(thm)],[94,475,theory(equality)])).
% cnf(509,plain,(xa!=sz00),inference(cn,[status(thm)],[508,theory(equality)])).
% cnf(570,plain,(aElementOf0(X1,sdtpldt1(X2,X3))|~aElementOf0(sz00,X3)|~aElementOf0(X1,X2)|~aSet0(X2)|~aSet0(X3)),inference(csr,[status(thm)],[343,27])).
% cnf(583,plain,(aElementOf0(X1,xI)|~aElementOf0(sz00,slsdtgt0(sz00))|~aElementOf0(X1,slsdtgt0(xa))|~aSet0(slsdtgt0(xa))|~aSet0(slsdtgt0(sz00))),inference(spm,[status(thm)],[570,504,theory(equality)])).
% cnf(584,plain,(aElementOf0(X1,xI)|$false|~aElementOf0(X1,slsdtgt0(xa))|~aSet0(slsdtgt0(xa))|~aSet0(slsdtgt0(sz00))),inference(rw,[status(thm)],[583,213,theory(equality)])).
% cnf(585,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xa))|~aSet0(slsdtgt0(xa))|~aSet0(slsdtgt0(sz00))),inference(cn,[status(thm)],[584,theory(equality)])).
% cnf(587,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xa))|~aSet0(slsdtgt0(sz00))|~aElement0(xa)),inference(spm,[status(thm)],[585,108,theory(equality)])).
% cnf(588,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xa))|~aSet0(slsdtgt0(sz00))|$false),inference(rw,[status(thm)],[587,96,theory(equality)])).
% cnf(589,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xa))|~aSet0(slsdtgt0(sz00))),inference(cn,[status(thm)],[588,theory(equality)])).
% cnf(591,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xa))|~aElement0(sz00)),inference(spm,[status(thm)],[589,108,theory(equality)])).
% cnf(592,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xa))|$false),inference(rw,[status(thm)],[591,103,theory(equality)])).
% cnf(593,plain,(aElementOf0(X1,xI)|~aElementOf0(X1,slsdtgt0(xa))),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(598,plain,(aElementOf0(xa,xI)),inference(spm,[status(thm)],[593,89,theory(equality)])).
% cnf(613,negated_conjecture,(sz00=xa),inference(spm,[status(thm)],[107,598,theory(equality)])).
% cnf(619,negated_conjecture,($false),inference(sr,[status(thm)],[613,509,theory(equality)])).
% cnf(620,negated_conjecture,($false),619,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 178
% # ...of these trivial : 1
% # ...subsumed : 49
% # ...remaining for further processing: 128
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 20
% # Generated clauses : 310
% # ...of the previous two non-trivial : 282
% # Contextual simplify-reflections : 47
% # Paramodulations : 283
% # Factorizations : 0
% # Equation resolutions : 27
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 82
% # Current number of unprocessed clauses: 120
% # ...number of literals in the above : 773
% # Clause-clause subsumption calls (NU) : 594
% # Rec. Clause-clause subsumption calls : 331
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 90 leaves, 1.33+/-1.075 terms/leaf
% # Paramod-from index: 45 leaves, 1.07+/-0.249 terms/leaf
% # Paramod-into index: 75 leaves, 1.19+/-0.558 terms/leaf
% # -------------------------------------------------
% # User time : 0.033 s
% # System time : 0.002 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.21 WC
% FINAL PrfWatch: 0.15 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP13996/RNG109+1.tptp
%
%------------------------------------------------------------------------------