TSTP Solution File: NUM447+5 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM447+5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:10 EDT 2023
% Result : Theorem 9.50s 1.68s
% Output : CNFRefutation 9.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 110 ( 14 unt; 0 def)
% Number of atoms : 686 ( 135 equ)
% Maximal formula atoms : 125 ( 6 avg)
% Number of connectives : 917 ( 341 ~; 402 |; 148 &)
% ( 4 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 47 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-3 aty)
% Number of variables : 176 ( 0 sgn; 61 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mAddZero,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mAddZero) ).
fof(mAddNeg,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mAddNeg) ).
fof(mIntZero,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mIntZero) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mIntNeg) ).
fof(mArSeq,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2)
& X2 != sz00 )
=> ! [X3] :
( X3 = szAzrzSzezqlpdtcmdtrp0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aInteger0(X4)
& sdteqdtlpzmzozddtrp0(X4,X1,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mArSeq) ).
fof(m__2046,hypothesis,
( aSet0(xS)
& ! [X1] :
( ( aElementOf0(X1,xS)
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& isPrime0(X2)
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
& sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
| sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2)) ) )
& szAzrzSzezqlpdtcmdtrp0(sz00,X2) = X1 ) )
& ( ? [X2] :
( aInteger0(X2)
& X2 != sz00
& isPrime0(X2)
& ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
& sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
| sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2)) ) ) )
=> szAzrzSzezqlpdtcmdtrp0(sz00,X2) = X1 ) )
=> aElementOf0(X1,xS) ) )
& xS = cS2043 ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',m__2046) ).
fof(m__,conjecture,
( ( ( ? [X1] :
( aElementOf0(X1,xS)
& aElementOf0(xn,X1) )
& aElementOf0(xn,sbsmnsldt0(xS)) )
=> ? [X1] :
( ( ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = xn ) )
| aDivisorOf0(X1,xn) )
& isPrime0(X1) ) )
& ( ? [X1] :
( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = xn )
& aDivisorOf0(X1,xn)
& isPrime0(X1) )
=> ( ? [X1] :
( aElementOf0(X1,xS)
& aElementOf0(xn,X1) )
| aElementOf0(xn,sbsmnsldt0(xS)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',m__) ).
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mDivisor) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mIntMult) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mMulAsso) ).
fof(mEquMod,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& X3 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mEquMod) ).
fof(mMulMinOne,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
& smndt0(X1) = sdtasdt0(X1,smndt0(sz10)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mMulMinOne) ).
fof(mEquModSym,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& X3 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
=> sdteqdtlpzmzozddtrp0(X2,X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mEquModSym) ).
fof(mIntOne,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',mIntOne) ).
fof(m__2106,hypothesis,
aInteger0(xn),
file('/export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p',m__2106) ).
fof(c_0_15,plain,
! [X76] :
( ( sdtpldt0(X76,sz00) = X76
| ~ aInteger0(X76) )
& ( X76 = sdtpldt0(sz00,X76)
| ~ aInteger0(X76) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
fof(c_0_16,plain,
! [X77] :
( ( sdtpldt0(X77,smndt0(X77)) = sz00
| ~ aInteger0(X77) )
& ( sz00 = sdtpldt0(smndt0(X77),X77)
| ~ aInteger0(X77) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddNeg])])]) ).
cnf(c_0_17,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
( sz00 = sdtpldt0(smndt0(X1),X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[mIntZero]) ).
fof(c_0_20,plain,
! [X81] :
( ~ aInteger0(X81)
| aInteger0(smndt0(X81)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
fof(c_0_21,plain,
! [X28,X29,X30,X31,X32,X33] :
( ( aSet0(X30)
| X30 != szAzrzSzezqlpdtcmdtrp0(X28,X29)
| ~ aInteger0(X28)
| ~ aInteger0(X29)
| X29 = sz00 )
& ( aInteger0(X31)
| ~ aElementOf0(X31,X30)
| X30 != szAzrzSzezqlpdtcmdtrp0(X28,X29)
| ~ aInteger0(X28)
| ~ aInteger0(X29)
| X29 = sz00 )
& ( sdteqdtlpzmzozddtrp0(X31,X28,X29)
| ~ aElementOf0(X31,X30)
| X30 != szAzrzSzezqlpdtcmdtrp0(X28,X29)
| ~ aInteger0(X28)
| ~ aInteger0(X29)
| X29 = sz00 )
& ( ~ aInteger0(X32)
| ~ sdteqdtlpzmzozddtrp0(X32,X28,X29)
| aElementOf0(X32,X30)
| X30 != szAzrzSzezqlpdtcmdtrp0(X28,X29)
| ~ aInteger0(X28)
| ~ aInteger0(X29)
| X29 = sz00 )
& ( ~ aElementOf0(esk8_3(X28,X29,X33),X33)
| ~ aInteger0(esk8_3(X28,X29,X33))
| ~ sdteqdtlpzmzozddtrp0(esk8_3(X28,X29,X33),X28,X29)
| ~ aSet0(X33)
| X33 = szAzrzSzezqlpdtcmdtrp0(X28,X29)
| ~ aInteger0(X28)
| ~ aInteger0(X29)
| X29 = sz00 )
& ( aInteger0(esk8_3(X28,X29,X33))
| aElementOf0(esk8_3(X28,X29,X33),X33)
| ~ aSet0(X33)
| X33 = szAzrzSzezqlpdtcmdtrp0(X28,X29)
| ~ aInteger0(X28)
| ~ aInteger0(X29)
| X29 = sz00 )
& ( sdteqdtlpzmzozddtrp0(esk8_3(X28,X29,X33),X28,X29)
| aElementOf0(esk8_3(X28,X29,X33),X33)
| ~ aSet0(X33)
| X33 = szAzrzSzezqlpdtcmdtrp0(X28,X29)
| ~ aInteger0(X28)
| ~ aInteger0(X29)
| X29 = sz00 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mArSeq])])])])])]) ).
fof(c_0_22,hypothesis,
! [X5,X7,X9,X10,X11,X12,X13,X15,X16] :
( aSet0(xS)
& ( aInteger0(esk1_1(X5))
| ~ aElementOf0(X5,xS) )
& ( esk1_1(X5) != sz00
| ~ aElementOf0(X5,xS) )
& ( isPrime0(esk1_1(X5))
| ~ aElementOf0(X5,xS) )
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aInteger0(X7)
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aInteger0(esk2_2(X5,X7))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( sdtasdt0(esk1_1(X5),esk2_2(X5,X7)) = sdtpldt0(X7,smndt0(sz00))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aDivisorOf0(esk1_1(X5),sdtpldt0(X7,smndt0(sz00)))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( sdteqdtlpzmzozddtrp0(X7,sz00,esk1_1(X5))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ aInteger0(X10)
| sdtasdt0(esk1_1(X5),X10) != sdtpldt0(X9,smndt0(sz00))
| ~ aInteger0(X9)
| aElementOf0(X9,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ aDivisorOf0(esk1_1(X5),sdtpldt0(X9,smndt0(sz00)))
| ~ aInteger0(X9)
| aElementOf0(X9,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ sdteqdtlpzmzozddtrp0(X9,sz00,esk1_1(X5))
| ~ aInteger0(X9)
| aElementOf0(X9,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)) = X5
| ~ aElementOf0(X5,xS) )
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( aInteger0(X13)
| ~ aElementOf0(X13,szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( aInteger0(esk3_3(X11,X12,X13))
| ~ aElementOf0(X13,szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( sdtasdt0(X12,esk3_3(X11,X12,X13)) = sdtpldt0(X13,smndt0(sz00))
| ~ aElementOf0(X13,szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( aDivisorOf0(X12,sdtpldt0(X13,smndt0(sz00)))
| ~ aElementOf0(X13,szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( sdteqdtlpzmzozddtrp0(X13,sz00,X12)
| ~ aElementOf0(X13,szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( ~ aInteger0(X16)
| sdtasdt0(X12,X16) != sdtpldt0(X15,smndt0(sz00))
| ~ aInteger0(X15)
| aElementOf0(X15,szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( ~ aDivisorOf0(X12,sdtpldt0(X15,smndt0(sz00)))
| ~ aInteger0(X15)
| aElementOf0(X15,szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( ~ sdteqdtlpzmzozddtrp0(X15,sz00,X12)
| ~ aInteger0(X15)
| aElementOf0(X15,szAzrzSzezqlpdtcmdtrp0(sz00,X12))
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& ( szAzrzSzezqlpdtcmdtrp0(sz00,X12) != X11
| ~ aInteger0(X12)
| X12 = sz00
| ~ isPrime0(X12)
| aElementOf0(X11,xS) )
& xS = cS2043 ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2046])])])])])]) ).
cnf(c_0_23,plain,
( smndt0(sz00) = sz00
| ~ aInteger0(smndt0(sz00)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_24,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( sdteqdtlpzmzozddtrp0(X1,X2,X3)
| X3 = sz00
| ~ aElementOf0(X1,X4)
| X4 != szAzrzSzezqlpdtcmdtrp0(X2,X3)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,negated_conjecture,
~ ( ( ( ? [X1] :
( aElementOf0(X1,xS)
& aElementOf0(xn,X1) )
& aElementOf0(xn,sbsmnsldt0(xS)) )
=> ? [X1] :
( ( ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = xn ) )
| aDivisorOf0(X1,xn) )
& isPrime0(X1) ) )
& ( ? [X1] :
( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = xn )
& aDivisorOf0(X1,xn)
& isPrime0(X1) )
=> ( ? [X1] :
( aElementOf0(X1,xS)
& aElementOf0(xn,X1) )
| aElementOf0(xn,sbsmnsldt0(xS)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_27,hypothesis,
( aDivisorOf0(esk1_1(X1),sdtpldt0(X2,smndt0(sz00)))
| ~ aElementOf0(X2,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X1)))
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
smndt0(sz00) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19])]) ).
cnf(c_0_29,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X2,X3,X1)
| ~ aElementOf0(X2,szAzrzSzezqlpdtcmdtrp0(X3,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X3) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_30,hypothesis,
( szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X1)) = X1
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,hypothesis,
( aInteger0(esk1_1(X1))
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,hypothesis,
( esk1_1(X1) != sz00
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,hypothesis,
( aInteger0(X1)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X2)))
| ~ aElementOf0(X2,xS) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_34,negated_conjecture,
! [X18,X19,X22] :
( ( aInteger0(esk5_0)
| aElementOf0(esk4_0,xS) )
& ( esk5_0 != sz00
| aElementOf0(esk4_0,xS) )
& ( aInteger0(esk6_0)
| aElementOf0(esk4_0,xS) )
& ( sdtasdt0(esk5_0,esk6_0) = xn
| aElementOf0(esk4_0,xS) )
& ( aDivisorOf0(esk5_0,xn)
| aElementOf0(esk4_0,xS) )
& ( isPrime0(esk5_0)
| aElementOf0(esk4_0,xS) )
& ( ~ aElementOf0(X22,xS)
| ~ aElementOf0(xn,X22)
| aElementOf0(esk4_0,xS) )
& ( ~ aElementOf0(xn,sbsmnsldt0(xS))
| aElementOf0(esk4_0,xS) )
& ( aInteger0(esk5_0)
| aElementOf0(xn,esk4_0) )
& ( esk5_0 != sz00
| aElementOf0(xn,esk4_0) )
& ( aInteger0(esk6_0)
| aElementOf0(xn,esk4_0) )
& ( sdtasdt0(esk5_0,esk6_0) = xn
| aElementOf0(xn,esk4_0) )
& ( aDivisorOf0(esk5_0,xn)
| aElementOf0(xn,esk4_0) )
& ( isPrime0(esk5_0)
| aElementOf0(xn,esk4_0) )
& ( ~ aElementOf0(X22,xS)
| ~ aElementOf0(xn,X22)
| aElementOf0(xn,esk4_0) )
& ( ~ aElementOf0(xn,sbsmnsldt0(xS))
| aElementOf0(xn,esk4_0) )
& ( aInteger0(esk5_0)
| aElementOf0(xn,sbsmnsldt0(xS)) )
& ( esk5_0 != sz00
| aElementOf0(xn,sbsmnsldt0(xS)) )
& ( aInteger0(esk6_0)
| aElementOf0(xn,sbsmnsldt0(xS)) )
& ( sdtasdt0(esk5_0,esk6_0) = xn
| aElementOf0(xn,sbsmnsldt0(xS)) )
& ( aDivisorOf0(esk5_0,xn)
| aElementOf0(xn,sbsmnsldt0(xS)) )
& ( isPrime0(esk5_0)
| aElementOf0(xn,sbsmnsldt0(xS)) )
& ( ~ aElementOf0(X22,xS)
| ~ aElementOf0(xn,X22)
| aElementOf0(xn,sbsmnsldt0(xS)) )
& ( ~ aElementOf0(xn,sbsmnsldt0(xS))
| aElementOf0(xn,sbsmnsldt0(xS)) )
& ( aInteger0(esk5_0)
| ~ aInteger0(X18)
| X18 = sz00
| ~ aInteger0(X19)
| sdtasdt0(X18,X19) != xn
| ~ isPrime0(X18) )
& ( esk5_0 != sz00
| ~ aInteger0(X18)
| X18 = sz00
| ~ aInteger0(X19)
| sdtasdt0(X18,X19) != xn
| ~ isPrime0(X18) )
& ( aInteger0(esk6_0)
| ~ aInteger0(X18)
| X18 = sz00
| ~ aInteger0(X19)
| sdtasdt0(X18,X19) != xn
| ~ isPrime0(X18) )
& ( sdtasdt0(esk5_0,esk6_0) = xn
| ~ aInteger0(X18)
| X18 = sz00
| ~ aInteger0(X19)
| sdtasdt0(X18,X19) != xn
| ~ isPrime0(X18) )
& ( aDivisorOf0(esk5_0,xn)
| ~ aInteger0(X18)
| X18 = sz00
| ~ aInteger0(X19)
| sdtasdt0(X18,X19) != xn
| ~ isPrime0(X18) )
& ( isPrime0(esk5_0)
| ~ aInteger0(X18)
| X18 = sz00
| ~ aInteger0(X19)
| sdtasdt0(X18,X19) != xn
| ~ isPrime0(X18) )
& ( ~ aElementOf0(X22,xS)
| ~ aElementOf0(xn,X22)
| ~ aInteger0(X18)
| X18 = sz00
| ~ aInteger0(X19)
| sdtasdt0(X18,X19) != xn
| ~ isPrime0(X18) )
& ( ~ aElementOf0(xn,sbsmnsldt0(xS))
| ~ aInteger0(X18)
| X18 = sz00
| ~ aInteger0(X19)
| sdtasdt0(X18,X19) != xn
| ~ isPrime0(X18) )
& ( aInteger0(esk5_0)
| ~ aDivisorOf0(X18,xn)
| ~ isPrime0(X18) )
& ( esk5_0 != sz00
| ~ aDivisorOf0(X18,xn)
| ~ isPrime0(X18) )
& ( aInteger0(esk6_0)
| ~ aDivisorOf0(X18,xn)
| ~ isPrime0(X18) )
& ( sdtasdt0(esk5_0,esk6_0) = xn
| ~ aDivisorOf0(X18,xn)
| ~ isPrime0(X18) )
& ( aDivisorOf0(esk5_0,xn)
| ~ aDivisorOf0(X18,xn)
| ~ isPrime0(X18) )
& ( isPrime0(esk5_0)
| ~ aDivisorOf0(X18,xn)
| ~ isPrime0(X18) )
& ( ~ aElementOf0(X22,xS)
| ~ aElementOf0(xn,X22)
| ~ aDivisorOf0(X18,xn)
| ~ isPrime0(X18) )
& ( ~ aElementOf0(xn,sbsmnsldt0(xS))
| ~ aDivisorOf0(X18,xn)
| ~ isPrime0(X18) ) ),
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_26])])])])]) ).
cnf(c_0_35,hypothesis,
( aDivisorOf0(esk1_1(X1),sdtpldt0(X2,sz00))
| ~ aElementOf0(X2,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X1)))
| ~ aElementOf0(X1,xS) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,hypothesis,
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X2)))
| ~ sdteqdtlpzmzozddtrp0(X1,sz00,esk1_1(X2))
| ~ aInteger0(X1)
| ~ aElementOf0(X2,xS) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_37,hypothesis,
( sdteqdtlpzmzozddtrp0(X1,sz00,esk1_1(X2))
| ~ aElementOf0(X2,xS)
| ~ aElementOf0(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_19])]),c_0_31]),c_0_32]) ).
cnf(c_0_38,hypothesis,
( aInteger0(X1)
| ~ aElementOf0(X2,xS)
| ~ aElementOf0(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_39,negated_conjecture,
( ~ aElementOf0(xn,sbsmnsldt0(xS))
| ~ aDivisorOf0(X1,xn)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( aDivisorOf0(esk5_0,xn)
| aElementOf0(xn,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,hypothesis,
( aDivisorOf0(esk1_1(X1),X2)
| ~ aElementOf0(X2,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X1)))
| ~ aElementOf0(X1,xS) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_17]),c_0_33]) ).
cnf(c_0_42,hypothesis,
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X2)))
| ~ aElementOf0(X2,xS)
| ~ aElementOf0(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
fof(c_0_43,plain,
! [X61,X62,X64,X65] :
( ( aInteger0(X62)
| ~ aDivisorOf0(X62,X61)
| ~ aInteger0(X61) )
& ( X62 != sz00
| ~ aDivisorOf0(X62,X61)
| ~ aInteger0(X61) )
& ( aInteger0(esk11_2(X61,X62))
| ~ aDivisorOf0(X62,X61)
| ~ aInteger0(X61) )
& ( sdtasdt0(X62,esk11_2(X61,X62)) = X61
| ~ aDivisorOf0(X62,X61)
| ~ aInteger0(X61) )
& ( ~ aInteger0(X64)
| X64 = sz00
| ~ aInteger0(X65)
| sdtasdt0(X64,X65) != X61
| aDivisorOf0(X64,X61)
| ~ aInteger0(X61) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivisor])])])])])]) ).
fof(c_0_44,plain,
! [X83,X84] :
( ~ aInteger0(X83)
| ~ aInteger0(X84)
| aInteger0(sdtasdt0(X83,X84)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])]) ).
cnf(c_0_45,negated_conjecture,
( aDivisorOf0(esk5_0,xn)
| ~ isPrime0(X1)
| ~ aDivisorOf0(X1,xn) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,hypothesis,
( aDivisorOf0(esk1_1(X1),X2)
| ~ aElementOf0(X1,xS)
| ~ aElementOf0(X2,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,hypothesis,
( isPrime0(esk1_1(X1))
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_48,negated_conjecture,
( isPrime0(esk5_0)
| ~ aDivisorOf0(X1,xn)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_49,plain,
( X1 = sz00
| aDivisorOf0(X1,X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X3
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( aInteger0(esk5_0)
| ~ aDivisorOf0(X1,xn)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,negated_conjecture,
( aDivisorOf0(esk5_0,xn)
| ~ aElementOf0(X1,xS)
| ~ aElementOf0(xn,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( aElementOf0(esk4_0,xS)
| esk5_0 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_54,negated_conjecture,
( aDivisorOf0(esk5_0,xn)
| aElementOf0(xn,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_55,negated_conjecture,
( isPrime0(esk5_0)
| ~ aElementOf0(X1,xS)
| ~ aElementOf0(xn,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( isPrime0(esk5_0)
| aElementOf0(xn,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_57,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( aInteger0(esk5_0)
| ~ aElementOf0(X1,xS)
| ~ aElementOf0(xn,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_46]),c_0_47]) ).
cnf(c_0_59,negated_conjecture,
( aInteger0(esk5_0)
| aElementOf0(esk4_0,xS) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_60,negated_conjecture,
( aInteger0(esk5_0)
| aElementOf0(xn,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_61,negated_conjecture,
( esk5_0 != sz00
| ~ aDivisorOf0(X1,xn)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_62,negated_conjecture,
( aDivisorOf0(esk5_0,xn)
| esk5_0 != sz00 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_63,negated_conjecture,
( isPrime0(esk5_0)
| esk5_0 != sz00 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_56]) ).
fof(c_0_64,plain,
! [X85,X86,X87] :
( ~ aInteger0(X85)
| ~ aInteger0(X86)
| ~ aInteger0(X87)
| sdtasdt0(X85,sdtasdt0(X86,X87)) = sdtasdt0(sdtasdt0(X85,X86),X87) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
cnf(c_0_65,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtasdt0(X1,sdtasdt0(X2,X3)))
| ~ aInteger0(X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_50]) ).
cnf(c_0_66,negated_conjecture,
aInteger0(esk5_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_67,negated_conjecture,
esk5_0 != sz00,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_68,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_69,plain,
( sdtasdt0(X1,esk11_2(X2,X1)) = X2
| ~ aDivisorOf0(X1,X2)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_70,plain,
( aInteger0(X1)
| ~ aDivisorOf0(X1,X2)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_71,plain,
( aInteger0(esk11_2(X1,X2))
| ~ aDivisorOf0(X2,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_72,plain,
! [X45,X46,X47] :
( ( ~ sdteqdtlpzmzozddtrp0(X45,X46,X47)
| aDivisorOf0(X47,sdtpldt0(X45,smndt0(X46)))
| ~ aInteger0(X45)
| ~ aInteger0(X46)
| ~ aInteger0(X47)
| X47 = sz00 )
& ( ~ aDivisorOf0(X47,sdtpldt0(X45,smndt0(X46)))
| sdteqdtlpzmzozddtrp0(X45,X46,X47)
| ~ aInteger0(X45)
| ~ aInteger0(X46)
| ~ aInteger0(X47)
| X47 = sz00 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEquMod])])]) ).
cnf(c_0_73,negated_conjecture,
( aDivisorOf0(esk5_0,sdtasdt0(esk5_0,sdtasdt0(X1,X2)))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_74,plain,
( sdtasdt0(X1,sdtasdt0(esk11_2(X2,X1),X3)) = sdtasdt0(X2,X3)
| ~ aDivisorOf0(X1,X2)
| ~ aInteger0(X3)
| ~ aInteger0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71]) ).
fof(c_0_75,plain,
! [X82] :
( ( sdtasdt0(smndt0(sz10),X82) = smndt0(X82)
| ~ aInteger0(X82) )
& ( smndt0(X82) = sdtasdt0(X82,smndt0(sz10))
| ~ aInteger0(X82) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMinOne])])]) ).
cnf(c_0_76,plain,
( sdteqdtlpzmzozddtrp0(X2,X3,X1)
| X1 = sz00
| ~ aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_77,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_78,negated_conjecture,
( aDivisorOf0(esk5_0,sdtasdt0(X1,X2))
| ~ aDivisorOf0(esk5_0,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_71]) ).
cnf(c_0_79,plain,
( smndt0(X1) = sdtasdt0(X1,smndt0(sz10))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
fof(c_0_80,plain,
! [X50,X51,X52] :
( ~ aInteger0(X50)
| ~ aInteger0(X51)
| ~ aInteger0(X52)
| X52 = sz00
| ~ sdteqdtlpzmzozddtrp0(X50,X51,X52)
| sdteqdtlpzmzozddtrp0(X51,X50,X52) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEquModSym])]) ).
cnf(c_0_81,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(sz00,X2,X1)
| ~ aDivisorOf0(X1,smndt0(X2))
| ~ aInteger0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_19])]),c_0_70]),c_0_24]) ).
cnf(c_0_82,negated_conjecture,
( aDivisorOf0(esk5_0,smndt0(X1))
| ~ aDivisorOf0(esk5_0,X1)
| ~ aInteger0(smndt0(sz10))
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_83,hypothesis,
( X1 = sz00
| aElementOf0(X2,xS)
| szAzrzSzezqlpdtcmdtrp0(sz00,X1) != X2
| ~ aInteger0(X1)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_84,plain,
( aElementOf0(X1,X4)
| X3 = sz00
| ~ aInteger0(X1)
| ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| X4 != szAzrzSzezqlpdtcmdtrp0(X2,X3)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_85,plain,
( X3 = sz00
| sdteqdtlpzmzozddtrp0(X2,X1,X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ sdteqdtlpzmzozddtrp0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_86,negated_conjecture,
( sdteqdtlpzmzozddtrp0(sz00,X1,esk5_0)
| ~ aDivisorOf0(esk5_0,X1)
| ~ aInteger0(smndt0(sz10))
| ~ aInteger0(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_67]) ).
cnf(c_0_87,hypothesis,
( X1 = sz00
| aElementOf0(szAzrzSzezqlpdtcmdtrp0(sz00,X1),xS)
| ~ isPrime0(X1)
| ~ aInteger0(X1) ),
inference(er,[status(thm)],[c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( isPrime0(esk5_0)
| aElementOf0(esk4_0,xS) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_89,plain,
( X1 = sz00
| aElementOf0(X2,szAzrzSzezqlpdtcmdtrp0(X3,X1))
| ~ sdteqdtlpzmzozddtrp0(X2,X3,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2) ),
inference(er,[status(thm)],[c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( sdteqdtlpzmzozddtrp0(X1,sz00,esk5_0)
| ~ aDivisorOf0(esk5_0,X1)
| ~ aInteger0(smndt0(sz10))
| ~ aInteger0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_66]),c_0_19])]),c_0_67]) ).
cnf(c_0_91,negated_conjecture,
( aElementOf0(xn,esk4_0)
| esk5_0 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_92,negated_conjecture,
( aElementOf0(esk4_0,xS)
| ~ aElementOf0(X1,xS)
| ~ aElementOf0(xn,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_93,negated_conjecture,
( aElementOf0(szAzrzSzezqlpdtcmdtrp0(sz00,esk5_0),xS)
| aElementOf0(esk4_0,xS) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_59]),c_0_53]) ).
cnf(c_0_94,negated_conjecture,
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz00,esk5_0))
| ~ aDivisorOf0(esk5_0,X1)
| ~ aInteger0(smndt0(sz10))
| ~ aInteger0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_66]),c_0_19])]),c_0_67]) ).
cnf(c_0_95,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[mIntOne]) ).
cnf(c_0_96,negated_conjecture,
( aElementOf0(xn,esk4_0)
| ~ aElementOf0(X1,xS)
| ~ aElementOf0(xn,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_97,negated_conjecture,
( aElementOf0(szAzrzSzezqlpdtcmdtrp0(sz00,esk5_0),xS)
| aElementOf0(xn,esk4_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_56]),c_0_60]),c_0_91]) ).
cnf(c_0_98,negated_conjecture,
( aElementOf0(esk4_0,xS)
| ~ aElementOf0(xn,szAzrzSzezqlpdtcmdtrp0(sz00,esk5_0)) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_99,negated_conjecture,
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz00,esk5_0))
| ~ aDivisorOf0(esk5_0,X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_24]),c_0_95])]) ).
cnf(c_0_100,hypothesis,
aInteger0(xn),
inference(split_conjunct,[status(thm)],[m__2106]) ).
cnf(c_0_101,negated_conjecture,
( aDivisorOf0(esk5_0,xn)
| aElementOf0(esk4_0,xS) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_102,negated_conjecture,
( aElementOf0(xn,esk4_0)
| ~ aElementOf0(xn,szAzrzSzezqlpdtcmdtrp0(sz00,esk5_0)) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_103,negated_conjecture,
( ~ aElementOf0(X1,xS)
| ~ aElementOf0(xn,X1)
| ~ aDivisorOf0(X2,xn)
| ~ isPrime0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_104,negated_conjecture,
aElementOf0(esk4_0,xS),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100])]),c_0_101]) ).
cnf(c_0_105,negated_conjecture,
aElementOf0(xn,esk4_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_99]),c_0_100])]),c_0_54]) ).
cnf(c_0_106,negated_conjecture,
( ~ isPrime0(X1)
| ~ aDivisorOf0(X1,xn) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105])]) ).
cnf(c_0_107,negated_conjecture,
aDivisorOf0(esk5_0,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_104]),c_0_105])]) ).
cnf(c_0_108,negated_conjecture,
isPrime0(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_104]),c_0_105])]) ).
cnf(c_0_109,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : NUM447+5 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n002.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 14:52:14 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.0VohoJTzlT/E---3.1_2000.p
% 9.50/1.68 # Version: 3.1pre001
% 9.50/1.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.50/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.50/1.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.50/1.68 # Starting new_bool_3 with 300s (1) cores
% 9.50/1.68 # Starting new_bool_1 with 300s (1) cores
% 9.50/1.68 # Starting sh5l with 300s (1) cores
% 9.50/1.68 # new_bool_3 with pid 2080 completed with status 0
% 9.50/1.68 # Result found by new_bool_3
% 9.50/1.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.50/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.50/1.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.50/1.68 # Starting new_bool_3 with 300s (1) cores
% 9.50/1.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 9.50/1.68 # Search class: FGHSF-FSLM31-SFFFFFNN
% 9.50/1.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 9.50/1.68 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 148s (1) cores
% 9.50/1.68 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2083 completed with status 0
% 9.50/1.68 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.50/1.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.50/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.50/1.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.50/1.68 # Starting new_bool_3 with 300s (1) cores
% 9.50/1.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 9.50/1.68 # Search class: FGHSF-FSLM31-SFFFFFNN
% 9.50/1.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 9.50/1.68 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 148s (1) cores
% 9.50/1.68 # Preprocessing time : 0.003 s
% 9.50/1.68 # Presaturation interreduction done
% 9.50/1.68
% 9.50/1.68 # Proof found!
% 9.50/1.68 # SZS status Theorem
% 9.50/1.68 # SZS output start CNFRefutation
% See solution above
% 9.50/1.68 # Parsed axioms : 44
% 9.50/1.68 # Removed by relevancy pruning/SinE : 8
% 9.50/1.68 # Initial clauses : 146
% 9.50/1.68 # Removed in clause preprocessing : 5
% 9.50/1.68 # Initial clauses in saturation : 141
% 9.50/1.68 # Processed clauses : 4794
% 9.50/1.68 # ...of these trivial : 42
% 9.50/1.68 # ...subsumed : 2787
% 9.50/1.68 # ...remaining for further processing : 1965
% 9.50/1.68 # Other redundant clauses eliminated : 106
% 9.50/1.68 # Clauses deleted for lack of memory : 0
% 9.50/1.68 # Backward-subsumed : 197
% 9.50/1.68 # Backward-rewritten : 847
% 9.50/1.68 # Generated clauses : 72434
% 9.50/1.68 # ...of the previous two non-redundant : 69524
% 9.50/1.68 # ...aggressively subsumed : 0
% 9.50/1.68 # Contextual simplify-reflections : 332
% 9.50/1.68 # Paramodulations : 72319
% 9.50/1.68 # Factorizations : 0
% 9.50/1.68 # NegExts : 0
% 9.50/1.68 # Equation resolutions : 106
% 9.50/1.68 # Total rewrite steps : 31292
% 9.50/1.68 # Propositional unsat checks : 0
% 9.50/1.68 # Propositional check models : 0
% 9.50/1.68 # Propositional check unsatisfiable : 0
% 9.50/1.68 # Propositional clauses : 0
% 9.50/1.68 # Propositional clauses after purity: 0
% 9.50/1.68 # Propositional unsat core size : 0
% 9.50/1.68 # Propositional preprocessing time : 0.000
% 9.50/1.68 # Propositional encoding time : 0.000
% 9.50/1.68 # Propositional solver time : 0.000
% 9.50/1.68 # Success case prop preproc time : 0.000
% 9.50/1.68 # Success case prop encoding time : 0.000
% 9.50/1.68 # Success case prop solver time : 0.000
% 9.50/1.68 # Current number of processed clauses : 752
% 9.50/1.68 # Positive orientable unit clauses : 72
% 9.50/1.68 # Positive unorientable unit clauses: 0
% 9.50/1.68 # Negative unit clauses : 3
% 9.50/1.68 # Non-unit-clauses : 677
% 9.50/1.68 # Current number of unprocessed clauses: 64716
% 9.50/1.68 # ...number of literals in the above : 265065
% 9.50/1.68 # Current number of archived formulas : 0
% 9.50/1.68 # Current number of archived clauses : 1194
% 9.50/1.68 # Clause-clause subsumption calls (NU) : 260824
% 9.50/1.68 # Rec. Clause-clause subsumption calls : 122221
% 9.50/1.68 # Non-unit clause-clause subsumptions : 3199
% 9.50/1.68 # Unit Clause-clause subsumption calls : 11766
% 9.50/1.68 # Rewrite failures with RHS unbound : 0
% 9.50/1.68 # BW rewrite match attempts : 34
% 9.50/1.68 # BW rewrite match successes : 18
% 9.50/1.68 # Condensation attempts : 0
% 9.50/1.68 # Condensation successes : 0
% 9.50/1.68 # Termbank termtop insertions : 1449844
% 9.50/1.68
% 9.50/1.68 # -------------------------------------------------
% 9.50/1.68 # User time : 1.144 s
% 9.50/1.68 # System time : 0.053 s
% 9.50/1.68 # Total time : 1.197 s
% 9.50/1.68 # Maximum resident set size: 2168 pages
% 9.50/1.68
% 9.50/1.68 # -------------------------------------------------
% 9.50/1.68 # User time : 1.147 s
% 9.50/1.68 # System time : 0.055 s
% 9.50/1.68 # Total time : 1.201 s
% 9.50/1.68 # Maximum resident set size: 1740 pages
% 9.50/1.68 % E---3.1 exiting
%------------------------------------------------------------------------------