TSTP Solution File: NUM483+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM483+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 19:29:35 EST 2010
% Result : Theorem 96.03s
% Output : Solution 96.61s
% 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/SystemOnTPTP25965/NUM483+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 ... mSortsC_01:
% CSA axiom mSortsC_01 found
% Looking for CSA axiom ... mDivTrans: CSA axiom mDivTrans found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mDefPrime:
% CSA axiom mDefPrime found
% Looking for CSA axiom ... m__1716:
% CSA axiom m__1716 found
% Looking for CSA axiom ... m__1700:
% CSA axiom m__1700 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... m__1716_04:
% CSA axiom m__1716_04 found
% Looking for CSA axiom ... m__1725:
% CSA axiom m__1725 found
% Looking for CSA axiom ... mLENTr:
% CSA axiom mLENTr found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mDivLE:
% CSA axiom mDivLE found
% Looking for CSA axiom ... m_MulUnit:
% CSA axiom m_MulUnit found
% Looking for CSA axiom ... mIH_03:
% CSA axiom mIH_03 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mDefDiv:
% CSA axiom mDefDiv found
% Looking for CSA axiom ... m_MulZero:
% CSA axiom m_MulZero found
% Looking for CSA axiom ... mMulCanc:
% CSA axiom mMulCanc found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :mMulCanc:m_MulZero:mDefDiv:mIH_03:m_MulUnit:mDivLE:mLENTr:m__1725:m__1716_04:m__1700:m__1716:mDefPrime:mDivTrans:mSortsC_01:mSortsC (15)
% Unselected axioms are ... :mZeroMul:m_AddZero:mZeroAdd:mDivSum:mDivMin:mDefQuot:mDivAsso:mNatSort:mSortsB:mSortsB_02:mAddComm:mAddAsso:mMulComm:mMulAsso:mAddCanc:mLERefl:mLEAsym:mLETran:mLETotal:mIH:mMonMul:mMonMul2:mAMDistr:mDefLE:mMonAdd:mDefDiff (26)
% SZS status THM for /tmp/SystemOnTPTP25965/NUM483+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP25965/NUM483+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 28546
% 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]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', m_MulZero)).
% fof(3, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(4, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>((~(X1=X2)&sdtlseqdt0(X1,X2))=>iLess0(X1,X2))),file('/tmp/SRASS.s.p', mIH_03)).
% fof(6, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>((doDivides0(X1,X2)&~(X2=sz00))=>sdtlseqdt0(X1,X2))),file('/tmp/SRASS.s.p', mDivLE)).
% fof(8, axiom,~(isPrime0(xk)),file('/tmp/SRASS.s.p', m__1725)).
% fof(9, axiom,(~(xk=sz00)&~(xk=sz10)),file('/tmp/SRASS.s.p', m__1716_04)).
% fof(10, axiom,![X1]:(((aNaturalNumber0(X1)&~(X1=sz00))&~(X1=sz10))=>(iLess0(X1,xk)=>?[X2]:((aNaturalNumber0(X2)&doDivides0(X2,X1))&isPrime0(X2)))),file('/tmp/SRASS.s.p', m__1700)).
% fof(11, axiom,aNaturalNumber0(xk),file('/tmp/SRASS.s.p', m__1716)).
% fof(12, axiom,![X1]:(aNaturalNumber0(X1)=>(isPrime0(X1)<=>((~(X1=sz00)&~(X1=sz10))&![X2]:((aNaturalNumber0(X2)&doDivides0(X2,X1))=>(X2=sz10|X2=X1))))),file('/tmp/SRASS.s.p', mDefPrime)).
% fof(13, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>((doDivides0(X1,X2)&doDivides0(X2,X3))=>doDivides0(X1,X3))),file('/tmp/SRASS.s.p', mDivTrans)).
% fof(15, axiom,aNaturalNumber0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(16, conjecture,?[X1]:((aNaturalNumber0(X1)&doDivides0(X1,xk))&isPrime0(X1)),file('/tmp/SRASS.s.p', m__)).
% fof(17, negated_conjecture,~(?[X1]:((aNaturalNumber0(X1)&doDivides0(X1,xk))&isPrime0(X1))),inference(assume_negation,[status(cth)],[16])).
% fof(18, plain,~(isPrime0(xk)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(25, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(26, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aNaturalNumber0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(sz00=sdtasdt0(sz00,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(30, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(doDivides0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&(![X3]:(~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|doDivides0(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(31, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&X5=sdtasdt0(X4,esk1_2(X4,X5))))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[31])).
% fof(33, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&X5=sdtasdt0(X4,esk1_2(X4,X5)))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk1_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((X5=sdtasdt0(X4,esk1_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[33])).
% cnf(35,plain,(X1=sdtasdt0(X2,esk1_2(X2,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,plain,(aNaturalNumber0(esk1_2(X2,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(37,plain,(doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|X1!=sdtasdt0(X2,X3)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[34])).
% fof(38, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((X1=X2|~(sdtlseqdt0(X1,X2)))|iLess0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(39, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|((X3=X4|~(sdtlseqdt0(X3,X4)))|iLess0(X3,X4))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(iLess0(X1,X2)|X1=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(46, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(doDivides0(X1,X2))|X2=sz00)|sdtlseqdt0(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(47, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|((~(doDivides0(X3,X4))|X4=sz00)|sdtlseqdt0(X3,X4))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(sdtlseqdt0(X1,X2)|X2=sz00|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[47])).
% cnf(54,plain,(~isPrime0(xk)),inference(split_conjunct,[status(thm)],[18])).
% cnf(55,plain,(xk!=sz10),inference(split_conjunct,[status(thm)],[9])).
% cnf(56,plain,(xk!=sz00),inference(split_conjunct,[status(thm)],[9])).
% fof(57, plain,![X1]:(((~(aNaturalNumber0(X1))|X1=sz00)|X1=sz10)|(~(iLess0(X1,xk))|?[X2]:((aNaturalNumber0(X2)&doDivides0(X2,X1))&isPrime0(X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(58, plain,![X3]:(((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10)|(~(iLess0(X3,xk))|?[X4]:((aNaturalNumber0(X4)&doDivides0(X4,X3))&isPrime0(X4)))),inference(variable_rename,[status(thm)],[57])).
% fof(59, plain,![X3]:(((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10)|(~(iLess0(X3,xk))|((aNaturalNumber0(esk2_1(X3))&doDivides0(esk2_1(X3),X3))&isPrime0(esk2_1(X3))))),inference(skolemize,[status(esa)],[58])).
% fof(60, plain,![X3]:((((aNaturalNumber0(esk2_1(X3))|~(iLess0(X3,xk)))|((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10))&((doDivides0(esk2_1(X3),X3)|~(iLess0(X3,xk)))|((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10)))&((isPrime0(esk2_1(X3))|~(iLess0(X3,xk)))|((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10))),inference(distribute,[status(thm)],[59])).
% cnf(61,plain,(X1=sz10|X1=sz00|isPrime0(esk2_1(X1))|~aNaturalNumber0(X1)|~iLess0(X1,xk)),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,plain,(X1=sz10|X1=sz00|doDivides0(esk2_1(X1),X1)|~aNaturalNumber0(X1)|~iLess0(X1,xk)),inference(split_conjunct,[status(thm)],[60])).
% cnf(63,plain,(X1=sz10|X1=sz00|aNaturalNumber0(esk2_1(X1))|~aNaturalNumber0(X1)|~iLess0(X1,xk)),inference(split_conjunct,[status(thm)],[60])).
% cnf(64,plain,(aNaturalNumber0(xk)),inference(split_conjunct,[status(thm)],[11])).
% fof(65, plain,![X1]:(~(aNaturalNumber0(X1))|((~(isPrime0(X1))|((~(X1=sz00)&~(X1=sz10))&![X2]:((~(aNaturalNumber0(X2))|~(doDivides0(X2,X1)))|(X2=sz10|X2=X1))))&(((X1=sz00|X1=sz10)|?[X2]:((aNaturalNumber0(X2)&doDivides0(X2,X1))&(~(X2=sz10)&~(X2=X1))))|isPrime0(X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(66, plain,![X3]:(~(aNaturalNumber0(X3))|((~(isPrime0(X3))|((~(X3=sz00)&~(X3=sz10))&![X4]:((~(aNaturalNumber0(X4))|~(doDivides0(X4,X3)))|(X4=sz10|X4=X3))))&(((X3=sz00|X3=sz10)|?[X5]:((aNaturalNumber0(X5)&doDivides0(X5,X3))&(~(X5=sz10)&~(X5=X3))))|isPrime0(X3)))),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X3]:(~(aNaturalNumber0(X3))|((~(isPrime0(X3))|((~(X3=sz00)&~(X3=sz10))&![X4]:((~(aNaturalNumber0(X4))|~(doDivides0(X4,X3)))|(X4=sz10|X4=X3))))&(((X3=sz00|X3=sz10)|((aNaturalNumber0(esk3_1(X3))&doDivides0(esk3_1(X3),X3))&(~(esk3_1(X3)=sz10)&~(esk3_1(X3)=X3))))|isPrime0(X3)))),inference(skolemize,[status(esa)],[66])).
% fof(68, plain,![X3]:![X4]:((((((~(aNaturalNumber0(X4))|~(doDivides0(X4,X3)))|(X4=sz10|X4=X3))&(~(X3=sz00)&~(X3=sz10)))|~(isPrime0(X3)))&(((X3=sz00|X3=sz10)|((aNaturalNumber0(esk3_1(X3))&doDivides0(esk3_1(X3),X3))&(~(esk3_1(X3)=sz10)&~(esk3_1(X3)=X3))))|isPrime0(X3)))|~(aNaturalNumber0(X3))),inference(shift_quantors,[status(thm)],[67])).
% fof(69, plain,![X3]:![X4]:((((((~(aNaturalNumber0(X4))|~(doDivides0(X4,X3)))|(X4=sz10|X4=X3))|~(isPrime0(X3)))|~(aNaturalNumber0(X3)))&(((~(X3=sz00)|~(isPrime0(X3)))|~(aNaturalNumber0(X3)))&((~(X3=sz10)|~(isPrime0(X3)))|~(aNaturalNumber0(X3)))))&(((((aNaturalNumber0(esk3_1(X3))|(X3=sz00|X3=sz10))|isPrime0(X3))|~(aNaturalNumber0(X3)))&(((doDivides0(esk3_1(X3),X3)|(X3=sz00|X3=sz10))|isPrime0(X3))|~(aNaturalNumber0(X3))))&((((~(esk3_1(X3)=sz10)|(X3=sz00|X3=sz10))|isPrime0(X3))|~(aNaturalNumber0(X3)))&(((~(esk3_1(X3)=X3)|(X3=sz00|X3=sz10))|isPrime0(X3))|~(aNaturalNumber0(X3)))))),inference(distribute,[status(thm)],[68])).
% cnf(70,plain,(isPrime0(X1)|X1=sz10|X1=sz00|~aNaturalNumber0(X1)|esk3_1(X1)!=X1),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,plain,(isPrime0(X1)|X1=sz10|X1=sz00|~aNaturalNumber0(X1)|esk3_1(X1)!=sz10),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,plain,(isPrime0(X1)|X1=sz10|X1=sz00|doDivides0(esk3_1(X1),X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[69])).
% cnf(73,plain,(isPrime0(X1)|X1=sz10|X1=sz00|aNaturalNumber0(esk3_1(X1))|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(77, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(doDivides0(X1,X2))|~(doDivides0(X2,X3)))|doDivides0(X1,X3))),inference(fof_nnf,[status(thm)],[13])).
% fof(78, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(doDivides0(X4,X5))|~(doDivides0(X5,X6)))|doDivides0(X4,X6))),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(doDivides0(X1,X2)|~doDivides0(X3,X2)|~doDivides0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[78])).
% cnf(82,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[15])).
% fof(83, negated_conjecture,![X1]:((~(aNaturalNumber0(X1))|~(doDivides0(X1,xk)))|~(isPrime0(X1))),inference(fof_nnf,[status(thm)],[17])).
% fof(84, negated_conjecture,![X2]:((~(aNaturalNumber0(X2))|~(doDivides0(X2,xk)))|~(isPrime0(X2))),inference(variable_rename,[status(thm)],[83])).
% cnf(85,negated_conjecture,(~isPrime0(X1)|~doDivides0(X1,xk)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[84])).
% cnf(87,plain,(X1=X2|iLess0(X1,X2)|sz00=X2|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~doDivides0(X1,X2)),inference(spm,[status(thm)],[40,48,theory(equality)])).
% cnf(92,plain,(X1=sz00|~aNaturalNumber0(esk1_2(sz00,X1))|~doDivides0(sz00,X1)|~aNaturalNumber0(sz00)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[28,35,theory(equality)])).
% cnf(95,plain,(X1=sz00|~aNaturalNumber0(esk1_2(sz00,X1))|~doDivides0(sz00,X1)|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[92,82,theory(equality)])).
% cnf(96,plain,(X1=sz00|~aNaturalNumber0(esk1_2(sz00,X1))|~doDivides0(sz00,X1)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[95,theory(equality)])).
% cnf(97,plain,(doDivides0(X1,X2)|sz00=X2|sz10=X2|isPrime0(X2)|~doDivides0(X1,esk3_1(X2))|~aNaturalNumber0(esk3_1(X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[79,72,theory(equality)])).
% cnf(100,negated_conjecture,(sz00=X1|sz10=X1|~doDivides0(esk2_1(X1),xk)|~aNaturalNumber0(esk2_1(X1))|~iLess0(X1,xk)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[85,61,theory(equality)])).
% cnf(101,plain,(doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(sdtasdt0(X1,X2))),inference(er,[status(thm)],[37,theory(equality)])).
% cnf(106,plain,(doDivides0(X1,X2)|sz00!=X2|~aNaturalNumber0(sz00)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[37,29,theory(equality)])).
% cnf(116,plain,(doDivides0(X1,X2)|sz00!=X2|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(rw,[status(thm)],[106,82,theory(equality)])).
% cnf(117,plain,(doDivides0(X1,X2)|sz00!=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(cn,[status(thm)],[116,theory(equality)])).
% cnf(214,negated_conjecture,(sz00=X1|sz10=X1|~iLess0(X1,xk)|~doDivides0(esk2_1(X1),xk)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[100,63])).
% cnf(244,plain,(X1=sz00|~doDivides0(sz00,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(sz00)),inference(spm,[status(thm)],[96,36,theory(equality)])).
% cnf(245,plain,(X1=sz00|~doDivides0(sz00,X1)|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[244,82,theory(equality)])).
% cnf(246,plain,(X1=sz00|~doDivides0(sz00,X1)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[245,theory(equality)])).
% cnf(280,plain,(doDivides0(X1,sdtasdt0(X2,X3))|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(sdtasdt0(X2,X3))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)),inference(spm,[status(thm)],[79,101,theory(equality)])).
% cnf(335,plain,(sdtasdt0(X1,X2)=sz00|~aNaturalNumber0(sdtasdt0(X1,X2))|~doDivides0(sz00,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(sz00)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[246,280,theory(equality)])).
% cnf(343,plain,(sdtasdt0(X1,X2)=sz00|~aNaturalNumber0(sdtasdt0(X1,X2))|~doDivides0(sz00,X1)|~aNaturalNumber0(X1)|$false|~aNaturalNumber0(X2)),inference(rw,[status(thm)],[335,82,theory(equality)])).
% cnf(344,plain,(sdtasdt0(X1,X2)=sz00|~aNaturalNumber0(sdtasdt0(X1,X2))|~doDivides0(sz00,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(cn,[status(thm)],[343,theory(equality)])).
% cnf(355,plain,(sz00=X2|sz10=X2|isPrime0(X2)|doDivides0(X1,X2)|~doDivides0(X1,esk3_1(X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[97,73])).
% cnf(356,plain,(sz10=X2|isPrime0(X2)|doDivides0(X1,X2)|~doDivides0(X1,esk3_1(X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[355,117])).
% cnf(358,plain,(sz10=X1|isPrime0(X1)|doDivides0(esk2_1(esk3_1(X1)),X1)|sz00=esk3_1(X1)|sz10=esk3_1(X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(esk2_1(esk3_1(X1)))|~iLess0(esk3_1(X1),xk)|~aNaturalNumber0(esk3_1(X1))),inference(spm,[status(thm)],[356,62,theory(equality)])).
% cnf(374,plain,(X2=sz00|~doDivides0(sz00,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(esk1_2(X1,X2))|~doDivides0(X1,X2)),inference(spm,[status(thm)],[344,35,theory(equality)])).
% cnf(389,plain,(X2=sz00|~doDivides0(sz00,X1)|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[374,36])).
% cnf(393,plain,(X1=sz00|~doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sz00!=X2|~aNaturalNumber0(sz00)),inference(spm,[status(thm)],[389,117,theory(equality)])).
% cnf(403,plain,(X1=sz00|~doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sz00!=X2|$false),inference(rw,[status(thm)],[393,82,theory(equality)])).
% cnf(404,plain,(X1=sz00|~doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sz00!=X2),inference(cn,[status(thm)],[403,theory(equality)])).
% cnf(409,plain,(X1=sz00|sz10=X1|isPrime0(X1)|sz00!=esk3_1(X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(esk3_1(X1))),inference(spm,[status(thm)],[404,72,theory(equality)])).
% cnf(445,plain,(X1=sz00|sz10=X1|isPrime0(X1)|esk3_1(X1)!=sz00|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[409,73])).
% cnf(987,plain,(esk3_1(X1)=sz00|esk3_1(X1)=sz10|sz10=X1|isPrime0(X1)|doDivides0(esk2_1(esk3_1(X1)),X1)|~iLess0(esk3_1(X1),xk)|~aNaturalNumber0(esk3_1(X1))|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[358,63])).
% cnf(995,negated_conjecture,(sz10=esk3_1(xk)|sz00=esk3_1(xk)|sz10=xk|isPrime0(xk)|~iLess0(esk3_1(xk),xk)|~aNaturalNumber0(esk3_1(xk))|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[214,987,theory(equality)])).
% cnf(996,negated_conjecture,(sz10=esk3_1(xk)|sz00=esk3_1(xk)|sz10=xk|isPrime0(xk)|~iLess0(esk3_1(xk),xk)|~aNaturalNumber0(esk3_1(xk))|$false),inference(rw,[status(thm)],[995,64,theory(equality)])).
% cnf(997,negated_conjecture,(sz10=esk3_1(xk)|sz00=esk3_1(xk)|sz10=xk|isPrime0(xk)|~iLess0(esk3_1(xk),xk)|~aNaturalNumber0(esk3_1(xk))),inference(cn,[status(thm)],[996,theory(equality)])).
% cnf(998,negated_conjecture,(esk3_1(xk)=sz10|esk3_1(xk)=sz00|isPrime0(xk)|~iLess0(esk3_1(xk),xk)|~aNaturalNumber0(esk3_1(xk))),inference(sr,[status(thm)],[997,55,theory(equality)])).
% cnf(999,negated_conjecture,(esk3_1(xk)=sz10|esk3_1(xk)=sz00|~iLess0(esk3_1(xk),xk)|~aNaturalNumber0(esk3_1(xk))),inference(sr,[status(thm)],[998,54,theory(equality)])).
% cnf(1000,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|sz00=xk|esk3_1(xk)=xk|~aNaturalNumber0(esk3_1(xk))|~doDivides0(esk3_1(xk),xk)|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[999,87,theory(equality)])).
% cnf(1001,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|sz00=xk|esk3_1(xk)=xk|~aNaturalNumber0(esk3_1(xk))|~doDivides0(esk3_1(xk),xk)|$false),inference(rw,[status(thm)],[1000,64,theory(equality)])).
% cnf(1002,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|sz00=xk|esk3_1(xk)=xk|~aNaturalNumber0(esk3_1(xk))|~doDivides0(esk3_1(xk),xk)),inference(cn,[status(thm)],[1001,theory(equality)])).
% cnf(1003,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|esk3_1(xk)=xk|~aNaturalNumber0(esk3_1(xk))|~doDivides0(esk3_1(xk),xk)),inference(sr,[status(thm)],[1002,56,theory(equality)])).
% cnf(1005,negated_conjecture,(esk3_1(xk)=xk|esk3_1(xk)=sz10|esk3_1(xk)=sz00|sz00=xk|sz10=xk|isPrime0(xk)|~aNaturalNumber0(esk3_1(xk))|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[1003,72,theory(equality)])).
% cnf(1009,negated_conjecture,(esk3_1(xk)=xk|esk3_1(xk)=sz10|esk3_1(xk)=sz00|sz00=xk|sz10=xk|isPrime0(xk)|~aNaturalNumber0(esk3_1(xk))|$false),inference(rw,[status(thm)],[1005,64,theory(equality)])).
% cnf(1010,negated_conjecture,(esk3_1(xk)=xk|esk3_1(xk)=sz10|esk3_1(xk)=sz00|sz00=xk|sz10=xk|isPrime0(xk)|~aNaturalNumber0(esk3_1(xk))),inference(cn,[status(thm)],[1009,theory(equality)])).
% cnf(1011,negated_conjecture,(esk3_1(xk)=xk|esk3_1(xk)=sz10|esk3_1(xk)=sz00|xk=sz10|isPrime0(xk)|~aNaturalNumber0(esk3_1(xk))),inference(sr,[status(thm)],[1010,56,theory(equality)])).
% cnf(1012,negated_conjecture,(esk3_1(xk)=xk|esk3_1(xk)=sz10|esk3_1(xk)=sz00|isPrime0(xk)|~aNaturalNumber0(esk3_1(xk))),inference(sr,[status(thm)],[1011,55,theory(equality)])).
% cnf(1013,negated_conjecture,(esk3_1(xk)=xk|esk3_1(xk)=sz10|esk3_1(xk)=sz00|~aNaturalNumber0(esk3_1(xk))),inference(sr,[status(thm)],[1012,54,theory(equality)])).
% cnf(1018,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|esk3_1(xk)=xk|sz00=xk|sz10=xk|isPrime0(xk)|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[1013,73,theory(equality)])).
% cnf(1019,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|esk3_1(xk)=xk|sz00=xk|sz10=xk|isPrime0(xk)|$false),inference(rw,[status(thm)],[1018,64,theory(equality)])).
% cnf(1020,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|esk3_1(xk)=xk|sz00=xk|sz10=xk|isPrime0(xk)),inference(cn,[status(thm)],[1019,theory(equality)])).
% cnf(1021,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|esk3_1(xk)=xk|xk=sz10|isPrime0(xk)),inference(sr,[status(thm)],[1020,56,theory(equality)])).
% cnf(1022,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|esk3_1(xk)=xk|isPrime0(xk)),inference(sr,[status(thm)],[1021,55,theory(equality)])).
% cnf(1023,negated_conjecture,(esk3_1(xk)=sz00|esk3_1(xk)=sz10|esk3_1(xk)=xk),inference(sr,[status(thm)],[1022,54,theory(equality)])).
% cnf(1027,negated_conjecture,(sz00=xk|sz10=xk|isPrime0(xk)|esk3_1(xk)=sz10|esk3_1(xk)=sz00|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[70,1023,theory(equality)])).
% cnf(1040,negated_conjecture,(sz00=xk|sz10=xk|isPrime0(xk)|esk3_1(xk)=sz10|esk3_1(xk)=sz00|$false),inference(rw,[status(thm)],[1027,64,theory(equality)])).
% cnf(1041,negated_conjecture,(sz00=xk|sz10=xk|isPrime0(xk)|esk3_1(xk)=sz10|esk3_1(xk)=sz00),inference(cn,[status(thm)],[1040,theory(equality)])).
% cnf(1042,negated_conjecture,(xk=sz10|isPrime0(xk)|esk3_1(xk)=sz10|esk3_1(xk)=sz00),inference(sr,[status(thm)],[1041,56,theory(equality)])).
% cnf(1043,negated_conjecture,(isPrime0(xk)|esk3_1(xk)=sz10|esk3_1(xk)=sz00),inference(sr,[status(thm)],[1042,55,theory(equality)])).
% cnf(1044,negated_conjecture,(esk3_1(xk)=sz10|esk3_1(xk)=sz00),inference(sr,[status(thm)],[1043,54,theory(equality)])).
% cnf(1084,negated_conjecture,(sz00=xk|sz10=xk|isPrime0(xk)|esk3_1(xk)=sz00|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[71,1044,theory(equality)])).
% cnf(1093,negated_conjecture,(sz00=xk|sz10=xk|isPrime0(xk)|esk3_1(xk)=sz00|$false),inference(rw,[status(thm)],[1084,64,theory(equality)])).
% cnf(1094,negated_conjecture,(sz00=xk|sz10=xk|isPrime0(xk)|esk3_1(xk)=sz00),inference(cn,[status(thm)],[1093,theory(equality)])).
% cnf(1095,negated_conjecture,(xk=sz10|isPrime0(xk)|esk3_1(xk)=sz00),inference(sr,[status(thm)],[1094,56,theory(equality)])).
% cnf(1096,negated_conjecture,(isPrime0(xk)|esk3_1(xk)=sz00),inference(sr,[status(thm)],[1095,55,theory(equality)])).
% cnf(1097,negated_conjecture,(esk3_1(xk)=sz00),inference(sr,[status(thm)],[1096,54,theory(equality)])).
% cnf(1139,negated_conjecture,(sz10=xk|xk=sz00|isPrime0(xk)|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[445,1097,theory(equality)])).
% cnf(1174,negated_conjecture,(sz10=xk|xk=sz00|isPrime0(xk)|$false),inference(rw,[status(thm)],[1139,64,theory(equality)])).
% cnf(1175,negated_conjecture,(sz10=xk|xk=sz00|isPrime0(xk)),inference(cn,[status(thm)],[1174,theory(equality)])).
% cnf(1176,negated_conjecture,(xk=sz00|isPrime0(xk)),inference(sr,[status(thm)],[1175,55,theory(equality)])).
% cnf(1177,negated_conjecture,(isPrime0(xk)),inference(sr,[status(thm)],[1176,56,theory(equality)])).
% cnf(1178,negated_conjecture,($false),inference(sr,[status(thm)],[1177,54,theory(equality)])).
% cnf(1179,negated_conjecture,($false),1178,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 276
% # ...of these trivial : 2
% # ...subsumed : 126
% # ...remaining for further processing: 148
% # Other redundant clauses eliminated : 11
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 14
% # Backward-rewritten : 2
% # Generated clauses : 409
% # ...of the previous two non-trivial : 326
% # Contextual simplify-reflections : 121
% # Paramodulations : 388
% # Factorizations : 3
% # Equation resolutions : 18
% # Current number of processed clauses: 101
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 91
% # Current number of unprocessed clauses: 84
% # ...number of literals in the above : 638
% # Clause-clause subsumption calls (NU) : 1871
% # Rec. Clause-clause subsumption calls : 686
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 65 leaves, 1.42+/-1.188 terms/leaf
% # Paramod-from index: 34 leaves, 1.09+/-0.284 terms/leaf
% # Paramod-into index: 59 leaves, 1.27+/-0.860 terms/leaf
% # -------------------------------------------------
% # User time : 0.044 s
% # System time : 0.003 s
% # Total time : 0.047 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP25965/NUM483+1.tptp
%
%------------------------------------------------------------------------------