TSTP Solution File: RNG098+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG098+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 : art07.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 22:32:58 EST 2010
% Result : Theorem 0s
% Output : Solution 0s
% 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/SystemOnTPTP5489/RNG098+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_01:
% CSA axiom mSortsC_01 found
% Looking for CSA axiom ... mSortsU:
% CSA axiom mSortsU found
% Looking for CSA axiom ... mSortsB:
% CSA axiom mSortsB found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... mSortsB_02:
% CSA axiom mSortsB_02 found
% Looking for CSA axiom ... mAddComm:
% CSA axiom mAddComm found
% Looking for CSA axiom ... mAddAsso:
% CSA axiom mAddAsso found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mMulComm:
% CSA axiom mMulComm found
% Looking for CSA axiom ... mMulAsso:
% CSA axiom mMulAsso found
% Looking for CSA axiom ... mMulUnit:
% CSA axiom mMulUnit found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mAMDistr:
% CSA axiom mAMDistr found
% Looking for CSA axiom ... mMulMnOne:
% CSA axiom mMulMnOne found
% Looking for CSA axiom ... mIdeSum:
% CSA axiom mIdeSum found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... m__1205:
% CSA axiom m__1205 found
% Looking for CSA axiom ... m__1205_03:
% CSA axiom m__1205_03 found
% Looking for CSA axiom ... m__1217:
% CSA axiom m__1217 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... m__1294:
% CSA axiom m__1294 found
% Looking for CSA axiom ... m__1319:
% CSA axiom m__1319 found
% Looking for CSA axiom ... m__1374:
% CSA axiom m__1374 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... m__1393:
% CSA axiom m__1393 found
% Looking for CSA axiom ... mDefIdeal:
% CSA axiom mDefIdeal found
% Looking for CSA axiom ... mDefSSum:
% CSA axiom mDefSSum found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... mDefMod:
% CSA axiom mDefMod found
% Looking for CSA axiom ... mAddInvr:
% CSA axiom mAddInvr found
% Looking for CSA axiom ... mAddZero:
% CSA axiom mAddZero found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... mMulZero:
% mCancel:
% CSA axiom mCancel found
% Looking for CSA axiom ... mUnNeZr:
% CSA axiom mUnNeZr found
% Looking for CSA axiom ... mSetEq:
% CSA axiom mSetEq found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mMulZero:
% mEOfElem:
% CSA axiom mEOfElem found
% Looking for CSA axiom ... mSortsC:
% mIdeInt:
% CSA axiom mIdeInt found
% Looking for CSA axiom ... mDefSInt: CSA axiom mDefSInt found
% ---- Iteration 11 (30 axioms selected)
% Looking for TBU SAT ... no
% Looking for TBU UNS ... yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :mDefSInt:mIdeInt:mEOfElem:mSetEq:mUnNeZr:mCancel:mAddZero:mAddInvr:mDefMod:mDefSSum:mDefIdeal:m__1393:m__1374:m__1319:m__1294:m__1217:m__1205_03:m__1205:mIdeSum:mMulMnOne:mAMDistr:mMulUnit:mMulAsso:mMulComm:mAddAsso:mAddComm:mSortsB_02:mSortsB:mSortsU:mSortsC_01 (30)
% Unselected axioms are ... :mMulZero:mSortsC:mElmSort:mSetSort (4)
% SZS status THM for /tmp/SystemOnTPTP5489/RNG098+1.tptp
% Looking for THM ... found
% SZS output start Solution for /tmp/SystemOnTPTP5489/RNG098+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 10713
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.92 CPU 4.01 WC
% PrfWatch: 5.92 CPU 6.02 WC
% PrfWatch: 7.91 CPU 8.02 WC
% PrfWatch: 9.89 CPU 10.03 WC
% PrfWatch: 11.89 CPU 12.03 WC
% PrfWatch: 13.87 CPU 14.04 WC
% PrfWatch: 15.58 CPU 16.07 WC
% PrfWatch: 17.18 CPU 18.08 WC
% PrfWatch: 19.14 CPU 20.08 WC
% PrfWatch: 21.14 CPU 22.08 WC
% PrfWatch: 23.12 CPU 24.09 WC
% PrfWatch: 25.11 CPU 26.09 WC
% PrfWatch: 27.11 CPU 28.10 WC
% PrfWatch: 29.09 CPU 30.10 WC
% PrfWatch: 30.68 CPU 32.11 WC
% PrfWatch: 32.25 CPU 34.11 WC
% PrfWatch: 34.22 CPU 36.12 WC
% PrfWatch: 36.22 CPU 38.12 WC
% PrfWatch: 38.20 CPU 40.13 WC
% PrfWatch: 40.20 CPU 42.13 WC
% PrfWatch: 42.19 CPU 44.14 WC
% PrfWatch: 44.17 CPU 46.14 WC
% PrfWatch: 46.17 CPU 48.15 WC
% PrfWatch: 48.15 CPU 50.15 WC
% PrfWatch: 50.14 CPU 52.16 WC
% PrfWatch: 52.14 CPU 54.16 WC
% PrfWatch: 54.12 CPU 56.17 WC
% PrfWatch: 56.11 CPU 58.17 WC
% PrfWatch: 58.10 CPU 60.18 WC
% PrfWatch: 60.09 CPU 62.18 WC
% PrfWatch: 62.09 CPU 64.19 WC
% PrfWatch: 64.07 CPU 66.19 WC
% PrfWatch: 66.06 CPU 68.20 WC
% PrfWatch: 68.04 CPU 70.20 WC
% PrfWatch: 70.04 CPU 72.20 WC
% PrfWatch: 72.02 CPU 74.21 WC
% PrfWatch: 74.01 CPU 76.21 WC
% PrfWatch: 76.01 CPU 78.22 WC
% PrfWatch: 78.00 CPU 80.22 WC
% PrfWatch: 79.99 CPU 82.23 WC
% PrfWatch: 81.98 CPU 84.23 WC
% PrfWatch: 83.97 CPU 86.24 WC
% PrfWatch: 85.97 CPU 88.24 WC
% PrfWatch: 87.96 CPU 90.25 WC
% PrfWatch: 89.96 CPU 92.25 WC
% PrfWatch: 91.94 CPU 94.26 WC
% PrfWatch: 93.93 CPU 96.26 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 95.91 CPU 98.27 WC
% PrfWatch: 97.89 CPU 100.27 WC
% PrfWatch: 99.89 CPU 102.28 WC
% PrfWatch: 101.89 CPU 104.28 WC
% PrfWatch: 103.89 CPU 106.28 WC
% PrfWatch: 105.89 CPU 108.29 WC
% PrfWatch: 107.89 CPU 110.29 WC
% PrfWatch: 109.89 CPU 112.30 WC
% PrfWatch: 111.89 CPU 114.30 WC
% PrfWatch: 113.89 CPU 116.31 WC
% PrfWatch: 115.89 CPU 118.31 WC
% PrfWatch: 117.89 CPU 120.32 WC
% PrfWatch: 119.88 CPU 122.32 WC
% PrfWatch: 121.88 CPU 124.33 WC
% PrfWatch: 123.88 CPU 126.33 WC
% PrfWatch: 125.88 CPU 128.33 WC
% PrfWatch: 127.88 CPU 130.34 WC
% PrfWatch: 129.88 CPU 132.34 WC
% PrfWatch: 131.88 CPU 134.35 WC
% PrfWatch: 133.88 CPU 136.35 WC
% PrfWatch: 135.88 CPU 138.36 WC
% PrfWatch: 137.88 CPU 140.36 WC
% PrfWatch: 139.75 CPU 142.37 WC
% PrfWatch: 141.34 CPU 144.41 WC
% PrfWatch: 143.22 CPU 146.43 WC
% PrfWatch: 145.22 CPU 148.43 WC
% PrfWatch: 147.22 CPU 150.44 WC
% PrfWatch: 149.22 CPU 152.44 WC
% PrfWatch: 151.22 CPU 154.44 WC
% PrfWatch: 153.20 CPU 156.45 WC
% PrfWatch: 155.17 CPU 158.45 WC
% PrfWatch: 157.14 CPU 160.46 WC
% PrfWatch: 159.09 CPU 162.46 WC
% PrfWatch: 161.06 CPU 164.47 WC
% PrfWatch: 163.00 CPU 166.47 WC
% PrfWatch: 164.87 CPU 168.48 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(11, axiom,![X1]:(aIdeal0(X1)<=>(aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>(![X3]:(aElementOf0(X3,X1)=>aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(aElement0(X3)=>aElementOf0(sdtasdt0(X3,X2),X1)))))),file('/tmp/SRASS.s.p', mDefIdeal)).
% fof(12, axiom,aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI),file('/tmp/SRASS.s.p', m__1393)).
% fof(13, axiom,sdtpldt0(xw,smndt0(xx))=sdtpldt0(sdtasdt0(xy,xa),sdtpldt0(sdtasdt0(xx,xb),smndt0(xx))),file('/tmp/SRASS.s.p', m__1374)).
% fof(15, axiom,((aElementOf0(xa,xI)&aElementOf0(xb,xJ))&sdtpldt0(xa,xb)=sz10),file('/tmp/SRASS.s.p', m__1294)).
% fof(16, axiom,(aElement0(xx)&aElement0(xy)),file('/tmp/SRASS.s.p', m__1217)).
% fof(18, axiom,(aIdeal0(xI)&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__1205)).
% fof(20, axiom,![X1]:(aElement0(X1)=>(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),file('/tmp/SRASS.s.p', mMulMnOne)).
% fof(21, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aElement0(X2))&aElement0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),file('/tmp/SRASS.s.p', mAMDistr)).
% fof(29, axiom,![X1]:(aElement0(X1)=>aElement0(smndt0(X1))),file('/tmp/SRASS.s.p', mSortsU)).
% fof(30, axiom,aElement0(sz10),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(31, conjecture,aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),file('/tmp/SRASS.s.p', m__)).
% fof(32, negated_conjecture,~(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)),inference(assume_negation,[status(cth)],[31])).
% fof(33, negated_conjecture,~(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)),inference(fof_simplification,[status(thm)],[32,theory(equality)])).
% fof(49, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(50, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(94, plain,![X1]:((~(aIdeal0(X1))|(aSet0(X1)&![X2]:(~(aElementOf0(X2,X1))|(![X3]:(~(aElementOf0(X3,X1))|aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(~(aElement0(X3))|aElementOf0(sdtasdt0(X3,X2),X1))))))&((~(aSet0(X1))|?[X2]:(aElementOf0(X2,X1)&(?[X3]:(aElementOf0(X3,X1)&~(aElementOf0(sdtpldt0(X2,X3),X1)))|?[X3]:(aElement0(X3)&~(aElementOf0(sdtasdt0(X3,X2),X1))))))|aIdeal0(X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(95, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|?[X8]:(aElementOf0(X8,X4)&(?[X9]:(aElementOf0(X9,X4)&~(aElementOf0(sdtpldt0(X8,X9),X4)))|?[X10]:(aElement0(X10)&~(aElementOf0(sdtasdt0(X10,X8),X4))))))|aIdeal0(X4))),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|(aElementOf0(esk9_1(X4),X4)&((aElementOf0(esk10_1(X4),X4)&~(aElementOf0(sdtpldt0(esk9_1(X4),esk10_1(X4)),X4)))|(aElement0(esk11_1(X4))&~(aElementOf0(sdtasdt0(esk11_1(X4),esk9_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[95])).
% fof(97, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))&(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4)))|~(aElementOf0(X5,X4)))&aSet0(X4))|~(aIdeal0(X4)))&((~(aSet0(X4))|(aElementOf0(esk9_1(X4),X4)&((aElementOf0(esk10_1(X4),X4)&~(aElementOf0(sdtpldt0(esk9_1(X4),esk10_1(X4)),X4)))|(aElement0(esk11_1(X4))&~(aElementOf0(sdtasdt0(esk11_1(X4),esk9_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[96])).
% fof(98, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4)))&(((~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4))))&(aSet0(X4)|~(aIdeal0(X4))))&(((aElementOf0(esk9_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk11_1(X4))|aElementOf0(esk10_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk11_1(X4),esk9_1(X4)),X4))|aElementOf0(esk10_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk11_1(X4))|~(aElementOf0(sdtpldt0(esk9_1(X4),esk10_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk11_1(X4),esk9_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk9_1(X4),esk10_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[97])).
% cnf(104,plain,(aSet0(X1)|~aIdeal0(X1)),inference(split_conjunct,[status(thm)],[98])).
% cnf(105,plain,(aElementOf0(sdtpldt0(X2,X3),X1)|~aIdeal0(X1)|~aElementOf0(X2,X1)|~aElementOf0(X3,X1)),inference(split_conjunct,[status(thm)],[98])).
% cnf(106,plain,(aElementOf0(sdtasdt0(X3,X2),X1)|~aIdeal0(X1)|~aElementOf0(X2,X1)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[98])).
% cnf(107,plain,(aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI)),inference(split_conjunct,[status(thm)],[12])).
% cnf(108,plain,(sdtpldt0(xw,smndt0(xx))=sdtpldt0(sdtasdt0(xy,xa),sdtpldt0(sdtasdt0(xx,xb),smndt0(xx)))),inference(split_conjunct,[status(thm)],[13])).
% cnf(111,plain,(aElementOf0(xb,xJ)),inference(split_conjunct,[status(thm)],[15])).
% cnf(112,plain,(aElementOf0(xa,xI)),inference(split_conjunct,[status(thm)],[15])).
% cnf(113,plain,(aElement0(xy)),inference(split_conjunct,[status(thm)],[16])).
% cnf(114,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[16])).
% cnf(118,plain,(aIdeal0(xJ)),inference(split_conjunct,[status(thm)],[18])).
% cnf(119,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[18])).
% fof(123, plain,![X1]:(~(aElement0(X1))|(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),inference(fof_nnf,[status(thm)],[20])).
% fof(124, plain,![X2]:(~(aElement0(X2))|(sdtasdt0(smndt0(sz10),X2)=smndt0(X2)&smndt0(X2)=sdtasdt0(X2,smndt0(sz10)))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X2]:((sdtasdt0(smndt0(sz10),X2)=smndt0(X2)|~(aElement0(X2)))&(smndt0(X2)=sdtasdt0(X2,smndt0(sz10))|~(aElement0(X2)))),inference(distribute,[status(thm)],[124])).
% cnf(126,plain,(smndt0(X1)=sdtasdt0(X1,smndt0(sz10))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[125])).
% fof(128, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(129, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)))),inference(variable_rename,[status(thm)],[128])).
% fof(130, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6))))&(sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))|((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6))))),inference(distribute,[status(thm)],[129])).
% cnf(132,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aElement0(X1)|~aElement0(X2)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[130])).
% fof(156, plain,![X1]:(~(aElement0(X1))|aElement0(smndt0(X1))),inference(fof_nnf,[status(thm)],[29])).
% fof(157, plain,![X2]:(~(aElement0(X2))|aElement0(smndt0(X2))),inference(variable_rename,[status(thm)],[156])).
% cnf(158,plain,(aElement0(smndt0(X1))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[157])).
% cnf(159,plain,(aElement0(sz10)),inference(split_conjunct,[status(thm)],[30])).
% cnf(160,negated_conjecture,(~aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)),inference(split_conjunct,[status(thm)],[33])).
% cnf(161,plain,(aSet0(xJ)),inference(spm,[status(thm)],[104,118,theory(equality)])).
% cnf(166,plain,(aElement0(xb)|~aSet0(xJ)),inference(spm,[status(thm)],[52,111,theory(equality)])).
% cnf(249,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),X1)|~aIdeal0(X1)|~aElementOf0(sdtpldt0(sdtasdt0(xx,xb),smndt0(xx)),X1)|~aElementOf0(sdtasdt0(xy,xa),X1)),inference(spm,[status(thm)],[105,108,theory(equality)])).
% cnf(353,plain,(sdtpldt0(sdtasdt0(X1,X2),smndt0(X1))=sdtasdt0(X1,sdtpldt0(X2,smndt0(sz10)))|~aElement0(X1)|~aElement0(X2)|~aElement0(smndt0(sz10))),inference(spm,[status(thm)],[132,126,theory(equality)])).
% cnf(440,plain,(aElement0(xb)|$false),inference(rw,[status(thm)],[166,161,theory(equality)])).
% cnf(441,plain,(aElement0(xb)),inference(cn,[status(thm)],[440,theory(equality)])).
% cnf(16187,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),X1)|~aIdeal0(X1)|~aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),X1)|~aElementOf0(sdtasdt0(xy,xa),X1)|~aElement0(smndt0(sz10))|~aElement0(xx)|~aElement0(xb)),inference(spm,[status(thm)],[249,353,theory(equality)])).
% cnf(16218,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),X1)|~aIdeal0(X1)|~aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),X1)|~aElementOf0(sdtasdt0(xy,xa),X1)|~aElement0(smndt0(sz10))|$false|~aElement0(xb)),inference(rw,[status(thm)],[16187,114,theory(equality)])).
% cnf(16219,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),X1)|~aIdeal0(X1)|~aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),X1)|~aElementOf0(sdtasdt0(xy,xa),X1)|~aElement0(smndt0(sz10))|$false|$false),inference(rw,[status(thm)],[16218,441,theory(equality)])).
% cnf(16220,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),X1)|~aIdeal0(X1)|~aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),X1)|~aElementOf0(sdtasdt0(xy,xa),X1)|~aElement0(smndt0(sz10))),inference(cn,[status(thm)],[16219,theory(equality)])).
% cnf(4682732,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)|~aElement0(smndt0(sz10))|~aIdeal0(xI)|~aElementOf0(sdtasdt0(xy,xa),xI)),inference(spm,[status(thm)],[16220,107,theory(equality)])).
% cnf(4682750,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)|~aElement0(smndt0(sz10))|$false|~aElementOf0(sdtasdt0(xy,xa),xI)),inference(rw,[status(thm)],[4682732,119,theory(equality)])).
% cnf(4682751,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)|~aElement0(smndt0(sz10))|~aElementOf0(sdtasdt0(xy,xa),xI)),inference(cn,[status(thm)],[4682750,theory(equality)])).
% cnf(4682752,plain,(~aElement0(smndt0(sz10))|~aElementOf0(sdtasdt0(xy,xa),xI)),inference(sr,[status(thm)],[4682751,160,theory(equality)])).
% cnf(4682768,plain,(~aElement0(smndt0(sz10))|~aElement0(xy)|~aIdeal0(xI)|~aElementOf0(xa,xI)),inference(spm,[status(thm)],[4682752,106,theory(equality)])).
% cnf(4682777,plain,(~aElement0(smndt0(sz10))|$false|~aIdeal0(xI)|~aElementOf0(xa,xI)),inference(rw,[status(thm)],[4682768,113,theory(equality)])).
% cnf(4682778,plain,(~aElement0(smndt0(sz10))|$false|$false|~aElementOf0(xa,xI)),inference(rw,[status(thm)],[4682777,119,theory(equality)])).
% cnf(4682779,plain,(~aElement0(smndt0(sz10))|$false|$false|$false),inference(rw,[status(thm)],[4682778,112,theory(equality)])).
% cnf(4682780,plain,(~aElement0(smndt0(sz10))),inference(cn,[status(thm)],[4682779,theory(equality)])).
% cnf(4682790,plain,(~aElement0(sz10)),inference(spm,[status(thm)],[4682780,158,theory(equality)])).
% cnf(4682794,plain,($false),inference(rw,[status(thm)],[4682790,159,theory(equality)])).
% cnf(4682795,plain,($false),inference(cn,[status(thm)],[4682794,theory(equality)])).
% cnf(4682796,plain,($false),4682795,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 166.73 CPU 170.48 WC
% # Processed clauses : 30451
% # ...of these trivial : 900
% # ...subsumed : 25521
% # ...remaining for further processing: 4030
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 202
% # Backward-rewritten : 275
% # Generated clauses : 1967370
% # ...of the previous two non-trivial : 1878768
% # Contextual simplify-reflections : 7421
% # Paramodulations : 1967322
% # Factorizations : 0
% # Equation resolutions : 48
% # Current number of processed clauses: 3488
% # Positive orientable unit clauses: 324
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 15
% # Non-unit-clauses : 3149
% # Current number of unprocessed clauses: 1783812
% # ...number of literals in the above : 11361650
% # Clause-clause subsumption calls (NU) : 670568
% # Rec. Clause-clause subsumption calls : 318288
% # Unit Clause-clause subsumption calls : 2858
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1318
% # Indexed BW rewrite successes : 113
% # Backwards rewriting index: 1693 leaves, 2.54+/-3.888 terms/leaf
% # Paramod-from index: 1017 leaves, 1.99+/-2.880 terms/leaf
% # Paramod-into index: 1487 leaves, 2.31+/-3.367 terms/leaf
% # -------------------------------------------------
% # User time : 91.714 s
% # System time : 3.588 s
% # Total time : 95.303 s
% # Maximum resident set size: 0 pages
% PrfWatch: 166.86 CPU 170.69 WC
% FINAL PrfWatch: 166.86 CPU 170.69 WC
% SZS output end Solution for /tmp/SystemOnTPTP5489/RNG098+1.tptp
%
%------------------------------------------------------------------------------