TSTP Solution File: NUM448+5 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM448+5 : 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 : Wed Dec 29 19:14:08 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP15917/NUM448+5.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15917/NUM448+5.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15917/NUM448+5.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 16013
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.026 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,aInteger0(sz10),file('/tmp/SRASS.s.p', mIntOne)).
% fof(3, axiom,![X1]:(aInteger0(X1)=>aInteger0(smndt0(X1))),file('/tmp/SRASS.s.p', mIntNeg)).
% fof(23, axiom,![X1]:(aInteger0(X1)=>(?[X2]:(aDivisorOf0(X2,X1)&isPrime0(X2))<=>(~(X1=sz10)&~(X1=smndt0(sz10))))),file('/tmp/SRASS.s.p', mPrimeDivisor)).
% fof(43, conjecture,(![X1]:(aInteger0(X1)=>(((?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2))|aElementOf0(X1,sbsmnsldt0(xS)))=>?[X2]:((((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1))&aDivisorOf0(X2,X1))&isPrime0(X2)))&(?[X2]:((((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1))|aDivisorOf0(X2,X1))&isPrime0(X2))=>(?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2))&aElementOf0(X1,sbsmnsldt0(xS))))))=>((aSet0(sbsmnsldt0(xS))&![X1]:(aElementOf0(X1,sbsmnsldt0(xS))<=>(aInteger0(X1)&?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2)))))=>((aSet0(stldt0(sbsmnsldt0(xS)))&![X1]:(aElementOf0(X1,stldt0(sbsmnsldt0(xS)))<=>(aInteger0(X1)&~(aElementOf0(X1,sbsmnsldt0(xS))))))=>(![X1]:(aElementOf0(X1,stldt0(sbsmnsldt0(xS)))<=>(X1=sz10|X1=smndt0(sz10)))|stldt0(sbsmnsldt0(xS))=cS2076)))),file('/tmp/SRASS.s.p', m__)).
% fof(44, negated_conjecture,~((![X1]:(aInteger0(X1)=>(((?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2))|aElementOf0(X1,sbsmnsldt0(xS)))=>?[X2]:((((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1))&aDivisorOf0(X2,X1))&isPrime0(X2)))&(?[X2]:((((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1))|aDivisorOf0(X2,X1))&isPrime0(X2))=>(?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2))&aElementOf0(X1,sbsmnsldt0(xS))))))=>((aSet0(sbsmnsldt0(xS))&![X1]:(aElementOf0(X1,sbsmnsldt0(xS))<=>(aInteger0(X1)&?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2)))))=>((aSet0(stldt0(sbsmnsldt0(xS)))&![X1]:(aElementOf0(X1,stldt0(sbsmnsldt0(xS)))<=>(aInteger0(X1)&~(aElementOf0(X1,sbsmnsldt0(xS))))))=>(![X1]:(aElementOf0(X1,stldt0(sbsmnsldt0(xS)))<=>(X1=sz10|X1=smndt0(sz10)))|stldt0(sbsmnsldt0(xS))=cS2076))))),inference(assume_negation,[status(cth)],[43])).
% fof(51, negated_conjecture,~((![X1]:(aInteger0(X1)=>(((?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2))|aElementOf0(X1,sbsmnsldt0(xS)))=>?[X2]:((((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1))&aDivisorOf0(X2,X1))&isPrime0(X2)))&(?[X2]:((((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1))|aDivisorOf0(X2,X1))&isPrime0(X2))=>(?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2))&aElementOf0(X1,sbsmnsldt0(xS))))))=>((aSet0(sbsmnsldt0(xS))&![X1]:(aElementOf0(X1,sbsmnsldt0(xS))<=>(aInteger0(X1)&?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2)))))=>((aSet0(stldt0(sbsmnsldt0(xS)))&![X1]:(aElementOf0(X1,stldt0(sbsmnsldt0(xS)))<=>(aInteger0(X1)&~(aElementOf0(X1,sbsmnsldt0(xS))))))=>(![X1]:(aElementOf0(X1,stldt0(sbsmnsldt0(xS)))<=>(X1=sz10|X1=smndt0(sz10)))|stldt0(sbsmnsldt0(xS))=cS2076))))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% cnf(53,plain,(aInteger0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% fof(54, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(55, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[54])).
% cnf(56,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(137, plain,![X1]:(~(aInteger0(X1))|((![X2]:(~(aDivisorOf0(X2,X1))|~(isPrime0(X2)))|(~(X1=sz10)&~(X1=smndt0(sz10))))&((X1=sz10|X1=smndt0(sz10))|?[X2]:(aDivisorOf0(X2,X1)&isPrime0(X2))))),inference(fof_nnf,[status(thm)],[23])).
% fof(138, plain,![X3]:(~(aInteger0(X3))|((![X4]:(~(aDivisorOf0(X4,X3))|~(isPrime0(X4)))|(~(X3=sz10)&~(X3=smndt0(sz10))))&((X3=sz10|X3=smndt0(sz10))|?[X5]:(aDivisorOf0(X5,X3)&isPrime0(X5))))),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X3]:(~(aInteger0(X3))|((![X4]:(~(aDivisorOf0(X4,X3))|~(isPrime0(X4)))|(~(X3=sz10)&~(X3=smndt0(sz10))))&((X3=sz10|X3=smndt0(sz10))|(aDivisorOf0(esk2_1(X3),X3)&isPrime0(esk2_1(X3)))))),inference(skolemize,[status(esa)],[138])).
% fof(140, plain,![X3]:![X4]:((((~(aDivisorOf0(X4,X3))|~(isPrime0(X4)))|(~(X3=sz10)&~(X3=smndt0(sz10))))&((X3=sz10|X3=smndt0(sz10))|(aDivisorOf0(esk2_1(X3),X3)&isPrime0(esk2_1(X3)))))|~(aInteger0(X3))),inference(shift_quantors,[status(thm)],[139])).
% fof(141, plain,![X3]:![X4]:((((~(X3=sz10)|(~(aDivisorOf0(X4,X3))|~(isPrime0(X4))))|~(aInteger0(X3)))&((~(X3=smndt0(sz10))|(~(aDivisorOf0(X4,X3))|~(isPrime0(X4))))|~(aInteger0(X3))))&(((aDivisorOf0(esk2_1(X3),X3)|(X3=sz10|X3=smndt0(sz10)))|~(aInteger0(X3)))&((isPrime0(esk2_1(X3))|(X3=sz10|X3=smndt0(sz10)))|~(aInteger0(X3))))),inference(distribute,[status(thm)],[140])).
% cnf(142,plain,(X1=smndt0(sz10)|X1=sz10|isPrime0(esk2_1(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[141])).
% cnf(143,plain,(X1=smndt0(sz10)|X1=sz10|aDivisorOf0(esk2_1(X1),X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[141])).
% cnf(144,plain,(~aInteger0(X1)|~isPrime0(X2)|~aDivisorOf0(X2,X1)|X1!=smndt0(sz10)),inference(split_conjunct,[status(thm)],[141])).
% cnf(145,plain,(~aInteger0(X1)|~isPrime0(X2)|~aDivisorOf0(X2,X1)|X1!=sz10),inference(split_conjunct,[status(thm)],[141])).
% fof(310, negated_conjecture,(![X1]:(~(aInteger0(X1))|(((![X2]:(~(aElementOf0(X2,xS))|~(aElementOf0(X1,X2)))&~(aElementOf0(X1,sbsmnsldt0(xS))))|?[X2]:((((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1))&aDivisorOf0(X2,X1))&isPrime0(X2)))&(![X2]:((((~(aInteger0(X2))|X2=sz00)|![X3]:(~(aInteger0(X3))|~(sdtasdt0(X2,X3)=X1)))&~(aDivisorOf0(X2,X1)))|~(isPrime0(X2)))|(?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2))&aElementOf0(X1,sbsmnsldt0(xS))))))&((aSet0(sbsmnsldt0(xS))&![X1]:((~(aElementOf0(X1,sbsmnsldt0(xS)))|(aInteger0(X1)&?[X2]:(aElementOf0(X2,xS)&aElementOf0(X1,X2))))&((~(aInteger0(X1))|![X2]:(~(aElementOf0(X2,xS))|~(aElementOf0(X1,X2))))|aElementOf0(X1,sbsmnsldt0(xS)))))&((aSet0(stldt0(sbsmnsldt0(xS)))&![X1]:((~(aElementOf0(X1,stldt0(sbsmnsldt0(xS))))|(aInteger0(X1)&~(aElementOf0(X1,sbsmnsldt0(xS)))))&((~(aInteger0(X1))|aElementOf0(X1,sbsmnsldt0(xS)))|aElementOf0(X1,stldt0(sbsmnsldt0(xS))))))&(?[X1]:((~(aElementOf0(X1,stldt0(sbsmnsldt0(xS))))|(~(X1=sz10)&~(X1=smndt0(sz10))))&(aElementOf0(X1,stldt0(sbsmnsldt0(xS)))|(X1=sz10|X1=smndt0(sz10))))&~(stldt0(sbsmnsldt0(xS))=cS2076))))),inference(fof_nnf,[status(thm)],[51])).
% fof(311, negated_conjecture,(![X4]:(~(aInteger0(X4))|(((![X5]:(~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5)))&~(aElementOf0(X4,sbsmnsldt0(xS))))|?[X6]:((((aInteger0(X6)&~(X6=sz00))&?[X7]:(aInteger0(X7)&sdtasdt0(X6,X7)=X4))&aDivisorOf0(X6,X4))&isPrime0(X6)))&(![X8]:((((~(aInteger0(X8))|X8=sz00)|![X9]:(~(aInteger0(X9))|~(sdtasdt0(X8,X9)=X4)))&~(aDivisorOf0(X8,X4)))|~(isPrime0(X8)))|(?[X10]:(aElementOf0(X10,xS)&aElementOf0(X4,X10))&aElementOf0(X4,sbsmnsldt0(xS))))))&((aSet0(sbsmnsldt0(xS))&![X11]:((~(aElementOf0(X11,sbsmnsldt0(xS)))|(aInteger0(X11)&?[X12]:(aElementOf0(X12,xS)&aElementOf0(X11,X12))))&((~(aInteger0(X11))|![X13]:(~(aElementOf0(X13,xS))|~(aElementOf0(X11,X13))))|aElementOf0(X11,sbsmnsldt0(xS)))))&((aSet0(stldt0(sbsmnsldt0(xS)))&![X14]:((~(aElementOf0(X14,stldt0(sbsmnsldt0(xS))))|(aInteger0(X14)&~(aElementOf0(X14,sbsmnsldt0(xS)))))&((~(aInteger0(X14))|aElementOf0(X14,sbsmnsldt0(xS)))|aElementOf0(X14,stldt0(sbsmnsldt0(xS))))))&(?[X15]:((~(aElementOf0(X15,stldt0(sbsmnsldt0(xS))))|(~(X15=sz10)&~(X15=smndt0(sz10))))&(aElementOf0(X15,stldt0(sbsmnsldt0(xS)))|(X15=sz10|X15=smndt0(sz10))))&~(stldt0(sbsmnsldt0(xS))=cS2076))))),inference(variable_rename,[status(thm)],[310])).
% fof(312, negated_conjecture,(![X4]:(~(aInteger0(X4))|(((![X5]:(~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5)))&~(aElementOf0(X4,sbsmnsldt0(xS))))|((((aInteger0(esk19_1(X4))&~(esk19_1(X4)=sz00))&(aInteger0(esk20_1(X4))&sdtasdt0(esk19_1(X4),esk20_1(X4))=X4))&aDivisorOf0(esk19_1(X4),X4))&isPrime0(esk19_1(X4))))&(![X8]:((((~(aInteger0(X8))|X8=sz00)|![X9]:(~(aInteger0(X9))|~(sdtasdt0(X8,X9)=X4)))&~(aDivisorOf0(X8,X4)))|~(isPrime0(X8)))|((aElementOf0(esk21_1(X4),xS)&aElementOf0(X4,esk21_1(X4)))&aElementOf0(X4,sbsmnsldt0(xS))))))&((aSet0(sbsmnsldt0(xS))&![X11]:((~(aElementOf0(X11,sbsmnsldt0(xS)))|(aInteger0(X11)&(aElementOf0(esk22_1(X11),xS)&aElementOf0(X11,esk22_1(X11)))))&((~(aInteger0(X11))|![X13]:(~(aElementOf0(X13,xS))|~(aElementOf0(X11,X13))))|aElementOf0(X11,sbsmnsldt0(xS)))))&((aSet0(stldt0(sbsmnsldt0(xS)))&![X14]:((~(aElementOf0(X14,stldt0(sbsmnsldt0(xS))))|(aInteger0(X14)&~(aElementOf0(X14,sbsmnsldt0(xS)))))&((~(aInteger0(X14))|aElementOf0(X14,sbsmnsldt0(xS)))|aElementOf0(X14,stldt0(sbsmnsldt0(xS))))))&(((~(aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS))))|(~(esk23_0=sz10)&~(esk23_0=smndt0(sz10))))&(aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))|(esk23_0=sz10|esk23_0=smndt0(sz10))))&~(stldt0(sbsmnsldt0(xS))=cS2076))))),inference(skolemize,[status(esa)],[311])).
% fof(313, negated_conjecture,![X4]:![X5]:![X8]:![X9]:![X11]:![X13]:![X14]:((((((~(aElementOf0(X14,stldt0(sbsmnsldt0(xS))))|(aInteger0(X14)&~(aElementOf0(X14,sbsmnsldt0(xS)))))&((~(aInteger0(X14))|aElementOf0(X14,sbsmnsldt0(xS)))|aElementOf0(X14,stldt0(sbsmnsldt0(xS)))))&aSet0(stldt0(sbsmnsldt0(xS))))&(((~(aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS))))|(~(esk23_0=sz10)&~(esk23_0=smndt0(sz10))))&(aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))|(esk23_0=sz10|esk23_0=smndt0(sz10))))&~(stldt0(sbsmnsldt0(xS))=cS2076)))&(((((~(aElementOf0(X13,xS))|~(aElementOf0(X11,X13)))|~(aInteger0(X11)))|aElementOf0(X11,sbsmnsldt0(xS)))&(~(aElementOf0(X11,sbsmnsldt0(xS)))|(aInteger0(X11)&(aElementOf0(esk22_1(X11),xS)&aElementOf0(X11,esk22_1(X11))))))&aSet0(sbsmnsldt0(xS))))&(((((((~(aInteger0(X9))|~(sdtasdt0(X8,X9)=X4))|(~(aInteger0(X8))|X8=sz00))&~(aDivisorOf0(X8,X4)))|~(isPrime0(X8)))|((aElementOf0(esk21_1(X4),xS)&aElementOf0(X4,esk21_1(X4)))&aElementOf0(X4,sbsmnsldt0(xS))))&(((~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5)))&~(aElementOf0(X4,sbsmnsldt0(xS))))|((((aInteger0(esk19_1(X4))&~(esk19_1(X4)=sz00))&(aInteger0(esk20_1(X4))&sdtasdt0(esk19_1(X4),esk20_1(X4))=X4))&aDivisorOf0(esk19_1(X4),X4))&isPrime0(esk19_1(X4)))))|~(aInteger0(X4)))),inference(shift_quantors,[status(thm)],[312])).
% fof(314, negated_conjecture,![X4]:![X5]:![X8]:![X9]:![X11]:![X13]:![X14]:(((((((aInteger0(X14)|~(aElementOf0(X14,stldt0(sbsmnsldt0(xS)))))&(~(aElementOf0(X14,sbsmnsldt0(xS)))|~(aElementOf0(X14,stldt0(sbsmnsldt0(xS))))))&((~(aInteger0(X14))|aElementOf0(X14,sbsmnsldt0(xS)))|aElementOf0(X14,stldt0(sbsmnsldt0(xS)))))&aSet0(stldt0(sbsmnsldt0(xS))))&((((~(esk23_0=sz10)|~(aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))))&(~(esk23_0=smndt0(sz10))|~(aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS))))))&(aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))|(esk23_0=sz10|esk23_0=smndt0(sz10))))&~(stldt0(sbsmnsldt0(xS))=cS2076)))&(((((~(aElementOf0(X13,xS))|~(aElementOf0(X11,X13)))|~(aInteger0(X11)))|aElementOf0(X11,sbsmnsldt0(xS)))&((aInteger0(X11)|~(aElementOf0(X11,sbsmnsldt0(xS))))&((aElementOf0(esk22_1(X11),xS)|~(aElementOf0(X11,sbsmnsldt0(xS))))&(aElementOf0(X11,esk22_1(X11))|~(aElementOf0(X11,sbsmnsldt0(xS)))))))&aSet0(sbsmnsldt0(xS))))&((((((aElementOf0(esk21_1(X4),xS)|(((~(aInteger0(X9))|~(sdtasdt0(X8,X9)=X4))|(~(aInteger0(X8))|X8=sz00))|~(isPrime0(X8))))|~(aInteger0(X4)))&((aElementOf0(X4,esk21_1(X4))|(((~(aInteger0(X9))|~(sdtasdt0(X8,X9)=X4))|(~(aInteger0(X8))|X8=sz00))|~(isPrime0(X8))))|~(aInteger0(X4))))&((aElementOf0(X4,sbsmnsldt0(xS))|(((~(aInteger0(X9))|~(sdtasdt0(X8,X9)=X4))|(~(aInteger0(X8))|X8=sz00))|~(isPrime0(X8))))|~(aInteger0(X4))))&((((aElementOf0(esk21_1(X4),xS)|(~(aDivisorOf0(X8,X4))|~(isPrime0(X8))))|~(aInteger0(X4)))&((aElementOf0(X4,esk21_1(X4))|(~(aDivisorOf0(X8,X4))|~(isPrime0(X8))))|~(aInteger0(X4))))&((aElementOf0(X4,sbsmnsldt0(xS))|(~(aDivisorOf0(X8,X4))|~(isPrime0(X8))))|~(aInteger0(X4)))))&(((((((aInteger0(esk19_1(X4))|(~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5))))|~(aInteger0(X4)))&((~(esk19_1(X4)=sz00)|(~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5))))|~(aInteger0(X4))))&(((aInteger0(esk20_1(X4))|(~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5))))|~(aInteger0(X4)))&((sdtasdt0(esk19_1(X4),esk20_1(X4))=X4|(~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5))))|~(aInteger0(X4)))))&((aDivisorOf0(esk19_1(X4),X4)|(~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5))))|~(aInteger0(X4))))&((isPrime0(esk19_1(X4))|(~(aElementOf0(X5,xS))|~(aElementOf0(X4,X5))))|~(aInteger0(X4))))&((((((aInteger0(esk19_1(X4))|~(aElementOf0(X4,sbsmnsldt0(xS))))|~(aInteger0(X4)))&((~(esk19_1(X4)=sz00)|~(aElementOf0(X4,sbsmnsldt0(xS))))|~(aInteger0(X4))))&(((aInteger0(esk20_1(X4))|~(aElementOf0(X4,sbsmnsldt0(xS))))|~(aInteger0(X4)))&((sdtasdt0(esk19_1(X4),esk20_1(X4))=X4|~(aElementOf0(X4,sbsmnsldt0(xS))))|~(aInteger0(X4)))))&((aDivisorOf0(esk19_1(X4),X4)|~(aElementOf0(X4,sbsmnsldt0(xS))))|~(aInteger0(X4))))&((isPrime0(esk19_1(X4))|~(aElementOf0(X4,sbsmnsldt0(xS))))|~(aInteger0(X4))))))),inference(distribute,[status(thm)],[313])).
% cnf(315,negated_conjecture,(isPrime0(esk19_1(X1))|~aInteger0(X1)|~aElementOf0(X1,sbsmnsldt0(xS))),inference(split_conjunct,[status(thm)],[314])).
% cnf(316,negated_conjecture,(aDivisorOf0(esk19_1(X1),X1)|~aInteger0(X1)|~aElementOf0(X1,sbsmnsldt0(xS))),inference(split_conjunct,[status(thm)],[314])).
% cnf(327,negated_conjecture,(aElementOf0(X1,sbsmnsldt0(xS))|~aInteger0(X1)|~isPrime0(X2)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[314])).
% cnf(336,negated_conjecture,(aInteger0(X1)|~aElementOf0(X1,sbsmnsldt0(xS))),inference(split_conjunct,[status(thm)],[314])).
% cnf(339,negated_conjecture,(esk23_0=smndt0(sz10)|esk23_0=sz10|aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))),inference(split_conjunct,[status(thm)],[314])).
% cnf(340,negated_conjecture,(~aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))|esk23_0!=smndt0(sz10)),inference(split_conjunct,[status(thm)],[314])).
% cnf(341,negated_conjecture,(~aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))|esk23_0!=sz10),inference(split_conjunct,[status(thm)],[314])).
% cnf(343,negated_conjecture,(aElementOf0(X1,stldt0(sbsmnsldt0(xS)))|aElementOf0(X1,sbsmnsldt0(xS))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[314])).
% cnf(344,negated_conjecture,(~aElementOf0(X1,stldt0(sbsmnsldt0(xS)))|~aElementOf0(X1,sbsmnsldt0(xS))),inference(split_conjunct,[status(thm)],[314])).
% cnf(345,negated_conjecture,(aInteger0(X1)|~aElementOf0(X1,stldt0(sbsmnsldt0(xS)))),inference(split_conjunct,[status(thm)],[314])).
% cnf(361,negated_conjecture,(aInteger0(esk23_0)|smndt0(sz10)=esk23_0|esk23_0=sz10),inference(spm,[status(thm)],[345,339,theory(equality)])).
% cnf(363,plain,(~isPrime0(X1)|~aDivisorOf0(X1,sz10)|~aInteger0(sz10)),inference(er,[status(thm)],[145,theory(equality)])).
% cnf(364,plain,(~isPrime0(X1)|~aDivisorOf0(X1,sz10)|$false),inference(rw,[status(thm)],[363,53,theory(equality)])).
% cnf(365,plain,(~isPrime0(X1)|~aDivisorOf0(X1,sz10)),inference(cn,[status(thm)],[364,theory(equality)])).
% cnf(373,negated_conjecture,(isPrime0(esk19_1(X1))|~aElementOf0(X1,sbsmnsldt0(xS))),inference(csr,[status(thm)],[315,336])).
% cnf(394,negated_conjecture,(aDivisorOf0(esk19_1(X1),X1)|~aElementOf0(X1,sbsmnsldt0(xS))),inference(csr,[status(thm)],[316,336])).
% cnf(395,negated_conjecture,(aElementOf0(X1,sbsmnsldt0(xS))|smndt0(sz10)=X1|sz10=X1|~isPrime0(esk2_1(X1))|~aInteger0(X1)),inference(spm,[status(thm)],[327,143,theory(equality)])).
% cnf(397,plain,(~isPrime0(X1)|~aDivisorOf0(X1,smndt0(sz10))|~aInteger0(smndt0(sz10))),inference(er,[status(thm)],[144,theory(equality)])).
% cnf(1216,plain,(~isPrime0(X1)|~aDivisorOf0(X1,smndt0(sz10))|~aInteger0(sz10)),inference(spm,[status(thm)],[397,56,theory(equality)])).
% cnf(1217,plain,(~isPrime0(X1)|~aDivisorOf0(X1,smndt0(sz10))|$false),inference(rw,[status(thm)],[1216,53,theory(equality)])).
% cnf(1218,plain,(~isPrime0(X1)|~aDivisorOf0(X1,smndt0(sz10))),inference(cn,[status(thm)],[1217,theory(equality)])).
% cnf(1219,negated_conjecture,(aInteger0(esk23_0)|esk23_0=sz10|~aInteger0(sz10)),inference(spm,[status(thm)],[56,361,theory(equality)])).
% cnf(1228,negated_conjecture,(aInteger0(esk23_0)|esk23_0=sz10|$false),inference(rw,[status(thm)],[1219,53,theory(equality)])).
% cnf(1229,negated_conjecture,(aInteger0(esk23_0)|esk23_0=sz10),inference(cn,[status(thm)],[1228,theory(equality)])).
% cnf(1427,negated_conjecture,(smndt0(sz10)=X1|sz10=X1|aElementOf0(X1,sbsmnsldt0(xS))|~aInteger0(X1)),inference(csr,[status(thm)],[395,142])).
% cnf(1438,negated_conjecture,(smndt0(sz10)=X1|sz10=X1|~aElementOf0(X1,stldt0(sbsmnsldt0(xS)))|~aInteger0(X1)),inference(spm,[status(thm)],[344,1427,theory(equality)])).
% cnf(1462,negated_conjecture,(smndt0(sz10)=X1|sz10=X1|~aElementOf0(X1,stldt0(sbsmnsldt0(xS)))),inference(csr,[status(thm)],[1438,345])).
% cnf(1463,negated_conjecture,(smndt0(sz10)=esk23_0|sz10=esk23_0),inference(spm,[status(thm)],[1462,339,theory(equality)])).
% cnf(1499,negated_conjecture,(esk23_0=sz10|~aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))),inference(spm,[status(thm)],[340,1463,theory(equality)])).
% cnf(1501,negated_conjecture,(esk23_0=sz10|~isPrime0(X1)|~aDivisorOf0(X1,esk23_0)),inference(spm,[status(thm)],[1218,1463,theory(equality)])).
% cnf(1510,negated_conjecture,(~aElementOf0(esk23_0,stldt0(sbsmnsldt0(xS)))),inference(csr,[status(thm)],[1499,341])).
% cnf(1511,negated_conjecture,(aElementOf0(esk23_0,sbsmnsldt0(xS))|~aInteger0(esk23_0)),inference(spm,[status(thm)],[1510,343,theory(equality)])).
% cnf(1512,negated_conjecture,(aElementOf0(esk23_0,sbsmnsldt0(xS))|esk23_0=sz10),inference(spm,[status(thm)],[1511,1229,theory(equality)])).
% cnf(1519,negated_conjecture,(isPrime0(esk19_1(esk23_0))|esk23_0=sz10),inference(spm,[status(thm)],[373,1512,theory(equality)])).
% cnf(1522,negated_conjecture,(aDivisorOf0(esk19_1(esk23_0),esk23_0)|esk23_0=sz10),inference(spm,[status(thm)],[394,1512,theory(equality)])).
% cnf(1555,negated_conjecture,(esk23_0=sz10|~isPrime0(esk19_1(esk23_0))),inference(spm,[status(thm)],[1501,1522,theory(equality)])).
% cnf(1558,negated_conjecture,(esk23_0=sz10),inference(csr,[status(thm)],[1555,1519])).
% cnf(1589,negated_conjecture,(aElementOf0(sz10,sbsmnsldt0(xS))|~aInteger0(esk23_0)),inference(rw,[status(thm)],[1511,1558,theory(equality)])).
% cnf(1590,negated_conjecture,(aElementOf0(sz10,sbsmnsldt0(xS))|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1589,1558,theory(equality)]),53,theory(equality)])).
% cnf(1591,negated_conjecture,(aElementOf0(sz10,sbsmnsldt0(xS))),inference(cn,[status(thm)],[1590,theory(equality)])).
% cnf(1595,negated_conjecture,(isPrime0(esk19_1(sz10))),inference(spm,[status(thm)],[373,1591,theory(equality)])).
% cnf(1598,negated_conjecture,(aDivisorOf0(esk19_1(sz10),sz10)),inference(spm,[status(thm)],[394,1591,theory(equality)])).
% cnf(1629,negated_conjecture,(~isPrime0(esk19_1(sz10))),inference(spm,[status(thm)],[365,1598,theory(equality)])).
% cnf(1647,negated_conjecture,($false),inference(rw,[status(thm)],[1629,1595,theory(equality)])).
% cnf(1648,negated_conjecture,($false),inference(cn,[status(thm)],[1647,theory(equality)])).
% cnf(1649,negated_conjecture,($false),1648,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 239
% # ...of these trivial : 3
% # ...subsumed : 14
% # ...remaining for further processing: 222
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 25
% # Generated clauses : 684
% # ...of the previous two non-trivial : 657
% # Contextual simplify-reflections : 22
% # Paramodulations : 638
% # Factorizations : 1
% # Equation resolutions : 45
% # Current number of processed clauses: 194
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 176
% # Current number of unprocessed clauses: 482
% # ...number of literals in the above : 2631
% # Clause-clause subsumption calls (NU) : 921
% # Rec. Clause-clause subsumption calls : 304
% # Unit Clause-clause subsumption calls : 22
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 209 leaves, 1.42+/-1.074 terms/leaf
% # Paramod-from index: 62 leaves, 1.05+/-0.215 terms/leaf
% # Paramod-into index: 125 leaves, 1.23+/-0.671 terms/leaf
% # -------------------------------------------------
% # User time : 0.073 s
% # System time : 0.005 s
% # Total time : 0.078 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.28 WC
% FINAL PrfWatch: 0.19 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP15917/NUM448+5.tptp
%
%------------------------------------------------------------------------------