TSTP Solution File: COM013+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM013+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 : art04.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:39:15 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP17443/COM013+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17443/COM013+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17443/COM013+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 17539
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(aRewritingSystem0(xR)&isTerminating0(xR)),file('/tmp/SRASS.s.p', m__587)).
% fof(2, 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(5, axiom,![X1]:![X2]:((aElement0(X1)&aRewritingSystem0(X2))=>![X3]:(aReductOfIn0(X3,X1,X2)=>aElement0(X3))),file('/tmp/SRASS.s.p', mReduct)).
% fof(7, 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(8, 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(12, 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(14, 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(15, conjecture,![X1]:(aElement0(X1)=>(![X2]:(aElement0(X2)=>(iLess0(X2,X1)=>?[X3]:aNormalFormOfIn0(X3,X2,xR)))=>?[X2]:aNormalFormOfIn0(X2,X1,xR))),file('/tmp/SRASS.s.p', m__)).
% fof(16, negated_conjecture,~(![X1]:(aElement0(X1)=>(![X2]:(aElement0(X2)=>(iLess0(X2,X1)=>?[X3]:aNormalFormOfIn0(X3,X2,xR)))=>?[X2]:aNormalFormOfIn0(X2,X1,xR)))),inference(assume_negation,[status(cth)],[15])).
% cnf(21,plain,(isTerminating0(xR)),inference(split_conjunct,[status(thm)],[1])).
% cnf(22,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[1])).
% fof(23, 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)],[2])).
% fof(24, 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)],[23])).
% fof(25, plain,![X4]:(~(aRewritingSystem0(X4))|((~(isTerminating0(X4))|![X5]:![X6]:((~(aElement0(X5))|~(aElement0(X6)))|(~(sdtmndtplgtdt0(X5,X4,X6))|iLess0(X6,X5))))&(((aElement0(esk1_1(X4))&aElement0(esk2_1(X4)))&(sdtmndtplgtdt0(esk1_1(X4),X4,esk2_1(X4))&~(iLess0(esk2_1(X4),esk1_1(X4)))))|isTerminating0(X4)))),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:(((((~(aElement0(X5))|~(aElement0(X6)))|(~(sdtmndtplgtdt0(X5,X4,X6))|iLess0(X6,X5)))|~(isTerminating0(X4)))&(((aElement0(esk1_1(X4))&aElement0(esk2_1(X4)))&(sdtmndtplgtdt0(esk1_1(X4),X4,esk2_1(X4))&~(iLess0(esk2_1(X4),esk1_1(X4)))))|isTerminating0(X4)))|~(aRewritingSystem0(X4))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:(((((~(aElement0(X5))|~(aElement0(X6)))|(~(sdtmndtplgtdt0(X5,X4,X6))|iLess0(X6,X5)))|~(isTerminating0(X4)))|~(aRewritingSystem0(X4)))&((((aElement0(esk1_1(X4))|isTerminating0(X4))|~(aRewritingSystem0(X4)))&((aElement0(esk2_1(X4))|isTerminating0(X4))|~(aRewritingSystem0(X4))))&(((sdtmndtplgtdt0(esk1_1(X4),X4,esk2_1(X4))|isTerminating0(X4))|~(aRewritingSystem0(X4)))&((~(iLess0(esk2_1(X4),esk1_1(X4)))|isTerminating0(X4))|~(aRewritingSystem0(X4)))))),inference(distribute,[status(thm)],[26])).
% cnf(32,plain,(iLess0(X2,X3)|~aRewritingSystem0(X1)|~isTerminating0(X1)|~sdtmndtplgtdt0(X3,X1,X2)|~aElement0(X2)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(37, plain,![X1]:![X2]:((~(aElement0(X1))|~(aRewritingSystem0(X2)))|![X3]:(~(aReductOfIn0(X3,X1,X2))|aElement0(X3))),inference(fof_nnf,[status(thm)],[5])).
% fof(38, plain,![X4]:![X5]:((~(aElement0(X4))|~(aRewritingSystem0(X5)))|![X6]:(~(aReductOfIn0(X6,X4,X5))|aElement0(X6))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:((~(aReductOfIn0(X6,X4,X5))|aElement0(X6))|(~(aElement0(X4))|~(aRewritingSystem0(X5)))),inference(shift_quantors,[status(thm)],[38])).
% cnf(40,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aReductOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(44, 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)],[7])).
% fof(45, 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)],[44])).
% cnf(46,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)],[45])).
% fof(47, 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)],[8])).
% fof(48, 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)],[47])).
% fof(49, 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(esk3_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6)))),inference(skolemize,[status(esa)],[48])).
% fof(50, 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(esk3_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6)))|(~(aElement0(X5))|~(aRewritingSystem0(X6)))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, 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(esk3_3(X5,X6,X7),X7,X6))|aNormalFormOfIn0(X7,X5,X6))|(~(aElement0(X5))|~(aRewritingSystem0(X6))))),inference(distribute,[status(thm)],[50])).
% cnf(52,plain,(aNormalFormOfIn0(X3,X2,X1)|aReductOfIn0(esk3_3(X2,X1,X3),X3,X1)|~aRewritingSystem0(X1)|~aElement0(X2)|~sdtmndtasgtdt0(X2,X1,X3)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(sdtmndtasgtdt0(X2,X1,X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(55,plain,(~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)|~aReductOfIn0(X4,X3,X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(74, 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)],[12])).
% fof(75, 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)],[74])).
% fof(76, plain,![X5]:![X6]:![X7]:(((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))|((~(sdtmndtplgtdt0(X5,X6,X7))|(aReductOfIn0(X7,X5,X6)|((aElement0(esk8_3(X5,X6,X7))&aReductOfIn0(esk8_3(X5,X6,X7),X5,X6))&sdtmndtplgtdt0(esk8_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)],[75])).
% fof(77, 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(esk8_3(X5,X6,X7))&aReductOfIn0(esk8_3(X5,X6,X7),X5,X6))&sdtmndtplgtdt0(esk8_3(X5,X6,X7),X6,X7)))))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))),inference(shift_quantors,[status(thm)],[76])).
% fof(78, 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(esk8_3(X5,X6,X7))|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7))))&(((aReductOfIn0(esk8_3(X5,X6,X7),X5,X6)|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))))&(((sdtmndtplgtdt0(esk8_3(X5,X6,X7),X6,X7)|aReductOfIn0(X7,X5,X6))|~(sdtmndtplgtdt0(X5,X6,X7)))|((~(aElement0(X5))|~(aRewritingSystem0(X6)))|~(aElement0(X7)))))),inference(distribute,[status(thm)],[77])).
% cnf(82,plain,(sdtmndtplgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~aReductOfIn0(X1,X3,X2)),inference(split_conjunct,[status(thm)],[78])).
% fof(98, 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)],[14])).
% fof(99, 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)],[98])).
% fof(100, 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)],[99])).
% cnf(101,plain,(sdtmndtasgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtplgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[100])).
% cnf(102,plain,(sdtmndtasgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|X3!=X1),inference(split_conjunct,[status(thm)],[100])).
% fof(104, negated_conjecture,?[X1]:(aElement0(X1)&(![X2]:(~(aElement0(X2))|(~(iLess0(X2,X1))|?[X3]:aNormalFormOfIn0(X3,X2,xR)))&![X2]:~(aNormalFormOfIn0(X2,X1,xR)))),inference(fof_nnf,[status(thm)],[16])).
% fof(105, negated_conjecture,?[X4]:(aElement0(X4)&(![X5]:(~(aElement0(X5))|(~(iLess0(X5,X4))|?[X6]:aNormalFormOfIn0(X6,X5,xR)))&![X7]:~(aNormalFormOfIn0(X7,X4,xR)))),inference(variable_rename,[status(thm)],[104])).
% fof(106, negated_conjecture,(aElement0(esk13_0)&(![X5]:(~(aElement0(X5))|(~(iLess0(X5,esk13_0))|aNormalFormOfIn0(esk14_1(X5),X5,xR)))&![X7]:~(aNormalFormOfIn0(X7,esk13_0,xR)))),inference(skolemize,[status(esa)],[105])).
% fof(107, negated_conjecture,![X5]:![X7]:((~(aNormalFormOfIn0(X7,esk13_0,xR))&(~(aElement0(X5))|(~(iLess0(X5,esk13_0))|aNormalFormOfIn0(esk14_1(X5),X5,xR))))&aElement0(esk13_0)),inference(shift_quantors,[status(thm)],[106])).
% cnf(108,negated_conjecture,(aElement0(esk13_0)),inference(split_conjunct,[status(thm)],[107])).
% cnf(109,negated_conjecture,(aNormalFormOfIn0(esk14_1(X1),X1,xR)|~iLess0(X1,esk13_0)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[107])).
% cnf(110,negated_conjecture,(~aNormalFormOfIn0(X1,esk13_0,xR)),inference(split_conjunct,[status(thm)],[107])).
% cnf(111,plain,(sdtmndtasgtdt0(X1,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)),inference(er,[status(thm)],[102,theory(equality)])).
% cnf(112,plain,(sdtmndtplgtdt0(X3,X2,X1)|~aReductOfIn0(X1,X3,X2)|~aElement0(X3)|~aRewritingSystem0(X2)),inference(csr,[status(thm)],[82,40])).
% cnf(123,negated_conjecture,(aElement0(esk14_1(X1))|~aElement0(X1)|~aRewritingSystem0(xR)|~iLess0(X1,esk13_0)),inference(spm,[status(thm)],[54,109,theory(equality)])).
% cnf(124,negated_conjecture,(aElement0(esk14_1(X1))|~aElement0(X1)|$false|~iLess0(X1,esk13_0)),inference(rw,[status(thm)],[123,22,theory(equality)])).
% cnf(125,negated_conjecture,(aElement0(esk14_1(X1))|~aElement0(X1)|~iLess0(X1,esk13_0)),inference(cn,[status(thm)],[124,theory(equality)])).
% cnf(126,negated_conjecture,(sdtmndtasgtdt0(esk13_0,X1,esk13_0)|~aRewritingSystem0(X1)),inference(spm,[status(thm)],[111,108,theory(equality)])).
% cnf(135,negated_conjecture,(sdtmndtasgtdt0(X1,xR,esk14_1(X1))|~aElement0(X1)|~aRewritingSystem0(xR)|~iLess0(X1,esk13_0)),inference(spm,[status(thm)],[53,109,theory(equality)])).
% cnf(136,negated_conjecture,(sdtmndtasgtdt0(X1,xR,esk14_1(X1))|~aElement0(X1)|$false|~iLess0(X1,esk13_0)),inference(rw,[status(thm)],[135,22,theory(equality)])).
% cnf(137,negated_conjecture,(sdtmndtasgtdt0(X1,xR,esk14_1(X1))|~aElement0(X1)|~iLess0(X1,esk13_0)),inference(cn,[status(thm)],[136,theory(equality)])).
% cnf(138,negated_conjecture,(~aReductOfIn0(X2,esk14_1(X1),xR)|~aElement0(X1)|~aRewritingSystem0(xR)|~iLess0(X1,esk13_0)),inference(spm,[status(thm)],[55,109,theory(equality)])).
% cnf(139,negated_conjecture,(~aReductOfIn0(X2,esk14_1(X1),xR)|~aElement0(X1)|$false|~iLess0(X1,esk13_0)),inference(rw,[status(thm)],[138,22,theory(equality)])).
% cnf(140,negated_conjecture,(~aReductOfIn0(X2,esk14_1(X1),xR)|~aElement0(X1)|~iLess0(X1,esk13_0)),inference(cn,[status(thm)],[139,theory(equality)])).
% cnf(142,negated_conjecture,(sdtmndtplgtdt0(esk13_0,X1,X2)|~aReductOfIn0(X2,esk13_0,X1)|~aRewritingSystem0(X1)),inference(spm,[status(thm)],[112,108,theory(equality)])).
% cnf(261,negated_conjecture,(aNormalFormOfIn0(esk13_0,esk13_0,X1)|aReductOfIn0(esk3_3(esk13_0,X1,esk13_0),esk13_0,X1)|~aElement0(esk13_0)|~aRewritingSystem0(X1)),inference(spm,[status(thm)],[52,126,theory(equality)])).
% cnf(264,negated_conjecture,(aNormalFormOfIn0(esk13_0,esk13_0,X1)|aReductOfIn0(esk3_3(esk13_0,X1,esk13_0),esk13_0,X1)|$false|~aRewritingSystem0(X1)),inference(rw,[status(thm)],[261,108,theory(equality)])).
% cnf(265,negated_conjecture,(aNormalFormOfIn0(esk13_0,esk13_0,X1)|aReductOfIn0(esk3_3(esk13_0,X1,esk13_0),esk13_0,X1)|~aRewritingSystem0(X1)),inference(cn,[status(thm)],[264,theory(equality)])).
% cnf(268,negated_conjecture,(sdtmndtasgtdt0(X1,xR,esk14_1(X2))|~sdtmndtasgtdt0(X1,xR,X2)|~aElement0(X2)|~aElement0(esk14_1(X2))|~aElement0(X1)|~aRewritingSystem0(xR)|~iLess0(X2,esk13_0)),inference(spm,[status(thm)],[46,137,theory(equality)])).
% cnf(274,negated_conjecture,(sdtmndtasgtdt0(X1,xR,esk14_1(X2))|~sdtmndtasgtdt0(X1,xR,X2)|~aElement0(X2)|~aElement0(esk14_1(X2))|~aElement0(X1)|$false|~iLess0(X2,esk13_0)),inference(rw,[status(thm)],[268,22,theory(equality)])).
% cnf(275,negated_conjecture,(sdtmndtasgtdt0(X1,xR,esk14_1(X2))|~sdtmndtasgtdt0(X1,xR,X2)|~aElement0(X2)|~aElement0(esk14_1(X2))|~aElement0(X1)|~iLess0(X2,esk13_0)),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(278,negated_conjecture,(sdtmndtasgtdt0(esk13_0,X1,X2)|~aElement0(esk13_0)|~aElement0(X2)|~aRewritingSystem0(X1)|~aReductOfIn0(X2,esk13_0,X1)),inference(spm,[status(thm)],[101,142,theory(equality)])).
% cnf(280,negated_conjecture,(iLess0(X1,esk13_0)|~aElement0(esk13_0)|~aElement0(X1)|~isTerminating0(X2)|~aRewritingSystem0(X2)|~aReductOfIn0(X1,esk13_0,X2)),inference(spm,[status(thm)],[32,142,theory(equality)])).
% cnf(281,negated_conjecture,(sdtmndtasgtdt0(esk13_0,X1,X2)|$false|~aElement0(X2)|~aRewritingSystem0(X1)|~aReductOfIn0(X2,esk13_0,X1)),inference(rw,[status(thm)],[278,108,theory(equality)])).
% cnf(282,negated_conjecture,(sdtmndtasgtdt0(esk13_0,X1,X2)|~aElement0(X2)|~aRewritingSystem0(X1)|~aReductOfIn0(X2,esk13_0,X1)),inference(cn,[status(thm)],[281,theory(equality)])).
% cnf(285,negated_conjecture,(iLess0(X1,esk13_0)|$false|~aElement0(X1)|~isTerminating0(X2)|~aRewritingSystem0(X2)|~aReductOfIn0(X1,esk13_0,X2)),inference(rw,[status(thm)],[280,108,theory(equality)])).
% cnf(286,negated_conjecture,(iLess0(X1,esk13_0)|~aElement0(X1)|~isTerminating0(X2)|~aRewritingSystem0(X2)|~aReductOfIn0(X1,esk13_0,X2)),inference(cn,[status(thm)],[285,theory(equality)])).
% cnf(308,negated_conjecture,(aNormalFormOfIn0(esk13_0,esk13_0,xR)|aReductOfIn0(esk3_3(esk13_0,xR,esk13_0),esk13_0,xR)),inference(spm,[status(thm)],[265,22,theory(equality)])).
% cnf(309,negated_conjecture,(aReductOfIn0(esk3_3(esk13_0,xR,esk13_0),esk13_0,xR)),inference(sr,[status(thm)],[308,110,theory(equality)])).
% cnf(310,negated_conjecture,(aElement0(esk3_3(esk13_0,xR,esk13_0))|~aElement0(esk13_0)|~aRewritingSystem0(xR)),inference(spm,[status(thm)],[40,309,theory(equality)])).
% cnf(312,negated_conjecture,(sdtmndtasgtdt0(esk13_0,xR,esk3_3(esk13_0,xR,esk13_0))|~aElement0(esk3_3(esk13_0,xR,esk13_0))|~aRewritingSystem0(xR)),inference(spm,[status(thm)],[282,309,theory(equality)])).
% cnf(313,negated_conjecture,(aElement0(esk3_3(esk13_0,xR,esk13_0))|$false|~aRewritingSystem0(xR)),inference(rw,[status(thm)],[310,108,theory(equality)])).
% cnf(314,negated_conjecture,(aElement0(esk3_3(esk13_0,xR,esk13_0))|$false|$false),inference(rw,[status(thm)],[313,22,theory(equality)])).
% cnf(315,negated_conjecture,(aElement0(esk3_3(esk13_0,xR,esk13_0))),inference(cn,[status(thm)],[314,theory(equality)])).
% cnf(319,negated_conjecture,(sdtmndtasgtdt0(esk13_0,xR,esk3_3(esk13_0,xR,esk13_0))|~aElement0(esk3_3(esk13_0,xR,esk13_0))|$false),inference(rw,[status(thm)],[312,22,theory(equality)])).
% cnf(320,negated_conjecture,(sdtmndtasgtdt0(esk13_0,xR,esk3_3(esk13_0,xR,esk13_0))|~aElement0(esk3_3(esk13_0,xR,esk13_0))),inference(cn,[status(thm)],[319,theory(equality)])).
% cnf(331,negated_conjecture,(sdtmndtasgtdt0(esk13_0,xR,esk3_3(esk13_0,xR,esk13_0))|$false),inference(rw,[status(thm)],[320,315,theory(equality)])).
% cnf(332,negated_conjecture,(sdtmndtasgtdt0(esk13_0,xR,esk3_3(esk13_0,xR,esk13_0))),inference(cn,[status(thm)],[331,theory(equality)])).
% cnf(404,negated_conjecture,(iLess0(esk3_3(esk13_0,xR,esk13_0),esk13_0)|~aElement0(esk3_3(esk13_0,xR,esk13_0))|~isTerminating0(xR)|~aRewritingSystem0(xR)),inference(spm,[status(thm)],[286,309,theory(equality)])).
% cnf(405,negated_conjecture,(iLess0(esk3_3(esk13_0,xR,esk13_0),esk13_0)|$false|~isTerminating0(xR)|~aRewritingSystem0(xR)),inference(rw,[status(thm)],[404,315,theory(equality)])).
% cnf(406,negated_conjecture,(iLess0(esk3_3(esk13_0,xR,esk13_0),esk13_0)|$false|$false|~aRewritingSystem0(xR)),inference(rw,[status(thm)],[405,21,theory(equality)])).
% cnf(407,negated_conjecture,(iLess0(esk3_3(esk13_0,xR,esk13_0),esk13_0)|$false|$false|$false),inference(rw,[status(thm)],[406,22,theory(equality)])).
% cnf(408,negated_conjecture,(iLess0(esk3_3(esk13_0,xR,esk13_0),esk13_0)),inference(cn,[status(thm)],[407,theory(equality)])).
% cnf(409,negated_conjecture,(sdtmndtasgtdt0(X1,xR,esk14_1(X2))|~sdtmndtasgtdt0(X1,xR,X2)|~iLess0(X2,esk13_0)|~aElement0(X1)|~aElement0(X2)),inference(csr,[status(thm)],[275,125])).
% cnf(413,negated_conjecture,(aNormalFormOfIn0(esk14_1(X1),X2,xR)|aReductOfIn0(esk3_3(X2,xR,esk14_1(X1)),esk14_1(X1),xR)|~aElement0(esk14_1(X1))|~aElement0(X2)|~aRewritingSystem0(xR)|~sdtmndtasgtdt0(X2,xR,X1)|~iLess0(X1,esk13_0)|~aElement0(X1)),inference(spm,[status(thm)],[52,409,theory(equality)])).
% cnf(420,negated_conjecture,(aNormalFormOfIn0(esk14_1(X1),X2,xR)|aReductOfIn0(esk3_3(X2,xR,esk14_1(X1)),esk14_1(X1),xR)|~aElement0(esk14_1(X1))|~aElement0(X2)|$false|~sdtmndtasgtdt0(X2,xR,X1)|~iLess0(X1,esk13_0)|~aElement0(X1)),inference(rw,[status(thm)],[413,22,theory(equality)])).
% cnf(421,negated_conjecture,(aNormalFormOfIn0(esk14_1(X1),X2,xR)|aReductOfIn0(esk3_3(X2,xR,esk14_1(X1)),esk14_1(X1),xR)|~aElement0(esk14_1(X1))|~aElement0(X2)|~sdtmndtasgtdt0(X2,xR,X1)|~iLess0(X1,esk13_0)|~aElement0(X1)),inference(cn,[status(thm)],[420,theory(equality)])).
% cnf(1213,negated_conjecture,(aNormalFormOfIn0(esk14_1(X1),X2,xR)|aReductOfIn0(esk3_3(X2,xR,esk14_1(X1)),esk14_1(X1),xR)|~sdtmndtasgtdt0(X2,xR,X1)|~iLess0(X1,esk13_0)|~aElement0(X2)|~aElement0(X1)),inference(csr,[status(thm)],[421,125])).
% cnf(1214,negated_conjecture,(aNormalFormOfIn0(esk14_1(X1),X2,xR)|~sdtmndtasgtdt0(X2,xR,X1)|~iLess0(X1,esk13_0)|~aElement0(X2)|~aElement0(X1)),inference(csr,[status(thm)],[1213,140])).
% cnf(1215,negated_conjecture,(~sdtmndtasgtdt0(esk13_0,xR,X1)|~iLess0(X1,esk13_0)|~aElement0(esk13_0)|~aElement0(X1)),inference(spm,[status(thm)],[110,1214,theory(equality)])).
% cnf(1219,negated_conjecture,(~sdtmndtasgtdt0(esk13_0,xR,X1)|~iLess0(X1,esk13_0)|$false|~aElement0(X1)),inference(rw,[status(thm)],[1215,108,theory(equality)])).
% cnf(1220,negated_conjecture,(~sdtmndtasgtdt0(esk13_0,xR,X1)|~iLess0(X1,esk13_0)|~aElement0(X1)),inference(cn,[status(thm)],[1219,theory(equality)])).
% cnf(1231,negated_conjecture,(~sdtmndtasgtdt0(esk13_0,xR,esk3_3(esk13_0,xR,esk13_0))|~aElement0(esk3_3(esk13_0,xR,esk13_0))),inference(spm,[status(thm)],[1220,408,theory(equality)])).
% cnf(1237,negated_conjecture,($false|~aElement0(esk3_3(esk13_0,xR,esk13_0))),inference(rw,[status(thm)],[1231,332,theory(equality)])).
% cnf(1238,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1237,315,theory(equality)])).
% cnf(1239,negated_conjecture,($false),inference(cn,[status(thm)],[1238,theory(equality)])).
% cnf(1240,negated_conjecture,($false),1239,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 251
% # ...of these trivial : 0
% # ...subsumed : 10
% # ...remaining for further processing: 241
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 1
% # Generated clauses : 656
% # ...of the previous two non-trivial : 634
% # Contextual simplify-reflections : 41
% # Paramodulations : 655
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 191
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 173
% # Current number of unprocessed clauses: 467
% # ...number of literals in the above : 3380
% # Clause-clause subsumption calls (NU) : 426
% # Rec. Clause-clause subsumption calls : 207
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 23
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 159 leaves, 2.14+/-2.011 terms/leaf
% # Paramod-from index: 67 leaves, 1.33+/-0.655 terms/leaf
% # Paramod-into index: 124 leaves, 1.55+/-1.220 terms/leaf
% # -------------------------------------------------
% # User time : 0.066 s
% # System time : 0.004 s
% # Total time : 0.070 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.27 WC
% FINAL PrfWatch: 0.17 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP17443/COM013+1.tptp
%
%------------------------------------------------------------------------------