TSTP Solution File: NUM471+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM471+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 18:55:55 EDT 2023
% Result : Theorem 2.62s 0.83s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 70 ( 23 unt; 0 def)
% Number of atoms : 289 ( 92 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 359 ( 140 ~; 147 |; 53 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn; 47 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mSortsB_02) ).
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtasdt0(X1,X2) = sdtasdt0(X1,X3)
| sdtasdt0(X2,X1) = sdtasdt0(X3,X1) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mMulCanc) ).
fof(m__1324_04,hypothesis,
( ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
& doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',m__1324_04) ).
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/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mDefQuot) ).
fof(m__,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xp,X1) = xq )
| sdtlseqdt0(xp,xq) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.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/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mSortsB) ).
fof(m__1360,hypothesis,
( aNaturalNumber0(xp)
& xm = sdtasdt0(xl,xp)
& xp = sdtsldt0(xm,xl) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',m__1360) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',m__1324) ).
fof(m__1347,hypothesis,
xl != sz00,
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',m__1347) ).
fof(m__1379,hypothesis,
( aNaturalNumber0(xq)
& sdtpldt0(xm,xn) = sdtasdt0(xl,xq)
& xq = sdtsldt0(sdtpldt0(xm,xn),xl) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',m__1379) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',m_AddZero) ).
fof(mLEAsym,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mLEAsym) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mSortsC) ).
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
| ( X2 != X1
& sdtlseqdt0(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mLETotal) ).
fof(mMonMul,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( X1 != sz00
& X2 != X3
& sdtlseqdt0(X2,X3) )
=> ( sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p',mMonMul) ).
fof(c_0_17,plain,
! [X7,X8,X10] :
( ( aNaturalNumber0(esk3_2(X7,X8))
| ~ doDivides0(X7,X8)
| ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8) )
& ( X8 = sdtasdt0(X7,esk3_2(X7,X8))
| ~ doDivides0(X7,X8)
| ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8) )
& ( ~ aNaturalNumber0(X10)
| X8 != sdtasdt0(X7,X10)
| doDivides0(X7,X8)
| ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8) ) ),
inference(distribute,[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_18,plain,
! [X40,X41] :
( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X41)
| aNaturalNumber0(sdtasdt0(X40,X41)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_19,plain,
! [X48,X49,X50] :
( ( sdtasdt0(X48,X49) != sdtasdt0(X48,X50)
| X49 = X50
| ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X50)
| X48 = sz00
| ~ aNaturalNumber0(X48) )
& ( sdtasdt0(X49,X48) != sdtasdt0(X50,X48)
| X49 = X50
| ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X50)
| X48 = sz00
| ~ aNaturalNumber0(X48) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulCanc])])])]) ).
fof(c_0_20,hypothesis,
( aNaturalNumber0(esk1_0)
& xm = sdtasdt0(xl,esk1_0)
& doDivides0(xl,xm)
& aNaturalNumber0(esk2_0)
& sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0)
& doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1324_04])]) ).
fof(c_0_21,plain,
! [X58,X59,X60] :
( ( aNaturalNumber0(X60)
| X60 != sdtsldt0(X59,X58)
| X58 = sz00
| ~ doDivides0(X58,X59)
| ~ aNaturalNumber0(X58)
| ~ aNaturalNumber0(X59) )
& ( X59 = sdtasdt0(X58,X60)
| X60 != sdtsldt0(X59,X58)
| X58 = sz00
| ~ doDivides0(X58,X59)
| ~ aNaturalNumber0(X58)
| ~ aNaturalNumber0(X59) )
& ( ~ aNaturalNumber0(X60)
| X59 != sdtasdt0(X58,X60)
| X60 = sdtsldt0(X59,X58)
| X58 = sz00
| ~ doDivides0(X58,X59)
| ~ aNaturalNumber0(X58)
| ~ aNaturalNumber0(X59) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])]) ).
cnf(c_0_22,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xp,X1) = xq )
| sdtlseqdt0(xp,xq) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_25,plain,
! [X33,X34,X36] :
( ( aNaturalNumber0(esk4_2(X33,X34))
| ~ sdtlseqdt0(X33,X34)
| ~ aNaturalNumber0(X33)
| ~ aNaturalNumber0(X34) )
& ( sdtpldt0(X33,esk4_2(X33,X34)) = X34
| ~ sdtlseqdt0(X33,X34)
| ~ aNaturalNumber0(X33)
| ~ aNaturalNumber0(X34) )
& ( ~ aNaturalNumber0(X36)
| sdtpldt0(X33,X36) != X34
| sdtlseqdt0(X33,X34)
| ~ aNaturalNumber0(X33)
| ~ aNaturalNumber0(X34) ) ),
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_26,plain,
! [X17,X18] :
( ~ aNaturalNumber0(X17)
| ~ aNaturalNumber0(X18)
| aNaturalNumber0(sdtpldt0(X17,X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_27,plain,
( X2 = X3
| X1 = sz00
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,hypothesis,
xm = sdtasdt0(xl,xp),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_31,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[m__1347]) ).
cnf(c_0_32,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
inference(split_conjunct,[status(thm)],[m__1379]) ).
cnf(c_0_34,plain,
( X1 = sdtsldt0(X2,X3)
| X3 = sz00
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ doDivides0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_22]),c_0_23]) ).
cnf(c_0_36,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
inference(split_conjunct,[status(thm)],[m__1379]) ).
fof(c_0_37,negated_conjecture,
! [X6] :
( ( ~ aNaturalNumber0(X6)
| sdtpldt0(xp,X6) != xq )
& ~ sdtlseqdt0(xp,xq) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
fof(c_0_38,plain,
! [X24] :
( ( sdtpldt0(X24,sz00) = X24
| ~ aNaturalNumber0(X24) )
& ( X24 = sdtpldt0(sz00,X24)
| ~ aNaturalNumber0(X24) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
fof(c_0_39,plain,
! [X62,X63] :
( ~ aNaturalNumber0(X62)
| ~ aNaturalNumber0(X63)
| ~ sdtlseqdt0(X62,X63)
| ~ sdtlseqdt0(X63,X62)
| X62 = X63 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])]) ).
cnf(c_0_40,plain,
( sdtlseqdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_41,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42,hypothesis,
( X1 = xp
| sdtasdt0(xl,X1) != xm
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_43,hypothesis,
sdtasdt0(xl,esk2_0) = sdtasdt0(xl,xq),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_44,hypothesis,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_45,plain,
( sdtsldt0(sdtasdt0(X1,X2),X1) = X2
| X1 = sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_23]),c_0_35]) ).
cnf(c_0_46,hypothesis,
sdtsldt0(sdtasdt0(xl,xq),xl) = xq,
inference(rw,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_47,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(xp,X1) != xq ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
fof(c_0_50,plain,
! [X67,X68] :
( ( X68 != X67
| sdtlseqdt0(X67,X68)
| ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X68) )
& ( sdtlseqdt0(X68,X67)
| sdtlseqdt0(X67,X68)
| ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X68) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETotal])])]) ).
cnf(c_0_51,plain,
( X1 = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_52,plain,
( sdtlseqdt0(X1,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_40]),c_0_41]) ).
cnf(c_0_53,hypothesis,
( esk2_0 = xp
| sdtasdt0(xl,xq) != xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_54,hypothesis,
esk2_0 = xq,
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_45,c_0_43]),c_0_46]),c_0_30]),c_0_44])]),c_0_31]) ).
cnf(c_0_55,negated_conjecture,
xq != xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_29])]) ).
fof(c_0_56,plain,
! [X53,X54,X55] :
( ( sdtasdt0(X53,X54) != sdtasdt0(X53,X55)
| X53 = sz00
| X54 = X55
| ~ sdtlseqdt0(X54,X55)
| ~ aNaturalNumber0(X53)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X55) )
& ( sdtlseqdt0(sdtasdt0(X53,X54),sdtasdt0(X53,X55))
| X53 = sz00
| X54 = X55
| ~ sdtlseqdt0(X54,X55)
| ~ aNaturalNumber0(X53)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X55) )
& ( sdtasdt0(X54,X53) != sdtasdt0(X55,X53)
| X53 = sz00
| X54 = X55
| ~ sdtlseqdt0(X54,X55)
| ~ aNaturalNumber0(X53)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X55) )
& ( sdtlseqdt0(sdtasdt0(X54,X53),sdtasdt0(X55,X53))
| X53 = sz00
| X54 = X55
| ~ sdtlseqdt0(X54,X55)
| ~ aNaturalNumber0(X53)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X55) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMonMul])])]) ).
cnf(c_0_57,plain,
( sdtlseqdt0(X1,X2)
| sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,hypothesis,
aNaturalNumber0(xq),
inference(split_conjunct,[status(thm)],[m__1379]) ).
cnf(c_0_59,plain,
( sdtpldt0(X1,X2) = X1
| ~ sdtlseqdt0(sdtpldt0(X1,X2),X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_41]) ).
cnf(c_0_60,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_61,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_62,hypothesis,
sdtasdt0(xl,xq) != xm,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_63,plain,
( sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
| X1 = sz00
| X2 = X3
| ~ sdtlseqdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_64,hypothesis,
( sdtlseqdt0(X1,xq)
| sdtlseqdt0(xq,X1)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_66,hypothesis,
~ sdtlseqdt0(sdtasdt0(xl,xq),xm),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_33]),c_0_60]),c_0_61])]),c_0_62]) ).
cnf(c_0_67,hypothesis,
( X1 = xp
| sdtlseqdt0(sdtasdt0(xl,X1),xm)
| ~ sdtlseqdt0(X1,xp)
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_28]),c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_68,hypothesis,
sdtlseqdt0(xq,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_29]),c_0_65]) ).
cnf(c_0_69,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_58])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM471+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n028.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 : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 13:38:36 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.N5Pnvt8UgY/E---3.1_14127.p
% 2.62/0.83 # Version: 3.1pre001
% 2.62/0.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.62/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.62/0.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.62/0.83 # Starting new_bool_3 with 300s (1) cores
% 2.62/0.83 # Starting new_bool_1 with 300s (1) cores
% 2.62/0.83 # Starting sh5l with 300s (1) cores
% 2.62/0.83 # new_bool_3 with pid 14263 completed with status 0
% 2.62/0.83 # Result found by new_bool_3
% 2.62/0.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.62/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.62/0.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.62/0.83 # Starting new_bool_3 with 300s (1) cores
% 2.62/0.83 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.62/0.83 # Search class: FGHSF-FFMM22-SFFFFFNN
% 2.62/0.83 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.62/0.83 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.62/0.83 # SAT001_MinMin_p005000_rr_RG with pid 14277 completed with status 0
% 2.62/0.83 # Result found by SAT001_MinMin_p005000_rr_RG
% 2.62/0.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.62/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.62/0.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.62/0.83 # Starting new_bool_3 with 300s (1) cores
% 2.62/0.83 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.62/0.83 # Search class: FGHSF-FFMM22-SFFFFFNN
% 2.62/0.83 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.62/0.83 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.62/0.83 # Preprocessing time : 0.002 s
% 2.62/0.83 # Presaturation interreduction done
% 2.62/0.83
% 2.62/0.83 # Proof found!
% 2.62/0.83 # SZS status Theorem
% 2.62/0.83 # SZS output start CNFRefutation
% See solution above
% 2.62/0.83 # Parsed axioms : 39
% 2.62/0.83 # Removed by relevancy pruning/SinE : 6
% 2.62/0.83 # Initial clauses : 64
% 2.62/0.83 # Removed in clause preprocessing : 1
% 2.62/0.83 # Initial clauses in saturation : 63
% 2.62/0.83 # Processed clauses : 3218
% 2.62/0.83 # ...of these trivial : 27
% 2.62/0.83 # ...subsumed : 2174
% 2.62/0.83 # ...remaining for further processing : 1017
% 2.62/0.83 # Other redundant clauses eliminated : 157
% 2.62/0.83 # Clauses deleted for lack of memory : 0
% 2.62/0.83 # Backward-subsumed : 139
% 2.62/0.83 # Backward-rewritten : 36
% 2.62/0.83 # Generated clauses : 18135
% 2.62/0.83 # ...of the previous two non-redundant : 17255
% 2.62/0.83 # ...aggressively subsumed : 0
% 2.62/0.83 # Contextual simplify-reflections : 141
% 2.62/0.83 # Paramodulations : 17971
% 2.62/0.83 # Factorizations : 0
% 2.62/0.83 # NegExts : 0
% 2.62/0.83 # Equation resolutions : 163
% 2.62/0.83 # Total rewrite steps : 13852
% 2.62/0.83 # Propositional unsat checks : 0
% 2.62/0.83 # Propositional check models : 0
% 2.62/0.83 # Propositional check unsatisfiable : 0
% 2.62/0.83 # Propositional clauses : 0
% 2.62/0.83 # Propositional clauses after purity: 0
% 2.62/0.83 # Propositional unsat core size : 0
% 2.62/0.83 # Propositional preprocessing time : 0.000
% 2.62/0.83 # Propositional encoding time : 0.000
% 2.62/0.83 # Propositional solver time : 0.000
% 2.62/0.83 # Success case prop preproc time : 0.000
% 2.62/0.83 # Success case prop encoding time : 0.000
% 2.62/0.83 # Success case prop solver time : 0.000
% 2.62/0.83 # Current number of processed clauses : 777
% 2.62/0.83 # Positive orientable unit clauses : 72
% 2.62/0.83 # Positive unorientable unit clauses: 0
% 2.62/0.83 # Negative unit clauses : 64
% 2.62/0.83 # Non-unit-clauses : 641
% 2.62/0.83 # Current number of unprocessed clauses: 13986
% 2.62/0.83 # ...number of literals in the above : 90063
% 2.62/0.83 # Current number of archived formulas : 0
% 2.62/0.83 # Current number of archived clauses : 234
% 2.62/0.83 # Clause-clause subsumption calls (NU) : 69013
% 2.62/0.83 # Rec. Clause-clause subsumption calls : 19148
% 2.62/0.83 # Non-unit clause-clause subsumptions : 1702
% 2.62/0.83 # Unit Clause-clause subsumption calls : 4655
% 2.62/0.83 # Rewrite failures with RHS unbound : 0
% 2.62/0.83 # BW rewrite match attempts : 23
% 2.62/0.83 # BW rewrite match successes : 16
% 2.62/0.83 # Condensation attempts : 0
% 2.62/0.83 # Condensation successes : 0
% 2.62/0.83 # Termbank termtop insertions : 354952
% 2.62/0.83
% 2.62/0.83 # -------------------------------------------------
% 2.62/0.83 # User time : 0.311 s
% 2.62/0.83 # System time : 0.022 s
% 2.62/0.83 # Total time : 0.333 s
% 2.62/0.83 # Maximum resident set size: 1884 pages
% 2.62/0.83
% 2.62/0.83 # -------------------------------------------------
% 2.62/0.83 # User time : 0.313 s
% 2.62/0.83 # System time : 0.023 s
% 2.62/0.83 # Total time : 0.337 s
% 2.62/0.83 # Maximum resident set size: 1720 pages
% 2.62/0.83 % E---3.1 exiting
% 2.62/0.83 % E---3.1 exiting
%------------------------------------------------------------------------------