TSTP Solution File: NUM481+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM481+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:58 EDT 2023
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 12 unt; 0 def)
% Number of atoms : 394 ( 169 equ)
% Maximal formula atoms : 128 ( 6 avg)
% Number of connectives : 505 ( 170 ~; 228 |; 84 &)
% ( 1 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn; 40 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( ( aNaturalNumber0(X1)
& X1 != sz00
& X1 != sz10 )
=> ( ! [X2] :
( ( aNaturalNumber0(X2)
& X2 != sz00
& X2 != sz10 )
=> ( iLess0(X2,X1)
=> ? [X3] :
( aNaturalNumber0(X3)
& ? [X4] :
( aNaturalNumber0(X4)
& X2 = sdtasdt0(X3,X4) )
& doDivides0(X3,X2)
& X3 != sz00
& X3 != sz10
& ! [X4] :
( ( aNaturalNumber0(X4)
& ( ? [X5] :
( aNaturalNumber0(X5)
& X3 = sdtasdt0(X4,X5) )
| doDivides0(X4,X3) ) )
=> ( X4 = sz10
| X4 = X3 ) )
& isPrime0(X3) ) ) )
=> ? [X2] :
( aNaturalNumber0(X2)
& ( ? [X3] :
( aNaturalNumber0(X3)
& X1 = sdtasdt0(X2,X3) )
| doDivides0(X2,X1) )
& ( ( X2 != sz00
& X2 != sz10
& ! [X3] :
( ( aNaturalNumber0(X3)
& ? [X4] :
( aNaturalNumber0(X4)
& X2 = sdtasdt0(X3,X4) )
& doDivides0(X3,X2) )
=> ( X3 = sz10
| X3 = X2 ) ) )
| isPrime0(X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',m__) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',m_MulUnit) ).
fof(mDivLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( doDivides0(X1,X2)
& X2 != sz00 )
=> sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',mDivLE) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',mSortsC_01) ).
fof(mIH_03,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',mIH_03) ).
fof(mDivTrans,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X2,X3) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',mDivTrans) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',mSortsB_02) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p',m_MulZero) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( aNaturalNumber0(X1)
& X1 != sz00
& X1 != sz10 )
=> ( ! [X2] :
( ( aNaturalNumber0(X2)
& X2 != sz00
& X2 != sz10 )
=> ( iLess0(X2,X1)
=> ? [X3] :
( aNaturalNumber0(X3)
& ? [X4] :
( aNaturalNumber0(X4)
& X2 = sdtasdt0(X3,X4) )
& doDivides0(X3,X2)
& X3 != sz00
& X3 != sz10
& ! [X4] :
( ( aNaturalNumber0(X4)
& ( ? [X5] :
( aNaturalNumber0(X5)
& X3 = sdtasdt0(X4,X5) )
| doDivides0(X4,X3) ) )
=> ( X4 = sz10
| X4 = X3 ) )
& isPrime0(X3) ) ) )
=> ? [X2] :
( aNaturalNumber0(X2)
& ( ? [X3] :
( aNaturalNumber0(X3)
& X1 = sdtasdt0(X2,X3) )
| doDivides0(X2,X1) )
& ( ( X2 != sz00
& X2 != sz10
& ! [X3] :
( ( aNaturalNumber0(X3)
& ? [X4] :
( aNaturalNumber0(X4)
& X2 = sdtasdt0(X3,X4) )
& doDivides0(X3,X2) )
=> ( X3 = sz10
| X3 = X2 ) ) )
| isPrime0(X2) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,negated_conjecture,
! [X87,X90,X91,X92,X93] :
( aNaturalNumber0(esk4_0)
& esk4_0 != sz00
& esk4_0 != sz10
& ( aNaturalNumber0(esk5_1(X87))
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( aNaturalNumber0(esk6_1(X87))
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( X87 = sdtasdt0(esk5_1(X87),esk6_1(X87))
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( doDivides0(esk5_1(X87),X87)
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( esk5_1(X87) != sz00
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( esk5_1(X87) != sz10
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( ~ aNaturalNumber0(X91)
| esk5_1(X87) != sdtasdt0(X90,X91)
| ~ aNaturalNumber0(X90)
| X90 = sz10
| X90 = esk5_1(X87)
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( ~ doDivides0(X90,esk5_1(X87))
| ~ aNaturalNumber0(X90)
| X90 = sz10
| X90 = esk5_1(X87)
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( isPrime0(esk5_1(X87))
| ~ iLess0(X87,esk4_0)
| ~ aNaturalNumber0(X87)
| X87 = sz00
| X87 = sz10 )
& ( aNaturalNumber0(esk7_1(X92))
| X92 = sz00
| X92 = sz10
| ~ aNaturalNumber0(X93)
| esk4_0 != sdtasdt0(X92,X93)
| ~ aNaturalNumber0(X92) )
& ( aNaturalNumber0(esk8_1(X92))
| X92 = sz00
| X92 = sz10
| ~ aNaturalNumber0(X93)
| esk4_0 != sdtasdt0(X92,X93)
| ~ aNaturalNumber0(X92) )
& ( X92 = sdtasdt0(esk7_1(X92),esk8_1(X92))
| X92 = sz00
| X92 = sz10
| ~ aNaturalNumber0(X93)
| esk4_0 != sdtasdt0(X92,X93)
| ~ aNaturalNumber0(X92) )
& ( doDivides0(esk7_1(X92),X92)
| X92 = sz00
| X92 = sz10
| ~ aNaturalNumber0(X93)
| esk4_0 != sdtasdt0(X92,X93)
| ~ aNaturalNumber0(X92) )
& ( esk7_1(X92) != sz10
| X92 = sz00
| X92 = sz10
| ~ aNaturalNumber0(X93)
| esk4_0 != sdtasdt0(X92,X93)
| ~ aNaturalNumber0(X92) )
& ( esk7_1(X92) != X92
| X92 = sz00
| X92 = sz10
| ~ aNaturalNumber0(X93)
| esk4_0 != sdtasdt0(X92,X93)
| ~ aNaturalNumber0(X92) )
& ( ~ isPrime0(X92)
| ~ aNaturalNumber0(X93)
| esk4_0 != sdtasdt0(X92,X93)
| ~ aNaturalNumber0(X92) )
& ( aNaturalNumber0(esk7_1(X92))
| X92 = sz00
| X92 = sz10
| ~ doDivides0(X92,esk4_0)
| ~ aNaturalNumber0(X92) )
& ( aNaturalNumber0(esk8_1(X92))
| X92 = sz00
| X92 = sz10
| ~ doDivides0(X92,esk4_0)
| ~ aNaturalNumber0(X92) )
& ( X92 = sdtasdt0(esk7_1(X92),esk8_1(X92))
| X92 = sz00
| X92 = sz10
| ~ doDivides0(X92,esk4_0)
| ~ aNaturalNumber0(X92) )
& ( doDivides0(esk7_1(X92),X92)
| X92 = sz00
| X92 = sz10
| ~ doDivides0(X92,esk4_0)
| ~ aNaturalNumber0(X92) )
& ( esk7_1(X92) != sz10
| X92 = sz00
| X92 = sz10
| ~ doDivides0(X92,esk4_0)
| ~ aNaturalNumber0(X92) )
& ( esk7_1(X92) != X92
| X92 = sz00
| X92 = sz10
| ~ doDivides0(X92,esk4_0)
| ~ aNaturalNumber0(X92) )
& ( ~ isPrime0(X92)
| ~ doDivides0(X92,esk4_0)
| ~ aNaturalNumber0(X92) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_11,plain,
! [X21] :
( ( sdtasdt0(X21,sz10) = X21
| ~ aNaturalNumber0(X21) )
& ( X21 = sdtasdt0(sz10,X21)
| ~ aNaturalNumber0(X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])]) ).
fof(c_0_12,plain,
! [X78,X79] :
( ~ aNaturalNumber0(X78)
| ~ aNaturalNumber0(X79)
| ~ doDivides0(X78,X79)
| X79 = sz00
| sdtlseqdt0(X78,X79) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivLE])]) ).
cnf(c_0_13,negated_conjecture,
( doDivides0(esk7_1(X1),X1)
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X2)
| esk4_0 != sdtasdt0(X1,X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_16,negated_conjecture,
aNaturalNumber0(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
esk4_0 != sz00,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
esk4_0 != sz10,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( aNaturalNumber0(esk7_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X2)
| esk4_0 != sdtasdt0(X1,X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_20,plain,
! [X60,X61] :
( ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61)
| X60 = X61
| ~ sdtlseqdt0(X60,X61)
| iLess0(X60,X61) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIH_03])]) ).
cnf(c_0_21,plain,
( X2 = sz00
| sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
doDivides0(esk7_1(esk4_0),esk4_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])])]),c_0_16])]),c_0_17]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
aNaturalNumber0(esk7_1(esk4_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_14]),c_0_15])])]),c_0_16])]),c_0_17]),c_0_18]) ).
fof(c_0_24,plain,
! [X69,X70,X71] :
( ~ aNaturalNumber0(X69)
| ~ aNaturalNumber0(X70)
| ~ aNaturalNumber0(X71)
| ~ doDivides0(X69,X70)
| ~ doDivides0(X70,X71)
| doDivides0(X69,X71) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivTrans])]) ).
cnf(c_0_25,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
sdtlseqdt0(esk7_1(esk4_0),esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16]),c_0_23])]),c_0_17]) ).
cnf(c_0_27,plain,
( doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( doDivides0(esk5_1(X1),X1)
| X1 = sz00
| X1 = sz10
| ~ iLess0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( esk7_1(esk4_0) = esk4_0
| iLess0(esk7_1(esk4_0),esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
( aNaturalNumber0(esk5_1(X1))
| X1 = sz00
| X1 = sz10
| ~ iLess0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( doDivides0(X1,esk4_0)
| ~ doDivides0(X1,esk7_1(esk4_0))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_16]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
( esk7_1(esk4_0) = esk4_0
| esk7_1(esk4_0) = sz10
| esk7_1(esk4_0) = sz00
| doDivides0(esk5_1(esk7_1(esk4_0)),esk7_1(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_33,negated_conjecture,
( esk7_1(esk4_0) = esk4_0
| esk7_1(esk4_0) = sz10
| esk7_1(esk4_0) = sz00
| aNaturalNumber0(esk5_1(esk7_1(esk4_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_23])]) ).
cnf(c_0_34,negated_conjecture,
( isPrime0(esk5_1(X1))
| X1 = sz00
| X1 = sz10
| ~ iLess0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
( ~ isPrime0(X1)
| ~ doDivides0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,negated_conjecture,
( esk7_1(esk4_0) = sz00
| esk7_1(esk4_0) = sz10
| esk7_1(esk4_0) = esk4_0
| doDivides0(esk5_1(esk7_1(esk4_0)),esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( esk7_1(esk4_0) = esk4_0
| esk7_1(esk4_0) = sz10
| esk7_1(esk4_0) = sz00
| isPrime0(esk5_1(esk7_1(esk4_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_23])]) ).
cnf(c_0_38,negated_conjecture,
( X1 = sz00
| X1 = sz10
| esk7_1(X1) != X1
| ~ doDivides0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,negated_conjecture,
( esk7_1(esk4_0) = esk4_0
| esk7_1(esk4_0) = sz10
| esk7_1(esk4_0) = sz00 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33]),c_0_37]) ).
fof(c_0_40,plain,
! [X62,X63,X65] :
( ( aNaturalNumber0(esk2_2(X62,X63))
| ~ doDivides0(X62,X63)
| ~ aNaturalNumber0(X62)
| ~ aNaturalNumber0(X63) )
& ( X63 = sdtasdt0(X62,esk2_2(X62,X63))
| ~ doDivides0(X62,X63)
| ~ aNaturalNumber0(X62)
| ~ aNaturalNumber0(X63) )
& ( ~ aNaturalNumber0(X65)
| X63 != sdtasdt0(X62,X65)
| doDivides0(X62,X63)
| ~ aNaturalNumber0(X62)
| ~ aNaturalNumber0(X63) ) ),
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_41,plain,
! [X8,X9] :
( ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9)
| aNaturalNumber0(sdtasdt0(X8,X9)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_42,negated_conjecture,
( esk7_1(esk4_0) = sz00
| esk7_1(esk4_0) = sz10
| ~ doDivides0(esk4_0,esk4_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_16])]),c_0_17]),c_0_18]) ).
cnf(c_0_43,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( X1 = sz00
| X1 = sz10
| esk7_1(X1) != sz10
| ~ doDivides0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_46,negated_conjecture,
( esk7_1(esk4_0) = sz00
| esk7_1(esk4_0) = sz10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_39]),c_0_42]) ).
cnf(c_0_47,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( X1 = sdtasdt0(esk7_1(X1),esk8_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X2)
| esk4_0 != sdtasdt0(X1,X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_49,negated_conjecture,
( esk7_1(esk4_0) = sz00
| ~ doDivides0(esk4_0,esk4_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_16])]),c_0_17]),c_0_18]) ).
cnf(c_0_50,plain,
( doDivides0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_14]),c_0_15])]) ).
fof(c_0_51,plain,
! [X22] :
( ( sdtasdt0(X22,sz00) = sz00
| ~ aNaturalNumber0(X22) )
& ( sz00 = sdtasdt0(sz00,X22)
| ~ aNaturalNumber0(X22) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])]) ).
cnf(c_0_52,negated_conjecture,
sdtasdt0(esk7_1(esk4_0),esk8_1(esk4_0)) = esk4_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_14]),c_0_15])])]),c_0_16])]),c_0_17]),c_0_18]) ).
cnf(c_0_53,negated_conjecture,
esk7_1(esk4_0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_16])]) ).
cnf(c_0_54,negated_conjecture,
( aNaturalNumber0(esk8_1(X1))
| X1 = sz00
| X1 = sz10
| ~ aNaturalNumber0(X2)
| esk4_0 != sdtasdt0(X1,X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_55,plain,
( sz00 = sdtasdt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,negated_conjecture,
sdtasdt0(sz00,esk8_1(esk4_0)) = esk4_0,
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
aNaturalNumber0(esk8_1(esk4_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_14]),c_0_15])])]),c_0_16])]),c_0_17]),c_0_18]) ).
cnf(c_0_58,negated_conjecture,
$false,
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_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM481+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % 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 13:10:45 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ZrBE1hsGfs/E---3.1_26790.p
% 0.21/0.54 # Version: 3.1pre001
% 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 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26904 completed with status 0
% 0.21/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 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 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FSMS21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54 # Starting sh5l with 136s (1) cores
% 0.21/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26911 completed with status 0
% 0.21/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 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 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FSMS21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (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 : 38
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 93
% 0.21/0.54 # Removed in clause preprocessing : 3
% 0.21/0.54 # Initial clauses in saturation : 90
% 0.21/0.54 # Processed clauses : 291
% 0.21/0.54 # ...of these trivial : 1
% 0.21/0.54 # ...subsumed : 45
% 0.21/0.54 # ...remaining for further processing : 245
% 0.21/0.54 # Other redundant clauses eliminated : 27
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 15
% 0.21/0.54 # Backward-rewritten : 13
% 0.21/0.54 # Generated clauses : 678
% 0.21/0.54 # ...of the previous two non-redundant : 595
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 16
% 0.21/0.54 # Paramodulations : 642
% 0.21/0.54 # Factorizations : 5
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 31
% 0.21/0.54 # Total rewrite steps : 532
% 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 : 121
% 0.21/0.54 # Positive orientable unit clauses : 21
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 9
% 0.21/0.54 # Non-unit-clauses : 91
% 0.21/0.54 # Current number of unprocessed clauses: 458
% 0.21/0.54 # ...number of literals in the above : 2099
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 113
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 1834
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 293
% 0.21/0.54 # Non-unit clause-clause subsumptions : 45
% 0.21/0.54 # Unit Clause-clause subsumption calls : 441
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 2
% 0.21/0.54 # BW rewrite match successes : 2
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 18623
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.032 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.037 s
% 0.21/0.54 # Maximum resident set size: 2032 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.146 s
% 0.21/0.54 # System time : 0.012 s
% 0.21/0.54 # Total time : 0.158 s
% 0.21/0.54 # Maximum resident set size: 1724 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------