TSTP Solution File: NUM481+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM481+3 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:26:26 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 63 ( 12 unt; 0 def)
% Number of atoms : 408 ( 173 equ)
% Maximal formula atoms : 128 ( 6 avg)
% Number of connectives : 519 ( 174 ~; 228 |; 90 &)
% ( 1 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 5 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 : 89 ( 0 sgn 44 !; 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/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(mDivLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( doDivides0(X1,X2)
& X2 != sz00 )
=> sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivLE) ).
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(mIH_03,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',mDivTrans) ).
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_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_10,plain,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
inference(fof_simplification,[status(thm)],[mSortsC_01]) ).
fof(c_0_11,plain,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( doDivides0(X1,X2)
& X2 != sz00 )
=> sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mDivLE]) ).
fof(c_0_12,negated_conjecture,
! [X90,X93,X94,X95,X96] :
( aNaturalNumber0(esk4_0)
& esk4_0 != sz00
& esk4_0 != sz10
& ( aNaturalNumber0(esk5_1(X90))
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( aNaturalNumber0(esk6_1(X90))
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( X90 = sdtasdt0(esk5_1(X90),esk6_1(X90))
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( doDivides0(esk5_1(X90),X90)
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( esk5_1(X90) != sz00
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( esk5_1(X90) != sz10
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( ~ aNaturalNumber0(X94)
| esk5_1(X90) != sdtasdt0(X93,X94)
| ~ aNaturalNumber0(X93)
| X93 = sz10
| X93 = esk5_1(X90)
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( ~ doDivides0(X93,esk5_1(X90))
| ~ aNaturalNumber0(X93)
| X93 = sz10
| X93 = esk5_1(X90)
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( isPrime0(esk5_1(X90))
| ~ iLess0(X90,esk4_0)
| ~ aNaturalNumber0(X90)
| X90 = sz00
| X90 = sz10 )
& ( aNaturalNumber0(esk7_1(X95))
| X95 = sz00
| X95 = sz10
| ~ aNaturalNumber0(X96)
| esk4_0 != sdtasdt0(X95,X96)
| ~ aNaturalNumber0(X95) )
& ( aNaturalNumber0(esk8_1(X95))
| X95 = sz00
| X95 = sz10
| ~ aNaturalNumber0(X96)
| esk4_0 != sdtasdt0(X95,X96)
| ~ aNaturalNumber0(X95) )
& ( X95 = sdtasdt0(esk7_1(X95),esk8_1(X95))
| X95 = sz00
| X95 = sz10
| ~ aNaturalNumber0(X96)
| esk4_0 != sdtasdt0(X95,X96)
| ~ aNaturalNumber0(X95) )
& ( doDivides0(esk7_1(X95),X95)
| X95 = sz00
| X95 = sz10
| ~ aNaturalNumber0(X96)
| esk4_0 != sdtasdt0(X95,X96)
| ~ aNaturalNumber0(X95) )
& ( esk7_1(X95) != sz10
| X95 = sz00
| X95 = sz10
| ~ aNaturalNumber0(X96)
| esk4_0 != sdtasdt0(X95,X96)
| ~ aNaturalNumber0(X95) )
& ( esk7_1(X95) != X95
| X95 = sz00
| X95 = sz10
| ~ aNaturalNumber0(X96)
| esk4_0 != sdtasdt0(X95,X96)
| ~ aNaturalNumber0(X95) )
& ( ~ isPrime0(X95)
| ~ aNaturalNumber0(X96)
| esk4_0 != sdtasdt0(X95,X96)
| ~ aNaturalNumber0(X95) )
& ( aNaturalNumber0(esk7_1(X95))
| X95 = sz00
| X95 = sz10
| ~ doDivides0(X95,esk4_0)
| ~ aNaturalNumber0(X95) )
& ( aNaturalNumber0(esk8_1(X95))
| X95 = sz00
| X95 = sz10
| ~ doDivides0(X95,esk4_0)
| ~ aNaturalNumber0(X95) )
& ( X95 = sdtasdt0(esk7_1(X95),esk8_1(X95))
| X95 = sz00
| X95 = sz10
| ~ doDivides0(X95,esk4_0)
| ~ aNaturalNumber0(X95) )
& ( doDivides0(esk7_1(X95),X95)
| X95 = sz00
| X95 = sz10
| ~ doDivides0(X95,esk4_0)
| ~ aNaturalNumber0(X95) )
& ( esk7_1(X95) != sz10
| X95 = sz00
| X95 = sz10
| ~ doDivides0(X95,esk4_0)
| ~ aNaturalNumber0(X95) )
& ( esk7_1(X95) != X95
| X95 = sz00
| X95 = sz10
| ~ doDivides0(X95,esk4_0)
| ~ aNaturalNumber0(X95) )
& ( ~ isPrime0(X95)
| ~ doDivides0(X95,esk4_0)
| ~ aNaturalNumber0(X95) ) ),
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_9])])])])])]) ).
fof(c_0_13,plain,
! [X22] :
( ( sdtasdt0(X22,sz10) = X22
| ~ aNaturalNumber0(X22) )
& ( X22 = sdtasdt0(sz10,X22)
| ~ aNaturalNumber0(X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])])]) ).
fof(c_0_14,plain,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mIH_03]) ).
fof(c_0_16,plain,
! [X81,X82] :
( ~ aNaturalNumber0(X81)
| ~ aNaturalNumber0(X82)
| ~ doDivides0(X81,X82)
| X82 = sz00
| sdtlseqdt0(X81,X82) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_17,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_12]) ).
cnf(c_0_18,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
aNaturalNumber0(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
esk4_0 != sz00,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
esk4_0 != sz10,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,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_12]) ).
fof(c_0_24,plain,
! [X63,X64] :
( ~ aNaturalNumber0(X63)
| ~ aNaturalNumber0(X64)
| X63 = X64
| ~ sdtlseqdt0(X63,X64)
| iLess0(X63,X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_25,plain,
( X2 = sz00
| sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,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_17,c_0_18]),c_0_19])])]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_27,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_23,c_0_18]),c_0_19])])]),c_0_20])]),c_0_21]),c_0_22]) ).
fof(c_0_28,plain,
! [X72,X73,X74] :
( ~ aNaturalNumber0(X72)
| ~ aNaturalNumber0(X73)
| ~ aNaturalNumber0(X74)
| ~ doDivides0(X72,X73)
| ~ doDivides0(X73,X74)
| doDivides0(X72,X74) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivTrans])])]) ).
cnf(c_0_29,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,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_25,c_0_26]),c_0_20]),c_0_27])]),c_0_21]) ).
cnf(c_0_31,plain,
( doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( doDivides0(esk5_1(X1),X1)
| X1 = sz00
| X1 = sz10
| ~ iLess0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,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_29,c_0_30]),c_0_20]),c_0_27])]) ).
cnf(c_0_34,negated_conjecture,
( aNaturalNumber0(esk5_1(X1))
| X1 = sz00
| X1 = sz10
| ~ iLess0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,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_31,c_0_26]),c_0_20]),c_0_27])]) ).
cnf(c_0_36,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_32,c_0_33]),c_0_27])]) ).
cnf(c_0_37,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_34,c_0_33]),c_0_27])]) ).
cnf(c_0_38,negated_conjecture,
( isPrime0(esk5_1(X1))
| X1 = sz00
| X1 = sz10
| ~ iLess0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
( ~ isPrime0(X1)
| ~ doDivides0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,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_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,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_38,c_0_33]),c_0_27])]) ).
cnf(c_0_42,negated_conjecture,
( X1 = sz00
| X1 = sz10
| esk7_1(X1) != X1
| ~ doDivides0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_43,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_39,c_0_40]),c_0_37]),c_0_41]) ).
fof(c_0_44,plain,
! [X65,X66,X68] :
( ( aNaturalNumber0(esk2_2(X65,X66))
| ~ doDivides0(X65,X66)
| ~ aNaturalNumber0(X65)
| ~ aNaturalNumber0(X66) )
& ( X66 = sdtasdt0(X65,esk2_2(X65,X66))
| ~ doDivides0(X65,X66)
| ~ aNaturalNumber0(X65)
| ~ aNaturalNumber0(X66) )
& ( ~ aNaturalNumber0(X68)
| X66 != sdtasdt0(X65,X68)
| doDivides0(X65,X66)
| ~ aNaturalNumber0(X65)
| ~ aNaturalNumber0(X66) ) ),
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_45,plain,
! [X9,X10] :
( ~ aNaturalNumber0(X9)
| ~ aNaturalNumber0(X10)
| aNaturalNumber0(sdtasdt0(X9,X10)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_46,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_42,c_0_43]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_47,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( X1 = sz00
| X1 = sz10
| esk7_1(X1) != sz10
| ~ doDivides0(X1,esk4_0)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_50,negated_conjecture,
( esk7_1(esk4_0) = sz00
| esk7_1(esk4_0) = sz10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_43]),c_0_46]) ).
cnf(c_0_51,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_48]) ).
cnf(c_0_52,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_12]) ).
cnf(c_0_53,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_49,c_0_50]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_54,plain,
( doDivides0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_18]),c_0_19])]) ).
fof(c_0_55,plain,
! [X23] :
( ( sdtasdt0(X23,sz00) = sz00
| ~ aNaturalNumber0(X23) )
& ( sz00 = sdtasdt0(sz00,X23)
| ~ aNaturalNumber0(X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])])]) ).
cnf(c_0_56,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_52,c_0_18]),c_0_19])])]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_57,negated_conjecture,
esk7_1(esk4_0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_20])]) ).
cnf(c_0_58,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_12]) ).
cnf(c_0_59,plain,
( sz00 = sdtasdt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_60,negated_conjecture,
sdtasdt0(sz00,esk8_1(esk4_0)) = esk4_0,
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,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_58,c_0_18]),c_0_19])])]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM481+3 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 03:42:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 6977 completed with status 0
% 0.21/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSF-FSMS21-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.53 # Starting sh5l with 136s (1) cores
% 0.21/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 6989 completed with status 0
% 0.21/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSF-FSMS21-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.53 # Preprocessing time : 0.003 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 38
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 93
% 0.21/0.53 # Removed in clause preprocessing : 3
% 0.21/0.53 # Initial clauses in saturation : 90
% 0.21/0.53 # Processed clauses : 291
% 0.21/0.53 # ...of these trivial : 1
% 0.21/0.53 # ...subsumed : 45
% 0.21/0.53 # ...remaining for further processing : 245
% 0.21/0.53 # Other redundant clauses eliminated : 27
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 15
% 0.21/0.53 # Backward-rewritten : 13
% 0.21/0.53 # Generated clauses : 678
% 0.21/0.53 # ...of the previous two non-redundant : 595
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 16
% 0.21/0.53 # Paramodulations : 642
% 0.21/0.53 # Factorizations : 5
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 31
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 532
% 0.21/0.53 # ...of those cached : 513
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 121
% 0.21/0.53 # Positive orientable unit clauses : 21
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 9
% 0.21/0.53 # Non-unit-clauses : 91
% 0.21/0.53 # Current number of unprocessed clauses: 458
% 0.21/0.53 # ...number of literals in the above : 2099
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 113
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 1834
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 293
% 0.21/0.53 # Non-unit clause-clause subsumptions : 45
% 0.21/0.53 # Unit Clause-clause subsumption calls : 441
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 2
% 0.21/0.53 # BW rewrite match successes : 2
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 19868
% 0.21/0.53 # Search garbage collected termcells : 1776
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.032 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.037 s
% 0.21/0.53 # Maximum resident set size: 2060 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.130 s
% 0.21/0.53 # System time : 0.015 s
% 0.21/0.53 # Total time : 0.145 s
% 0.21/0.53 # Maximum resident set size: 1736 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------