%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU537^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:29:58 AM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 1213 ( 349 equ; 0 cnn)
% Maximal formula atoms : 57 ( 80 avg)
% Number of connectives : 595 ( 27 ~; 6 |; 225 &; 62 @)
% ( 0 <=>; 275 =>; 0 <=; 0 <~>)
% Maximal formula depth : 63 ( 36 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 154 ( 151 usr; 62 con; 0-4 aty)
% Number of variables : 34 ( 0 ^; 20 !; 14 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
exu: ( $i > $o ) > $o ).
thf(func_def_3,type,
setextAx: $o ).
thf(func_def_5,type,
emptysetAx: $o ).
thf(func_def_6,type,
setadjoin: $i > $i > $i ).
thf(func_def_7,type,
setadjoinAx: $o ).
thf(func_def_8,type,
powerset: $i > $i ).
thf(func_def_9,type,
powersetAx: $o ).
thf(func_def_10,type,
setunion: $i > $i ).
thf(func_def_11,type,
setunionAx: $o ).
thf(func_def_13,type,
omega0Ax: $o ).
thf(func_def_14,type,
omegaSAx: $o ).
thf(func_def_15,type,
omegaIndAx: $o ).
thf(func_def_16,type,
replAx: $o ).
thf(func_def_17,type,
foundationAx: $o ).
thf(func_def_18,type,
wellorderingAx: $o ).
thf(func_def_19,type,
descr: ( $i > $o ) > $i ).
thf(func_def_20,type,
descrp: $o ).
thf(func_def_21,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_22,type,
dsetconstrI: $o ).
thf(func_def_23,type,
dsetconstrEL: $o ).
thf(func_def_24,type,
dsetconstrER: $o ).
thf(func_def_25,type,
exuE1: $o ).
thf(func_def_26,type,
prop2set: $o > $i ).
thf(func_def_27,type,
prop2setE: $o ).
thf(func_def_28,type,
emptysetE: $o ).
thf(func_def_29,type,
emptysetimpfalse: $o ).
thf(func_def_30,type,
notinemptyset: $o ).
thf(func_def_31,type,
exuE3e: $o ).
thf(func_def_32,type,
setext: $o ).
thf(func_def_33,type,
emptyI: $o ).
thf(func_def_34,type,
noeltsimpempty: $o ).
thf(func_def_35,type,
setbeta: $o ).
thf(func_def_36,type,
nonempty: $i > $o ).
thf(func_def_37,type,
nonemptyE1: $o ).
thf(func_def_38,type,
nonemptyI: $o ).
thf(func_def_39,type,
nonemptyI1: $o ).
thf(func_def_40,type,
setadjoinIL: $o ).
thf(func_def_41,type,
emptyinunitempty: $o ).
thf(func_def_42,type,
setadjoinIR: $o ).
thf(func_def_43,type,
setadjoinE: $o ).
thf(func_def_44,type,
setadjoinOr: $o ).
thf(func_def_45,type,
setoftrueEq: $o ).
thf(func_def_46,type,
powersetI: $o ).
thf(func_def_47,type,
emptyinPowerset: $o ).
thf(func_def_48,type,
emptyInPowerset: $o ).
thf(func_def_49,type,
powersetE: $o ).
thf(func_def_50,type,
setunionI: $o ).
thf(func_def_51,type,
setunionE: $o ).
thf(func_def_52,type,
subPowSU: $o ).
thf(func_def_53,type,
exuE2: $o ).
thf(func_def_54,type,
nonemptyImpWitness: $o ).
thf(func_def_55,type,
uniqinunit: $o ).
thf(func_def_56,type,
notinsingleton: $o ).
thf(func_def_57,type,
eqinunit: $o ).
thf(func_def_58,type,
singletonsswitch: $o ).
thf(func_def_59,type,
upairsetE: $o ).
thf(func_def_60,type,
upairsetIL: $o ).
thf(func_def_61,type,
upairsetIR: $o ).
thf(func_def_62,type,
emptyE1: $o ).
thf(func_def_63,type,
vacuousDall: $o ).
thf(func_def_64,type,
quantDeMorgan1: $o ).
thf(func_def_67,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_68,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_69,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_70,type,
vNOT: $o > $o ).
thf(func_def_71,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_72,type,
vAND: $o > $o > $o ).
thf(func_def_73,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_74,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_75,type,
vIMP: $o > $o > $o ).
thf(func_def_76,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_77,type,
sP0: $i > $i > $o ).
thf(func_def_78,type,
sP1: $i > $o ).
thf(func_def_79,type,
sP2: $i > $i > $o ).
thf(func_def_80,type,
sP3: $i > $i > $o ).
thf(func_def_81,type,
sP4: $o ).
thf(func_def_85,type,
sK8: $i > $i > $i ).
thf(func_def_86,type,
sK9: $i > $o ).
thf(func_def_87,type,
sK10: $i > $i ).
thf(func_def_88,type,
sK11: ( $i > $o ) > $i ).
thf(func_def_89,type,
sK12: $i > $i > $i ).
thf(func_def_90,type,
sK13: $i > $i > $i ).
thf(func_def_91,type,
sK14: $i > $i > $i ).
thf(func_def_92,type,
sK15: $i > $i > $i ).
thf(func_def_93,type,
sK16: $i > $i > $i ).
thf(func_def_94,type,
sK17: $i > $i > $i > $i ).
thf(func_def_95,type,
sK18: $i > $i ).
thf(func_def_96,type,
sK19: $i > $i ).
thf(func_def_97,type,
sK20: $i > $i ).
thf(func_def_98,type,
sK21: $i > $i ).
thf(func_def_99,type,
sK22: $i > $i > $i ).
thf(func_def_100,type,
sK23: $i > $i > $i > $i ).
thf(func_def_101,type,
sK24: $i > $i > $i > $i ).
thf(func_def_102,type,
sK25: $i > $i > $i ).
thf(func_def_103,type,
sK26: $i > $i > $i ).
thf(func_def_104,type,
sK27: $i > $i ).
thf(func_def_106,type,
sK29: $i > $i ).
thf(func_def_107,type,
sK30: $i > $i ).
thf(func_def_109,type,
sK32: $i > $o ).
thf(func_def_111,type,
sK34: ( $i > $o ) > $i > $i ).
thf(func_def_113,type,
sK36: $i > $o ).
thf(func_def_122,type,
sK45: $i > $i > $i ).
thf(func_def_125,type,
sK48: $i > $i ).
thf(func_def_131,type,
sK54: $i > $o ).
thf(func_def_135,type,
sK58: $i > $o ).
thf(func_def_136,type,
sK59: $i > $o ).
thf(func_def_137,type,
sK60: ( $i > $o ) > $i ).
thf(func_def_139,type,
sK62: $i > $o ).
thf(func_def_140,type,
sK63: $i > $o ).
thf(func_def_141,type,
sK64: $i > $i ).
thf(func_def_142,type,
sK65: ( $i > $o ) > $i ).
thf(func_def_144,type,
sK67: $i > $i > $o ).
thf(func_def_145,type,
sK68: $i > $i ).
thf(func_def_146,type,
sK69: $i > $i ).
thf(func_def_147,type,
sK70: ( $i > $i > $o ) > $i > $i ).
thf(func_def_148,type,
sK71: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_149,type,
sK72: ( $i > $i > $o ) > $i > $i ).
thf(func_def_154,type,
sK77: $i > $i > $i ).
thf(func_def_156,type,
sK79: $i > $i ).
thf(func_def_162,type,
sK85: $i > $o ).
thf(func_def_165,type,
sK88: $i > $i > $i ).
thf(func_def_166,type,
sK89: $i > $i > $i ).
thf(func_def_169,type,
sK92: $i > $i > $i ).
thf(func_def_170,type,
sK93: $o > $i > $i > $i ).
thf(func_def_173,type,
sK96: $o ).
thf(func_def_179,type,
sK102: $i > $o ).
thf(func_def_183,type,
sK106: $i > $i ).
thf(func_def_186,type,
sK109: $i > $i ).
thf(func_def_187,type,
sK110: $i > $i ).
thf(func_def_188,type,
sK111: $i > $i ).
thf(func_def_196,type,
sK119: $o ).
thf(func_def_198,type,
sK121: $o ).
thf(func_def_205,type,
sK128: $i > $o ).
thf(func_def_214,type,
sK137: $o ).
thf(func_def_221,type,
sK144: $i > $i ).
thf(func_def_227,type,
sK150: $i > $o ).
thf(func_def_230,type,
sK153: $i > $o ).
thf(func_def_232,type,
sK155: $i > $i ).
thf(func_def_233,type,
sK156: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_234,type,
sK157: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_235,type,
sK158: ( $i > $o ) > $i > $i ).
thf(func_def_236,type,
sK159: ( $i > $o ) > $i > $i ).
thf(func_def_237,type,
sK160: ( $i > $o ) > $i > $i ).
thf(func_def_238,type,
sK161: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_239,type,
sK162: ( $i > $o ) > $i > $i ).
thf(func_def_240,type,
sK163: ( $i > $o ) > $i > $i ).
thf(func_def_241,type,
sK164: $i > ( $i > $o ) > $i ).
thf(f57,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( nonemptyImpWitness
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( emptyE1
=> ( vacuousDall
=> ( quantDeMorgan1
=> ! [X1: $i > $o,X0: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ~ ( X1 @ X2 ) )
=> ~ ? [X2: $i] :
( ( X1 @ X2 )
& ( in @ X2 @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quantDeMorgan2) ).
thf(f58,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( nonemptyImpWitness
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( emptyE1
=> ( vacuousDall
=> ( quantDeMorgan1
=> ! [X1: $i > $o,X0: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ~ ( X1 @ X2 ) )
=> ~ ? [X2: $i] :
( ( X1 @ X2 )
& ( in @ X2 @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
thf(f84,plain,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( nonemptyImpWitness
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( emptyE1
=> ( vacuousDall
=> ( quantDeMorgan1
=> ! [X0: $i > $o,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ~ ( X0 @ X2 ) )
=> ~ ? [X3: $i] :
( ( X0 @ X3 )
& ( in @ X3 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f58]) ).
thf(f85,plain,
~ ( ( setextAx = $true )
=> ( ( emptysetAx = $true )
=> ( ( setadjoinAx = $true )
=> ( ( powersetAx = $true )
=> ( ( setunionAx = $true )
=> ( ( omega0Ax = $true )
=> ( ( omegaSAx = $true )
=> ( ( omegaIndAx = $true )
=> ( ( replAx = $true )
=> ( ( foundationAx = $true )
=> ( ( wellorderingAx = $true )
=> ( ( descrp = $true )
=> ( ( dsetconstrI = $true )
=> ( ( dsetconstrEL = $true )
=> ( ( dsetconstrER = $true )
=> ( ( exuE1 = $true )
=> ( ( prop2setE = $true )
=> ( ( emptysetE = $true )
=> ( ( emptysetimpfalse = $true )
=> ( ( notinemptyset = $true )
=> ( ( exuE3e = $true )
=> ( ( setext = $true )
=> ( ( emptyI = $true )
=> ( ( noeltsimpempty = $true )
=> ( ( setbeta = $true )
=> ( ( nonemptyE1 = $true )
=> ( ( nonemptyI = $true )
=> ( ( nonemptyI1 = $true )
=> ( ( setadjoinIL = $true )
=> ( ( emptyinunitempty = $true )
=> ( ( setadjoinIR = $true )
=> ( ( setadjoinE = $true )
=> ( ( setadjoinOr = $true )
=> ( ( setoftrueEq = $true )
=> ( ( powersetI = $true )
=> ( ( emptyinPowerset = $true )
=> ( ( emptyInPowerset = $true )
=> ( ( powersetE = $true )
=> ( ( setunionI = $true )
=> ( ( setunionE = $true )
=> ( ( subPowSU = $true )
=> ( ( exuE2 = $true )
=> ( ( nonemptyImpWitness = $true )
=> ( ( uniqinunit = $true )
=> ( ( notinsingleton = $true )
=> ( ( eqinunit = $true )
=> ( ( singletonsswitch = $true )
=> ( ( upairsetE = $true )
=> ( ( upairsetIL = $true )
=> ( ( upairsetIR = $true )
=> ( ( emptyE1 = $true )
=> ( ( vacuousDall = $true )
=> ( ( quantDeMorgan1 = $true )
=> ! [X0: $i > $o,X1: $i] :
( ! [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
=> ( ( X0 @ X2 )
!= $true ) )
=> ~ ? [X3: $i] :
( ( ( X0 @ X3 )
= $true )
& ( ( in @ X3 @ X1 )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f84]) ).
thf(f172,plain,
~ ( ( setextAx = $true )
=> ( ( emptysetAx = $true )
=> ( ( setadjoinAx = $true )
=> ( ( powersetAx = $true )
=> ( ( setunionAx = $true )
=> ( ( omega0Ax = $true )
=> ( ( omegaSAx = $true )
=> ( ( omegaIndAx = $true )
=> ( ( replAx = $true )
=> ( ( foundationAx = $true )
=> ( ( wellorderingAx = $true )
=> ( ( descrp = $true )
=> ( ( dsetconstrI = $true )
=> ( ( dsetconstrEL = $true )
=> ( ( dsetconstrER = $true )
=> ( ( exuE1 = $true )
=> ( ( prop2setE = $true )
=> ( ( emptysetE = $true )
=> ( ( emptysetimpfalse = $true )
=> ( ( notinemptyset = $true )
=> ( ( exuE3e = $true )
=> ( ( setext = $true )
=> ( ( emptyI = $true )
=> ( ( noeltsimpempty = $true )
=> ( ( setbeta = $true )
=> ( ( nonemptyE1 = $true )
=> ( ( nonemptyI = $true )
=> ( ( nonemptyI1 = $true )
=> ( ( setadjoinIL = $true )
=> ( ( emptyinunitempty = $true )
=> ( ( setadjoinIR = $true )
=> ( ( setadjoinE = $true )
=> ( ( setadjoinOr = $true )
=> ( ( setoftrueEq = $true )
=> ( ( powersetI = $true )
=> ( ( emptyinPowerset = $true )
=> ( ( emptyInPowerset = $true )
=> ( ( powersetE = $true )
=> ( ( setunionI = $true )
=> ( ( setunionE = $true )
=> ( ( subPowSU = $true )
=> ( ( exuE2 = $true )
=> ( ( nonemptyImpWitness = $true )
=> ( ( uniqinunit = $true )
=> ( ( notinsingleton = $true )
=> ( ( eqinunit = $true )
=> ( ( singletonsswitch = $true )
=> ( ( upairsetE = $true )
=> ( ( upairsetIL = $true )
=> ( ( upairsetIR = $true )
=> ( ( emptyE1 = $true )
=> ( ( vacuousDall = $true )
=> ( ( quantDeMorgan1 = $true )
=> ! [X1: $i,X0: $i > $o] :
( ! [X2: $i] :
( ( ( in @ X2 @ X1 )
= $true )
=> ( ( X0 @ X2 )
!= $true ) )
=> ~ ? [X3: $i] :
( ( ( X0 @ X3 )
= $true )
& ( ( in @ X3 @ X1 )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(flattening,[],[f85]) ).
thf(f209,plain,
( ? [X1: $i,X0: $i > $o] :
( ? [X3: $i] :
( ( ( X0 @ X3 )
= $true )
& ( ( in @ X3 @ X1 )
= $true ) )
& ! [X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
| ( ( X0 @ X2 )
!= $true ) ) )
& ( quantDeMorgan1 = $true )
& ( vacuousDall = $true )
& ( emptyE1 = $true )
& ( upairsetIR = $true )
& ( upairsetIL = $true )
& ( upairsetE = $true )
& ( singletonsswitch = $true )
& ( eqinunit = $true )
& ( notinsingleton = $true )
& ( uniqinunit = $true )
& ( nonemptyImpWitness = $true )
& ( exuE2 = $true )
& ( subPowSU = $true )
& ( setunionE = $true )
& ( setunionI = $true )
& ( powersetE = $true )
& ( emptyInPowerset = $true )
& ( emptyinPowerset = $true )
& ( powersetI = $true )
& ( setoftrueEq = $true )
& ( setadjoinOr = $true )
& ( setadjoinE = $true )
& ( setadjoinIR = $true )
& ( emptyinunitempty = $true )
& ( setadjoinIL = $true )
& ( nonemptyI1 = $true )
& ( nonemptyI = $true )
& ( nonemptyE1 = $true )
& ( setbeta = $true )
& ( noeltsimpempty = $true )
& ( emptyI = $true )
& ( setext = $true )
& ( exuE3e = $true )
& ( notinemptyset = $true )
& ( emptysetimpfalse = $true )
& ( emptysetE = $true )
& ( prop2setE = $true )
& ( exuE1 = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true )
& ( descrp = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( omegaIndAx = $true )
& ( omegaSAx = $true )
& ( omega0Ax = $true )
& ( setunionAx = $true )
& ( powersetAx = $true )
& ( setadjoinAx = $true )
& ( emptysetAx = $true )
& ( setextAx = $true ) ),
inference(ennf_transformation,[],[f172]) ).
thf(f210,plain,
( ( emptyI = $true )
& ( powersetAx = $true )
& ( upairsetE = $true )
& ( vacuousDall = $true )
& ( omegaIndAx = $true )
& ( emptysetAx = $true )
& ( eqinunit = $true )
& ( setunionI = $true )
& ( nonemptyE1 = $true )
& ( setunionAx = $true )
& ( replAx = $true )
& ( dsetconstrEL = $true )
& ( upairsetIL = $true )
& ( singletonsswitch = $true )
& ? [X1: $i,X0: $i > $o] :
( ? [X3: $i] :
( ( ( X0 @ X3 )
= $true )
& ( ( in @ X3 @ X1 )
= $true ) )
& ! [X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
| ( ( X0 @ X2 )
!= $true ) ) )
& ( nonemptyImpWitness = $true )
& ( omegaSAx = $true )
& ( setadjoinAx = $true )
& ( exuE3e = $true )
& ( dsetconstrI = $true )
& ( powersetE = $true )
& ( quantDeMorgan1 = $true )
& ( setadjoinIL = $true )
& ( descrp = $true )
& ( emptyinunitempty = $true )
& ( omega0Ax = $true )
& ( notinemptyset = $true )
& ( dsetconstrER = $true )
& ( nonemptyI1 = $true )
& ( emptysetE = $true )
& ( setunionE = $true )
& ( upairsetIR = $true )
& ( emptyInPowerset = $true )
& ( nonemptyI = $true )
& ( notinsingleton = $true )
& ( setadjoinE = $true )
& ( subPowSU = $true )
& ( powersetI = $true )
& ( exuE2 = $true )
& ( setext = $true )
& ( setoftrueEq = $true )
& ( emptysetimpfalse = $true )
& ( setbeta = $true )
& ( setextAx = $true )
& ( prop2setE = $true )
& ( emptyE1 = $true )
& ( exuE1 = $true )
& ( uniqinunit = $true )
& ( emptyinPowerset = $true )
& ( setadjoinIR = $true )
& ( setadjoinOr = $true )
& ( noeltsimpempty = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true ) ),
inference(flattening,[],[f209]) ).
thf(f411,plain,
( ( emptyI = $true )
& ( powersetAx = $true )
& ( upairsetE = $true )
& ( vacuousDall = $true )
& ( omegaIndAx = $true )
& ( emptysetAx = $true )
& ( eqinunit = $true )
& ( setunionI = $true )
& ( nonemptyE1 = $true )
& ( setunionAx = $true )
& ( replAx = $true )
& ( dsetconstrEL = $true )
& ( upairsetIL = $true )
& ( singletonsswitch = $true )
& ? [X0: $i,X1: $i > $o] :
( ? [X2: $i] :
( ( ( X1 @ X2 )
= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
& ! [X3: $i] :
( ( ( in @ X3 @ X0 )
!= $true )
| ( ( X1 @ X3 )
!= $true ) ) )
& ( nonemptyImpWitness = $true )
& ( omegaSAx = $true )
& ( setadjoinAx = $true )
& ( exuE3e = $true )
& ( dsetconstrI = $true )
& ( powersetE = $true )
& ( quantDeMorgan1 = $true )
& ( setadjoinIL = $true )
& ( descrp = $true )
& ( emptyinunitempty = $true )
& ( omega0Ax = $true )
& ( notinemptyset = $true )
& ( dsetconstrER = $true )
& ( nonemptyI1 = $true )
& ( emptysetE = $true )
& ( setunionE = $true )
& ( upairsetIR = $true )
& ( emptyInPowerset = $true )
& ( nonemptyI = $true )
& ( notinsingleton = $true )
& ( setadjoinE = $true )
& ( subPowSU = $true )
& ( powersetI = $true )
& ( exuE2 = $true )
& ( setext = $true )
& ( setoftrueEq = $true )
& ( emptysetimpfalse = $true )
& ( setbeta = $true )
& ( setextAx = $true )
& ( prop2setE = $true )
& ( emptyE1 = $true )
& ( exuE1 = $true )
& ( uniqinunit = $true )
& ( emptyinPowerset = $true )
& ( setadjoinIR = $true )
& ( setadjoinOr = $true )
& ( noeltsimpempty = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true ) ),
inference(rectify,[],[f210]) ).
thf(f412,plain,
( ( emptyI = $true )
& ( powersetAx = $true )
& ( upairsetE = $true )
& ( vacuousDall = $true )
& ( omegaIndAx = $true )
& ( emptysetAx = $true )
& ( eqinunit = $true )
& ( setunionI = $true )
& ( nonemptyE1 = $true )
& ( setunionAx = $true )
& ( replAx = $true )
& ( dsetconstrEL = $true )
& ( upairsetIL = $true )
& ( singletonsswitch = $true )
& ( ( sK153 @ sK154 )
= $true )
& ( $true
= ( in @ sK154 @ sK152 ) )
& ! [X3: $i] :
( ( $true
!= ( in @ X3 @ sK152 ) )
| ( $true
!= ( sK153 @ X3 ) ) )
& ( nonemptyImpWitness = $true )
& ( omegaSAx = $true )
& ( setadjoinAx = $true )
& ( exuE3e = $true )
& ( dsetconstrI = $true )
& ( powersetE = $true )
& ( quantDeMorgan1 = $true )
& ( setadjoinIL = $true )
& ( descrp = $true )
& ( emptyinunitempty = $true )
& ( omega0Ax = $true )
& ( notinemptyset = $true )
& ( dsetconstrER = $true )
& ( nonemptyI1 = $true )
& ( emptysetE = $true )
& ( setunionE = $true )
& ( upairsetIR = $true )
& ( emptyInPowerset = $true )
& ( nonemptyI = $true )
& ( notinsingleton = $true )
& ( setadjoinE = $true )
& ( subPowSU = $true )
& ( powersetI = $true )
& ( exuE2 = $true )
& ( setext = $true )
& ( setoftrueEq = $true )
& ( emptysetimpfalse = $true )
& ( setbeta = $true )
& ( setextAx = $true )
& ( prop2setE = $true )
& ( emptyE1 = $true )
& ( exuE1 = $true )
& ( uniqinunit = $true )
& ( emptyinPowerset = $true )
& ( setadjoinIR = $true )
& ( setadjoinOr = $true )
& ( noeltsimpempty = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK152,sK153,sK154]),skolemize(X0,sK152),skolemize(X1,sK153),skolemize(X2,sK154)],[f411]) ).
thf(f685,plain,
! [X3: $i] :
( ( $true
!= ( in @ X3 @ sK152 ) )
| ( $true
!= ( sK153 @ X3 ) ) ),
inference(cnf_transformation,[],[f412]) ).
thf(f686,plain,
( $true
= ( in @ sK154 @ sK152 ) ),
inference(cnf_transformation,[],[f412]) ).
thf(f687,plain,
( ( sK153 @ sK154 )
= $true ),
inference(cnf_transformation,[],[f412]) ).
thf(f1175,plain,
( ( $true != $true )
| ( ( sK153 @ sK154 )
!= $true ) ),
inference(constrained_superposition,[],[f685,f686]) ).
thf(f1176,plain,
( ( sK153 @ sK154 )
!= $true ),
inference(trivial_inequality_removal,[],[f1175]) ).
thf(f1177,plain,
$false,
inference(forward_subsumption_resolution,[],[f1176,f687]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU537^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n017.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 13:44:38 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.29 % (362755)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.29 % (362764)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=838221667:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.29 % (362766)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.29 % (362766)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.20/0.29 % (362764)Instruction limit reached!
% 0.20/0.29 % (362764)------------------------------
% 0.20/0.29 % (362764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (362764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (362764)CaDiCaL version: 2.1.3
% 0.20/0.29 % (362764)Termination reason: Instruction limit
% 0.20/0.29 % (362764)Termination phase: Equality resolution with deletion
% 0.20/0.29 % (362764)Time elapsed: 0.006 s
% 0.20/0.29 % (362764)Peak memory usage: 11 MB
% 0.20/0.29 % (362764)Instructions burned: 24 (million)
% 0.20/0.29 % (362762)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2150931437:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.29 % (362760)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1465355759:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.29 % (362761)lrs+10_16_si=on:nwc=1.5:random_seed=3149960533:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.29 % (362763)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=354264868:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.20/0.29 % (362765)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3172572450:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.29 % (362766)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2499418510:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.29 % (362762)Instruction limit reached!
% 0.20/0.29 % (362762)------------------------------
% 0.20/0.29 % (362762)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (362762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (362762)CaDiCaL version: 2.1.3
% 0.20/0.29 % (362762)Termination reason: Instruction limit
% 0.20/0.29 % (362762)Termination phase: shuffling
% 0.20/0.29 % (362762)Time elapsed: 0.002 s
% 0.20/0.29 % (362762)Peak memory usage: 10 MB
% 0.20/0.29 % (362762)Instructions burned: 4 (million)
% 0.20/0.29 % (362761)Instruction limit reached!
% 0.20/0.29 % (362761)------------------------------
% 0.20/0.29 % (362761)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (362761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (362761)CaDiCaL version: 2.1.3
% 0.20/0.29 % (362761)Termination reason: Instruction limit
% 0.20/0.29 % (362761)Termination phase: Property scanning
% 0.20/0.29 % (362761)Time elapsed: 0.008 s
% 0.20/0.29 % (362761)Peak memory usage: 11 MB
% 0.20/0.29 % (362761)Instructions burned: 19 (million)
% 0.20/0.29 % (362769)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2064224388:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.29 % (362769)Instruction limit reached!
% 0.20/0.29 % (362769)------------------------------
% 0.20/0.29 % (362769)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (362769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (362769)CaDiCaL version: 2.1.3
% 0.20/0.29 % (362769)Termination reason: Instruction limit
% 0.20/0.29 % (362769)Termination phase: shuffling
% 0.20/0.29 % (362769)Time elapsed: 0.001 s
% 0.20/0.29 % (362769)Peak memory usage: 10 MB
% 0.20/0.29 % (362769)Instructions burned: 4 (million)
% 0.20/0.29 % (362775)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3186385070:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.20/0.29 % (362778)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2245890030:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.20/0.29 % (362776)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.20/0.29 % (362775)Instruction limit reached!
% 0.20/0.29 % (362775)------------------------------
% 0.20/0.29 % (362775)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (362775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (362775)CaDiCaL version: 2.1.3
% 0.20/0.29 % (362775)Termination reason: Instruction limit
% 0.20/0.29 % (362775)Termination phase: Property scanning
% 0.20/0.29 % (362775)Time elapsed: 0.003 s
% 0.20/0.29 % (362775)Peak memory usage: 10 MB
% 0.20/0.29 % (362775)Instructions burned: 7 (million)
% 0.20/0.29 % (362778)Instruction limit reached!
% 0.20/0.29 % (362778)------------------------------
% 0.20/0.29 % (362778)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (362778)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (362778)CaDiCaL version: 2.1.3
% 0.20/0.29 % (362778)Termination reason: Instruction limit
% 0.20/0.29 % (362778)Termination phase: SInE selection
% 0.20/0.29 % (362778)Time elapsed: 0.003 s
% 0.20/0.29 % (362778)Peak memory usage: 10 MB
% 0.20/0.29 % (362778)Instructions burned: 13 (million)
% 0.20/0.29 % (362776)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=40879345:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.20/0.29 % (362760) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-362755-362760"...
% 0.20/0.29 % (362760)...printing done.
% 0.20/0.29 % (362763) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-362755-362763"...
% 0.20/0.29 % (362760)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29 % (362760)------------------------------
% 0.20/0.29 % (362760)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (362760)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (362760)CaDiCaL version: 2.1.3
% 0.20/0.29 % (362760)Termination reason: Refutation
% 0.20/0.29 % (362760)Time elapsed: 0.030 s
% 0.20/0.29 % (362760)Peak memory usage: 13 MB
% 0.20/0.29 % (362760)Instructions burned: 59 (million)
% 0.20/0.29 % (362755)Success in time 0.056 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------