%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU532^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:57 AM UTC 2026
% Result : Theorem 0.39s 0.29s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 822 ( 219 equ; 0 cnn)
% Maximal formula atoms : 50 ( 43 avg)
% Number of connectives : 459 ( 15 ~; 8 |; 147 &; 96 @)
% ( 1 <=>; 192 =>; 0 <=; 0 <~>)
% Maximal formula depth : 56 ( 22 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 147 ( 144 usr; 60 con; 0-4 aty)
% Number of variables : 34 ( 0 ^; 26 !; 8 ?; 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_62,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_63,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_64,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_65,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_66,type,
vAND: $o > $o > $o ).
thf(func_def_67,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_68,type,
vIMP: $o > $o > $o ).
thf(func_def_69,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_70,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_71,type,
vNOT: $o > $o ).
thf(func_def_72,type,
sP0: $o ).
thf(func_def_73,type,
sP1: $i > $i > $o ).
thf(func_def_74,type,
sP2: $i > $o ).
thf(func_def_75,type,
sP3: $i > $i > $o ).
thf(func_def_76,type,
sP4: $i > $i > $o ).
thf(func_def_77,type,
sK5: ( $i > $o ) > $i ).
thf(func_def_78,type,
sK6: $i > $o ).
thf(func_def_79,type,
sK7: $i > $i > $i ).
thf(func_def_83,type,
sK11: $i > $i > $o ).
thf(func_def_84,type,
sK12: $i > $i ).
thf(func_def_85,type,
sK13: $i > $i ).
thf(func_def_86,type,
sK14: ( $i > $i > $o ) > $i > $i ).
thf(func_def_87,type,
sK15: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_88,type,
sK16: ( $i > $i > $o ) > $i > $i ).
thf(func_def_91,type,
sK19: $i > $i > $i ).
thf(func_def_92,type,
sK20: $i > $i > $i ).
thf(func_def_93,type,
sK21: $i > $i > $i ).
thf(func_def_94,type,
sK22: $i > $i > $i ).
thf(func_def_95,type,
sK23: $i > $i > $i ).
thf(func_def_96,type,
sK24: $i > $i > $i > $i ).
thf(func_def_97,type,
sK25: $i > $i ).
thf(func_def_98,type,
sK26: $i > $i ).
thf(func_def_99,type,
sK27: $i > $i ).
thf(func_def_100,type,
sK28: $i > $i ).
thf(func_def_101,type,
sK29: $i > $i > $i > $i ).
thf(func_def_102,type,
sK30: $i > $i > $i > $i ).
thf(func_def_103,type,
sK31: $i > $i > $i ).
thf(func_def_104,type,
sK32: $i > $i > $i ).
thf(func_def_105,type,
sK33: $i > $i > $i ).
thf(func_def_106,type,
sK34: $i > $i ).
thf(func_def_108,type,
sK36: $i > $i ).
thf(func_def_109,type,
sK37: $i > $i ).
thf(func_def_111,type,
sK39: $i > $i ).
thf(func_def_113,type,
sK41: $o ).
thf(func_def_119,type,
sK47: $i > $i > $i ).
thf(func_def_126,type,
sK54: $i > $i > $i ).
thf(func_def_127,type,
sK55: $i > $i > $i ).
thf(func_def_132,type,
sK60: $i > $i ).
thf(func_def_136,type,
sK64: $i > $i > $i ).
thf(func_def_139,type,
sK67: $i > $i > $i ).
thf(func_def_146,type,
sK74: $o ).
thf(func_def_154,type,
sK82: ( $i > $o ) > $i ).
thf(func_def_155,type,
sK83: $i > $o ).
thf(func_def_156,type,
sK84: $i > $i ).
thf(func_def_159,type,
sK87: $i > $o ).
thf(func_def_162,type,
sK90: $i > $o ).
thf(func_def_169,type,
sK97: $i > $o ).
thf(func_def_170,type,
sK98: $i > $o ).
thf(func_def_174,type,
sK102: $i > $i ).
thf(func_def_178,type,
sK106: $i > $o ).
thf(func_def_186,type,
sK114: $i > $i ).
thf(func_def_194,type,
sK122: $i > $i ).
thf(func_def_196,type,
sK124: $o ).
thf(func_def_199,type,
sK127: $i > $o ).
thf(func_def_200,type,
sK128: ( $i > $o ) > $i ).
thf(func_def_201,type,
sK129: $i > $o ).
thf(func_def_202,type,
sK130: $i > $i ).
thf(func_def_203,type,
sK131: $i > $i ).
thf(func_def_205,type,
sK133: $i > $i ).
thf(func_def_209,type,
sK137: $o > $i > $i > $i ).
thf(func_def_212,type,
sK140: $o ).
thf(func_def_213,type,
sK141: $i > $i ).
thf(func_def_214,type,
sK142: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_215,type,
sK143: ( $i > $o ) > $i > $i ).
thf(func_def_216,type,
sK144: $i > ( $i > $o ) > $i ).
thf(func_def_217,type,
sK145: $i > ( $i > $o ) > $i ).
thf(func_def_218,type,
sK146: $i > ( $i > $o ) > $i ).
thf(func_def_219,type,
sK147: $i > ( $i > $o ) > $i ).
thf(func_def_220,type,
sK148: $i > ( $i > $o ) > $i ).
thf(func_def_221,type,
sK149: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_222,type,
sK150: $i > ( $i > $i > $o ) > $i > $i ).
thf(f32,axiom,
! [X1: $i,X0: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= setadjoinIL ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
thf(f52,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
=> ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsetIL) ).
thf(f53,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
=> ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
thf(f78,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
=> ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f53]) ).
thf(f79,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 )
=> ! [X1: $i,X0: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f78]) ).
thf(f112,plain,
! [X0: $i,X1: $i] :
( ( in @ X1 @ ( setadjoin @ X1 @ X0 ) )
= setadjoinIL ),
inference(rectify,[],[f32]) ).
thf(f113,plain,
( ( setadjoinIL = $true )
<=> ! [X0: $i,X1: $i] :
( $true
= ( in @ X1 @ ( setadjoin @ X1 @ X0 ) ) ) ),
inference(fool_elimination,[],[f112]) ).
thf(f197,plain,
( ? [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
!= $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,[],[f79]) ).
thf(f198,plain,
( ( singletonsswitch = $true )
& ( setadjoinE = $true )
& ( emptyinunitempty = $true )
& ( foundationAx = $true )
& ( powersetI = $true )
& ( noeltsimpempty = $true )
& ( setadjoinIR = $true )
& ( replAx = $true )
& ( emptysetE = $true )
& ( prop2setE = $true )
& ( omega0Ax = $true )
& ( wellorderingAx = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrER = $true )
& ( emptysetimpfalse = $true )
& ( descrp = $true )
& ( nonemptyI = $true )
& ( exuE2 = $true )
& ( powersetE = $true )
& ( subPowSU = $true )
& ( nonemptyImpWitness = $true )
& ( setextAx = $true )
& ( emptyInPowerset = $true )
& ( eqinunit = $true )
& ( setext = $true )
& ( setadjoinIL = $true )
& ( setoftrueEq = $true )
& ( upairsetE = $true )
& ( omegaIndAx = $true )
& ( emptyinPowerset = $true )
& ( exuE3e = $true )
& ( setunionAx = $true )
& ( emptysetAx = $true )
& ( setunionI = $true )
& ( nonemptyI1 = $true )
& ( setadjoinAx = $true )
& ( setbeta = $true )
& ( notinemptyset = $true )
& ( dsetconstrI = $true )
& ( powersetAx = $true )
& ( emptyI = $true )
& ( exuE1 = $true )
& ( uniqinunit = $true )
& ( setadjoinOr = $true )
& ( nonemptyE1 = $true )
& ( notinsingleton = $true )
& ( omegaSAx = $true )
& ? [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
!= $true )
& ( setunionE = $true ) ),
inference(flattening,[],[f197]) ).
thf(f298,plain,
( ( ( setadjoinIL = $true )
| ? [X0: $i,X1: $i] :
( $true
!= ( in @ X1 @ ( setadjoin @ X1 @ X0 ) ) ) )
& ( ! [X0: $i,X1: $i] :
( $true
= ( in @ X1 @ ( setadjoin @ X1 @ X0 ) ) )
| ( setadjoinIL != $true ) ) ),
inference(nnf_transformation,[],[f113]) ).
thf(f299,plain,
( ( ( setadjoinIL = $true )
| ? [X0: $i,X1: $i] :
( $true
!= ( in @ X1 @ ( setadjoin @ X1 @ X0 ) ) ) )
& ( ! [X2: $i,X3: $i] :
( $true
= ( in @ X3 @ ( setadjoin @ X3 @ X2 ) ) )
| ( setadjoinIL != $true ) ) ),
inference(rectify,[],[f298]) ).
thf(f300,plain,
( ( ( setadjoinIL = $true )
| ( $true
!= ( in @ sK78 @ ( setadjoin @ sK78 @ sK77 ) ) ) )
& ( ! [X2: $i,X3: $i] :
( $true
= ( in @ X3 @ ( setadjoin @ X3 @ X2 ) ) )
| ( setadjoinIL != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK77,sK78]),skolemize(X0,sK77),skolemize(X1,sK78)],[f299]) ).
thf(f353,plain,
( ( singletonsswitch = $true )
& ( setadjoinE = $true )
& ( emptyinunitempty = $true )
& ( foundationAx = $true )
& ( powersetI = $true )
& ( noeltsimpempty = $true )
& ( setadjoinIR = $true )
& ( replAx = $true )
& ( emptysetE = $true )
& ( prop2setE = $true )
& ( omega0Ax = $true )
& ( wellorderingAx = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrER = $true )
& ( emptysetimpfalse = $true )
& ( descrp = $true )
& ( nonemptyI = $true )
& ( exuE2 = $true )
& ( powersetE = $true )
& ( subPowSU = $true )
& ( nonemptyImpWitness = $true )
& ( setextAx = $true )
& ( emptyInPowerset = $true )
& ( eqinunit = $true )
& ( setext = $true )
& ( setadjoinIL = $true )
& ( setoftrueEq = $true )
& ( upairsetE = $true )
& ( omegaIndAx = $true )
& ( emptyinPowerset = $true )
& ( exuE3e = $true )
& ( setunionAx = $true )
& ( emptysetAx = $true )
& ( setunionI = $true )
& ( nonemptyI1 = $true )
& ( setadjoinAx = $true )
& ( setbeta = $true )
& ( notinemptyset = $true )
& ( dsetconstrI = $true )
& ( powersetAx = $true )
& ( emptyI = $true )
& ( exuE1 = $true )
& ( uniqinunit = $true )
& ( setadjoinOr = $true )
& ( nonemptyE1 = $true )
& ( notinsingleton = $true )
& ( omegaSAx = $true )
& ( $true
!= ( in @ sK119 @ ( setadjoin @ sK119 @ ( setadjoin @ sK120 @ emptyset ) ) ) )
& ( setunionE = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK119,sK120]),skolemize(X0,sK119),skolemize(X1,sK120)],[f198]) ).
thf(f499,plain,
! [X2: $i,X3: $i] :
( ( $true
= ( in @ X3 @ ( setadjoin @ X3 @ X2 ) ) )
| ( setadjoinIL != $true ) ),
inference(cnf_transformation,[],[f300]) ).
thf(f564,plain,
( $true
!= ( in @ sK119 @ ( setadjoin @ sK119 @ ( setadjoin @ sK120 @ emptyset ) ) ) ),
inference(cnf_transformation,[],[f353]) ).
thf(f586,plain,
setadjoinIL = $true,
inference(cnf_transformation,[],[f353]) ).
thf(f731,plain,
! [X2: $i,X3: $i] :
( ( $true != $true )
| ( $true
= ( in @ X3 @ ( setadjoin @ X3 @ X2 ) ) ) ),
inference(definition_unfolding,[],[f499,f586]) ).
thf(f900,plain,
! [X2: $i,X3: $i] :
( $true
= ( in @ X3 @ ( setadjoin @ X3 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f731]) ).
thf(f1056,plain,
$false,
inference(forward_subsumption_resolution,[],[f564,f900]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU532^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.17 % Computer : n008.cluster.edu
% 0.14/0.17 % Model : x86_64 x86_64
% 0.14/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.17 % Memory : 8046.5625MB
% 0.14/0.17 % OS : Linux 6.8.0-71-generic
% 0.14/0.17 % CPULimit : 300
% 0.14/0.17 % WCLimit : 300
% 0.14/0.17 % DateTime : Tue Sep 29 13:49:09 UTC 2026
% 0.14/0.17 % CPUTime :
% 0.14/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.20 Running higher-order theorem proving
% 0.14/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.29 % (3180672)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.39/0.29 % (3180679)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4055938386:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.39/0.29 % (3180679)Instruction limit reached!
% 0.39/0.29 % (3180679)------------------------------
% 0.39/0.29 % (3180679)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29 % (3180679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29 % (3180679)CaDiCaL version: 2.1.3
% 0.39/0.29 % (3180679)Termination reason: Instruction limit
% 0.39/0.29 % (3180679)Termination phase: shuffling
% 0.39/0.29 % (3180679)Time elapsed: 0.001 s
% 0.39/0.29 % (3180679)Peak memory usage: 9 MB
% 0.39/0.29 % (3180679)Instructions burned: 4 (million)
% 0.39/0.29 % (3180678)lrs+10_16_si=on:nwc=1.5:random_seed=3559918877:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.39/0.29 % (3180677)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4294439061:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.39/0.29 % (3180680)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=1677405881: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.39/0.29 % (3180681)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3920786290:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.39/0.29 % (3180683)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.39/0.29 % (3180683)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.39/0.29 % (3180683)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=3006433840:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.39/0.29 % (3180681)Instruction limit reached!
% 0.39/0.29 % (3180681)------------------------------
% 0.39/0.29 % (3180681)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29 % (3180681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29 % (3180681)CaDiCaL version: 2.1.3
% 0.39/0.29 % (3180681)Termination reason: Instruction limit
% 0.39/0.29 % (3180681)Termination phase: Property scanning
% 0.39/0.29 % (3180681)Time elapsed: 0.006 s
% 0.39/0.29 % (3180681)Peak memory usage: 11 MB
% 0.39/0.29 % (3180681)Instructions burned: 27 (million)
% 0.39/0.29 % (3180678)Instruction limit reached!
% 0.39/0.29 % (3180678)------------------------------
% 0.39/0.29 % (3180678)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29 % (3180678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29 % (3180678)CaDiCaL version: 2.1.3
% 0.39/0.29 % (3180678)Termination reason: Instruction limit
% 0.39/0.29 % (3180678)Termination phase: Property scanning
% 0.39/0.29 % (3180678)Time elapsed: 0.008 s
% 0.39/0.29 % (3180678)Peak memory usage: 10 MB
% 0.39/0.29 % (3180678)Instructions burned: 19 (million)
% 0.39/0.29 % (3180682)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1431478730:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.39/0.29 % (3180685)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=1005826358:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.39/0.29 % (3180685)Instruction limit reached!
% 0.39/0.29 % (3180685)------------------------------
% 0.39/0.29 % (3180685)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29 % (3180685)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29 % (3180685)CaDiCaL version: 2.1.3
% 0.39/0.29 % (3180685)Termination reason: Instruction limit
% 0.39/0.29 % (3180685)Termination phase: shuffling
% 0.39/0.29 % (3180685)Time elapsed: 0.001 s
% 0.39/0.29 % (3180685)Peak memory usage: 10 MB
% 0.39/0.29 % (3180685)Instructions burned: 2 (million)
% 0.39/0.29 % (3180692)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.39/0.29 % (3180692)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=451591484:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.39/0.29 % (3180677) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3180672-3180677"...
% 0.39/0.29 % (3180692)Instruction limit reached!
% 0.39/0.29 % (3180692)------------------------------
% 0.39/0.29 % (3180692)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29 % (3180692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29 % (3180692)CaDiCaL version: 2.1.3
% 0.39/0.29 % (3180692)Termination reason: Instruction limit
% 0.39/0.29 % (3180692)Termination phase: Property scanning
% 0.39/0.29 % (3180692)Time elapsed: 0.002 s
% 0.39/0.29 % (3180692)Peak memory usage: 9 MB
% 0.39/0.29 % (3180692)Instructions burned: 9 (million)
% 0.39/0.29 % (3180677)...printing done.
% 0.39/0.29 % (3180677)Refutation found. Thanks to Tanya!
% 0.39/0.29 % SZS status Theorem for theBenchmark
% 0.39/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.39/0.29 % (3180677)------------------------------
% 0.39/0.29 % (3180677)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29 % (3180677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29 % (3180677)CaDiCaL version: 2.1.3
% 0.39/0.29 % (3180677)Termination reason: Refutation
% 0.39/0.29 % (3180677)Time elapsed: 0.025 s
% 0.39/0.29 % (3180677)Peak memory usage: 12 MB
% 0.39/0.29 % (3180677)Instructions burned: 50 (million)
% 0.39/0.29 % (3180672)Success in time 0.069 s
% 0.39/0.29 % Vampire exiting
%------------------------------------------------------------------------------