TSTP Solution File: COM020+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM020+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 : Tue Dec 28 22:42:30 EST 2010
% Result : Theorem 1.25s
% Output : Solution 1.25s
% 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/SystemOnTPTP11006/COM020+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11006/COM020+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11006/COM020+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 11102
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(24, conjecture,?[X1]:((aElement0(X1)&sdtmndtasgtdt0(xb,xR,X1))&sdtmndtasgtdt0(xd,xR,X1)),file('/tmp/SRASS.s.p', m__)).
% fof(25, negated_conjecture,~(?[X1]:((aElement0(X1)&sdtmndtasgtdt0(xb,xR,X1))&sdtmndtasgtdt0(xd,xR,X1))),inference(assume_negation,[status(cth)],[24])).
% fof(30, plain,![X1]:![X2]:((~(aElement0(X1))|~(aRewritingSystem0(X2)))|![X3]:(~(aReductOfIn0(X3,X1,X2))|aElement0(X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(31, plain,![X4]:![X5]:((~(aElement0(X4))|~(aRewritingSystem0(X5)))|![X6]:(~(aReductOfIn0(X6,X4,X5))|aElement0(X6))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:((~(aReductOfIn0(X6,X4,X5))|aElement0(X6))|(~(aElement0(X4))|~(aRewritingSystem0(X5)))),inference(shift_quantors,[status(thm)],[31])).
% cnf(33,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aReductOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, 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(35, 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)],[34])).
% fof(36, 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)],[35])).
% fof(37, 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)],[36])).
% fof(38, 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)],[37])).
% cnf(42,plain,(sdtmndtplgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~aReductOfIn0(X1,X3,X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(47, 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(48, 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)],[47])).
% cnf(49,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)],[48])).
% fof(64, 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(65, 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)],[64])).
% fof(66, 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)],[65])).
% fof(67, 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)],[66])).
% fof(68, 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)],[67])).
% cnf(73,plain,(iLess0(X2,X3)|~aRewritingSystem0(X1)|~isTerminating0(X1)|~sdtmndtplgtdt0(X3,X1,X2)|~aElement0(X2)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[68])).
% fof(74, 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(75, 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)],[74])).
% 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)))|aReductOfIn0(esk8_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6)))),inference(skolemize,[status(esa)],[75])).
% fof(77, 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)],[76])).
% fof(78, 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)],[77])).
% cnf(80,plain,(sdtmndtasgtdt0(X2,X1,X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[78])).
% cnf(81,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[78])).
% cnf(88,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[9])).
% cnf(89,plain,(isTerminating0(xR)),inference(split_conjunct,[status(thm)],[10])).
% cnf(92,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[11])).
% cnf(93,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[11])).
% fof(94, 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(95, 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)],[94])).
% fof(96, 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)],[95])).
% fof(97, 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)],[96])).
% cnf(98,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)],[97])).
% cnf(99,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)],[97])).
% cnf(100,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)],[97])).
% cnf(103,plain,(sdtmndtasgtdt0(xu,xR,xb)),inference(split_conjunct,[status(thm)],[14])).
% cnf(104,plain,(aReductOfIn0(xu,xa,xR)),inference(split_conjunct,[status(thm)],[14])).
% cnf(105,plain,(aElement0(xu)),inference(split_conjunct,[status(thm)],[14])).
% cnf(110,plain,(sdtmndtasgtdt0(xu,xR,xw)),inference(split_conjunct,[status(thm)],[16])).
% cnf(111,plain,(aElement0(xw)),inference(split_conjunct,[status(thm)],[16])).
% cnf(112,plain,(aNormalFormOfIn0(xd,xw,xR)),inference(split_conjunct,[status(thm)],[17])).
% fof(141, negated_conjecture,![X1]:((~(aElement0(X1))|~(sdtmndtasgtdt0(xb,xR,X1)))|~(sdtmndtasgtdt0(xd,xR,X1))),inference(fof_nnf,[status(thm)],[25])).
% fof(142, negated_conjecture,![X2]:((~(aElement0(X2))|~(sdtmndtasgtdt0(xb,xR,X2)))|~(sdtmndtasgtdt0(xd,xR,X2))),inference(variable_rename,[status(thm)],[141])).
% cnf(143,negated_conjecture,(~sdtmndtasgtdt0(xd,xR,X1)|~sdtmndtasgtdt0(xb,xR,X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[142])).
% cnf(164,plain,(aElement0(xd)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[81,112,theory(equality)])).
% cnf(166,plain,(sdtmndtasgtdt0(xw,xR,xd)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[80,112,theory(equality)])).
% cnf(167,plain,(aElement0(xd)|$false|~aElement0(xw)),inference(rw,[status(thm)],[164,88,theory(equality)])).
% cnf(168,plain,(aElement0(xd)|$false|$false),inference(rw,[status(thm)],[167,111,theory(equality)])).
% cnf(169,plain,(aElement0(xd)),inference(cn,[status(thm)],[168,theory(equality)])).
% cnf(173,plain,(sdtmndtasgtdt0(xw,xR,xd)|$false|~aElement0(xw)),inference(rw,[status(thm)],[166,88,theory(equality)])).
% cnf(174,plain,(sdtmndtasgtdt0(xw,xR,xd)|$false|$false),inference(rw,[status(thm)],[173,111,theory(equality)])).
% cnf(175,plain,(sdtmndtasgtdt0(xw,xR,xd)),inference(cn,[status(thm)],[174,theory(equality)])).
% cnf(178,plain,(sdtmndtplgtdt0(X3,X2,X1)|~aReductOfIn0(X1,X3,X2)|~aRewritingSystem0(X2)|~aElement0(X3)),inference(csr,[status(thm)],[42,33])).
% cnf(180,plain,(sdtmndtplgtdt0(xa,xR,xu)|~aRewritingSystem0(xR)|~aElement0(xa)),inference(spm,[status(thm)],[178,104,theory(equality)])).
% cnf(184,plain,(sdtmndtplgtdt0(xa,xR,xu)|$false|~aElement0(xa)),inference(rw,[status(thm)],[180,88,theory(equality)])).
% cnf(185,plain,(sdtmndtplgtdt0(xa,xR,xu)|$false|$false),inference(rw,[status(thm)],[184,93,theory(equality)])).
% cnf(186,plain,(sdtmndtplgtdt0(xa,xR,xu)),inference(cn,[status(thm)],[185,theory(equality)])).
% cnf(533,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|~aRewritingSystem0(xR)|~aElement0(xw)|~aElement0(xd)|~aElement0(X1)),inference(spm,[status(thm)],[49,175,theory(equality)])).
% cnf(545,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|$false|~aElement0(xw)|~aElement0(xd)|~aElement0(X1)),inference(rw,[status(thm)],[533,88,theory(equality)])).
% cnf(546,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|$false|$false|~aElement0(xd)|~aElement0(X1)),inference(rw,[status(thm)],[545,111,theory(equality)])).
% cnf(547,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|$false|$false|$false|~aElement0(X1)),inference(rw,[status(thm)],[546,169,theory(equality)])).
% cnf(548,plain,(sdtmndtasgtdt0(X1,xR,xd)|~sdtmndtasgtdt0(X1,xR,xw)|~aElement0(X1)),inference(cn,[status(thm)],[547,theory(equality)])).
% cnf(617,plain,(iLess0(xu,xa)|~isTerminating0(xR)|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xu)),inference(spm,[status(thm)],[73,186,theory(equality)])).
% cnf(637,plain,(iLess0(xu,xa)|$false|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xu)),inference(rw,[status(thm)],[617,89,theory(equality)])).
% cnf(638,plain,(iLess0(xu,xa)|$false|$false|~aElement0(xa)|~aElement0(xu)),inference(rw,[status(thm)],[637,88,theory(equality)])).
% cnf(639,plain,(iLess0(xu,xa)|$false|$false|$false|~aElement0(xu)),inference(rw,[status(thm)],[638,93,theory(equality)])).
% cnf(640,plain,(iLess0(xu,xa)|$false|$false|$false|$false),inference(rw,[status(thm)],[639,105,theory(equality)])).
% cnf(641,plain,(iLess0(xu,xa)),inference(cn,[status(thm)],[640,theory(equality)])).
% cnf(647,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)],[100,641,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)|~aElement0(xu)),inference(spm,[status(thm)],[99,641,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)|~aElement0(xu)),inference(spm,[status(thm)],[98,641,theory(equality)])).
% cnf(650,plain,(aElement0(esk10_3(xu,X1,X2))|~sdtmndtasgtdt0(xu,xR,X1)|~sdtmndtasgtdt0(xu,xR,X2)|~aElement0(X1)|~aElement0(X2)|$false),inference(rw,[status(thm)],[647,105,theory(equality)])).
% cnf(651,plain,(aElement0(esk10_3(xu,X1,X2))|~sdtmndtasgtdt0(xu,xR,X1)|~sdtmndtasgtdt0(xu,xR,X2)|~aElement0(X1)|~aElement0(X2)),inference(cn,[status(thm)],[650,theory(equality)])).
% cnf(652,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)],[648,105,theory(equality)])).
% cnf(653,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)],[652,theory(equality)])).
% cnf(654,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)],[649,105,theory(equality)])).
% cnf(655,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)],[654,theory(equality)])).
% cnf(834,plain,(sdtmndtasgtdt0(xu,xR,xd)|~aElement0(xu)),inference(spm,[status(thm)],[548,110,theory(equality)])).
% cnf(838,plain,(sdtmndtasgtdt0(xu,xR,xd)|$false),inference(rw,[status(thm)],[834,105,theory(equality)])).
% cnf(839,plain,(sdtmndtasgtdt0(xu,xR,xd)),inference(cn,[status(thm)],[838,theory(equality)])).
% cnf(1862,plain,(aElement0(esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(xb)|~aElement0(X1)),inference(spm,[status(thm)],[651,103,theory(equality)])).
% cnf(1872,plain,(aElement0(esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|$false|~aElement0(X1)),inference(rw,[status(thm)],[1862,92,theory(equality)])).
% cnf(1873,plain,(aElement0(esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X1)),inference(cn,[status(thm)],[1872,theory(equality)])).
% cnf(1900,plain,(aElement0(esk10_3(xu,xb,xd))|~aElement0(xd)),inference(spm,[status(thm)],[1873,839,theory(equality)])).
% cnf(1912,plain,(aElement0(esk10_3(xu,xb,xd))|$false),inference(rw,[status(thm)],[1900,169,theory(equality)])).
% cnf(1913,plain,(aElement0(esk10_3(xu,xb,xd))),inference(cn,[status(thm)],[1912,theory(equality)])).
% cnf(11227,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(xb)|~aElement0(X1)),inference(spm,[status(thm)],[653,103,theory(equality)])).
% cnf(11260,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|$false|~aElement0(X1)),inference(rw,[status(thm)],[11227,92,theory(equality)])).
% cnf(11261,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X1)),inference(cn,[status(thm)],[11260,theory(equality)])).
% cnf(11668,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xb,xd))|~aElement0(xd)),inference(spm,[status(thm)],[11261,839,theory(equality)])).
% cnf(11707,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xb,xd))|$false),inference(rw,[status(thm)],[11668,169,theory(equality)])).
% cnf(11708,plain,(sdtmndtasgtdt0(xb,xR,esk10_3(xu,xb,xd))),inference(cn,[status(thm)],[11707,theory(equality)])).
% cnf(11956,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(xb)|~aElement0(X1)),inference(spm,[status(thm)],[655,103,theory(equality)])).
% cnf(11993,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|$false|~aElement0(X1)),inference(rw,[status(thm)],[11956,92,theory(equality)])).
% cnf(11994,plain,(sdtmndtasgtdt0(X1,xR,esk10_3(xu,xb,X1))|~sdtmndtasgtdt0(xu,xR,X1)|~aElement0(X1)),inference(cn,[status(thm)],[11993,theory(equality)])).
% cnf(12131,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xb,xd))|~aElement0(xd)),inference(spm,[status(thm)],[11994,839,theory(equality)])).
% cnf(12170,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xb,xd))|$false),inference(rw,[status(thm)],[12131,169,theory(equality)])).
% cnf(12171,plain,(sdtmndtasgtdt0(xd,xR,esk10_3(xu,xb,xd))),inference(cn,[status(thm)],[12170,theory(equality)])).
% cnf(12438,negated_conjecture,(~sdtmndtasgtdt0(xd,xR,esk10_3(xu,xb,xd))|~aElement0(esk10_3(xu,xb,xd))),inference(spm,[status(thm)],[143,11708,theory(equality)])).
% cnf(12486,negated_conjecture,(~sdtmndtasgtdt0(xd,xR,esk10_3(xu,xb,xd))|$false),inference(rw,[status(thm)],[12438,1913,theory(equality)])).
% cnf(12487,negated_conjecture,(~sdtmndtasgtdt0(xd,xR,esk10_3(xu,xb,xd))),inference(cn,[status(thm)],[12486,theory(equality)])).
% cnf(13721,plain,($false),inference(sr,[status(thm)],[12171,12487,theory(equality)])).
% cnf(13722,plain,($false),13721,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 866
% # ...of these trivial : 4
% # ...subsumed : 24
% # ...remaining for further processing: 838
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 34
% # Generated clauses : 3383
% # ...of the previous two non-trivial : 3095
% # Contextual simplify-reflections : 76
% # Paramodulations : 3382
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 782
% # Positive orientable unit clauses: 328
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 443
% # Current number of unprocessed clauses: 2290
% # ...number of literals in the above : 6136
% # Clause-clause subsumption calls (NU) : 4594
% # Rec. Clause-clause subsumption calls : 3421
% # Unit Clause-clause subsumption calls : 498
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4204
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index: 245 leaves, 4.27+/-8.273 terms/leaf
% # Paramod-from index: 105 leaves, 4.11+/-6.847 terms/leaf
% # Paramod-into index: 179 leaves, 4.07+/-6.635 terms/leaf
% # -------------------------------------------------
% # User time : 0.210 s
% # System time : 0.010 s
% # Total time : 0.220 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.46 CPU 0.55 WC
% FINAL PrfWatch: 0.46 CPU 0.55 WC
% SZS output end Solution for /tmp/SystemOnTPTP11006/COM020+1.tptp
%
%------------------------------------------------------------------------------