TSTP Solution File: NUM460+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM460+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 : art09.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:19:36 EST 2010
% Result : Theorem 1.83s
% Output : Solution 1.83s
% 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/SystemOnTPTP29794/NUM460+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29794/NUM460+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29794/NUM460+1.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 29890
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,((aNaturalNumber0(xm)&aNaturalNumber0(xn))&aNaturalNumber0(xl)),file('/tmp/SRASS.s.p', m__773)).
% fof(4, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(5, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),file('/tmp/SRASS.s.p', mAddComm)).
% fof(6, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),file('/tmp/SRASS.s.p', mAddAsso)).
% fof(7, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>((sdtpldt0(X1,X2)=sdtpldt0(X1,X3)|sdtpldt0(X2,X1)=sdtpldt0(X3,X1))=>X2=X3)),file('/tmp/SRASS.s.p', mAddCanc)).
% fof(8, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))),file('/tmp/SRASS.s.p', mDefLE)).
% fof(13, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)=>![X3]:(X3=sdtmndt0(X2,X1)<=>(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2)))),file('/tmp/SRASS.s.p', mDefDiff)).
% fof(23, conjecture,((sdtlseqdt0(xm,xn)&sdtlseqdt0(xn,xl))=>sdtlseqdt0(xm,xl)),file('/tmp/SRASS.s.p', m__)).
% fof(24, negated_conjecture,~(((sdtlseqdt0(xm,xn)&sdtlseqdt0(xn,xl))=>sdtlseqdt0(xm,xl))),inference(assume_negation,[status(cth)],[23])).
% cnf(29,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[2])).
% cnf(30,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[2])).
% cnf(31,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[2])).
% fof(35, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(36, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(39, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|sdtpldt0(X3,X4)=sdtpldt0(X4,X3)),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(42, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(sdtpldt0(X1,X2)=sdtpldt0(X1,X3))&~(sdtpldt0(X2,X1)=sdtpldt0(X3,X1)))|X2=X3)),inference(fof_nnf,[status(thm)],[7])).
% fof(45, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(sdtpldt0(X4,X5)=sdtpldt0(X4,X6))&~(sdtpldt0(X5,X4)=sdtpldt0(X6,X4)))|X5=X6)),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X4]:![X5]:![X6]:(((~(sdtpldt0(X4,X5)=sdtpldt0(X4,X6))|X5=X6)|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))&((~(sdtpldt0(X5,X4)=sdtpldt0(X6,X4))|X5=X6)|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))),inference(distribute,[status(thm)],[45])).
% cnf(47,plain,(X2=X1|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|sdtpldt0(X2,X3)!=sdtpldt0(X1,X3)),inference(split_conjunct,[status(thm)],[46])).
% fof(49, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(sdtlseqdt0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&(![X3]:(~(aNaturalNumber0(X3))|~(sdtpldt0(X1,X3)=X2))|sdtlseqdt0(X1,X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(50, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(sdtlseqdt0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&(![X7]:(~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5)))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(sdtlseqdt0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&sdtpldt0(X4,esk1_2(X4,X5))=X5))&(![X7]:(~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5)))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5))&(~(sdtlseqdt0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&sdtpldt0(X4,esk1_2(X4,X5))=X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk1_2(X4,X5))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((sdtpldt0(X4,esk1_2(X4,X5))=X5|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(sdtpldt0(X2,esk1_2(X2,X1))=X1|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(aNaturalNumber0(esk1_2(X2,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(sdtlseqdt0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[53])).
% fof(67, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(~(sdtlseqdt0(X1,X2))|![X3]:((~(X3=sdtmndt0(X2,X1))|(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&((~(aNaturalNumber0(X3))|~(sdtpldt0(X1,X3)=X2))|X3=sdtmndt0(X2,X1))))),inference(fof_nnf,[status(thm)],[13])).
% fof(68, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|(~(sdtlseqdt0(X4,X5))|![X6]:((~(X6=sdtmndt0(X5,X4))|(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:((((~(X6=sdtmndt0(X5,X4))|(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[68])).
% fof(70, plain,![X4]:![X5]:![X6]:(((((aNaturalNumber0(X6)|~(X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((sdtpldt0(X4,X6)=X5|~(X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))&((((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))),inference(distribute,[status(thm)],[69])).
% cnf(71,plain,(X3=sdtmndt0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[70])).
% fof(112, negated_conjecture,((sdtlseqdt0(xm,xn)&sdtlseqdt0(xn,xl))&~(sdtlseqdt0(xm,xl))),inference(fof_nnf,[status(thm)],[24])).
% cnf(113,negated_conjecture,(~sdtlseqdt0(xm,xl)),inference(split_conjunct,[status(thm)],[112])).
% cnf(114,negated_conjecture,(sdtlseqdt0(xn,xl)),inference(split_conjunct,[status(thm)],[112])).
% cnf(115,negated_conjecture,(sdtlseqdt0(xm,xn)),inference(split_conjunct,[status(thm)],[112])).
% cnf(156,negated_conjecture,(aNaturalNumber0(esk1_2(xn,xl))|~aNaturalNumber0(xn)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[55,114,theory(equality)])).
% cnf(157,negated_conjecture,(aNaturalNumber0(esk1_2(xm,xn))|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[55,115,theory(equality)])).
% cnf(159,negated_conjecture,(aNaturalNumber0(esk1_2(xn,xl))|$false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[156,30,theory(equality)])).
% cnf(160,negated_conjecture,(aNaturalNumber0(esk1_2(xn,xl))|$false|$false),inference(rw,[status(thm)],[159,29,theory(equality)])).
% cnf(161,negated_conjecture,(aNaturalNumber0(esk1_2(xn,xl))),inference(cn,[status(thm)],[160,theory(equality)])).
% cnf(162,negated_conjecture,(aNaturalNumber0(esk1_2(xm,xn))|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[157,31,theory(equality)])).
% cnf(163,negated_conjecture,(aNaturalNumber0(esk1_2(xm,xn))|$false|$false),inference(rw,[status(thm)],[162,30,theory(equality)])).
% cnf(164,negated_conjecture,(aNaturalNumber0(esk1_2(xm,xn))),inference(cn,[status(thm)],[163,theory(equality)])).
% cnf(212,plain,(sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(sdtpldt0(X1,X2))),inference(er,[status(thm)],[56,theory(equality)])).
% cnf(257,negated_conjecture,(sdtpldt0(xn,esk1_2(xn,xl))=xl|~aNaturalNumber0(xn)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[54,114,theory(equality)])).
% cnf(258,negated_conjecture,(sdtpldt0(xm,esk1_2(xm,xn))=xn|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[54,115,theory(equality)])).
% cnf(260,negated_conjecture,(sdtpldt0(xn,esk1_2(xn,xl))=xl|$false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[257,30,theory(equality)])).
% cnf(261,negated_conjecture,(sdtpldt0(xn,esk1_2(xn,xl))=xl|$false|$false),inference(rw,[status(thm)],[260,29,theory(equality)])).
% cnf(262,negated_conjecture,(sdtpldt0(xn,esk1_2(xn,xl))=xl),inference(cn,[status(thm)],[261,theory(equality)])).
% cnf(263,negated_conjecture,(sdtpldt0(xm,esk1_2(xm,xn))=xn|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[258,31,theory(equality)])).
% cnf(264,negated_conjecture,(sdtpldt0(xm,esk1_2(xm,xn))=xn|$false|$false),inference(rw,[status(thm)],[263,30,theory(equality)])).
% cnf(265,negated_conjecture,(sdtpldt0(xm,esk1_2(xm,xn))=xn),inference(cn,[status(thm)],[264,theory(equality)])).
% cnf(317,plain,(sdtmndt0(X1,X2)=X3|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[71,56])).
% cnf(470,negated_conjecture,(X1=xn|sdtpldt0(X1,esk1_2(xn,xl))!=xl|~aNaturalNumber0(esk1_2(xn,xl))|~aNaturalNumber0(xn)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[47,262,theory(equality)])).
% cnf(471,negated_conjecture,(sdtmndt0(X1,xn)=esk1_2(xn,xl)|xl!=X1|~aNaturalNumber0(esk1_2(xn,xl))|~aNaturalNumber0(xn)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[317,262,theory(equality)])).
% cnf(489,negated_conjecture,(X1=xn|sdtpldt0(X1,esk1_2(xn,xl))!=xl|$false|~aNaturalNumber0(xn)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[470,161,theory(equality)])).
% cnf(490,negated_conjecture,(X1=xn|sdtpldt0(X1,esk1_2(xn,xl))!=xl|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[489,30,theory(equality)])).
% cnf(491,negated_conjecture,(X1=xn|sdtpldt0(X1,esk1_2(xn,xl))!=xl|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[490,theory(equality)])).
% cnf(492,negated_conjecture,(sdtmndt0(X1,xn)=esk1_2(xn,xl)|xl!=X1|$false|~aNaturalNumber0(xn)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[471,161,theory(equality)])).
% cnf(493,negated_conjecture,(sdtmndt0(X1,xn)=esk1_2(xn,xl)|xl!=X1|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[492,30,theory(equality)])).
% cnf(494,negated_conjecture,(sdtmndt0(X1,xn)=esk1_2(xn,xl)|xl!=X1|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[493,theory(equality)])).
% cnf(511,negated_conjecture,(X1=xm|sdtpldt0(X1,esk1_2(xm,xn))!=xn|~aNaturalNumber0(esk1_2(xm,xn))|~aNaturalNumber0(xm)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[47,265,theory(equality)])).
% cnf(512,negated_conjecture,(sdtmndt0(X1,xm)=esk1_2(xm,xn)|xn!=X1|~aNaturalNumber0(esk1_2(xm,xn))|~aNaturalNumber0(xm)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[317,265,theory(equality)])).
% cnf(530,negated_conjecture,(X1=xm|sdtpldt0(X1,esk1_2(xm,xn))!=xn|$false|~aNaturalNumber0(xm)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[511,164,theory(equality)])).
% cnf(531,negated_conjecture,(X1=xm|sdtpldt0(X1,esk1_2(xm,xn))!=xn|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[530,31,theory(equality)])).
% cnf(532,negated_conjecture,(X1=xm|sdtpldt0(X1,esk1_2(xm,xn))!=xn|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[531,theory(equality)])).
% cnf(533,negated_conjecture,(sdtmndt0(X1,xm)=esk1_2(xm,xn)|xn!=X1|$false|~aNaturalNumber0(xm)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[512,164,theory(equality)])).
% cnf(534,negated_conjecture,(sdtmndt0(X1,xm)=esk1_2(xm,xn)|xn!=X1|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[533,31,theory(equality)])).
% cnf(535,negated_conjecture,(sdtmndt0(X1,xm)=esk1_2(xm,xn)|xn!=X1|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[534,theory(equality)])).
% cnf(567,negated_conjecture,(X1=xn|sdtpldt0(esk1_2(xn,xl),X1)!=xl|~aNaturalNumber0(X1)|~aNaturalNumber0(esk1_2(xn,xl))),inference(spm,[status(thm)],[491,40,theory(equality)])).
% cnf(574,negated_conjecture,(X1=xn|sdtpldt0(esk1_2(xn,xl),X1)!=xl|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[567,161,theory(equality)])).
% cnf(575,negated_conjecture,(X1=xn|sdtpldt0(esk1_2(xn,xl),X1)!=xl|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[574,theory(equality)])).
% cnf(580,negated_conjecture,(X1=xm|sdtpldt0(esk1_2(xm,xn),X1)!=xn|~aNaturalNumber0(X1)|~aNaturalNumber0(esk1_2(xm,xn))),inference(spm,[status(thm)],[532,40,theory(equality)])).
% cnf(587,negated_conjecture,(X1=xm|sdtpldt0(esk1_2(xm,xn),X1)!=xn|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[580,164,theory(equality)])).
% cnf(588,negated_conjecture,(X1=xm|sdtpldt0(esk1_2(xm,xn),X1)!=xn|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[587,theory(equality)])).
% cnf(667,negated_conjecture,(sdtmndt0(xl,xn)=esk1_2(xn,xl)|~aNaturalNumber0(xl)),inference(er,[status(thm)],[494,theory(equality)])).
% cnf(668,negated_conjecture,(sdtmndt0(xl,xn)=esk1_2(xn,xl)|$false),inference(rw,[status(thm)],[667,29,theory(equality)])).
% cnf(669,negated_conjecture,(sdtmndt0(xl,xn)=esk1_2(xn,xl)),inference(cn,[status(thm)],[668,theory(equality)])).
% cnf(671,negated_conjecture,(X1=xn|sdtpldt0(sdtmndt0(xl,xn),X1)!=xl|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[575,669,theory(equality)])).
% cnf(677,negated_conjecture,(sdtpldt0(xn,sdtmndt0(xl,xn))=xl),inference(rw,[status(thm)],[262,669,theory(equality)])).
% cnf(679,negated_conjecture,(aNaturalNumber0(sdtmndt0(xl,xn))),inference(rw,[status(thm)],[161,669,theory(equality)])).
% cnf(767,negated_conjecture,(sdtmndt0(xn,xm)=esk1_2(xm,xn)|~aNaturalNumber0(xn)),inference(er,[status(thm)],[535,theory(equality)])).
% cnf(768,negated_conjecture,(sdtmndt0(xn,xm)=esk1_2(xm,xn)|$false),inference(rw,[status(thm)],[767,30,theory(equality)])).
% cnf(769,negated_conjecture,(sdtmndt0(xn,xm)=esk1_2(xm,xn)),inference(cn,[status(thm)],[768,theory(equality)])).
% cnf(772,negated_conjecture,(X1=xm|sdtpldt0(sdtmndt0(xn,xm),X1)!=xn|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[588,769,theory(equality)])).
% cnf(777,negated_conjecture,(sdtpldt0(xm,sdtmndt0(xn,xm))=xn),inference(rw,[status(thm)],[265,769,theory(equality)])).
% cnf(779,negated_conjecture,(aNaturalNumber0(sdtmndt0(xn,xm))),inference(rw,[status(thm)],[164,769,theory(equality)])).
% cnf(955,plain,(sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[212,37])).
% cnf(967,plain,(sdtlseqdt0(X1,sdtpldt0(X2,X1))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[955,40,theory(equality)])).
% cnf(988,plain,(sdtlseqdt0(X1,sdtpldt0(X2,sdtpldt0(X3,X1)))|~aNaturalNumber0(sdtpldt0(X2,X3))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[967,43,theory(equality)])).
% cnf(989,negated_conjecture,(sdtlseqdt0(sdtmndt0(xl,xn),xl)|~aNaturalNumber0(xn)|~aNaturalNumber0(sdtmndt0(xl,xn))),inference(spm,[status(thm)],[967,677,theory(equality)])).
% cnf(990,negated_conjecture,(sdtlseqdt0(sdtmndt0(xn,xm),xn)|~aNaturalNumber0(xm)|~aNaturalNumber0(sdtmndt0(xn,xm))),inference(spm,[status(thm)],[967,777,theory(equality)])).
% cnf(996,negated_conjecture,(sdtlseqdt0(sdtmndt0(xl,xn),xl)|$false|~aNaturalNumber0(sdtmndt0(xl,xn))),inference(rw,[status(thm)],[989,30,theory(equality)])).
% cnf(997,negated_conjecture,(sdtlseqdt0(sdtmndt0(xl,xn),xl)|$false|$false),inference(rw,[status(thm)],[996,679,theory(equality)])).
% cnf(998,negated_conjecture,(sdtlseqdt0(sdtmndt0(xl,xn),xl)),inference(cn,[status(thm)],[997,theory(equality)])).
% cnf(999,negated_conjecture,(sdtlseqdt0(sdtmndt0(xn,xm),xn)|$false|~aNaturalNumber0(sdtmndt0(xn,xm))),inference(rw,[status(thm)],[990,31,theory(equality)])).
% cnf(1000,negated_conjecture,(sdtlseqdt0(sdtmndt0(xn,xm),xn)|$false|$false),inference(rw,[status(thm)],[999,779,theory(equality)])).
% cnf(1001,negated_conjecture,(sdtlseqdt0(sdtmndt0(xn,xm),xn)),inference(cn,[status(thm)],[1000,theory(equality)])).
% cnf(1006,negated_conjecture,(aNaturalNumber0(esk1_2(sdtmndt0(xl,xn),xl))|~aNaturalNumber0(sdtmndt0(xl,xn))|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[55,998,theory(equality)])).
% cnf(1007,negated_conjecture,(sdtpldt0(sdtmndt0(xl,xn),esk1_2(sdtmndt0(xl,xn),xl))=xl|~aNaturalNumber0(sdtmndt0(xl,xn))|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[54,998,theory(equality)])).
% cnf(1014,negated_conjecture,(aNaturalNumber0(esk1_2(sdtmndt0(xl,xn),xl))|$false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[1006,679,theory(equality)])).
% cnf(1015,negated_conjecture,(aNaturalNumber0(esk1_2(sdtmndt0(xl,xn),xl))|$false|$false),inference(rw,[status(thm)],[1014,29,theory(equality)])).
% cnf(1016,negated_conjecture,(aNaturalNumber0(esk1_2(sdtmndt0(xl,xn),xl))),inference(cn,[status(thm)],[1015,theory(equality)])).
% cnf(1017,negated_conjecture,(sdtpldt0(sdtmndt0(xl,xn),esk1_2(sdtmndt0(xl,xn),xl))=xl|$false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[1007,679,theory(equality)])).
% cnf(1018,negated_conjecture,(sdtpldt0(sdtmndt0(xl,xn),esk1_2(sdtmndt0(xl,xn),xl))=xl|$false|$false),inference(rw,[status(thm)],[1017,29,theory(equality)])).
% cnf(1019,negated_conjecture,(sdtpldt0(sdtmndt0(xl,xn),esk1_2(sdtmndt0(xl,xn),xl))=xl),inference(cn,[status(thm)],[1018,theory(equality)])).
% cnf(1022,negated_conjecture,(aNaturalNumber0(esk1_2(sdtmndt0(xn,xm),xn))|~aNaturalNumber0(sdtmndt0(xn,xm))|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[55,1001,theory(equality)])).
% cnf(1023,negated_conjecture,(sdtpldt0(sdtmndt0(xn,xm),esk1_2(sdtmndt0(xn,xm),xn))=xn|~aNaturalNumber0(sdtmndt0(xn,xm))|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[54,1001,theory(equality)])).
% cnf(1030,negated_conjecture,(aNaturalNumber0(esk1_2(sdtmndt0(xn,xm),xn))|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[1022,779,theory(equality)])).
% cnf(1031,negated_conjecture,(aNaturalNumber0(esk1_2(sdtmndt0(xn,xm),xn))|$false|$false),inference(rw,[status(thm)],[1030,30,theory(equality)])).
% cnf(1032,negated_conjecture,(aNaturalNumber0(esk1_2(sdtmndt0(xn,xm),xn))),inference(cn,[status(thm)],[1031,theory(equality)])).
% cnf(1033,negated_conjecture,(sdtpldt0(sdtmndt0(xn,xm),esk1_2(sdtmndt0(xn,xm),xn))=xn|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[1023,779,theory(equality)])).
% cnf(1034,negated_conjecture,(sdtpldt0(sdtmndt0(xn,xm),esk1_2(sdtmndt0(xn,xm),xn))=xn|$false|$false),inference(rw,[status(thm)],[1033,30,theory(equality)])).
% cnf(1035,negated_conjecture,(sdtpldt0(sdtmndt0(xn,xm),esk1_2(sdtmndt0(xn,xm),xn))=xn),inference(cn,[status(thm)],[1034,theory(equality)])).
% cnf(1073,negated_conjecture,(esk1_2(sdtmndt0(xl,xn),xl)=xn|~aNaturalNumber0(esk1_2(sdtmndt0(xl,xn),xl))),inference(spm,[status(thm)],[671,1019,theory(equality)])).
% cnf(1121,negated_conjecture,(esk1_2(sdtmndt0(xl,xn),xl)=xn|$false),inference(rw,[status(thm)],[1073,1016,theory(equality)])).
% cnf(1122,negated_conjecture,(esk1_2(sdtmndt0(xl,xn),xl)=xn),inference(cn,[status(thm)],[1121,theory(equality)])).
% cnf(1123,negated_conjecture,(sdtpldt0(sdtmndt0(xl,xn),xn)=xl),inference(rw,[status(thm)],[1019,1122,theory(equality)])).
% cnf(1213,negated_conjecture,(esk1_2(sdtmndt0(xn,xm),xn)=xm|~aNaturalNumber0(esk1_2(sdtmndt0(xn,xm),xn))),inference(spm,[status(thm)],[772,1035,theory(equality)])).
% cnf(1261,negated_conjecture,(esk1_2(sdtmndt0(xn,xm),xn)=xm|$false),inference(rw,[status(thm)],[1213,1032,theory(equality)])).
% cnf(1262,negated_conjecture,(esk1_2(sdtmndt0(xn,xm),xn)=xm),inference(cn,[status(thm)],[1261,theory(equality)])).
% cnf(1263,negated_conjecture,(sdtpldt0(sdtmndt0(xn,xm),xm)=xn),inference(rw,[status(thm)],[1035,1262,theory(equality)])).
% cnf(31337,plain,(sdtlseqdt0(X1,sdtpldt0(X2,sdtpldt0(X3,X1)))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)),inference(csr,[status(thm)],[988,37])).
% cnf(31344,negated_conjecture,(sdtlseqdt0(xm,sdtpldt0(X1,xn))|~aNaturalNumber0(xm)|~aNaturalNumber0(sdtmndt0(xn,xm))|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[31337,1263,theory(equality)])).
% cnf(31422,negated_conjecture,(sdtlseqdt0(xm,sdtpldt0(X1,xn))|$false|~aNaturalNumber0(sdtmndt0(xn,xm))|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[31344,31,theory(equality)])).
% cnf(31423,negated_conjecture,(sdtlseqdt0(xm,sdtpldt0(X1,xn))|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[31422,779,theory(equality)])).
% cnf(31424,negated_conjecture,(sdtlseqdt0(xm,sdtpldt0(X1,xn))|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[31423,theory(equality)])).
% cnf(31526,negated_conjecture,(sdtlseqdt0(xm,xl)|~aNaturalNumber0(sdtmndt0(xl,xn))),inference(spm,[status(thm)],[31424,1123,theory(equality)])).
% cnf(31548,negated_conjecture,(sdtlseqdt0(xm,xl)|$false),inference(rw,[status(thm)],[31526,679,theory(equality)])).
% cnf(31549,negated_conjecture,(sdtlseqdt0(xm,xl)),inference(cn,[status(thm)],[31548,theory(equality)])).
% cnf(31550,negated_conjecture,($false),inference(sr,[status(thm)],[31549,113,theory(equality)])).
% cnf(31551,negated_conjecture,($false),31550,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1789
% # ...of these trivial : 32
% # ...subsumed : 1072
% # ...remaining for further processing: 685
% # Other redundant clauses eliminated : 30
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 84
% # Generated clauses : 12388
% # ...of the previous two non-trivial : 11239
% # Contextual simplify-reflections : 191
% # Paramodulations : 12284
% # Factorizations : 0
% # Equation resolutions : 104
% # Current number of processed clauses: 590
% # Positive orientable unit clauses: 110
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 478
% # Current number of unprocessed clauses: 9065
% # ...number of literals in the above : 46431
% # Clause-clause subsumption calls (NU) : 12661
% # Rec. Clause-clause subsumption calls : 9526
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 49
% # Indexed BW rewrite successes : 33
% # Backwards rewriting index: 340 leaves, 1.33+/-1.197 terms/leaf
% # Paramod-from index: 199 leaves, 1.14+/-0.421 terms/leaf
% # Paramod-into index: 295 leaves, 1.31+/-1.158 terms/leaf
% # -------------------------------------------------
% # User time : 0.512 s
% # System time : 0.023 s
% # Total time : 0.535 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.02 CPU 1.12 WC
% FINAL PrfWatch: 1.02 CPU 1.12 WC
% SZS output end Solution for /tmp/SystemOnTPTP29794/NUM460+1.tptp
%
%------------------------------------------------------------------------------