TSTP Solution File: NUM498+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM498+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:26:32 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 74 ( 18 unt; 0 def)
% Number of atoms : 297 ( 128 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 346 ( 123 ~; 147 |; 51 &)
% ( 6 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__1860,hypothesis,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1860) ).
fof(m__2306,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2306) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(m__2287,hypothesis,
( xn != xp
& sdtlseqdt0(xn,xp)
& xm != xp
& sdtlseqdt0(xm,xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2287) ).
fof(m__,conjecture,
( ( xk = sz00
| xk = sz10 )
=> ( doDivides0(xp,xn)
| doDivides0(xp,xm) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).
fof(mZeroAdd,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtpldt0(X1,X2) = sz00
=> ( X1 = sz00
& X2 = sz00 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroAdd) ).
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/sandbox/benchmark/theBenchmark.p',mDefPrime) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulUnit) ).
fof(mZeroMul,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtasdt0(X1,X2) = sz00
=> ( X1 = sz00
| X2 = sz00 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroMul) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulZero) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_15,plain,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_16,plain,
! [X8,X9,X10] :
( ( aNaturalNumber0(X10)
| X10 != sdtsldt0(X9,X8)
| X8 = sz00
| ~ doDivides0(X8,X9)
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9) )
& ( X9 = sdtasdt0(X8,X10)
| X10 != sdtsldt0(X9,X8)
| X8 = sz00
| ~ doDivides0(X8,X9)
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9) )
& ( ~ aNaturalNumber0(X10)
| X9 != sdtasdt0(X8,X10)
| X10 = sdtsldt0(X9,X8)
| X8 = sz00
| ~ doDivides0(X8,X9)
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
cnf(c_0_17,plain,
( X1 = sdtasdt0(X2,X3)
| X2 = sz00
| X3 != sdtsldt0(X1,X2)
| ~ doDivides0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_18,plain,
! [X4,X5,X7] :
( ( aNaturalNumber0(esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( X5 = sdtasdt0(X4,esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X7)
| X5 != sdtasdt0(X4,X7)
| doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])]) ).
fof(c_0_19,plain,
! [X49,X50] :
( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X50)
| aNaturalNumber0(sdtasdt0(X49,X50)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_20,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_22,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_24,hypothesis,
( xn != xp
& sdtlseqdt0(xn,xp)
& xm != xp
& sdtlseqdt0(xm,xp) ),
inference(fof_simplification,[status(thm)],[m__2287]) ).
cnf(c_0_25,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| xp = sz00
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_28,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_30,negated_conjecture,
~ ( ( xk = sz00
| xk = sz10 )
=> ( doDivides0(xp,xn)
| doDivides0(xp,xm) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_31,plain,
! [X70,X71,X73] :
( ( aNaturalNumber0(esk4_2(X70,X71))
| ~ sdtlseqdt0(X70,X71)
| ~ aNaturalNumber0(X70)
| ~ aNaturalNumber0(X71) )
& ( sdtpldt0(X70,esk4_2(X70,X71)) = X71
| ~ sdtlseqdt0(X70,X71)
| ~ aNaturalNumber0(X70)
| ~ aNaturalNumber0(X71) )
& ( ~ aNaturalNumber0(X73)
| sdtpldt0(X70,X73) != X71
| sdtlseqdt0(X70,X71)
| ~ aNaturalNumber0(X70)
| ~ aNaturalNumber0(X71) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_32,hypothesis,
( xn != xp
& sdtlseqdt0(xn,xp)
& xm != xp
& sdtlseqdt0(xm,xp) ),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_26]) ).
cnf(c_0_34,hypothesis,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| xp = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_26]),c_0_28]),c_0_29])]) ).
fof(c_0_35,negated_conjecture,
( ( xk = sz00
| xk = sz10 )
& ~ doDivides0(xp,xn)
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])]) ).
fof(c_0_36,plain,
! [X40,X41] :
( ( X40 = sz00
| sdtpldt0(X40,X41) != sz00
| ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X41) )
& ( X41 = sz00
| sdtpldt0(X40,X41) != sz00
| ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X41) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroAdd])])])]) ).
cnf(c_0_37,plain,
( sdtpldt0(X1,esk4_2(X1,X2)) = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,hypothesis,
sdtlseqdt0(xn,xp),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( aNaturalNumber0(esk4_2(X1,X2))
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_40,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefPrime]) ).
cnf(c_0_41,hypothesis,
( xp = sz00
| doDivides0(xn,sdtasdt0(xp,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29]),c_0_28])]) ).
cnf(c_0_42,negated_conjecture,
( xk = sz00
| xk = sz10 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_43,plain,
! [X33] :
( ( sdtasdt0(X33,sz10) = X33
| ~ aNaturalNumber0(X33) )
& ( X33 = sdtasdt0(sz10,X33)
| ~ aNaturalNumber0(X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])])]) ).
fof(c_0_44,plain,
! [X42,X43] :
( ~ aNaturalNumber0(X42)
| ~ aNaturalNumber0(X43)
| sdtasdt0(X42,X43) != sz00
| X42 = sz00
| X43 = sz00 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroMul])])]) ).
cnf(c_0_45,plain,
( X1 = sz00
| sdtpldt0(X1,X2) != sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,hypothesis,
sdtpldt0(xn,esk4_2(xn,xp)) = xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23]),c_0_29])]) ).
cnf(c_0_47,hypothesis,
aNaturalNumber0(esk4_2(xn,xp)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_23]),c_0_29])]) ).
fof(c_0_48,plain,
! [X25,X26] :
( ( X25 != sz00
| ~ isPrime0(X25)
| ~ aNaturalNumber0(X25) )
& ( X25 != sz10
| ~ isPrime0(X25)
| ~ aNaturalNumber0(X25) )
& ( ~ aNaturalNumber0(X26)
| ~ doDivides0(X26,X25)
| X26 = sz10
| X26 = X25
| ~ isPrime0(X25)
| ~ aNaturalNumber0(X25) )
& ( aNaturalNumber0(esk2_1(X25))
| X25 = sz00
| X25 = sz10
| isPrime0(X25)
| ~ aNaturalNumber0(X25) )
& ( doDivides0(esk2_1(X25),X25)
| X25 = sz00
| X25 = sz10
| isPrime0(X25)
| ~ aNaturalNumber0(X25) )
& ( esk2_1(X25) != sz10
| X25 = sz00
| X25 = sz10
| isPrime0(X25)
| ~ aNaturalNumber0(X25) )
& ( esk2_1(X25) != X25
| X25 = sz00
| X25 = sz10
| isPrime0(X25)
| ~ aNaturalNumber0(X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])])])]) ).
cnf(c_0_49,negated_conjecture,
( xk = sz00
| xp = sz00
| doDivides0(xn,sdtasdt0(xp,sz10)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
( X1 = sz00
| X2 = sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,hypothesis,
( xn = sz00
| xp != sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_29])]) ).
cnf(c_0_53,plain,
( X1 = sz10
| X1 = X2
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( xp = sz00
| xk = sz00
| doDivides0(xn,xp) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_23])]) ).
cnf(c_0_55,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_56,hypothesis,
xn != xp,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_57,hypothesis,
( xn = sz00
| xm = sz00
| sdtasdt0(xp,xk) != sz00 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_34]),c_0_28]),c_0_29])]),c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( xk = sz00
| xp = sz00
| xn = sz10 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_23]),c_0_29])]),c_0_56]) ).
fof(c_0_59,plain,
! [X36] :
( ( sdtasdt0(X36,sz00) = sz00
| ~ aNaturalNumber0(X36) )
& ( sz00 = sdtasdt0(sz00,X36)
| ~ aNaturalNumber0(X36) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])])]) ).
cnf(c_0_60,hypothesis,
( xn = sz10
| xm = sz00
| xn = sz00
| sdtasdt0(xp,sz00) != sz00 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_52]) ).
cnf(c_0_61,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_62,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_63,hypothesis,
( xn = sz00
| xm = sz00
| xn = sz10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_23])]) ).
cnf(c_0_64,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_65,negated_conjecture,
( xn = sz10
| xn = sz00
| ~ doDivides0(xp,sz00) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
( doDivides0(X1,sz00)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_61]),c_0_64])]) ).
cnf(c_0_67,negated_conjecture,
( xn = sz00
| xn = sz10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_23])]) ).
cnf(c_0_68,hypothesis,
( xn = sz00
| doDivides0(xp,sdtasdt0(sz10,xm)) ),
inference(spm,[status(thm)],[c_0_21,c_0_67]) ).
cnf(c_0_69,plain,
( X1 = sdtasdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_70,negated_conjecture,
~ doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_71,hypothesis,
xn = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_28])]),c_0_62]) ).
cnf(c_0_72,negated_conjecture,
~ doDivides0(xp,sz00),
inference(rw,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_66]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM498+1 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 07:13:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # sh5l with pid 22933 completed with status 0
% 0.21/0.54 # Result found by sh5l
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 22945 completed with status 0
% 0.21/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.54 # Preprocessing time : 0.002 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 46
% 0.21/0.54 # Removed by relevancy pruning/SinE : 1
% 0.21/0.54 # Initial clauses : 83
% 0.21/0.54 # Removed in clause preprocessing : 3
% 0.21/0.54 # Initial clauses in saturation : 80
% 0.21/0.54 # Processed clauses : 268
% 0.21/0.54 # ...of these trivial : 1
% 0.21/0.54 # ...subsumed : 45
% 0.21/0.54 # ...remaining for further processing : 222
% 0.21/0.54 # Other redundant clauses eliminated : 20
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 9
% 0.21/0.54 # Backward-rewritten : 31
% 0.21/0.54 # Generated clauses : 576
% 0.21/0.54 # ...of the previous two non-redundant : 510
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 7
% 0.21/0.54 # Paramodulations : 546
% 0.21/0.54 # Factorizations : 4
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 24
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 565
% 0.21/0.54 # ...of those cached : 541
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 97
% 0.21/0.54 # Positive orientable unit clauses : 24
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 8
% 0.21/0.54 # Non-unit-clauses : 65
% 0.21/0.54 # Current number of unprocessed clauses: 383
% 0.21/0.54 # ...number of literals in the above : 1588
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 117
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 1243
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 479
% 0.21/0.54 # Non-unit clause-clause subsumptions : 52
% 0.21/0.54 # Unit Clause-clause subsumption calls : 162
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 6
% 0.21/0.54 # BW rewrite match successes : 6
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 15502
% 0.21/0.54 # Search garbage collected termcells : 1316
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.025 s
% 0.21/0.54 # System time : 0.007 s
% 0.21/0.54 # Total time : 0.032 s
% 0.21/0.54 # Maximum resident set size: 2044 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.028 s
% 0.21/0.54 # System time : 0.009 s
% 0.21/0.54 # Total time : 0.037 s
% 0.21/0.54 # Maximum resident set size: 1740 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------