TSTP Solution File: COM022+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM022+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Tue Dec 28 22:47:39 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP12284/COM022+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12284/COM022+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12284/COM022+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 12416
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(11, axiom,((aElement0(xa)&aElement0(xb))&aElement0(xc)),file('/tmp/SRASS.s.p', m__731)).
% fof(13, 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(19, conjecture,(((sdtmndtplgtdt0(xa,xR,xb)&sdtmndtplgtdt0(xa,xR,xc))=>?[X1]:(((aElement0(X1)&aReductOfIn0(X1,xa,xR))&sdtmndtasgtdt0(X1,xR,xb))&?[X2]:(((aElement0(X2)&aReductOfIn0(X2,xa,xR))&sdtmndtasgtdt0(X2,xR,xc))&?[X3]:(((aElement0(X3)&sdtmndtasgtdt0(X1,xR,X3))&sdtmndtasgtdt0(X2,xR,X3))&?[X4]:((aNormalFormOfIn0(X4,X3,xR)&sdtmndtasgtdt0(xb,xR,X4))&sdtmndtasgtdt0(xc,xR,X4))))))=>((sdtmndtasgtdt0(xa,xR,xb)&sdtmndtasgtdt0(xa,xR,xc))=>?[X1]:((aElement0(X1)&sdtmndtasgtdt0(xb,xR,X1))&sdtmndtasgtdt0(xc,xR,X1)))),file('/tmp/SRASS.s.p', m__)).
% fof(20, negated_conjecture,~((((sdtmndtplgtdt0(xa,xR,xb)&sdtmndtplgtdt0(xa,xR,xc))=>?[X1]:(((aElement0(X1)&aReductOfIn0(X1,xa,xR))&sdtmndtasgtdt0(X1,xR,xb))&?[X2]:(((aElement0(X2)&aReductOfIn0(X2,xa,xR))&sdtmndtasgtdt0(X2,xR,xc))&?[X3]:(((aElement0(X3)&sdtmndtasgtdt0(X1,xR,X3))&sdtmndtasgtdt0(X2,xR,X3))&?[X4]:((aNormalFormOfIn0(X4,X3,xR)&sdtmndtasgtdt0(xb,xR,X4))&sdtmndtasgtdt0(xc,xR,X4))))))=>((sdtmndtasgtdt0(xa,xR,xb)&sdtmndtasgtdt0(xa,xR,xc))=>?[X1]:((aElement0(X1)&sdtmndtasgtdt0(xb,xR,X1))&sdtmndtasgtdt0(xc,xR,X1))))),inference(assume_negation,[status(cth)],[19])).
% fof(69, 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(70, 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)],[69])).
% fof(71, 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)],[70])).
% fof(72, 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)],[71])).
% fof(73, 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)],[72])).
% cnf(76,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aNormalFormOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[73])).
% cnf(83,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[9])).
% cnf(86,plain,(aElement0(xc)),inference(split_conjunct,[status(thm)],[11])).
% cnf(87,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[11])).
% cnf(88,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[11])).
% fof(96, 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)],[13])).
% fof(97, 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)],[96])).
% fof(98, 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)],[97])).
% cnf(100,plain,(sdtmndtasgtdt0(X3,X2,X1)|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|X3!=X1),inference(split_conjunct,[status(thm)],[98])).
% cnf(101,plain,(sdtmndtplgtdt0(X3,X2,X1)|X3=X1|~aElement0(X1)|~aRewritingSystem0(X2)|~aElement0(X3)|~sdtmndtasgtdt0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(124, negated_conjecture,(((~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))|?[X1]:(((aElement0(X1)&aReductOfIn0(X1,xa,xR))&sdtmndtasgtdt0(X1,xR,xb))&?[X2]:(((aElement0(X2)&aReductOfIn0(X2,xa,xR))&sdtmndtasgtdt0(X2,xR,xc))&?[X3]:(((aElement0(X3)&sdtmndtasgtdt0(X1,xR,X3))&sdtmndtasgtdt0(X2,xR,X3))&?[X4]:((aNormalFormOfIn0(X4,X3,xR)&sdtmndtasgtdt0(xb,xR,X4))&sdtmndtasgtdt0(xc,xR,X4))))))&((sdtmndtasgtdt0(xa,xR,xb)&sdtmndtasgtdt0(xa,xR,xc))&![X1]:((~(aElement0(X1))|~(sdtmndtasgtdt0(xb,xR,X1)))|~(sdtmndtasgtdt0(xc,xR,X1))))),inference(fof_nnf,[status(thm)],[20])).
% fof(125, negated_conjecture,(((~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))|?[X5]:(((aElement0(X5)&aReductOfIn0(X5,xa,xR))&sdtmndtasgtdt0(X5,xR,xb))&?[X6]:(((aElement0(X6)&aReductOfIn0(X6,xa,xR))&sdtmndtasgtdt0(X6,xR,xc))&?[X7]:(((aElement0(X7)&sdtmndtasgtdt0(X5,xR,X7))&sdtmndtasgtdt0(X6,xR,X7))&?[X8]:((aNormalFormOfIn0(X8,X7,xR)&sdtmndtasgtdt0(xb,xR,X8))&sdtmndtasgtdt0(xc,xR,X8))))))&((sdtmndtasgtdt0(xa,xR,xb)&sdtmndtasgtdt0(xa,xR,xc))&![X9]:((~(aElement0(X9))|~(sdtmndtasgtdt0(xb,xR,X9)))|~(sdtmndtasgtdt0(xc,xR,X9))))),inference(variable_rename,[status(thm)],[124])).
% fof(126, negated_conjecture,(((~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))|(((aElement0(esk15_0)&aReductOfIn0(esk15_0,xa,xR))&sdtmndtasgtdt0(esk15_0,xR,xb))&(((aElement0(esk16_0)&aReductOfIn0(esk16_0,xa,xR))&sdtmndtasgtdt0(esk16_0,xR,xc))&(((aElement0(esk17_0)&sdtmndtasgtdt0(esk15_0,xR,esk17_0))&sdtmndtasgtdt0(esk16_0,xR,esk17_0))&((aNormalFormOfIn0(esk18_0,esk17_0,xR)&sdtmndtasgtdt0(xb,xR,esk18_0))&sdtmndtasgtdt0(xc,xR,esk18_0))))))&((sdtmndtasgtdt0(xa,xR,xb)&sdtmndtasgtdt0(xa,xR,xc))&![X9]:((~(aElement0(X9))|~(sdtmndtasgtdt0(xb,xR,X9)))|~(sdtmndtasgtdt0(xc,xR,X9))))),inference(skolemize,[status(esa)],[125])).
% fof(127, negated_conjecture,![X9]:((((~(aElement0(X9))|~(sdtmndtasgtdt0(xb,xR,X9)))|~(sdtmndtasgtdt0(xc,xR,X9)))&(sdtmndtasgtdt0(xa,xR,xb)&sdtmndtasgtdt0(xa,xR,xc)))&((~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))|(((aElement0(esk15_0)&aReductOfIn0(esk15_0,xa,xR))&sdtmndtasgtdt0(esk15_0,xR,xb))&(((aElement0(esk16_0)&aReductOfIn0(esk16_0,xa,xR))&sdtmndtasgtdt0(esk16_0,xR,xc))&(((aElement0(esk17_0)&sdtmndtasgtdt0(esk15_0,xR,esk17_0))&sdtmndtasgtdt0(esk16_0,xR,esk17_0))&((aNormalFormOfIn0(esk18_0,esk17_0,xR)&sdtmndtasgtdt0(xb,xR,esk18_0))&sdtmndtasgtdt0(xc,xR,esk18_0))))))),inference(shift_quantors,[status(thm)],[126])).
% fof(128, negated_conjecture,![X9]:((((~(aElement0(X9))|~(sdtmndtasgtdt0(xb,xR,X9)))|~(sdtmndtasgtdt0(xc,xR,X9)))&(sdtmndtasgtdt0(xa,xR,xb)&sdtmndtasgtdt0(xa,xR,xc)))&((((aElement0(esk15_0)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc))))&(aReductOfIn0(esk15_0,xa,xR)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))))&(sdtmndtasgtdt0(esk15_0,xR,xb)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))))&((((aElement0(esk16_0)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc))))&(aReductOfIn0(esk16_0,xa,xR)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))))&(sdtmndtasgtdt0(esk16_0,xR,xc)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))))&((((aElement0(esk17_0)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc))))&(sdtmndtasgtdt0(esk15_0,xR,esk17_0)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))))&(sdtmndtasgtdt0(esk16_0,xR,esk17_0)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))))&(((aNormalFormOfIn0(esk18_0,esk17_0,xR)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc))))&(sdtmndtasgtdt0(xb,xR,esk18_0)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc)))))&(sdtmndtasgtdt0(xc,xR,esk18_0)|(~(sdtmndtplgtdt0(xa,xR,xb))|~(sdtmndtplgtdt0(xa,xR,xc))))))))),inference(distribute,[status(thm)],[127])).
% cnf(129,negated_conjecture,(sdtmndtasgtdt0(xc,xR,esk18_0)|~sdtmndtplgtdt0(xa,xR,xc)|~sdtmndtplgtdt0(xa,xR,xb)),inference(split_conjunct,[status(thm)],[128])).
% cnf(130,negated_conjecture,(sdtmndtasgtdt0(xb,xR,esk18_0)|~sdtmndtplgtdt0(xa,xR,xc)|~sdtmndtplgtdt0(xa,xR,xb)),inference(split_conjunct,[status(thm)],[128])).
% cnf(131,negated_conjecture,(aNormalFormOfIn0(esk18_0,esk17_0,xR)|~sdtmndtplgtdt0(xa,xR,xc)|~sdtmndtplgtdt0(xa,xR,xb)),inference(split_conjunct,[status(thm)],[128])).
% cnf(134,negated_conjecture,(aElement0(esk17_0)|~sdtmndtplgtdt0(xa,xR,xc)|~sdtmndtplgtdt0(xa,xR,xb)),inference(split_conjunct,[status(thm)],[128])).
% cnf(141,negated_conjecture,(sdtmndtasgtdt0(xa,xR,xc)),inference(split_conjunct,[status(thm)],[128])).
% cnf(142,negated_conjecture,(sdtmndtasgtdt0(xa,xR,xb)),inference(split_conjunct,[status(thm)],[128])).
% cnf(143,negated_conjecture,(~sdtmndtasgtdt0(xc,xR,X1)|~sdtmndtasgtdt0(xb,xR,X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[128])).
% cnf(150,plain,(sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1)),inference(er,[status(thm)],[100,theory(equality)])).
% cnf(154,negated_conjecture,(xb=xa|sdtmndtplgtdt0(xa,xR,xb)|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xb)),inference(spm,[status(thm)],[101,142,theory(equality)])).
% cnf(155,negated_conjecture,(xc=xa|sdtmndtplgtdt0(xa,xR,xc)|~aRewritingSystem0(xR)|~aElement0(xa)|~aElement0(xc)),inference(spm,[status(thm)],[101,141,theory(equality)])).
% cnf(156,negated_conjecture,(xb=xa|sdtmndtplgtdt0(xa,xR,xb)|$false|~aElement0(xa)|~aElement0(xb)),inference(rw,[status(thm)],[154,83,theory(equality)])).
% cnf(157,negated_conjecture,(xb=xa|sdtmndtplgtdt0(xa,xR,xb)|$false|$false|~aElement0(xb)),inference(rw,[status(thm)],[156,88,theory(equality)])).
% cnf(158,negated_conjecture,(xb=xa|sdtmndtplgtdt0(xa,xR,xb)|$false|$false|$false),inference(rw,[status(thm)],[157,87,theory(equality)])).
% cnf(159,negated_conjecture,(xb=xa|sdtmndtplgtdt0(xa,xR,xb)),inference(cn,[status(thm)],[158,theory(equality)])).
% cnf(160,negated_conjecture,(xc=xa|sdtmndtplgtdt0(xa,xR,xc)|$false|~aElement0(xa)|~aElement0(xc)),inference(rw,[status(thm)],[155,83,theory(equality)])).
% cnf(161,negated_conjecture,(xc=xa|sdtmndtplgtdt0(xa,xR,xc)|$false|$false|~aElement0(xc)),inference(rw,[status(thm)],[160,88,theory(equality)])).
% cnf(162,negated_conjecture,(xc=xa|sdtmndtplgtdt0(xa,xR,xc)|$false|$false|$false),inference(rw,[status(thm)],[161,86,theory(equality)])).
% cnf(163,negated_conjecture,(xc=xa|sdtmndtplgtdt0(xa,xR,xc)),inference(cn,[status(thm)],[162,theory(equality)])).
% cnf(250,negated_conjecture,(~sdtmndtasgtdt0(xc,xR,xb)|~aElement0(xb)|~aRewritingSystem0(xR)),inference(spm,[status(thm)],[143,150,theory(equality)])).
% cnf(256,negated_conjecture,(~sdtmndtasgtdt0(xc,xR,xb)|$false|~aRewritingSystem0(xR)),inference(rw,[status(thm)],[250,87,theory(equality)])).
% cnf(257,negated_conjecture,(~sdtmndtasgtdt0(xc,xR,xb)|$false|$false),inference(rw,[status(thm)],[256,83,theory(equality)])).
% cnf(258,negated_conjecture,(~sdtmndtasgtdt0(xc,xR,xb)),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(286,negated_conjecture,(aElement0(esk17_0)|xb=xa|~sdtmndtplgtdt0(xa,xR,xc)),inference(spm,[status(thm)],[134,159,theory(equality)])).
% cnf(289,negated_conjecture,(sdtmndtasgtdt0(xb,xR,esk18_0)|xb=xa|~sdtmndtplgtdt0(xa,xR,xc)),inference(spm,[status(thm)],[130,159,theory(equality)])).
% cnf(290,negated_conjecture,(sdtmndtasgtdt0(xc,xR,esk18_0)|xb=xa|~sdtmndtplgtdt0(xa,xR,xc)),inference(spm,[status(thm)],[129,159,theory(equality)])).
% cnf(295,negated_conjecture,(aNormalFormOfIn0(esk18_0,esk17_0,xR)|xb=xa|~sdtmndtplgtdt0(xa,xR,xc)),inference(spm,[status(thm)],[131,159,theory(equality)])).
% cnf(513,negated_conjecture,(xb=xa|aElement0(esk17_0)|xc=xa),inference(spm,[status(thm)],[286,163,theory(equality)])).
% cnf(709,negated_conjecture,(xb=xa|sdtmndtasgtdt0(xb,xR,esk18_0)|xc=xa),inference(spm,[status(thm)],[289,163,theory(equality)])).
% cnf(710,negated_conjecture,(xb=xa|sdtmndtasgtdt0(xc,xR,esk18_0)|xc=xa),inference(spm,[status(thm)],[290,163,theory(equality)])).
% cnf(715,negated_conjecture,(xb=xa|aNormalFormOfIn0(esk18_0,esk17_0,xR)|xc=xa),inference(spm,[status(thm)],[295,163,theory(equality)])).
% cnf(751,negated_conjecture,(xc=xa|xb=xa|~sdtmndtasgtdt0(xc,xR,esk18_0)|~aElement0(esk18_0)),inference(spm,[status(thm)],[143,709,theory(equality)])).
% cnf(907,negated_conjecture,(aElement0(esk18_0)|xc=xa|xb=xa|~aRewritingSystem0(xR)|~aElement0(esk17_0)),inference(spm,[status(thm)],[76,715,theory(equality)])).
% cnf(910,negated_conjecture,(aElement0(esk18_0)|xc=xa|xb=xa|$false|~aElement0(esk17_0)),inference(rw,[status(thm)],[907,83,theory(equality)])).
% cnf(911,negated_conjecture,(aElement0(esk18_0)|xc=xa|xb=xa|~aElement0(esk17_0)),inference(cn,[status(thm)],[910,theory(equality)])).
% cnf(941,negated_conjecture,(xc=xa|xb=xa|aElement0(esk18_0)),inference(csr,[status(thm)],[911,513])).
% cnf(1023,negated_conjecture,(xc=xa|xb=xa|~sdtmndtasgtdt0(xc,xR,esk18_0)),inference(csr,[status(thm)],[751,941])).
% cnf(1024,negated_conjecture,(xc=xa|xb=xa),inference(csr,[status(thm)],[1023,710])).
% cnf(1028,negated_conjecture,(xb=xa|~sdtmndtasgtdt0(xa,xR,xb)),inference(spm,[status(thm)],[258,1024,theory(equality)])).
% cnf(1044,negated_conjecture,(xb=xa|$false),inference(rw,[status(thm)],[1028,142,theory(equality)])).
% cnf(1045,negated_conjecture,(xb=xa),inference(cn,[status(thm)],[1044,theory(equality)])).
% cnf(1097,negated_conjecture,(~sdtmndtasgtdt0(xa,xR,X1)|~sdtmndtasgtdt0(xc,xR,X1)|~aElement0(X1)),inference(rw,[status(thm)],[143,1045,theory(equality)])).
% cnf(1167,negated_conjecture,(~sdtmndtasgtdt0(xc,xR,xc)|~aElement0(xc)),inference(spm,[status(thm)],[1097,141,theory(equality)])).
% cnf(1176,negated_conjecture,(~sdtmndtasgtdt0(xc,xR,xc)|$false),inference(rw,[status(thm)],[1167,86,theory(equality)])).
% cnf(1177,negated_conjecture,(~sdtmndtasgtdt0(xc,xR,xc)),inference(cn,[status(thm)],[1176,theory(equality)])).
% cnf(1180,negated_conjecture,(~aRewritingSystem0(xR)|~aElement0(xc)),inference(spm,[status(thm)],[1177,150,theory(equality)])).
% cnf(1181,negated_conjecture,($false|~aElement0(xc)),inference(rw,[status(thm)],[1180,83,theory(equality)])).
% cnf(1182,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1181,86,theory(equality)])).
% cnf(1183,negated_conjecture,($false),inference(cn,[status(thm)],[1182,theory(equality)])).
% cnf(1184,negated_conjecture,($false),1183,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 159
% # ...of these trivial : 0
% # ...subsumed : 9
% # ...remaining for further processing: 150
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 21
% # Backward-rewritten : 41
% # Generated clauses : 330
% # ...of the previous two non-trivial : 326
% # Contextual simplify-reflections : 32
% # Paramodulations : 329
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 87
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 77
% # Current number of unprocessed clauses: 98
% # ...number of literals in the above : 515
% # Clause-clause subsumption calls (NU) : 193
% # Rec. Clause-clause subsumption calls : 121
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 96 leaves, 1.75+/-1.762 terms/leaf
% # Paramod-from index: 33 leaves, 1.21+/-0.409 terms/leaf
% # Paramod-into index: 62 leaves, 1.44+/-1.087 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.004 s
% # Total time : 0.040 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP12284/COM022+1.tptp
%
%------------------------------------------------------------------------------