TSTP Solution File: NUM437+5 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM437+5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:45 EDT 2023
% Result : Theorem 0.71s 0.58s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 53 ( 6 unt; 0 def)
% Number of atoms : 425 ( 38 equ)
% Maximal formula atoms : 69 ( 8 avg)
% Number of connectives : 555 ( 183 ~; 200 |; 130 &)
% ( 8 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 4 con; 0-3 aty)
% Number of variables : 123 ( 10 sgn; 55 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(X1,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(X1)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(X1)))
& sdteqdtlpzmzozddtrp0(X3,X1,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(X1)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(X1)))
| sdteqdtlpzmzozddtrp0(X3,X1,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2)) ) ) )
=> ( ! [X3] :
( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2))
=> aElementOf0(X3,sbsmnsldt0(xS)) )
| aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X1,X2),sbsmnsldt0(xS)) ) ) ) )
| isOpen0(sbsmnsldt0(xS)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OnHfeEB1Ut/E---3.1_19760.p',m__) ).
fof(m__1750,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> ( aSet0(cS1395)
& ! [X2] :
( aElementOf0(X2,cS1395)
<=> aInteger0(X2) )
& aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,cS1395) )
& aSubsetOf0(X1,cS1395)
& ! [X2] :
( aElementOf0(X2,X1)
=> ? [X3] :
( aInteger0(X3)
& X3 != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(X2,X3))
& ! [X4] :
( ( aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3))
=> ( aInteger0(X4)
& ? [X5] :
( aInteger0(X5)
& sdtasdt0(X3,X5) = sdtpldt0(X4,smndt0(X2)) )
& aDivisorOf0(X3,sdtpldt0(X4,smndt0(X2)))
& sdteqdtlpzmzozddtrp0(X4,X2,X3) ) )
& ( ( aInteger0(X4)
& ( ? [X5] :
( aInteger0(X5)
& sdtasdt0(X3,X5) = sdtpldt0(X4,smndt0(X2)) )
| aDivisorOf0(X3,sdtpldt0(X4,smndt0(X2)))
| sdteqdtlpzmzozddtrp0(X4,X2,X3) ) )
=> aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3)) ) )
& ! [X4] :
( aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3))
=> aElementOf0(X4,X1) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X2,X3),X1) ) )
& isOpen0(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OnHfeEB1Ut/E---3.1_19760.p',m__1750) ).
fof(mSubset,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OnHfeEB1Ut/E---3.1_19760.p',mSubset) ).
fof(mOpen,axiom,
! [X1] :
( aSubsetOf0(X1,cS1395)
=> ( isOpen0(X1)
<=> ! [X2] :
( aElementOf0(X2,X1)
=> ? [X3] :
( aInteger0(X3)
& X3 != sz00
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X2,X3),X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OnHfeEB1Ut/E---3.1_19760.p',mOpen) ).
fof(c_0_4,plain,
! [X1] :
( epred1_1(X1)
<=> ( aSet0(cS1395)
& ! [X2] :
( aElementOf0(X2,cS1395)
<=> aInteger0(X2) )
& aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,cS1395) )
& aSubsetOf0(X1,cS1395)
& ! [X2] :
( aElementOf0(X2,X1)
=> ? [X3] :
( aInteger0(X3)
& X3 != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(X2,X3))
& ! [X4] :
( ( aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3))
=> ( aInteger0(X4)
& ? [X5] :
( aInteger0(X5)
& sdtasdt0(X3,X5) = sdtpldt0(X4,smndt0(X2)) )
& aDivisorOf0(X3,sdtpldt0(X4,smndt0(X2)))
& sdteqdtlpzmzozddtrp0(X4,X2,X3) ) )
& ( ( aInteger0(X4)
& ( ? [X5] :
( aInteger0(X5)
& sdtasdt0(X3,X5) = sdtpldt0(X4,smndt0(X2)) )
| aDivisorOf0(X3,sdtpldt0(X4,smndt0(X2)))
| sdteqdtlpzmzozddtrp0(X4,X2,X3) ) )
=> aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3)) ) )
& ! [X4] :
( aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3))
=> aElementOf0(X4,X1) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X2,X3),X1) ) )
& isOpen0(X1) ) ),
introduced(definition) ).
fof(c_0_5,plain,
! [X1] :
( epred1_1(X1)
=> ( aSet0(cS1395)
& ! [X2] :
( aElementOf0(X2,cS1395)
<=> aInteger0(X2) )
& aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,cS1395) )
& aSubsetOf0(X1,cS1395)
& ! [X2] :
( aElementOf0(X2,X1)
=> ? [X3] :
( aInteger0(X3)
& X3 != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(X2,X3))
& ! [X4] :
( ( aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3))
=> ( aInteger0(X4)
& ? [X5] :
( aInteger0(X5)
& sdtasdt0(X3,X5) = sdtpldt0(X4,smndt0(X2)) )
& aDivisorOf0(X3,sdtpldt0(X4,smndt0(X2)))
& sdteqdtlpzmzozddtrp0(X4,X2,X3) ) )
& ( ( aInteger0(X4)
& ( ? [X5] :
( aInteger0(X5)
& sdtasdt0(X3,X5) = sdtpldt0(X4,smndt0(X2)) )
| aDivisorOf0(X3,sdtpldt0(X4,smndt0(X2)))
| sdteqdtlpzmzozddtrp0(X4,X2,X3) ) )
=> aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3)) ) )
& ! [X4] :
( aElementOf0(X4,szAzrzSzezqlpdtcmdtrp0(X2,X3))
=> aElementOf0(X4,X1) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X2,X3),X1) ) )
& isOpen0(X1) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
~ ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(X1,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(X1)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(X1)))
& sdteqdtlpzmzozddtrp0(X3,X1,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(X1)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(X1)))
| sdteqdtlpzmzozddtrp0(X3,X1,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2)) ) ) )
=> ( ! [X3] :
( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2))
=> aElementOf0(X3,sbsmnsldt0(xS)) )
| aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X1,X2),sbsmnsldt0(xS)) ) ) ) )
| isOpen0(sbsmnsldt0(xS)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> epred1_1(X1) ) ),
inference(apply_def,[status(thm)],[m__1750,c_0_4]) ).
fof(c_0_8,plain,
! [X101,X102,X103,X104,X105,X107,X109,X110,X111] :
( ( aSet0(cS1395)
| ~ epred1_1(X101) )
& ( ~ aElementOf0(X102,cS1395)
| aInteger0(X102)
| ~ epred1_1(X101) )
& ( ~ aInteger0(X103)
| aElementOf0(X103,cS1395)
| ~ epred1_1(X101) )
& ( aSet0(X101)
| ~ epred1_1(X101) )
& ( ~ aElementOf0(X104,X101)
| aElementOf0(X104,cS1395)
| ~ epred1_1(X101) )
& ( aSubsetOf0(X101,cS1395)
| ~ epred1_1(X101) )
& ( aInteger0(esk16_2(X101,X105))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( esk16_2(X101,X105) != sz00
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( aInteger0(X107)
| ~ aElementOf0(X107,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( aInteger0(esk17_3(X101,X105,X107))
| ~ aElementOf0(X107,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( sdtasdt0(esk16_2(X101,X105),esk17_3(X101,X105,X107)) = sdtpldt0(X107,smndt0(X105))
| ~ aElementOf0(X107,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( aDivisorOf0(esk16_2(X101,X105),sdtpldt0(X107,smndt0(X105)))
| ~ aElementOf0(X107,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( sdteqdtlpzmzozddtrp0(X107,X105,esk16_2(X101,X105))
| ~ aElementOf0(X107,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( ~ aInteger0(X110)
| sdtasdt0(esk16_2(X101,X105),X110) != sdtpldt0(X109,smndt0(X105))
| ~ aInteger0(X109)
| aElementOf0(X109,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( ~ aDivisorOf0(esk16_2(X101,X105),sdtpldt0(X109,smndt0(X105)))
| ~ aInteger0(X109)
| aElementOf0(X109,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( ~ sdteqdtlpzmzozddtrp0(X109,X105,esk16_2(X101,X105))
| ~ aInteger0(X109)
| aElementOf0(X109,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( ~ aElementOf0(X111,szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)))
| aElementOf0(X111,X101)
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X105,esk16_2(X101,X105)),X101)
| ~ aElementOf0(X105,X101)
| ~ epred1_1(X101) )
& ( isOpen0(X101)
| ~ epred1_1(X101) ) ),
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)],[c_0_5])])])])])]) ).
fof(c_0_9,negated_conjecture,
! [X6,X8,X9,X11,X12,X14] :
( aSet0(sbsmnsldt0(xS))
& ( aInteger0(X6)
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aElementOf0(esk1_1(X6),xS)
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aElementOf0(X6,esk1_1(X6))
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X8)
| ~ aElementOf0(X9,xS)
| ~ aElementOf0(X8,X9)
| aElementOf0(X8,sbsmnsldt0(xS)) )
& aElementOf0(esk2_0,sbsmnsldt0(xS))
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( aInteger0(X12)
| ~ aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( aInteger0(esk3_2(X11,X12))
| ~ aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( sdtasdt0(X11,esk3_2(X11,X12)) = sdtpldt0(X12,smndt0(esk2_0))
| ~ aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( aDivisorOf0(X11,sdtpldt0(X12,smndt0(esk2_0)))
| ~ aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( sdteqdtlpzmzozddtrp0(X12,esk2_0,X11)
| ~ aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( ~ aInteger0(X14)
| sdtasdt0(X11,X14) != sdtpldt0(X12,smndt0(esk2_0))
| ~ aInteger0(X12)
| aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( ~ aDivisorOf0(X11,sdtpldt0(X12,smndt0(esk2_0)))
| ~ aInteger0(X12)
| aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( ~ sdteqdtlpzmzozddtrp0(X12,esk2_0,X11)
| ~ aInteger0(X12)
| aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( aElementOf0(esk4_1(X11),szAzrzSzezqlpdtcmdtrp0(esk2_0,X11))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( ~ aElementOf0(esk4_1(X11),sbsmnsldt0(xS))
| ~ aInteger0(X11)
| X11 = sz00 )
& ( ~ aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(esk2_0,X11),sbsmnsldt0(xS))
| ~ aInteger0(X11)
| X11 = sz00 )
& ~ isOpen0(sbsmnsldt0(xS)) ),
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)],[c_0_6])])])])])]) ).
fof(c_0_10,hypothesis,
! [X22] :
( aSet0(xS)
& ( ~ aElementOf0(X22,xS)
| epred1_1(X22) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(X2,esk16_2(X3,X2)))
| ~ aElementOf0(X2,X3)
| ~ epred1_1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( aElementOf0(esk4_1(X1),szAzrzSzezqlpdtcmdtrp0(esk2_0,X1))
| X1 = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( aInteger0(esk16_2(X1,X2))
| ~ aElementOf0(X2,X1)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( esk16_2(X1,X2) != sz00
| ~ aElementOf0(X2,X1)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( aElementOf0(X1,cS1395)
| ~ aInteger0(X1)
| ~ epred1_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,hypothesis,
( epred1_1(X1)
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( aSet0(cS1395)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( aElementOf0(X1,cS1395)
| ~ aElementOf0(X1,X2)
| ~ epred1_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( aElementOf0(esk4_1(esk16_2(X1,esk2_0)),X1)
| ~ epred1_1(X1)
| ~ aElementOf0(esk2_0,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]) ).
cnf(c_0_20,hypothesis,
( aElementOf0(X1,cS1395)
| ~ aElementOf0(X2,xS)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( aElementOf0(esk1_1(X1),xS)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( aSet0(cS1395)
| ~ aElementOf0(X1,xS) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_23,plain,
( aInteger0(X1)
| ~ aElementOf0(X1,cS1395)
| ~ epred1_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,plain,
( aElementOf0(esk4_1(esk16_2(X1,esk2_0)),cS1395)
| ~ epred1_1(X1)
| ~ aElementOf0(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_25,plain,
! [X34,X35,X36,X37] :
( ( aSet0(X35)
| ~ aSubsetOf0(X35,X34)
| ~ aSet0(X34) )
& ( ~ aElementOf0(X36,X35)
| aElementOf0(X36,X34)
| ~ aSubsetOf0(X35,X34)
| ~ aSet0(X34) )
& ( aElementOf0(esk11_2(X34,X37),X37)
| ~ aSet0(X37)
| aSubsetOf0(X37,X34)
| ~ aSet0(X34) )
& ( ~ aElementOf0(esk11_2(X34,X37),X34)
| ~ aSet0(X37)
| aSubsetOf0(X37,X34)
| ~ aSet0(X34) ) ),
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)],[mSubset])])])])])]) ).
cnf(c_0_26,negated_conjecture,
( aElementOf0(X1,cS1395)
| ~ aElementOf0(X2,sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
aElementOf0(esk2_0,sbsmnsldt0(xS)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,plain,
( aSet0(cS1395)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_29,plain,
( aInteger0(esk4_1(esk16_2(X1,esk2_0)))
| ~ epred1_1(X2)
| ~ epred1_1(X1)
| ~ aElementOf0(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( aSubsetOf0(X2,X1)
| ~ aElementOf0(esk11_2(X1,X2),X1)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( aElementOf0(X1,cS1395)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
aSet0(cS1395),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,plain,
( aElementOf0(esk11_2(X1,X2),X2)
| aSubsetOf0(X2,X1)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
aSet0(sbsmnsldt0(xS)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_36,hypothesis,
( aInteger0(esk4_1(esk16_2(X1,esk2_0)))
| ~ epred1_1(X1)
| ~ aElementOf0(esk2_0,X1)
| ~ aElementOf0(X2,xS) ),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
fof(c_0_37,plain,
! [X16,X17,X20] :
( ( aInteger0(esk5_2(X16,X17))
| ~ aElementOf0(X17,X16)
| ~ isOpen0(X16)
| ~ aSubsetOf0(X16,cS1395) )
& ( esk5_2(X16,X17) != sz00
| ~ aElementOf0(X17,X16)
| ~ isOpen0(X16)
| ~ aSubsetOf0(X16,cS1395) )
& ( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X17,esk5_2(X16,X17)),X16)
| ~ aElementOf0(X17,X16)
| ~ isOpen0(X16)
| ~ aSubsetOf0(X16,cS1395) )
& ( aElementOf0(esk6_1(X16),X16)
| isOpen0(X16)
| ~ aSubsetOf0(X16,cS1395) )
& ( ~ aInteger0(X20)
| X20 = sz00
| ~ aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(esk6_1(X16),X20),X16)
| isOpen0(X16)
| ~ aSubsetOf0(X16,cS1395) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mOpen])])])])]) ).
cnf(c_0_38,negated_conjecture,
( aSubsetOf0(X1,cS1395)
| ~ aSet0(X1)
| ~ aInteger0(esk11_2(cS1395,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
( aSubsetOf0(sbsmnsldt0(xS),X1)
| aInteger0(esk11_2(X1,sbsmnsldt0(xS)))
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1)
| ~ aElementOf0(X2,xS)
| ~ aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
( aInteger0(esk4_1(esk16_2(X1,esk2_0)))
| ~ epred1_1(X1)
| ~ aElementOf0(X2,sbsmnsldt0(xS))
| ~ aElementOf0(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_42,plain,
( aElementOf0(esk6_1(X1),X1)
| isOpen0(X1)
| ~ aSubsetOf0(X1,cS1395) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
aSubsetOf0(sbsmnsldt0(xS),cS1395),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_35]),c_0_32])]) ).
cnf(c_0_44,negated_conjecture,
~ isOpen0(sbsmnsldt0(xS)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_45,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| ~ aElementOf0(X2,sbsmnsldt0(xS))
| ~ aElementOf0(X1,esk1_1(X2))
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_46,negated_conjecture,
( aInteger0(esk4_1(esk16_2(X1,esk2_0)))
| ~ epred1_1(X1)
| ~ aElementOf0(esk2_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( X1 = sz00
| ~ aElementOf0(esk4_1(X1),sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_48,negated_conjecture,
( aElementOf0(esk4_1(esk16_2(esk1_1(X1),esk2_0)),sbsmnsldt0(xS))
| ~ epred1_1(esk1_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aElementOf0(esk2_0,esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_19]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( ~ epred1_1(esk1_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aElementOf0(esk2_0,esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_13]),c_0_14]) ).
cnf(c_0_50,hypothesis,
( ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aElementOf0(esk2_0,esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_16]),c_0_21]) ).
cnf(c_0_51,negated_conjecture,
( aElementOf0(X1,esk1_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM437+5 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 14:22:28 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.OnHfeEB1Ut/E---3.1_19760.p
% 0.71/0.58 # Version: 3.1pre001
% 0.71/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.71/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.71/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.71/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.71/0.58 # Starting sh5l with 300s (1) cores
% 0.71/0.58 # sh5l with pid 19841 completed with status 0
% 0.71/0.58 # Result found by sh5l
% 0.71/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.71/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.71/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.71/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.71/0.58 # Starting sh5l with 300s (1) cores
% 0.71/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.71/0.58 # Search class: FGHSF-FSLS31-SFFFFFNN
% 0.71/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.71/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 69s (1) cores
% 0.71/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 19842 completed with status 0
% 0.71/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.71/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.71/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.71/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.71/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.71/0.58 # Starting sh5l with 300s (1) cores
% 0.71/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.71/0.58 # Search class: FGHSF-FSLS31-SFFFFFNN
% 0.71/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.71/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 69s (1) cores
% 0.71/0.58 # Preprocessing time : 0.002 s
% 0.71/0.58 # Presaturation interreduction done
% 0.71/0.58
% 0.71/0.58 # Proof found!
% 0.71/0.58 # SZS status Theorem
% 0.71/0.58 # SZS output start CNFRefutation
% See solution above
% 0.71/0.58 # Parsed axioms : 38
% 0.71/0.58 # Removed by relevancy pruning/SinE : 3
% 0.71/0.58 # Initial clauses : 126
% 0.71/0.58 # Removed in clause preprocessing : 4
% 0.71/0.58 # Initial clauses in saturation : 122
% 0.71/0.58 # Processed clauses : 749
% 0.71/0.58 # ...of these trivial : 5
% 0.71/0.58 # ...subsumed : 192
% 0.71/0.58 # ...remaining for further processing : 552
% 0.71/0.58 # Other redundant clauses eliminated : 28
% 0.71/0.58 # Clauses deleted for lack of memory : 0
% 0.71/0.58 # Backward-subsumed : 41
% 0.71/0.58 # Backward-rewritten : 11
% 0.71/0.58 # Generated clauses : 2307
% 0.71/0.58 # ...of the previous two non-redundant : 1895
% 0.71/0.58 # ...aggressively subsumed : 0
% 0.71/0.58 # Contextual simplify-reflections : 51
% 0.71/0.58 # Paramodulations : 2279
% 0.71/0.58 # Factorizations : 0
% 0.71/0.58 # NegExts : 0
% 0.71/0.58 # Equation resolutions : 28
% 0.71/0.58 # Total rewrite steps : 1467
% 0.71/0.58 # Propositional unsat checks : 0
% 0.71/0.58 # Propositional check models : 0
% 0.71/0.58 # Propositional check unsatisfiable : 0
% 0.71/0.58 # Propositional clauses : 0
% 0.71/0.58 # Propositional clauses after purity: 0
% 0.71/0.58 # Propositional unsat core size : 0
% 0.71/0.58 # Propositional preprocessing time : 0.000
% 0.71/0.58 # Propositional encoding time : 0.000
% 0.71/0.58 # Propositional solver time : 0.000
% 0.71/0.58 # Success case prop preproc time : 0.000
% 0.71/0.58 # Success case prop encoding time : 0.000
% 0.71/0.58 # Success case prop solver time : 0.000
% 0.71/0.58 # Current number of processed clauses : 356
% 0.71/0.58 # Positive orientable unit clauses : 20
% 0.71/0.58 # Positive unorientable unit clauses: 0
% 0.71/0.58 # Negative unit clauses : 3
% 0.71/0.58 # Non-unit-clauses : 333
% 0.71/0.58 # Current number of unprocessed clauses: 1301
% 0.71/0.58 # ...number of literals in the above : 7894
% 0.71/0.58 # Current number of archived formulas : 0
% 0.71/0.58 # Current number of archived clauses : 174
% 0.71/0.58 # Clause-clause subsumption calls (NU) : 28034
% 0.71/0.58 # Rec. Clause-clause subsumption calls : 6313
% 0.71/0.58 # Non-unit clause-clause subsumptions : 276
% 0.71/0.58 # Unit Clause-clause subsumption calls : 112
% 0.71/0.58 # Rewrite failures with RHS unbound : 0
% 0.71/0.58 # BW rewrite match attempts : 5
% 0.71/0.58 # BW rewrite match successes : 5
% 0.71/0.58 # Condensation attempts : 0
% 0.71/0.58 # Condensation successes : 0
% 0.71/0.58 # Termbank termtop insertions : 67050
% 0.71/0.58
% 0.71/0.58 # -------------------------------------------------
% 0.71/0.58 # User time : 0.091 s
% 0.71/0.58 # System time : 0.005 s
% 0.71/0.58 # Total time : 0.096 s
% 0.71/0.58 # Maximum resident set size: 2076 pages
% 0.71/0.58
% 0.71/0.58 # -------------------------------------------------
% 0.71/0.58 # User time : 0.095 s
% 0.71/0.58 # System time : 0.006 s
% 0.71/0.58 # Total time : 0.101 s
% 0.71/0.58 # Maximum resident set size: 1736 pages
% 0.71/0.58 % E---3.1 exiting
% 0.71/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------