TSTP Solution File: COM019+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : COM019+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 : art05.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 : Tue Dec 28 22:42:20 EST 2010

% Result   : Theorem 4.94s
% Output   : Solution 4.94s
% 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/SystemOnTPTP15472/COM019+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP15472/COM019+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15472/COM019+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 15568
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.92 CPU 4.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aElement0(X1)&aRewritingSystem0(X2))=>![X3]:(aReductOfIn0(X3,X1,X2)=>aElement0(X3))),file('/tmp/SRASS.s.p', mReduct)).
% fof(2, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aRewritingSystem0(X2))&aElement0(X3))=>(sdtmndtplgtdt0(X1,X2,X3)<=>(aReductOfIn0(X3,X1,X2)|?[X4]:((aElement0(X4)&aReductOfIn0(X4,X1,X2))&sdtmndtplgtdt0(X4,X2,X3))))),file('/tmp/SRASS.s.p', mTCDef)).
% fof(4, axiom,![X1]:![X2]:![X3]:![X4]:((((aElement0(X1)&aRewritingSystem0(X2))&aElement0(X3))&aElement0(X4))=>((sdtmndtasgtdt0(X1,X2,X3)&sdtmndtasgtdt0(X3,X2,X4))=>sdtmndtasgtdt0(X1,X2,X4))),file('/tmp/SRASS.s.p', mTCRTrans)).
% fof(6, axiom,![X1]:(aRewritingSystem0(X1)=>(isTerminating0(X1)<=>![X2]:![X3]:((aElement0(X2)&aElement0(X3))=>(sdtmndtplgtdt0(X2,X1,X3)=>iLess0(X3,X2))))),file('/tmp/SRASS.s.p', mTermin)).
% fof(7, axiom,![X1]:![X2]:((aElement0(X1)&aRewritingSystem0(X2))=>![X3]:(aNormalFormOfIn0(X3,X1,X2)<=>((aElement0(X3)&sdtmndtasgtdt0(X1,X2,X3))&~(?[X4]:aReductOfIn0(X4,X3,X2))))),file('/tmp/SRASS.s.p', mNFRDef)).
% fof(9, axiom,aRewritingSystem0(xR),file('/tmp/SRASS.s.p', m__656)).
% fof(10, axiom,(isLocallyConfluent0(xR)&isTerminating0(xR)),file('/tmp/SRASS.s.p', m__656_01)).
% fof(11, axiom,((aElement0(xa)&aElement0(xb))&aElement0(xc)),file('/tmp/SRASS.s.p', m__731)).
% fof(12, axiom,![X1]:![X2]:![X3]:(((((aElement0(X1)&aElement0(X2))&aElement0(X3))&sdtmndtasgtdt0(X1,xR,X2))&sdtmndtasgtdt0(X1,xR,X3))=>(iLess0(X1,xa)=>?[X4]:((aElement0(X4)&sdtmndtasgtdt0(X2,xR,X4))&sdtmndtasgtdt0(X3,xR,X4)))),file('/tmp/SRASS.s.p', m__715)).
% fof(14, axiom,((aElement0(xu)&aReductOfIn0(xu,xa,xR))&sdtmndtasgtdt0(xu,xR,xb)),file('/tmp/SRASS.s.p', m__755)).
% fof(16, axiom,((aElement0(xw)&sdtmndtasgtdt0(xu,xR,xw))&sdtmndtasgtdt0(xv,xR,xw)),file('/tmp/SRASS.s.p', m__799)).
% fof(17, axiom,aNormalFormOfIn0(xd,xw,xR),file('/tmp/SRASS.s.p', m__818)).
% fof(18, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aRewritingSystem0(X2))&aElement0(X3))=>(sdtmndtasgtdt0(X1,X2,X3)<=>(X1=X3|sdtmndtplgtdt0(X1,X2,X3)))),file('/tmp/SRASS.s.p', mTCRDef)).
% fof(24, conjecture,sdtmndtasgtdt0(xb,xR,xd),file('/tmp/SRASS.s.p', m__)).
% fof(25, negated_conjecture,~(sdtmndtasgtdt0(xb,xR,xd)),inference(assume_negation,[status(cth)],[24])).
% fof(30, negated_conjecture,~(sdtmndtasgtdt0(xb,xR,xd)),inference(fof_simplification,[status(thm)],[25,theory(equality)])).
% fof(31, plain,![X1]:![X2]:((~(aElement0(X1))|~(aRewritingSystem0(X2)))|![X3]:(~(aReductOfIn0(X3,X1,X2))|aElement0(X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(32, plain,![X4]:![X5]:((~(aElement0(X4))|~(aRewritingSystem0(X5)))|![X6]:(~(aReductOfIn0(X6,X4,X5))|aElement0(X6))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:((~(aReductOfIn0(X6,X4,X5))|aElement0(X6))|(~(aElement0(X4))|~(aRewritingSystem0(X5)))),inference(shift_quantors,[status(thm)],[32])).
% cnf(34,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aReductOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aRewritingSystem0(X2)))|~(aElement0(X3)))|((~(sdtmndtplgtdt0(X1,X2,X3))|(aReductOfIn0(X3,X1,X2)|?[X4]:((aElement0(X4)&aReductOfIn0(X4,X1,X2))&sdtmndtplgtdt0(X4,X2,X3))))&((~(aReductOfIn0(X3,X1,X2))&![X4]:((~(aElement0(X4))|~(aReductOfIn0(X4,X1,X2)))|~(sdtmndtplgtdt0(X4,X2,X3))))|sdtmndtplgtdt0(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(36, plain,![X5]:![X6]:![X7]:(((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))|((~(sdtmndtplgtdt0(X5,X6,X7))|(aReductOfIn0(X7,X5,X6)|?[X8]:((aElement0(X8)&aReductOfIn0(X8,X5,X6))&sdtmndtplgtdt0(X8,X6,X7))))&((~(aReductOfIn0(X7,X5,X6))&![X9]:((~(aElement0(X9))|~(aReductOfIn0(X9,X5,X6)))|~(sdtmndtplgtdt0(X9,X6,X7))))|sdtmndtplgtdt0(X5,X6,X7)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:(((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))|((~(sdtmndtplgtdt0(X5,X6,X7))|(aReductOfIn0(X7,X5,X6)|((aElement0(esk1_3(X5,X6,X7))&aReductOfIn0(esk1_3(X5,X6,X7),X5,X6))&sdtmndtplgtdt0(esk1_3(X5,X6,X7),X6,X7))))&((~(aReductOfIn0(X7,X5,X6))&![X9]:((~(aElement0(X9))|~(aReductOfIn0(X9,X5,X6)))|~(sdtmndtplgtdt0(X9,X6,X7))))|sdtmndtplgtdt0(X5,X6,X7)))),inference(skolemize,[status(esa)],[36])).
% fof(38, plain,![X5]:![X6]:![X7]:![X9]:((((((~(aElement0(X9))|~(aReductOfIn0(X9,X5,X6)))|~(sdtmndtplgtdt0(X9,X6,X7)))&~(aReductOfIn0(X7,X5,X6)))|sdtmndtplgtdt0(X5,X6,X7))&(~(sdtmndtplgtdt0(X5,X6,X7))|(aReductOfIn0(X7,X5,X6)|((aElement0(esk1_3(X5,X6,X7))&aReductOfIn0(esk1_3(X5,X6,X7),X5,X6))&sdtmndtplgtdt0(esk1_3(X5,X6,X7),X6,X7)))))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))),inference(shift_quantors,[status(thm)],[37])).
% fof(39, plain,![X5]:![X6]:![X7]:![X9]:((((((~(aElement0(X9))|~(aReductOfIn0(X9,X5,X6)))|~(sdtmndtplgtdt0(X9,X6,X7)))|sdtmndtplgtdt0(X5,X6,X7))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7))))&((~(aReductOfIn0(X7,X5,X6))|sdtmndtplgtdt0(X5,X6,X7))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))))&(((((aElement0(esk1_3(X5,X6,X7))|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7))))&(((aReductOfIn0(esk1_3(X5,X6,X7),X5,X6)|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))))&(((sdtmndtplgtdt0(esk1_3(X5,X6,X7),X6,X7)|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))))),inference(distribute,[status(thm)],[38])).
% cnf(41,plain,(aReductOfIn0(X1,X3,X2)|aReductOfIn0(esk1_3(X3,X2,X1),X3,X2)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtplgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% cnf(43,plain,(sdtmndtplgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~aReductOfIn0(X1,X3,X2)),inference(split_conjunct,[status(thm)],[39])).
% fof(48, plain,![X1]:![X2]:![X3]:![X4]:((((~(aElement0(X1))|~(aRewritingSystem0(X2)))|~(aElement0(X3)))|~(aElement0(X4)))|((~(sdtmndtasgtdt0(X1,X2,X3))|~(sdtmndtasgtdt0(X3,X2,X4)))|sdtmndtasgtdt0(X1,X2,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(49, plain,![X5]:![X6]:![X7]:![X8]:((((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))|~(aElement0(X8)))|((~(sdtmndtasgtdt0(X5,X6,X7))|~(sdtmndtasgtdt0(X7,X6,X8)))|sdtmndtasgtdt0(X5,X6,X8))),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtasgtdt0(X4,X2,X3)|~sdtmndtasgtdt0(X1,X2,X4)|~aElement0(X3)|~aElement0(X4)|~aRewritingSystem0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(65, plain,![X1]:(~(aRewritingSystem0(X1))|((~(isTerminating0(X1))|![X2]:![X3]:((~(aElement0(X2))|~(aElement0(X3)))|(~(sdtmndtplgtdt0(X2,X1,X3))|iLess0(X3,X2))))&(?[X2]:?[X3]:((aElement0(X2)&aElement0(X3))&(sdtmndtplgtdt0(X2,X1,X3)&~(iLess0(X3,X2))))|isTerminating0(X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(66, plain,![X4]:(~(aRewritingSystem0(X4))|((~(isTerminating0(X4))|![X5]:![X6]:((~(aElement0(X5))|~(aElement0(X6)))|(~(sdtmndtplgtdt0(X5,X4,X6))|iLess0(X6,X5))))&(?[X7]:?[X8]:((aElement0(X7)&aElement0(X8))&(sdtmndtplgtdt0(X7,X4,X8)&~(iLess0(X8,X7))))|isTerminating0(X4)))),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X4]:(~(aRewritingSystem0(X4))|((~(isTerminating0(X4))|![X5]:![X6]:((~(aElement0(X5))|~(aElement0(X6)))|(~(sdtmndtplgtdt0(X5,X4,X6))|iLess0(X6,X5))))&(((aElement0(esk6_1(X4))&aElement0(esk7_1(X4)))&(sdtmndtplgtdt0(esk6_1(X4),X4,esk7_1(X4))&~(iLess0(esk7_1(X4),esk6_1(X4)))))|isTerminating0(X4)))),inference(skolemize,[status(esa)],[66])).
% fof(68, plain,![X4]:![X5]:![X6]:(((((~(aElement0(X5))|~(aElement0(X6)))|(~(sdtmndtplgtdt0(X5,X4,X6))|iLess0(X6,X5)))|~(isTerminating0(X4)))&(((aElement0(esk6_1(X4))&aElement0(esk7_1(X4)))&(sdtmndtplgtdt0(esk6_1(X4),X4,esk7_1(X4))&~(iLess0(esk7_1(X4),esk6_1(X4)))))|isTerminating0(X4)))|~(aRewritingSystem0(X4))),inference(shift_quantors,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:(((((~(aElement0(X5))|~(aElement0(X6)))|(~(sdtmndtplgtdt0(X5,X4,X6))|iLess0(X6,X5)))|~(isTerminating0(X4)))|~(aRewritingSystem0(X4)))&((((aElement0(esk6_1(X4))|isTerminating0(X4))|~(aRewritingSystem0(X4)))&((aElement0(esk7_1(X4))|isTerminating0(X4))|~(aRewritingSystem0(X4))))&(((sdtmndtplgtdt0(esk6_1(X4),X4,esk7_1(X4))|isTerminating0(X4))|~(aRewritingSystem0(X4)))&((~(iLess0(esk7_1(X4),esk6_1(X4)))|isTerminating0(X4))|~(aRewritingSystem0(X4)))))),inference(distribute,[status(thm)],[68])).
% cnf(74,plain,(iLess0(X2,X3)|~aRewritingSystem0(X1)|~isTerminating0(X1)|~sdtmndtplgtdt0(X3,X1,X2)|~aElement0(X2)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[69])).
% fof(75, plain,![X1]:![X2]:((~(aElement0(X1))|~(aRewritingSystem0(X2)))|![X3]:((~(aNormalFormOfIn0(X3,X1,X2))|((aElement0(X3)&sdtmndtasgtdt0(X1,X2,X3))&![X4]:~(aReductOfIn0(X4,X3,X2))))&(((~(aElement0(X3))|~(sdtmndtasgtdt0(X1,X2,X3)))|?[X4]:aReductOfIn0(X4,X3,X2))|aNormalFormOfIn0(X3,X1,X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(76, plain,![X5]:![X6]:((~(aElement0(X5))|~(aRewritingSystem0(X6)))|![X7]:((~(aNormalFormOfIn0(X7,X5,X6))|((aElement0(X7)&sdtmndtasgtdt0(X5,X6,X7))&![X8]:~(aReductOfIn0(X8,X7,X6))))&(((~(aElement0(X7))|~(sdtmndtasgtdt0(X5,X6,X7)))|?[X9]:aReductOfIn0(X9,X7,X6))|aNormalFormOfIn0(X7,X5,X6)))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X5]:![X6]:((~(aElement0(X5))|~(aRewritingSystem0(X6)))|![X7]:((~(aNormalFormOfIn0(X7,X5,X6))|((aElement0(X7)&sdtmndtasgtdt0(X5,X6,X7))&![X8]:~(aReductOfIn0(X8,X7,X6))))&(((~(aElement0(X7))|~(sdtmndtasgtdt0(X5,X6,X7)))|aReductOfIn0(esk8_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6)))),inference(skolemize,[status(esa)],[76])).
% fof(78, plain,![X5]:![X6]:![X7]:![X8]:((((~(aReductOfIn0(X8,X7,X6))&(aElement0(X7)&sdtmndtasgtdt0(X5,X6,X7)))|~(aNormalFormOfIn0(X7,X5,X6)))&(((~(aElement0(X7))|~(sdtmndtasgtdt0(X5,X6,X7)))|aReductOfIn0(esk8_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6)))),inference(shift_quantors,[status(thm)],[77])).
% fof(79, plain,![X5]:![X6]:![X7]:![X8]:((((~(aReductOfIn0(X8,X7,X6))|~(aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))&(((aElement0(X7)|~(aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))&((sdtmndtasgtdt0(X5,X6,X7)|~(aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))))&((((~(aElement0(X7))|~(sdtmndtasgtdt0(X5,X6,X7)))|aReductOfIn0(esk8_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))),inference(distribute,[status(thm)],[78])).
% cnf(81,plain,(sdtmndtasgtdt0(X2,X1,X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[79])).
% cnf(82,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[79])).
% cnf(83,plain,(~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)|~aReductOfIn0(X4,X3,X1)),inference(split_conjunct,[status(thm)],[79])).
% cnf(89,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[9])).
% cnf(90,plain,(isTerminating0(xR)),inference(split_conjunct,[status(thm)],[10])).
% cnf(93,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[11])).
% cnf(94,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[11])).
% fof(95, plain,![X1]:![X2]:![X3]:(((((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|~(sdtmndtasgtdt0(X1,xR,X2)))|~(sdtmndtasgtdt0(X1,xR,X3)))|(~(iLess0(X1,xa))|?[X4]:((aElement0(X4)&sdtmndtasgtdt0(X2,xR,X4))&sdtmndtasgtdt0(X3,xR,X4)))),inference(fof_nnf,[status(thm)],[12])).
% fof(96, plain,![X5]:![X6]:![X7]:(((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7)))|(~(iLess0(X5,xa))|?[X8]:((aElement0(X8)&sdtmndtasgtdt0(X6,xR,X8))&sdtmndtasgtdt0(X7,xR,X8)))),inference(variable_rename,[status(thm)],[95])).
% fof(97, plain,![X5]:![X6]:![X7]:(((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7)))|(~(iLess0(X5,xa))|((aElement0(esk10_3(X5,X6,X7))&sdtmndtasgtdt0(X6,xR,esk10_3(X5,X6,X7)))&sdtmndtasgtdt0(X7,xR,esk10_3(X5,X6,X7))))),inference(skolemize,[status(esa)],[96])).
% fof(98, plain,![X5]:![X6]:![X7]:((((aElement0(esk10_3(X5,X6,X7))|~(iLess0(X5,xa)))|((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7))))&((sdtmndtasgtdt0(X6,xR,esk10_3(X5,X6,X7))|~(iLess0(X5,xa)))|((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7)))))&((sdtmndtasgtdt0(X7,xR,esk10_3(X5,X6,X7))|~(iLess0(X5,xa)))|((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7))))),inference(distribute,[status(thm)],[97])).
% cnf(99,plain,(sdtmndtasgtdt0(X2,xR,esk10_3(X1,X3,X2))|~sdtmndtasgtdt0(X1,xR,X2)|~sdtmndtasgtdt0(X1,xR,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1)|~iLess0(X1,xa)),inference(split_conjunct,[status(thm)],[98])).
% cnf(100,plain,(sdtmndtasgtdt0(X3,xR,esk10_3(X1,X3,X2))|~sdtmndtasgtdt0(X1,xR,X2)|~sdtmndtasgtdt0(X1,xR,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1)|~iLess0(X1,xa)),inference(split_conjunct,[status(thm)],[98])).
% cnf(101,plain,(aElement0(esk10_3(X1,X3,X2))|~sdtmndtasgtdt0(X1,xR,X2)|~sdtmndtasgtdt0(X1,xR,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1)|~iLess0(X1,xa)),inference(split_conjunct,[status(thm)],[98])).
% cnf(104,plain,(sdtmndtasgtdt0(xu,xR,xb)),inference(split_conjunct,[status(thm)],[14])).
% cnf(105,plain,(aReductOfIn0(xu,xa,xR)),inference(split_conjunct,[status(thm)],[14])).
% cnf(106,plain,(aElement0(xu)),inference(split_conjunct,[status(thm)],[14])).
% cnf(111,plain,(sdtmndtasgtdt0(xu,xR,xw)),inference(split_conjunct,[status(thm)],[16])).
% cnf(112,plain,(aElement0(xw)),inference(split_conjunct,[status(thm)],[16])).
% cnf(113,plain,(aNormalFormOfIn0(xd,xw,xR)),inference(split_conjunct,[status(thm)],[17])).
% fof(114, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aRewritingSystem0(X2)))|~(aElement0(X3)))|((~(sdtmndtasgtdt0(X1,X2,X3))|(X1=X3|sdtmndtplgtdt0(X1,X2,X3)))&((~(X1=X3)&~(sdtmndtplgtdt0(X1,X2,X3)))|sdtmndtasgtdt0(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[18])).
% fof(115, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aRewritingSystem0(X5)))|~(aElement0(X6)))|((~(sdtmndtasgtdt0(X4,X5,X6))|(X4=X6|sdtmndtplgtdt0(X4,X5,X6)))&((~(X4=X6)&~(sdtmndtplgtdt0(X4,X5,X6)))|sdtmndtasgtdt0(X4,X5,X6)))),inference(variable_rename,[status(thm)],[114])).
% fof(116, plain,![X4]:![X5]:![X6]:(((~(sdtmndtasgtdt0(X4,X5,X6))|(X4=X6|sdtmndtplgtdt0(X4,X5,X6)))|((~(aElement0(X4))|~(aRewritingSystem0(X5)))|~(aElement0(X6))))&(((~(X4=X6)|sdtmndtasgtdt0(X4,X5,X6))|((~(aElement0(X4))|~(aRewritingSystem0(X5)))|~(aElement0(X6))))&((~(sdtmndtplgtdt0(X4,X5,X6))|sdtmndtasgtdt0(X4,X5,X6))|((~(aElement0(X4))|~(aRewritingSystem0(X5)))|~(aElement0(X6)))))),inference(distribute,[status(thm)],[115])).
% cnf(119,plain,(sdtmndtplgtdt0(X3,X2,X1)|X3=X1|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtasgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[116])).
% cnf(142,negated_conjecture,(~sdtmndtasgtdt0(xb,xR,xd)),inference(split_conjunct,[status(thm)],[30])).
% cnf(163,plain,(aElement0(xd)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[82,113,theory(equality)])).
% cnf(164,plain,(~aReductOfIn0(X1,xd,xR)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[83,113,theory(equality)])).
% cnf(165,plain,(sdtmndtasgtdt0(xw,xR,xd)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[81,113,theory(equality)])).
% cnf(166,plain,(aElement0(xd)|$false|~aElement0(xw)),inference(rw,[status(thm)],[163,89,theory(equality)])).
% cnf(167,plain,(aElement0(xd)|$false|$false),inference(rw,[status(thm)],[166,112,theory(equality)])).
% cnf(168,plain,(aElement0(xd)),inference(cn,[status(thm)],[167,theory(equality)])).
% cnf(169,plain,(~aReductOfIn0(X1,xd,xR)|$false|~aElement0(xw)),inference(rw,[status(thm)],[164,89,theory(equality)])).
% cnf(170,plain,(~aReductOfIn0(X1,xd,xR)|$false|$false),inference(rw,[status(thm)],[169,112,theory(equality)])).
% cnf(171,plain,(~aReductOfIn0(X1,xd,xR)),inference(cn,[status(thm)],[170,theory(equality)])).
% cnf(172,plain,(sdtmndtasgtdt0(xw,xR,xd)|$false|~aElement0(xw)),inference(rw,[status(thm)],[165,89,theory(equality)])).
% cnf(173,plain,(sdtmndtasgtdt0(xw,xR,xd)|$false|$false),inference(rw,[status(thm)],[172,112,theory(equality)])).
% cnf(174,plain,(sdtmndtasgtdt0(xw,xR,xd)),inference(cn,[status(thm)],[173,theory(equality)])).
% cnf(177,plain,(sdtmndtplgtdt0(X3,X2,X1)|~aReductOfIn0(X1,X3,X2)|~aRewritingSystem0(X2)|~aElement0(X3)),inference(csr,[status(thm)],[43,34])).
% cnf(179,plain,(sdtmndtplgtdt0(xa,xR,xu)|~aRewritingSystem0(xR)|~aElement0(xa)),inference(spm,[status(thm)],[177,105,theory(equality)])).
% cnf(183,plain,(sdtmndtplgtdt0(xa,xR,xu)|$false|~aElement0(xa)),inference(rw,[status(thm)],[179,89,theory(equality)])).
% cnf(184,plain,(sdtmndtplgtdt0(xa,xR,xu)|$false|$false),inference(rw,[status(thm)],[183,94,theory(equality)])).
% cnf(185,plain,(sdtmndtplgtdt0(xa,xR,xu)),inference(cn,[status(thm)],[184,theory(equality)])).
% cnf(528,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|~aRewritingSystem0(xR)|~aElement0(xw)|~aElement0(xd)|~aElement0(X1)),inference(spm,[status(thm)],[50,174,theory(equality)])).
% cnf(540,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|$false|~aElement0(xw)|~aElement0(xd)|~aElement0(X1)),inference(rw,[status(thm)],[528,89,theory(equality)])).
% cnf(541,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|$false|$false|~aElement0(xd)|~aElement0(X1)),inference(rw,[status(thm)],[540,112,theory(equality)])).
% cnf(542,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|$false|$false|$false|~aElement0(X1)),inference(rw,[status(thm)],[541,168,theory(equality)])).
% cnf(543,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|~aElement0(X1)),inference(cn,[status(thm)],[542,theory(equality)])).
% cnf(612,plain,(iLess0(xu,xa)|~isTerminating0(xR)|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xu)),inference(spm,[status(thm)],[74,185,theory(equality)])).
% cnf(632,plain,(iLess0(xu,xa)|$false|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xu)),inference(rw,[status(thm)],[612,90,theory(equality)])).
% cnf(633,plain,(iLess0(xu,xa)|$false|$false|~aElement0(xa)|~aElement0(xu)),inference(rw,[status(thm)],[632,89,theory(equality)])).
% cnf(634,plain,(iLess0(xu,xa)|$false|$false|$false|~aElement0(xu)),inference(rw,[status(thm)],[633,94,theory(equality)])).
% cnf(635,plain,(iLess0(xu,xa)|$false|$false|$false|$false),inference(rw,[status(thm)],[634,106,theory(equality)])).
% cnf(636,plain,(iLess0(xu,xa)),inference(cn,[status(thm)],[635,theory(equality)])).
% cnf(642,plain,(aElement0(esk10_3(xu,X1,X2))|~sdtmndtasgtdt0(xu,xR,X1)|~sdtmndtasgtdt0(xu,xR,X2)|~aElement0(X1)|~aElement0(X2)|~aElement0(xu)),inference(spm,[status(thm)],[101,636,theory(equality)])).
% cnf(643,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,X1,X2))|~sdtmndtasgtdt0(xu,xR,X1)|~sdtmndtasgtdt0(xu,xR,X2)|~aElement0(X1)|~aElement0(X2)|~aElement0(xu)),inference(spm,[status(thm)],[100,636,theory(equality)])).
% cnf(644,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,X2,X1))|~sdtmndtasgtdt0(xu,xR,X2)|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X2)|~aElement0(X1)|~aElement0(xu)),inference(spm,[status(thm)],[99,636,theory(equality)])).
% cnf(645,plain,(aElement0(esk10_3(xu,X1,X2))|~sdtmndtasgtdt0(xu,xR,X1)|~sdtmndtasgtdt0(xu,xR,X2)|~aElement0(X1)|~aElement0(X2)|$false),inference(rw,[status(thm)],[642,106,theory(equality)])).
% cnf(646,plain,(aElement0(esk10_3(xu,X1,X2))|~sdtmndtasgtdt0(xu,xR,X1)|~sdtmndtasgtdt0(xu,xR,X2)|~aElement0(X1)|~aElement0(X2)),inference(cn,[status(thm)],[645,theory(equality)])).
% cnf(647,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,X1,X2))|~sdtmndtasgtdt0(xu,xR,X1)|~sdtmndtasgtdt0(xu,xR,X2)|~aElement0(X1)|~aElement0(X2)|$false),inference(rw,[status(thm)],[643,106,theory(equality)])).
% cnf(648,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,X1,X2))|~sdtmndtasgtdt0(xu,xR,X1)|~sdtmndtasgtdt0(xu,xR,X2)|~aElement0(X1)|~aElement0(X2)),inference(cn,[status(thm)],[647,theory(equality)])).
% cnf(649,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,X2,X1))|~sdtmndtasgtdt0(xu,xR,X2)|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X2)|~aElement0(X1)|$false),inference(rw,[status(thm)],[644,106,theory(equality)])).
% cnf(650,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,X2,X1))|~sdtmndtasgtdt0(xu,xR,X2)|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X2)|~aElement0(X1)),inference(cn,[status(thm)],[649,theory(equality)])).
% cnf(865,plain,(sdtmndtasgtdt0(xu,xR,xd)|~aElement0(xu)),inference(spm,[status(thm)],[543,111,theory(equality)])).
% cnf(869,plain,(sdtmndtasgtdt0(xu,xR,xd)|$false),inference(rw,[status(thm)],[865,106,theory(equality)])).
% cnf(870,plain,(sdtmndtasgtdt0(xu,xR,xd)),inference(cn,[status(thm)],[869,theory(equality)])).
% cnf(1903,plain,(aElement0(esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(xd)|~aElement0(X1)),inference(spm,[status(thm)],[646,870,theory(equality)])).
% cnf(1915,plain,(aElement0(esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|$false|~aElement0(X1)),inference(rw,[status(thm)],[1903,168,theory(equality)])).
% cnf(1916,plain,(aElement0(esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X1)),inference(cn,[status(thm)],[1915,theory(equality)])).
% cnf(1973,plain,(aElement0(esk10_3(xu,xd,xb))|~aElement0(xb)),inference(spm,[status(thm)],[1916,104,theory(equality)])).
% cnf(1983,plain,(aElement0(esk10_3(xu,xd,xb))|$false),inference(rw,[status(thm)],[1973,93,theory(equality)])).
% cnf(1984,plain,(aElement0(esk10_3(xu,xd,xb))),inference(cn,[status(thm)],[1983,theory(equality)])).
% cnf(11422,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(xd)|~aElement0(X1)),inference(spm,[status(thm)],[648,870,theory(equality)])).
% cnf(11459,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|$false|~aElement0(X1)),inference(rw,[status(thm)],[11422,168,theory(equality)])).
% cnf(11460,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X1)),inference(cn,[status(thm)],[11459,theory(equality)])).
% cnf(12315,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xd,xb))|~aElement0(xb)),inference(spm,[status(thm)],[11460,104,theory(equality)])).
% cnf(12354,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xd,xb))|$false),inference(rw,[status(thm)],[12315,93,theory(equality)])).
% cnf(12355,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xd,xb))),inference(cn,[status(thm)],[12354,theory(equality)])).
% cnf(12746,plain,(esk10_3(xu,xd,xb)=xd|sdtmndtplgtdt0(xd,xR,esk10_3(xu,xd,xb))|~aRewritingSystem0(xR)|~aElement0(xd)|~aElement0(esk10_3(xu,xd,xb))),inference(spm,[status(thm)],[119,12355,theory(equality)])).
% cnf(12778,plain,(esk10_3(xu,xd,xb)=xd|sdtmndtplgtdt0(xd,xR,esk10_3(xu,xd,xb))|$false|~aElement0(xd)|~aElement0(esk10_3(xu,xd,xb))),inference(rw,[status(thm)],[12746,89,theory(equality)])).
% cnf(12779,plain,(esk10_3(xu,xd,xb)=xd|sdtmndtplgtdt0(xd,xR,esk10_3(xu,xd,xb))|$false|$false|~aElement0(esk10_3(xu,xd,xb))),inference(rw,[status(thm)],[12778,168,theory(equality)])).
% cnf(12780,plain,(esk10_3(xu,xd,xb)=xd|sdtmndtplgtdt0(xd,xR,esk10_3(xu,xd,xb))|$false|$false|$false),inference(rw,[status(thm)],[12779,1984,theory(equality)])).
% cnf(12781,plain,(esk10_3(xu,xd,xb)=xd|sdtmndtplgtdt0(xd,xR,esk10_3(xu,xd,xb))),inference(cn,[status(thm)],[12780,theory(equality)])).
% cnf(14991,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(xd)|~aElement0(X1)),inference(spm,[status(thm)],[650,870,theory(equality)])).
% cnf(15041,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|$false|~aElement0(X1)),inference(rw,[status(thm)],[14991,168,theory(equality)])).
% cnf(15042,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,xd,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X1)),inference(cn,[status(thm)],[15041,theory(equality)])).
% cnf(16138,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xd,xb))|~aElement0(xb)),inference(spm,[status(thm)],[15042,104,theory(equality)])).
% cnf(16189,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xd,xb))|$false),inference(rw,[status(thm)],[16138,93,theory(equality)])).
% cnf(16190,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xd,xb))),inference(cn,[status(thm)],[16189,theory(equality)])).
% cnf(149046,plain,(aReductOfIn0(esk1_3(xd,xR,esk10_3(xu,xd,xb)),xd,xR)|aReductOfIn0(esk10_3(xu,xd,xb),xd,xR)|esk10_3(xu,xd,xb)=xd|~aRewritingSystem0(xR)|~aElement0(xd)|~aElement0(esk10_3(xu,xd,xb))),inference(spm,[status(thm)],[41,12781,theory(equality)])).
% cnf(149056,plain,(aReductOfIn0(esk1_3(xd,xR,esk10_3(xu,xd,xb)),xd,xR)|aReductOfIn0(esk10_3(xu,xd,xb),xd,xR)|esk10_3(xu,xd,xb)=xd|$false|~aElement0(xd)|~aElement0(esk10_3(xu,xd,xb))),inference(rw,[status(thm)],[149046,89,theory(equality)])).
% cnf(149057,plain,(aReductOfIn0(esk1_3(xd,xR,esk10_3(xu,xd,xb)),xd,xR)|aReductOfIn0(esk10_3(xu,xd,xb),xd,xR)|esk10_3(xu,xd,xb)=xd|$false|$false|~aElement0(esk10_3(xu,xd,xb))),inference(rw,[status(thm)],[149056,168,theory(equality)])).
% cnf(149058,plain,(aReductOfIn0(esk1_3(xd,xR,esk10_3(xu,xd,xb)),xd,xR)|aReductOfIn0(esk10_3(xu,xd,xb),xd,xR)|esk10_3(xu,xd,xb)=xd|$false|$false|$false),inference(rw,[status(thm)],[149057,1984,theory(equality)])).
% cnf(149059,plain,(aReductOfIn0(esk1_3(xd,xR,esk10_3(xu,xd,xb)),xd,xR)|aReductOfIn0(esk10_3(xu,xd,xb),xd,xR)|esk10_3(xu,xd,xb)=xd),inference(cn,[status(thm)],[149058,theory(equality)])).
% cnf(149060,plain,(aReductOfIn0(esk10_3(xu,xd,xb),xd,xR)|esk10_3(xu,xd,xb)=xd),inference(sr,[status(thm)],[149059,171,theory(equality)])).
% cnf(149061,plain,(esk10_3(xu,xd,xb)=xd),inference(sr,[status(thm)],[149060,171,theory(equality)])).
% cnf(149116,plain,(sdtmndtasgtdt0(xb,xR,xd)),inference(rw,[status(thm)],[16190,149061,theory(equality)])).
% cnf(149117,plain,($false),inference(sr,[status(thm)],[149116,142,theory(equality)])).
% cnf(149118,plain,($false),149117,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 4248
% # ...of these trivial                : 20
% # ...subsumed                        : 345
% # ...remaining for further processing: 3883
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 68
% # Backward-rewritten                 : 728
% # Generated clauses                  : 45426
% # ...of the previous two non-trivial : 44611
% # Contextual simplify-reflections    : 213
% # Paramodulations                    : 45425
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 3086
% #    Positive orientable unit clauses: 1313
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 1771
% # Current number of unprocessed clauses: 32746
% # ...number of literals in the above : 70846
% # Clause-clause subsumption calls (NU) : 58077
% # Rec. Clause-clause subsumption calls : 46696
% # Unit Clause-clause subsumption calls : 6526
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 88749
% # Indexed BW rewrite successes       : 134
% # Backwards rewriting index:   407 leaves,   9.64+/-23.087 terms/leaf
% # Paramod-from index:          172 leaves,   9.56+/-22.642 terms/leaf
% # Paramod-into index:          317 leaves,   8.03+/-17.820 terms/leaf
% # -------------------------------------------------
% # User time              : 2.279 s
% # System time            : 0.078 s
% # Total time             : 2.357 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.11 CPU 4.23 WC
% FINAL PrfWatch: 4.11 CPU 4.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP15472/COM019+1.tptp
% 
%------------------------------------------------------------------------------