TSTP Solution File: NUM494+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM494+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:24 EDT 2023
% Result : Theorem 1.00s 0.64s
% Output : CNFRefutation 1.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 64 ( 18 unt; 0 def)
% Number of atoms : 255 ( 100 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 303 ( 112 ~; 125 |; 53 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn; 37 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp)
& ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sdtpldt0(sdtpldt0(xr,xm),xp),X1) = sdtpldt0(sdtpldt0(xn,xm),xp) )
| sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',m__) ).
fof(mPrimDiv,axiom,
! [X1] :
( ( aNaturalNumber0(X1)
& X1 != sz00
& X1 != sz10 )
=> ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& isPrime0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mPrimDiv) ).
fof(m__1860,hypothesis,
( xp != sz00
& xp != sz10
& ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xp = sdtasdt0(X1,X2) )
| doDivides0(X1,xp) ) )
=> ( X1 = sz10
| X1 = xp ) )
& isPrime0(xp)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(xn,xm) = sdtasdt0(xp,X1) )
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',m__1860) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mAddComm) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mDefPrime) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',m__1837) ).
fof(m__1883,hypothesis,
( aNaturalNumber0(xr)
& sdtpldt0(xp,xr) = xn
& xr = sdtmndt0(xn,xp) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',m__1883) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mAddAsso) ).
fof(mAddCanc,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtpldt0(X1,X2) = sdtpldt0(X1,X3)
| sdtpldt0(X2,X1) = sdtpldt0(X3,X1) )
=> X2 = X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mAddCanc) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mSortsC_01) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mSortsB) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',m_AddZero) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p',mSortsC) ).
fof(c_0_14,negated_conjecture,
~ ( sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp)
& ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(sdtpldt0(sdtpldt0(xr,xm),xp),X1) = sdtpldt0(sdtpldt0(xn,xm),xp) )
| sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_15,plain,
! [X86] :
( ( aNaturalNumber0(esk4_1(X86))
| ~ aNaturalNumber0(X86)
| X86 = sz00
| X86 = sz10 )
& ( doDivides0(esk4_1(X86),X86)
| ~ aNaturalNumber0(X86)
| X86 = sz00
| X86 = sz10 )
& ( isPrime0(esk4_1(X86))
| ~ aNaturalNumber0(X86)
| X86 = sz00
| X86 = sz10 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mPrimDiv])])])]) ).
fof(c_0_16,hypothesis,
! [X96,X97] :
( xp != sz00
& xp != sz10
& ( ~ aNaturalNumber0(X97)
| xp != sdtasdt0(X96,X97)
| ~ aNaturalNumber0(X96)
| X96 = sz10
| X96 = xp )
& ( ~ doDivides0(X96,xp)
| ~ aNaturalNumber0(X96)
| X96 = sz10
| X96 = xp )
& isPrime0(xp)
& aNaturalNumber0(esk9_0)
& sdtasdt0(xn,xm) = sdtasdt0(xp,esk9_0)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1860])])])])]) ).
fof(c_0_17,negated_conjecture,
! [X102] :
( ( ~ aNaturalNumber0(X102)
| sdtpldt0(sdtpldt0(sdtpldt0(xr,xm),xp),X102) != sdtpldt0(sdtpldt0(xn,xm),xp)
| sdtpldt0(sdtpldt0(xr,xm),xp) = sdtpldt0(sdtpldt0(xn,xm),xp) )
& ( ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| sdtpldt0(sdtpldt0(xr,xm),xp) = sdtpldt0(sdtpldt0(xn,xm),xp) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_18,plain,
! [X10,X11] :
( ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X11)
| sdtpldt0(X10,X11) = sdtpldt0(X11,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).
fof(c_0_19,plain,
! [X83,X84] :
( ( X83 != sz00
| ~ isPrime0(X83)
| ~ aNaturalNumber0(X83) )
& ( X83 != sz10
| ~ isPrime0(X83)
| ~ aNaturalNumber0(X83) )
& ( ~ aNaturalNumber0(X84)
| ~ doDivides0(X84,X83)
| X84 = sz10
| X84 = X83
| ~ isPrime0(X83)
| ~ aNaturalNumber0(X83) )
& ( aNaturalNumber0(esk3_1(X83))
| X83 = sz00
| X83 = sz10
| isPrime0(X83)
| ~ aNaturalNumber0(X83) )
& ( doDivides0(esk3_1(X83),X83)
| X83 = sz00
| X83 = sz10
| isPrime0(X83)
| ~ aNaturalNumber0(X83) )
& ( esk3_1(X83) != sz10
| X83 = sz00
| X83 = sz10
| isPrime0(X83)
| ~ aNaturalNumber0(X83) )
& ( esk3_1(X83) != X83
| X83 = sz00
| X83 = sz10
| isPrime0(X83)
| ~ aNaturalNumber0(X83) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrime])])])])]) ).
cnf(c_0_20,plain,
( doDivides0(esk4_1(X1),X1)
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_22,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,hypothesis,
xp != sz10,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( aNaturalNumber0(esk4_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( sdtpldt0(sdtpldt0(xr,xm),xp) = sdtpldt0(sdtpldt0(xn,xm),xp)
| ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_28,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_29,plain,
! [X12,X13,X14] :
( ~ aNaturalNumber0(X12)
| ~ aNaturalNumber0(X13)
| ~ aNaturalNumber0(X14)
| sdtpldt0(sdtpldt0(X12,X13),X14) = sdtpldt0(X12,sdtpldt0(X13,X14)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
fof(c_0_30,plain,
! [X26,X27,X28] :
( ( sdtpldt0(X26,X27) != sdtpldt0(X26,X28)
| X27 = X28
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X27)
| ~ aNaturalNumber0(X28) )
& ( sdtpldt0(X27,X26) != sdtpldt0(X28,X26)
| X27 = X28
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X27)
| ~ aNaturalNumber0(X28) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddCanc])])]) ).
cnf(c_0_31,plain,
( isPrime0(esk4_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,plain,
( X1 = sz10
| X1 = X2
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,hypothesis,
doDivides0(esk4_1(xp),xp),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_34,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(esk4_1(xp)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_36,plain,
( X1 != sz10
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_37,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_38,negated_conjecture,
( sdtpldt0(sdtpldt0(xm,xr),xp) = sdtpldt0(sdtpldt0(xn,xm),xp)
| ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xm,xr),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_39,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( X2 = X3
| sdtpldt0(X1,X2) != sdtpldt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,hypothesis,
isPrime0(esk4_1(xp)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_42,hypothesis,
( esk4_1(xp) = xp
| esk4_1(xp) = sz10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_21]),c_0_35])]) ).
cnf(c_0_43,plain,
~ isPrime0(sz10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
( sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(xm,sdtpldt0(xr,xp))
| ~ sdtlseqdt0(sdtpldt0(xm,sdtpldt0(xr,xp)),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_21]),c_0_27]),c_0_28])]) ).
cnf(c_0_45,hypothesis,
sdtpldt0(xp,xr) = xn,
inference(split_conjunct,[status(thm)],[m__1883]) ).
fof(c_0_46,plain,
! [X36,X37,X39] :
( ( aNaturalNumber0(esk1_2(X36,X37))
| ~ sdtlseqdt0(X36,X37)
| ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X37) )
& ( sdtpldt0(X36,esk1_2(X36,X37)) = X37
| ~ sdtlseqdt0(X36,X37)
| ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X37) )
& ( ~ aNaturalNumber0(X39)
| sdtpldt0(X36,X39) != X37
| sdtlseqdt0(X36,X37)
| ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X37) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefLE])])])])]) ).
fof(c_0_47,plain,
! [X6,X7] :
( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7)
| aNaturalNumber0(sdtpldt0(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_48,hypothesis,
( X1 = esk4_1(xp)
| sdtpldt0(X2,X1) != sdtpldt0(X2,esk4_1(xp))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_35]) ).
cnf(c_0_49,hypothesis,
esk4_1(xp) = xp,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
fof(c_0_50,plain,
! [X15] :
( ( sdtpldt0(X15,sz00) = X15
| ~ aNaturalNumber0(X15) )
& ( X15 = sdtpldt0(sz00,X15)
| ~ aNaturalNumber0(X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
cnf(c_0_51,negated_conjecture,
( sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(xm,xn)
| ~ sdtlseqdt0(sdtpldt0(xm,xn),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_26]),c_0_45]),c_0_45]),c_0_21]),c_0_27])]) ).
cnf(c_0_52,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_53,plain,
( sdtlseqdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,hypothesis,
( X1 = xp
| sdtpldt0(X2,X1) != sdtpldt0(X2,xp)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_49]) ).
cnf(c_0_56,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_57,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_58,negated_conjecture,
( sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(xn,xm)
| ~ sdtlseqdt0(sdtpldt0(xn,xm),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_26]),c_0_52]),c_0_28])]) ).
cnf(c_0_59,plain,
( sdtlseqdt0(X1,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_53]),c_0_54]) ).
cnf(c_0_60,hypothesis,
( sdtpldt0(X1,xp) != X1
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),c_0_22]) ).
cnf(c_0_61,negated_conjecture,
( sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(xn,xm)
| ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_21])]) ).
cnf(c_0_62,negated_conjecture,
~ aNaturalNumber0(sdtpldt0(xn,xm)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_54]),c_0_28]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM494+3 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 14:24:09 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.23/0.51 Running first-order model finding
% 0.23/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.9vl4yz2Hgg/E---3.1_24556.p
% 1.00/0.64 # Version: 3.1pre001
% 1.00/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.00/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.00/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.00/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.00/0.64 # Starting sh5l with 300s (1) cores
% 1.00/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 24633 completed with status 0
% 1.00/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.00/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.00/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.00/0.64 # No SInE strategy applied
% 1.00/0.64 # Search class: FGHSF-FSLM32-MFFFFFNN
% 1.00/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.00/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 1.00/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.00/0.64 # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 1.00/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 1.00/0.64 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.64 # G-E--_208_C18_F1_SE_CS_SP_PS_S0U with pid 24643 completed with status 0
% 1.00/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S0U
% 1.00/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.00/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.00/0.64 # No SInE strategy applied
% 1.00/0.64 # Search class: FGHSF-FSLM32-MFFFFFNN
% 1.00/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.00/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 1.00/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.00/0.64 # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 1.00/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 1.00/0.64 # Preprocessing time : 0.005 s
% 1.00/0.64 # Presaturation interreduction done
% 1.00/0.64
% 1.00/0.64 # Proof found!
% 1.00/0.64 # SZS status Theorem
% 1.00/0.64 # SZS output start CNFRefutation
% See solution above
% 1.00/0.64 # Parsed axioms : 46
% 1.00/0.64 # Removed by relevancy pruning/SinE : 0
% 1.00/0.64 # Initial clauses : 222
% 1.00/0.64 # Removed in clause preprocessing : 3
% 1.00/0.64 # Initial clauses in saturation : 219
% 1.00/0.64 # Processed clauses : 518
% 1.00/0.64 # ...of these trivial : 5
% 1.00/0.64 # ...subsumed : 78
% 1.00/0.64 # ...remaining for further processing : 435
% 1.00/0.64 # Other redundant clauses eliminated : 31
% 1.00/0.64 # Clauses deleted for lack of memory : 0
% 1.00/0.64 # Backward-subsumed : 15
% 1.00/0.64 # Backward-rewritten : 26
% 1.00/0.64 # Generated clauses : 1033
% 1.00/0.64 # ...of the previous two non-redundant : 869
% 1.00/0.64 # ...aggressively subsumed : 0
% 1.00/0.64 # Contextual simplify-reflections : 6
% 1.00/0.64 # Paramodulations : 998
% 1.00/0.64 # Factorizations : 1
% 1.00/0.64 # NegExts : 0
% 1.00/0.64 # Equation resolutions : 34
% 1.00/0.64 # Total rewrite steps : 970
% 1.00/0.64 # Propositional unsat checks : 0
% 1.00/0.64 # Propositional check models : 0
% 1.00/0.64 # Propositional check unsatisfiable : 0
% 1.00/0.64 # Propositional clauses : 0
% 1.00/0.64 # Propositional clauses after purity: 0
% 1.00/0.64 # Propositional unsat core size : 0
% 1.00/0.64 # Propositional preprocessing time : 0.000
% 1.00/0.64 # Propositional encoding time : 0.000
% 1.00/0.64 # Propositional solver time : 0.000
% 1.00/0.64 # Success case prop preproc time : 0.000
% 1.00/0.64 # Success case prop encoding time : 0.000
% 1.00/0.64 # Success case prop solver time : 0.000
% 1.00/0.64 # Current number of processed clauses : 169
% 1.00/0.64 # Positive orientable unit clauses : 38
% 1.00/0.64 # Positive unorientable unit clauses: 0
% 1.00/0.64 # Negative unit clauses : 13
% 1.00/0.64 # Non-unit-clauses : 118
% 1.00/0.64 # Current number of unprocessed clauses: 759
% 1.00/0.64 # ...number of literals in the above : 3917
% 1.00/0.64 # Current number of archived formulas : 0
% 1.00/0.64 # Current number of archived clauses : 255
% 1.00/0.64 # Clause-clause subsumption calls (NU) : 30646
% 1.00/0.64 # Rec. Clause-clause subsumption calls : 1056
% 1.00/0.64 # Non-unit clause-clause subsumptions : 61
% 1.00/0.64 # Unit Clause-clause subsumption calls : 219
% 1.00/0.64 # Rewrite failures with RHS unbound : 0
% 1.00/0.64 # BW rewrite match attempts : 9
% 1.00/0.64 # BW rewrite match successes : 9
% 1.00/0.64 # Condensation attempts : 0
% 1.00/0.64 # Condensation successes : 0
% 1.00/0.64 # Termbank termtop insertions : 34980
% 1.00/0.64
% 1.00/0.64 # -------------------------------------------------
% 1.00/0.64 # User time : 0.084 s
% 1.00/0.64 # System time : 0.004 s
% 1.00/0.64 # Total time : 0.088 s
% 1.00/0.64 # Maximum resident set size: 2388 pages
% 1.00/0.64
% 1.00/0.64 # -------------------------------------------------
% 1.00/0.64 # User time : 0.371 s
% 1.00/0.64 # System time : 0.017 s
% 1.00/0.64 # Total time : 0.388 s
% 1.00/0.64 # Maximum resident set size: 1736 pages
% 1.00/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------