TSTP Solution File: COM018+4 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : COM018+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art02.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:17 EST 2010

% Result   : Theorem 0.98s
% Output   : Solution 0.98s
% 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/SystemOnTPTP8231/COM018+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP8231/COM018+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8231/COM018+4.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 8327
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.040 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:((aRewritingSystem0(X1)&isTerminating0(X1))=>![X2]:(aElement0(X2)=>?[X3]:aNormalFormOfIn0(X3,X2,X1))),file('/tmp/SRASS.s.p', mTermNF)).
% fof(10, axiom,aRewritingSystem0(xR),file('/tmp/SRASS.s.p', m__656)).
% fof(11, axiom,(((![X1]:![X2]:![X3]:(((((aElement0(X1)&aElement0(X2))&aElement0(X3))&aReductOfIn0(X2,X1,xR))&aReductOfIn0(X3,X1,xR))=>?[X4]:((((aElement0(X4)&(X2=X4|((aReductOfIn0(X4,X2,xR)|?[X5]:((aElement0(X5)&aReductOfIn0(X5,X2,xR))&sdtmndtplgtdt0(X5,xR,X4)))&sdtmndtplgtdt0(X2,xR,X4))))&sdtmndtasgtdt0(X2,xR,X4))&(X3=X4|((aReductOfIn0(X4,X3,xR)|?[X5]:((aElement0(X5)&aReductOfIn0(X5,X3,xR))&sdtmndtplgtdt0(X5,xR,X4)))&sdtmndtplgtdt0(X3,xR,X4))))&sdtmndtasgtdt0(X3,xR,X4)))&isLocallyConfluent0(xR))&![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>(((aReductOfIn0(X2,X1,xR)|?[X3]:((aElement0(X3)&aReductOfIn0(X3,X1,xR))&sdtmndtplgtdt0(X3,xR,X2)))|sdtmndtplgtdt0(X1,xR,X2))=>iLess0(X2,X1))))&isTerminating0(xR)),file('/tmp/SRASS.s.p', m__656_01)).
% fof(17, axiom,((((aElement0(xw)&(xu=xw|((aReductOfIn0(xw,xu,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xu,xR))&sdtmndtplgtdt0(X1,xR,xw)))&sdtmndtplgtdt0(xu,xR,xw))))&sdtmndtasgtdt0(xu,xR,xw))&(xv=xw|((aReductOfIn0(xw,xv,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xv,xR))&sdtmndtplgtdt0(X1,xR,xw)))&sdtmndtplgtdt0(xv,xR,xw))))&sdtmndtasgtdt0(xv,xR,xw)),file('/tmp/SRASS.s.p', m__799)).
% fof(23, conjecture,?[X1]:(((aElement0(X1)&((((xw=X1|aReductOfIn0(X1,xw,xR))|?[X2]:((aElement0(X2)&aReductOfIn0(X2,xw,xR))&sdtmndtplgtdt0(X2,xR,X1)))|sdtmndtplgtdt0(xw,xR,X1))|sdtmndtasgtdt0(xw,xR,X1)))&~(?[X2]:aReductOfIn0(X2,X1,xR)))|aNormalFormOfIn0(X1,xw,xR)),file('/tmp/SRASS.s.p', m__)).
% fof(24, negated_conjecture,~(?[X1]:(((aElement0(X1)&((((xw=X1|aReductOfIn0(X1,xw,xR))|?[X2]:((aElement0(X2)&aReductOfIn0(X2,xw,xR))&sdtmndtplgtdt0(X2,xR,X1)))|sdtmndtplgtdt0(xw,xR,X1))|sdtmndtasgtdt0(xw,xR,X1)))&~(?[X2]:aReductOfIn0(X2,X1,xR)))|aNormalFormOfIn0(X1,xw,xR))),inference(assume_negation,[status(cth)],[23])).
% fof(88, plain,![X1]:((~(aRewritingSystem0(X1))|~(isTerminating0(X1)))|![X2]:(~(aElement0(X2))|?[X3]:aNormalFormOfIn0(X3,X2,X1))),inference(fof_nnf,[status(thm)],[9])).
% fof(89, plain,![X4]:((~(aRewritingSystem0(X4))|~(isTerminating0(X4)))|![X5]:(~(aElement0(X5))|?[X6]:aNormalFormOfIn0(X6,X5,X4))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X4]:((~(aRewritingSystem0(X4))|~(isTerminating0(X4)))|![X5]:(~(aElement0(X5))|aNormalFormOfIn0(esk9_2(X4,X5),X5,X4))),inference(skolemize,[status(esa)],[89])).
% fof(91, plain,![X4]:![X5]:((~(aElement0(X5))|aNormalFormOfIn0(esk9_2(X4,X5),X5,X4))|(~(aRewritingSystem0(X4))|~(isTerminating0(X4)))),inference(shift_quantors,[status(thm)],[90])).
% cnf(92,plain,(aNormalFormOfIn0(esk9_2(X1,X2),X2,X1)|~isTerminating0(X1)|~aRewritingSystem0(X1)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[91])).
% cnf(93,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[10])).
% fof(94, plain,(((![X1]:![X2]:![X3]:(((((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|~(aReductOfIn0(X2,X1,xR)))|~(aReductOfIn0(X3,X1,xR)))|?[X4]:((((aElement0(X4)&(X2=X4|((aReductOfIn0(X4,X2,xR)|?[X5]:((aElement0(X5)&aReductOfIn0(X5,X2,xR))&sdtmndtplgtdt0(X5,xR,X4)))&sdtmndtplgtdt0(X2,xR,X4))))&sdtmndtasgtdt0(X2,xR,X4))&(X3=X4|((aReductOfIn0(X4,X3,xR)|?[X5]:((aElement0(X5)&aReductOfIn0(X5,X3,xR))&sdtmndtplgtdt0(X5,xR,X4)))&sdtmndtplgtdt0(X3,xR,X4))))&sdtmndtasgtdt0(X3,xR,X4)))&isLocallyConfluent0(xR))&![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|(((~(aReductOfIn0(X2,X1,xR))&![X3]:((~(aElement0(X3))|~(aReductOfIn0(X3,X1,xR)))|~(sdtmndtplgtdt0(X3,xR,X2))))&~(sdtmndtplgtdt0(X1,xR,X2)))|iLess0(X2,X1))))&isTerminating0(xR)),inference(fof_nnf,[status(thm)],[11])).
% fof(95, plain,(((![X6]:![X7]:![X8]:(((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))|?[X9]:((((aElement0(X9)&(X7=X9|((aReductOfIn0(X9,X7,xR)|?[X10]:((aElement0(X10)&aReductOfIn0(X10,X7,xR))&sdtmndtplgtdt0(X10,xR,X9)))&sdtmndtplgtdt0(X7,xR,X9))))&sdtmndtasgtdt0(X7,xR,X9))&(X8=X9|((aReductOfIn0(X9,X8,xR)|?[X11]:((aElement0(X11)&aReductOfIn0(X11,X8,xR))&sdtmndtplgtdt0(X11,xR,X9)))&sdtmndtplgtdt0(X8,xR,X9))))&sdtmndtasgtdt0(X8,xR,X9)))&isLocallyConfluent0(xR))&![X12]:![X13]:((~(aElement0(X12))|~(aElement0(X13)))|(((~(aReductOfIn0(X13,X12,xR))&![X14]:((~(aElement0(X14))|~(aReductOfIn0(X14,X12,xR)))|~(sdtmndtplgtdt0(X14,xR,X13))))&~(sdtmndtplgtdt0(X12,xR,X13)))|iLess0(X13,X12))))&isTerminating0(xR)),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,(((![X6]:![X7]:![X8]:(((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))|((((aElement0(esk10_3(X6,X7,X8))&(X7=esk10_3(X6,X7,X8)|((aReductOfIn0(esk10_3(X6,X7,X8),X7,xR)|((aElement0(esk11_3(X6,X7,X8))&aReductOfIn0(esk11_3(X6,X7,X8),X7,xR))&sdtmndtplgtdt0(esk11_3(X6,X7,X8),xR,esk10_3(X6,X7,X8))))&sdtmndtplgtdt0(X7,xR,esk10_3(X6,X7,X8)))))&sdtmndtasgtdt0(X7,xR,esk10_3(X6,X7,X8)))&(X8=esk10_3(X6,X7,X8)|((aReductOfIn0(esk10_3(X6,X7,X8),X8,xR)|((aElement0(esk12_3(X6,X7,X8))&aReductOfIn0(esk12_3(X6,X7,X8),X8,xR))&sdtmndtplgtdt0(esk12_3(X6,X7,X8),xR,esk10_3(X6,X7,X8))))&sdtmndtplgtdt0(X8,xR,esk10_3(X6,X7,X8)))))&sdtmndtasgtdt0(X8,xR,esk10_3(X6,X7,X8))))&isLocallyConfluent0(xR))&![X12]:![X13]:((~(aElement0(X12))|~(aElement0(X13)))|(((~(aReductOfIn0(X13,X12,xR))&![X14]:((~(aElement0(X14))|~(aReductOfIn0(X14,X12,xR)))|~(sdtmndtplgtdt0(X14,xR,X13))))&~(sdtmndtplgtdt0(X12,xR,X13)))|iLess0(X13,X12))))&isTerminating0(xR)),inference(skolemize,[status(esa)],[95])).
% fof(97, plain,![X6]:![X7]:![X8]:![X12]:![X13]:![X14]:((((((((~(aElement0(X14))|~(aReductOfIn0(X14,X12,xR)))|~(sdtmndtplgtdt0(X14,xR,X13)))&~(aReductOfIn0(X13,X12,xR)))&~(sdtmndtplgtdt0(X12,xR,X13)))|iLess0(X13,X12))|(~(aElement0(X12))|~(aElement0(X13))))&((((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))|((((aElement0(esk10_3(X6,X7,X8))&(X7=esk10_3(X6,X7,X8)|((aReductOfIn0(esk10_3(X6,X7,X8),X7,xR)|((aElement0(esk11_3(X6,X7,X8))&aReductOfIn0(esk11_3(X6,X7,X8),X7,xR))&sdtmndtplgtdt0(esk11_3(X6,X7,X8),xR,esk10_3(X6,X7,X8))))&sdtmndtplgtdt0(X7,xR,esk10_3(X6,X7,X8)))))&sdtmndtasgtdt0(X7,xR,esk10_3(X6,X7,X8)))&(X8=esk10_3(X6,X7,X8)|((aReductOfIn0(esk10_3(X6,X7,X8),X8,xR)|((aElement0(esk12_3(X6,X7,X8))&aReductOfIn0(esk12_3(X6,X7,X8),X8,xR))&sdtmndtplgtdt0(esk12_3(X6,X7,X8),xR,esk10_3(X6,X7,X8))))&sdtmndtplgtdt0(X8,xR,esk10_3(X6,X7,X8)))))&sdtmndtasgtdt0(X8,xR,esk10_3(X6,X7,X8))))&isLocallyConfluent0(xR)))&isTerminating0(xR)),inference(shift_quantors,[status(thm)],[96])).
% fof(98, plain,![X6]:![X7]:![X8]:![X12]:![X13]:![X14]:((((((((~(aElement0(X14))|~(aReductOfIn0(X14,X12,xR)))|~(sdtmndtplgtdt0(X14,xR,X13)))|iLess0(X13,X12))|(~(aElement0(X12))|~(aElement0(X13))))&((~(aReductOfIn0(X13,X12,xR))|iLess0(X13,X12))|(~(aElement0(X12))|~(aElement0(X13)))))&((~(sdtmndtplgtdt0(X12,xR,X13))|iLess0(X13,X12))|(~(aElement0(X12))|~(aElement0(X13)))))&((((((aElement0(esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR))))&((((((aElement0(esk11_3(X6,X7,X8))|aReductOfIn0(esk10_3(X6,X7,X8),X7,xR))|X7=esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR))))&(((aReductOfIn0(esk11_3(X6,X7,X8),X7,xR)|aReductOfIn0(esk10_3(X6,X7,X8),X7,xR))|X7=esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))))&(((sdtmndtplgtdt0(esk11_3(X6,X7,X8),xR,esk10_3(X6,X7,X8))|aReductOfIn0(esk10_3(X6,X7,X8),X7,xR))|X7=esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))))&((sdtmndtplgtdt0(X7,xR,esk10_3(X6,X7,X8))|X7=esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR))))))&(sdtmndtasgtdt0(X7,xR,esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))))&((((((aElement0(esk12_3(X6,X7,X8))|aReductOfIn0(esk10_3(X6,X7,X8),X8,xR))|X8=esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR))))&(((aReductOfIn0(esk12_3(X6,X7,X8),X8,xR)|aReductOfIn0(esk10_3(X6,X7,X8),X8,xR))|X8=esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))))&(((sdtmndtplgtdt0(esk12_3(X6,X7,X8),xR,esk10_3(X6,X7,X8))|aReductOfIn0(esk10_3(X6,X7,X8),X8,xR))|X8=esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))))&((sdtmndtplgtdt0(X8,xR,esk10_3(X6,X7,X8))|X8=esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR))))))&(sdtmndtasgtdt0(X8,xR,esk10_3(X6,X7,X8))|((((~(aElement0(X6))|~(aElement0(X7)))|~(aElement0(X8)))|~(aReductOfIn0(X7,X6,xR)))|~(aReductOfIn0(X8,X6,xR)))))&isLocallyConfluent0(xR)))&isTerminating0(xR)),inference(distribute,[status(thm)],[97])).
% cnf(99,plain,(isTerminating0(xR)),inference(split_conjunct,[status(thm)],[98])).
% fof(429, plain,((((aElement0(xw)&(xu=xw|((aReductOfIn0(xw,xu,xR)|?[X2]:((aElement0(X2)&aReductOfIn0(X2,xu,xR))&sdtmndtplgtdt0(X2,xR,xw)))&sdtmndtplgtdt0(xu,xR,xw))))&sdtmndtasgtdt0(xu,xR,xw))&(xv=xw|((aReductOfIn0(xw,xv,xR)|?[X3]:((aElement0(X3)&aReductOfIn0(X3,xv,xR))&sdtmndtplgtdt0(X3,xR,xw)))&sdtmndtplgtdt0(xv,xR,xw))))&sdtmndtasgtdt0(xv,xR,xw)),inference(variable_rename,[status(thm)],[17])).
% fof(430, plain,((((aElement0(xw)&(xu=xw|((aReductOfIn0(xw,xu,xR)|((aElement0(esk20_0)&aReductOfIn0(esk20_0,xu,xR))&sdtmndtplgtdt0(esk20_0,xR,xw)))&sdtmndtplgtdt0(xu,xR,xw))))&sdtmndtasgtdt0(xu,xR,xw))&(xv=xw|((aReductOfIn0(xw,xv,xR)|((aElement0(esk21_0)&aReductOfIn0(esk21_0,xv,xR))&sdtmndtplgtdt0(esk21_0,xR,xw)))&sdtmndtplgtdt0(xv,xR,xw))))&sdtmndtasgtdt0(xv,xR,xw)),inference(skolemize,[status(esa)],[429])).
% fof(431, plain,((((aElement0(xw)&(((((aElement0(esk20_0)|aReductOfIn0(xw,xu,xR))|xu=xw)&((aReductOfIn0(esk20_0,xu,xR)|aReductOfIn0(xw,xu,xR))|xu=xw))&((sdtmndtplgtdt0(esk20_0,xR,xw)|aReductOfIn0(xw,xu,xR))|xu=xw))&(sdtmndtplgtdt0(xu,xR,xw)|xu=xw)))&sdtmndtasgtdt0(xu,xR,xw))&(((((aElement0(esk21_0)|aReductOfIn0(xw,xv,xR))|xv=xw)&((aReductOfIn0(esk21_0,xv,xR)|aReductOfIn0(xw,xv,xR))|xv=xw))&((sdtmndtplgtdt0(esk21_0,xR,xw)|aReductOfIn0(xw,xv,xR))|xv=xw))&(sdtmndtplgtdt0(xv,xR,xw)|xv=xw)))&sdtmndtasgtdt0(xv,xR,xw)),inference(distribute,[status(thm)],[430])).
% cnf(442,plain,(aElement0(xw)),inference(split_conjunct,[status(thm)],[431])).
% fof(465, negated_conjecture,![X1]:(((~(aElement0(X1))|((((~(xw=X1)&~(aReductOfIn0(X1,xw,xR)))&![X2]:((~(aElement0(X2))|~(aReductOfIn0(X2,xw,xR)))|~(sdtmndtplgtdt0(X2,xR,X1))))&~(sdtmndtplgtdt0(xw,xR,X1)))&~(sdtmndtasgtdt0(xw,xR,X1))))|?[X2]:aReductOfIn0(X2,X1,xR))&~(aNormalFormOfIn0(X1,xw,xR))),inference(fof_nnf,[status(thm)],[24])).
% fof(466, negated_conjecture,![X3]:(((~(aElement0(X3))|((((~(xw=X3)&~(aReductOfIn0(X3,xw,xR)))&![X4]:((~(aElement0(X4))|~(aReductOfIn0(X4,xw,xR)))|~(sdtmndtplgtdt0(X4,xR,X3))))&~(sdtmndtplgtdt0(xw,xR,X3)))&~(sdtmndtasgtdt0(xw,xR,X3))))|?[X5]:aReductOfIn0(X5,X3,xR))&~(aNormalFormOfIn0(X3,xw,xR))),inference(variable_rename,[status(thm)],[465])).
% fof(467, negated_conjecture,![X3]:(((~(aElement0(X3))|((((~(xw=X3)&~(aReductOfIn0(X3,xw,xR)))&![X4]:((~(aElement0(X4))|~(aReductOfIn0(X4,xw,xR)))|~(sdtmndtplgtdt0(X4,xR,X3))))&~(sdtmndtplgtdt0(xw,xR,X3)))&~(sdtmndtasgtdt0(xw,xR,X3))))|aReductOfIn0(esk26_1(X3),X3,xR))&~(aNormalFormOfIn0(X3,xw,xR))),inference(skolemize,[status(esa)],[466])).
% fof(468, negated_conjecture,![X3]:![X4]:((((((((~(aElement0(X4))|~(aReductOfIn0(X4,xw,xR)))|~(sdtmndtplgtdt0(X4,xR,X3)))&(~(xw=X3)&~(aReductOfIn0(X3,xw,xR))))&~(sdtmndtplgtdt0(xw,xR,X3)))&~(sdtmndtasgtdt0(xw,xR,X3)))|~(aElement0(X3)))|aReductOfIn0(esk26_1(X3),X3,xR))&~(aNormalFormOfIn0(X3,xw,xR))),inference(shift_quantors,[status(thm)],[467])).
% fof(469, negated_conjecture,![X3]:![X4]:((((((((~(aElement0(X4))|~(aReductOfIn0(X4,xw,xR)))|~(sdtmndtplgtdt0(X4,xR,X3)))|~(aElement0(X3)))|aReductOfIn0(esk26_1(X3),X3,xR))&(((~(xw=X3)|~(aElement0(X3)))|aReductOfIn0(esk26_1(X3),X3,xR))&((~(aReductOfIn0(X3,xw,xR))|~(aElement0(X3)))|aReductOfIn0(esk26_1(X3),X3,xR))))&((~(sdtmndtplgtdt0(xw,xR,X3))|~(aElement0(X3)))|aReductOfIn0(esk26_1(X3),X3,xR)))&((~(sdtmndtasgtdt0(xw,xR,X3))|~(aElement0(X3)))|aReductOfIn0(esk26_1(X3),X3,xR)))&~(aNormalFormOfIn0(X3,xw,xR))),inference(distribute,[status(thm)],[468])).
% cnf(470,negated_conjecture,(~aNormalFormOfIn0(X1,xw,xR)),inference(split_conjunct,[status(thm)],[469])).
% cnf(862,negated_conjecture,(~isTerminating0(xR)|~aRewritingSystem0(xR)|~aElement0(xw)),inference(spm,[status(thm)],[470,92,theory(equality)])).
% cnf(866,negated_conjecture,($false|~aRewritingSystem0(xR)|~aElement0(xw)),inference(rw,[status(thm)],[862,99,theory(equality)])).
% cnf(867,negated_conjecture,($false|$false|~aElement0(xw)),inference(rw,[status(thm)],[866,93,theory(equality)])).
% cnf(868,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[867,442,theory(equality)])).
% cnf(869,negated_conjecture,($false),inference(cn,[status(thm)],[868,theory(equality)])).
% cnf(870,negated_conjecture,($false),869,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 70
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 70
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 106
% # ...of the previous two non-trivial : 83
% # Contextual simplify-reflections    : 1
% # Paramodulations                    : 104
% # Factorizations                     : 0
% # Equation resolutions               : 2
% # Current number of processed clauses: 69
% #    Positive orientable unit clauses: 17
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 51
% # Current number of unprocessed clauses: 386
% # ...number of literals in the above : 2957
% # Clause-clause subsumption calls (NU) : 37
% # Rec. Clause-clause subsumption calls : 26
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 3
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    94 leaves,   1.18+/-0.564 terms/leaf
% # Paramod-from index:           47 leaves,   1.13+/-0.334 terms/leaf
% # Paramod-into index:           78 leaves,   1.13+/-0.371 terms/leaf
% # -------------------------------------------------
% # User time              : 0.043 s
% # System time            : 0.005 s
% # Total time             : 0.048 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.25 WC
% FINAL PrfWatch: 0.17 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP8231/COM018+4.tptp
% 
%------------------------------------------------------------------------------