%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU626^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:32:44 AM UTC 2026
% Result : Theorem 14.63s 2.31s
% Output : Refutation 14.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of formulae : 45 ( 29 unt; 0 typ; 0 def)
% Number of atoms : 2448 ( 628 equ; 0 cnn)
% Maximal formula atoms : 146 ( 54 avg)
% Number of connectives : 1528 ( 8 ~; 11 |; 432 &; 434 @)
% ( 0 <=>; 610 =>; 0 <=; 0 <~>)
% Maximal formula depth : 155 ( 25 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 264 ( 260 usr; 150 con; 0-4 aty)
% ( 33 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 110 ( 39 ^; 63 !; 8 ?; 110 :)
% 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_65,type,
quantDeMorgan2: $o ).
thf(func_def_66,type,
quantDeMorgan3: $o ).
thf(func_def_67,type,
quantDeMorgan4: $o ).
thf(func_def_68,type,
prop2setI: $o ).
thf(func_def_69,type,
set2prop: $i > $o ).
thf(func_def_70,type,
prop2set2propI: $o ).
thf(func_def_71,type,
notdexE: $o ).
thf(func_def_72,type,
notdallE: $o ).
thf(func_def_73,type,
exuI1: $o ).
thf(func_def_74,type,
exuI3: $o ).
thf(func_def_75,type,
exuI2: $o ).
thf(func_def_76,type,
inCongP: $o ).
thf(func_def_77,type,
in__Cong: $o ).
thf(func_def_78,type,
exuE3u: $o ).
thf(func_def_79,type,
exu__Cong: $o ).
thf(func_def_80,type,
emptyset__Cong: $o ).
thf(func_def_81,type,
setadjoin__Cong: $o ).
thf(func_def_82,type,
powerset__Cong: $o ).
thf(func_def_83,type,
setunion__Cong: $o ).
thf(func_def_84,type,
omega__Cong: $o ).
thf(func_def_85,type,
exuEu: $o ).
thf(func_def_86,type,
descr__Cong: $o ).
thf(func_def_87,type,
dsetconstr__Cong: $o ).
thf(func_def_88,type,
subset: $i > $i > $o ).
thf(func_def_89,type,
disjoint: $i > $i > $o ).
thf(func_def_90,type,
setsmeet: $i > $i > $o ).
thf(func_def_91,type,
subsetI1: $o ).
thf(func_def_92,type,
eqimpsubset2: $o ).
thf(func_def_93,type,
eqimpsubset1: $o ).
thf(func_def_94,type,
subsetI2: $o ).
thf(func_def_95,type,
emptysetsubset: $o ).
thf(func_def_96,type,
subsetE: $o ).
thf(func_def_97,type,
subsetE2: $o ).
thf(func_def_98,type,
notsubsetI: $o ).
thf(func_def_99,type,
notequalI1: $o ).
thf(func_def_100,type,
notequalI2: $o ).
thf(func_def_101,type,
subsetRefl: $o ).
thf(func_def_102,type,
subsetTrans: $o ).
thf(func_def_103,type,
setadjoinSub: $o ).
thf(func_def_104,type,
setadjoinSub2: $o ).
thf(func_def_105,type,
subset2powerset: $o ).
thf(func_def_106,type,
setextsub: $o ).
thf(func_def_107,type,
subsetemptysetimpeq: $o ).
thf(func_def_108,type,
powersetI1: $o ).
thf(func_def_109,type,
powersetE1: $o ).
thf(func_def_110,type,
inPowerset: $o ).
thf(func_def_111,type,
powersetsubset: $o ).
thf(func_def_112,type,
sepInPowerset: $o ).
thf(func_def_113,type,
sepSubset: $o ).
thf(func_def_114,type,
binunion: $i > $i > $i ).
thf(func_def_115,type,
binunionIL: $o ).
thf(func_def_116,type,
upairset2IR: $o ).
thf(func_def_117,type,
binunionIR: $o ).
thf(func_def_118,type,
binunionEcases: $o ).
thf(func_def_119,type,
binunionE: $o ).
thf(func_def_120,type,
binunionLsub: $o ).
thf(func_def_121,type,
binunionRsub: $o ).
thf(func_def_122,type,
binintersect: $i > $i > $i ).
thf(func_def_123,type,
binintersectI: $o ).
thf(func_def_124,type,
binintersectSubset5: $o ).
thf(func_def_125,type,
binintersectEL: $o ).
thf(func_def_126,type,
binintersectLsub: $o ).
thf(func_def_127,type,
binintersectSubset2: $o ).
thf(func_def_128,type,
binintersectSubset3: $o ).
thf(func_def_129,type,
binintersectER: $o ).
thf(func_def_130,type,
disjointsetsI1: $o ).
thf(func_def_131,type,
binintersectRsub: $o ).
thf(func_def_132,type,
binintersectSubset4: $o ).
thf(func_def_133,type,
binintersectSubset1: $o ).
thf(func_def_134,type,
bs114d: $o ).
thf(func_def_135,type,
regular: $i > $o ).
thf(func_def_136,type,
setminus: $i > $i > $i ).
thf(func_def_137,type,
setminusI: $o ).
thf(func_def_138,type,
setminusEL: $o ).
thf(func_def_139,type,
setminusER: $o ).
thf(func_def_140,type,
setminusSubset2: $o ).
thf(func_def_141,type,
setminusERneg: $o ).
thf(func_def_142,type,
setminusELneg: $o ).
thf(func_def_143,type,
setminusILneg: $o ).
thf(func_def_144,type,
setminusIRneg: $o ).
thf(func_def_145,type,
setminusLsub: $o ).
thf(func_def_146,type,
setminusSubset1: $o ).
thf(func_def_147,type,
symdiff: $i > $i > $i ).
thf(func_def_148,type,
symdiffE: $o ).
thf(func_def_149,type,
symdiffI1: $o ).
thf(func_def_150,type,
symdiffI2: $o ).
thf(func_def_151,type,
symdiffIneg1: $o ).
thf(func_def_152,type,
symdiffIneg2: $o ).
thf(func_def_153,type,
iskpair: $i > $o ).
thf(func_def_154,type,
secondinupair: $o ).
thf(func_def_155,type,
setukpairIL: $o ).
thf(func_def_156,type,
setukpairIR: $o ).
thf(func_def_157,type,
kpairiskpair: $o ).
thf(func_def_158,type,
kpair: $i > $i > $i ).
thf(func_def_159,type,
kpairp: $o ).
thf(func_def_160,type,
cartprod: $i > $i > $i ).
thf(func_def_161,type,
singletonsubset: $o ).
thf(func_def_162,type,
singletoninpowerset: $o ).
thf(func_def_163,type,
singletoninpowunion: $o ).
thf(func_def_164,type,
upairset2E: $o ).
thf(func_def_165,type,
upairsubunion: $o ).
thf(func_def_166,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_167,type,
vAND: $o > $o > $o ).
thf(func_def_168,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_169,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_170,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_171,type,
vIMP: $o > $o > $o ).
thf(func_def_172,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_173,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_174,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_175,type,
vIFF: $o > $o > $o ).
thf(func_def_176,type,
vNOT: $o > $o ).
thf(func_def_177,type,
vOR: $o > $o > $o ).
thf(func_def_178,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_179,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_182,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_187,type,
sK4: $i > $i > $i ).
thf(func_def_188,type,
sK5: $i > $i > $i ).
thf(func_def_189,type,
sK6: $i > $i > $i ).
thf(func_def_190,type,
sK7: $i > $i > $i ).
thf(func_def_191,type,
sK8: $i > $i > $i ).
thf(func_def_192,type,
sK9: $i > $i > $i ).
thf(func_def_193,type,
sK10: $i > $i > $i ).
thf(func_def_194,type,
sK11: ( $i > $o ) > ( $i > $o ) > $i > $i > $i ).
thf(func_def_195,type,
sK12: $i > $i > ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_196,type,
sK13: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_197,type,
sK14: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_198,type,
sK15: ( $i > $o ) > $i > $i ).
thf(func_def_199,type,
sK16: ( $i > $o ) > $i > $i ).
thf(func_def_200,type,
sK17: ( $i > $o ) > $i > $i ).
thf(func_def_201,type,
sK18: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_202,type,
sK19: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_203,type,
sK20: ( $i > $o ) > $i ).
thf(func_def_204,type,
sK21: ( $i > $o ) > $i > $i ).
thf(func_def_205,type,
sK22: ( $i > $o ) > $i ).
thf(func_def_206,type,
sK23: ( $i > $o ) > $i > $i ).
thf(func_def_207,type,
sK24: ( $i > $o ) > $i > $i ).
thf(func_def_208,type,
sK25: ( $i > $o ) > $i ).
thf(func_def_209,type,
sK26: ( $i > $o ) > $i > $i ).
thf(func_def_210,type,
sK27: ( $i > $o ) > $i ).
thf(func_def_211,type,
sK28: ( $i > $o ) > $i > $i ).
thf(func_def_212,type,
sK29: ( $i > $o ) > $i > $i ).
thf(func_def_213,type,
sK30: ( $i > $o ) > $i ).
thf(func_def_214,type,
sK31: ( $i > $o ) > $i > $i ).
thf(func_def_215,type,
sK32: ( $i > $o ) > $i ).
thf(func_def_216,type,
sK33: ( $i > $o ) > $i > $i ).
thf(func_def_217,type,
sK34: ( $i > $o ) > $i > $i ).
thf(func_def_218,type,
sK35: ( $i > $o ) > $i > $i ).
thf(func_def_219,type,
sK36: ( $i > $o ) > $i ).
thf(func_def_220,type,
sK37: ( $i > $o ) > $i > $i ).
thf(func_def_221,type,
sK38: ( $i > $o ) > $i ).
thf(func_def_222,type,
sK39: ( $i > $o ) > $i ).
thf(func_def_223,type,
sK40: ( $i > $o ) > $i ).
thf(func_def_224,type,
sK41: ( $i > $o ) > $i ).
thf(func_def_225,type,
sK42: ( $i > $o ) > $i > $i ).
thf(func_def_226,type,
sK43: ( $i > $o ) > $i > $i ).
thf(func_def_227,type,
sK44: ( $i > $o ) > $i > $i ).
thf(func_def_228,type,
sK45: ( $i > $o ) > $i > $i ).
thf(func_def_229,type,
sK46: ( $i > $o ) > $i > $i ).
thf(func_def_230,type,
sK47: ( $i > $o ) > $i > $i ).
thf(func_def_231,type,
sK48: ( $i > $o ) > $i > $i ).
thf(func_def_232,type,
sK49: $i > $i ).
thf(func_def_233,type,
sK50: ( $i > $o ) > $i ).
thf(func_def_234,type,
sK51: ( $i > $o ) > $i > $i ).
thf(func_def_235,type,
sK52: $i > $o > $i > $i ).
thf(func_def_236,type,
sK53: $i > $i > $i ).
thf(func_def_237,type,
sK54: $i > $i ).
thf(func_def_238,type,
sK55: $i > $i ).
thf(func_def_239,type,
sK56: $i > $i ).
thf(func_def_240,type,
sK57: $i > $i > $i ).
thf(func_def_241,type,
sK58: $i > $i > $i ).
thf(func_def_242,type,
sK59: ( $i > $o ) > $i ).
thf(func_def_243,type,
sK60: ( $i > $o ) > $i > $i ).
thf(func_def_244,type,
sK61: ( $i > $o ) > $i ).
thf(func_def_245,type,
sK62: ( $i > $o ) > $i > $i ).
thf(func_def_246,type,
sK63: ( $i > $o ) > $i > $i ).
thf(func_def_247,type,
sK64: $i > $i ).
thf(func_def_248,type,
sK65: $i > $i > $i > $i ).
thf(func_def_249,type,
sK66: $i > $i > $i ).
thf(func_def_250,type,
sK67: $i > $i > $i ).
thf(func_def_251,type,
sK68: $i > $i > $i ).
thf(func_def_252,type,
sK69: $i > $i ).
thf(func_def_253,type,
sK70: $i > ( $i > $i > $o ) > $i ).
thf(func_def_254,type,
sK71: $i > ( $i > $i > $o ) > $i ).
thf(func_def_255,type,
sK72: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_256,type,
sK73: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_257,type,
sK74: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_258,type,
sK75: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_259,type,
sK76: $i > $i ).
thf(func_def_260,type,
sK77: $i > $i > $i ).
thf(func_def_261,type,
sK78: $i > $i > $i ).
thf(func_def_262,type,
sK79: $i > $i > $i ).
thf(f95,axiom,
( powersetI1
= ( ! [X0: $i,X1: $i] :
( ( subset @ X1 @ X0 )
=> ( in @ X1 @ ( powerset @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetI1) ).
thf(f147,axiom,
( upairsubunion
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( subset @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsubunion) ).
thf(f148,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
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( dsetconstr__Cong
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( sepInPowerset
=> ( sepSubset
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ( binunionE
=> ( binunionLsub
=> ( binunionRsub
=> ( binintersectI
=> ( binintersectSubset5
=> ( binintersectEL
=> ( binintersectLsub
=> ( binintersectSubset2
=> ( binintersectSubset3
=> ( binintersectER
=> ( disjointsetsI1
=> ( binintersectRsub
=> ( binintersectSubset4
=> ( binintersectSubset1
=> ( bs114d
=> ( setminusI
=> ( setminusEL
=> ( setminusER
=> ( setminusSubset2
=> ( setminusERneg
=> ( setminusELneg
=> ( setminusILneg
=> ( setminusIRneg
=> ( setminusLsub
=> ( setminusSubset1
=> ( symdiffE
=> ( symdiffI1
=> ( symdiffI2
=> ( symdiffIneg1
=> ( symdiffIneg2
=> ( secondinupair
=> ( setukpairIL
=> ( setukpairIR
=> ( kpairiskpair
=> ( kpairp
=> ( singletonsubset
=> ( singletoninpowerset
=> ( singletoninpowunion
=> ( upairset2E
=> ( upairsubunion
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairinpowunion) ).
thf(f149,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
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( dsetconstr__Cong
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( sepInPowerset
=> ( sepSubset
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ( binunionE
=> ( binunionLsub
=> ( binunionRsub
=> ( binintersectI
=> ( binintersectSubset5
=> ( binintersectEL
=> ( binintersectLsub
=> ( binintersectSubset2
=> ( binintersectSubset3
=> ( binintersectER
=> ( disjointsetsI1
=> ( binintersectRsub
=> ( binintersectSubset4
=> ( binintersectSubset1
=> ( bs114d
=> ( setminusI
=> ( setminusEL
=> ( setminusER
=> ( setminusSubset2
=> ( setminusERneg
=> ( setminusELneg
=> ( setminusILneg
=> ( setminusIRneg
=> ( setminusLsub
=> ( setminusSubset1
=> ( symdiffE
=> ( symdiffI1
=> ( symdiffI2
=> ( symdiffIneg1
=> ( symdiffIneg2
=> ( secondinupair
=> ( setukpairIL
=> ( setukpairIR
=> ( kpairiskpair
=> ( kpairp
=> ( singletonsubset
=> ( singletoninpowerset
=> ( singletoninpowunion
=> ( upairset2E
=> ( upairsubunion
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f148]) ).
thf(f328,plain,
( powersetI1
= ( ! [X0: $i,X1: $i] :
( ( subset @ X1 @ X0 )
=> ( in @ X1 @ ( powerset @ X0 ) ) ) ) ),
inference(rectify,[],[f95]) ).
thf(f329,plain,
( powersetI1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y0 @ Y1 )
=> ( in @ Y0 @ ( powerset @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f328]) ).
thf(f430,plain,
( upairsubunion
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( subset @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( binunion @ X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f147]) ).
thf(f431,plain,
( upairsubunion
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( subset @ ( setadjoin @ Y0 @ ( setadjoin @ Y3 @ emptyset ) ) @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f430]) ).
thf(f432,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
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( dsetconstr__Cong
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( sepInPowerset
=> ( sepSubset
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ( binunionE
=> ( binunionLsub
=> ( binunionRsub
=> ( binintersectI
=> ( binintersectSubset5
=> ( binintersectEL
=> ( binintersectLsub
=> ( binintersectSubset2
=> ( binintersectSubset3
=> ( binintersectER
=> ( disjointsetsI1
=> ( binintersectRsub
=> ( binintersectSubset4
=> ( binintersectSubset1
=> ( bs114d
=> ( setminusI
=> ( setminusEL
=> ( setminusER
=> ( setminusSubset2
=> ( setminusERneg
=> ( setminusELneg
=> ( setminusILneg
=> ( setminusIRneg
=> ( setminusLsub
=> ( setminusSubset1
=> ( symdiffE
=> ( symdiffI1
=> ( symdiffI2
=> ( symdiffIneg1
=> ( symdiffIneg2
=> ( secondinupair
=> ( setukpairIL
=> ( setukpairIR
=> ( kpairiskpair
=> ( kpairp
=> ( singletonsubset
=> ( singletoninpowerset
=> ( singletoninpowunion
=> ( upairset2E
=> ( upairsubunion
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f149]) ).
thf(f433,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 )
=> ( ( quantDeMorgan2 = $true )
=> ( ( quantDeMorgan3 = $true )
=> ( ( quantDeMorgan4 = $true )
=> ( ( prop2setI = $true )
=> ( ( prop2set2propI = $true )
=> ( ( notdexE = $true )
=> ( ( notdallE = $true )
=> ( ( exuI1 = $true )
=> ( ( exuI3 = $true )
=> ( ( exuI2 = $true )
=> ( ( inCongP = $true )
=> ( ( in__Cong = $true )
=> ( ( exuE3u = $true )
=> ( ( exu__Cong = $true )
=> ( ( emptyset__Cong = $true )
=> ( ( setadjoin__Cong = $true )
=> ( ( powerset__Cong = $true )
=> ( ( setunion__Cong = $true )
=> ( ( omega__Cong = $true )
=> ( ( exuEu = $true )
=> ( ( descr__Cong = $true )
=> ( ( dsetconstr__Cong = $true )
=> ( ( subsetI1 = $true )
=> ( ( eqimpsubset2 = $true )
=> ( ( eqimpsubset1 = $true )
=> ( ( subsetI2 = $true )
=> ( ( emptysetsubset = $true )
=> ( ( subsetE = $true )
=> ( ( subsetE2 = $true )
=> ( ( notsubsetI = $true )
=> ( ( notequalI1 = $true )
=> ( ( notequalI2 = $true )
=> ( ( subsetRefl = $true )
=> ( ( subsetTrans = $true )
=> ( ( setadjoinSub = $true )
=> ( ( setadjoinSub2 = $true )
=> ( ( subset2powerset = $true )
=> ( ( setextsub = $true )
=> ( ( subsetemptysetimpeq = $true )
=> ( ( powersetI1 = $true )
=> ( ( powersetE1 = $true )
=> ( ( inPowerset = $true )
=> ( ( powersetsubset = $true )
=> ( ( sepInPowerset = $true )
=> ( ( sepSubset = $true )
=> ( ( binunionIL = $true )
=> ( ( upairset2IR = $true )
=> ( ( binunionIR = $true )
=> ( ( binunionEcases = $true )
=> ( ( binunionE = $true )
=> ( ( binunionLsub = $true )
=> ( ( binunionRsub = $true )
=> ( ( binintersectI = $true )
=> ( ( binintersectSubset5 = $true )
=> ( ( binintersectEL = $true )
=> ( ( binintersectLsub = $true )
=> ( ( binintersectSubset2 = $true )
=> ( ( binintersectSubset3 = $true )
=> ( ( binintersectER = $true )
=> ( ( disjointsetsI1 = $true )
=> ( ( binintersectRsub = $true )
=> ( ( binintersectSubset4 = $true )
=> ( ( binintersectSubset1 = $true )
=> ( ( bs114d = $true )
=> ( ( setminusI = $true )
=> ( ( setminusEL = $true )
=> ( ( setminusER = $true )
=> ( ( setminusSubset2 = $true )
=> ( ( setminusERneg = $true )
=> ( ( setminusELneg = $true )
=> ( ( setminusILneg = $true )
=> ( ( setminusIRneg = $true )
=> ( ( setminusLsub = $true )
=> ( ( setminusSubset1 = $true )
=> ( ( symdiffE = $true )
=> ( ( symdiffI1 = $true )
=> ( ( symdiffI2 = $true )
=> ( ( symdiffIneg1 = $true )
=> ( ( symdiffIneg2 = $true )
=> ( ( secondinupair = $true )
=> ( ( setukpairIL = $true )
=> ( ( setukpairIR = $true )
=> ( ( kpairiskpair = $true )
=> ( ( kpairp = $true )
=> ( ( singletonsubset = $true )
=> ( ( singletoninpowerset = $true )
=> ( ( singletoninpowunion = $true )
=> ( ( upairset2E = $true )
=> ( ( upairsubunion = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
=> ( ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f432]) ).
thf(f434,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) )
!= $true )
& ( ( in @ X3 @ X1 )
= $true ) )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( upairsubunion = $true )
& ( upairset2E = $true )
& ( singletoninpowunion = $true )
& ( singletoninpowerset = $true )
& ( singletonsubset = $true )
& ( kpairp = $true )
& ( kpairiskpair = $true )
& ( setukpairIR = $true )
& ( setukpairIL = $true )
& ( secondinupair = $true )
& ( symdiffIneg2 = $true )
& ( symdiffIneg1 = $true )
& ( symdiffI2 = $true )
& ( symdiffI1 = $true )
& ( symdiffE = $true )
& ( setminusSubset1 = $true )
& ( setminusLsub = $true )
& ( setminusIRneg = $true )
& ( setminusILneg = $true )
& ( setminusELneg = $true )
& ( setminusERneg = $true )
& ( setminusSubset2 = $true )
& ( setminusER = $true )
& ( setminusEL = $true )
& ( setminusI = $true )
& ( bs114d = $true )
& ( binintersectSubset1 = $true )
& ( binintersectSubset4 = $true )
& ( binintersectRsub = $true )
& ( disjointsetsI1 = $true )
& ( binintersectER = $true )
& ( binintersectSubset3 = $true )
& ( binintersectSubset2 = $true )
& ( binintersectLsub = $true )
& ( binintersectEL = $true )
& ( binintersectSubset5 = $true )
& ( binintersectI = $true )
& ( binunionRsub = $true )
& ( binunionLsub = $true )
& ( binunionE = $true )
& ( binunionEcases = $true )
& ( binunionIR = $true )
& ( upairset2IR = $true )
& ( binunionIL = $true )
& ( sepSubset = $true )
& ( sepInPowerset = $true )
& ( powersetsubset = $true )
& ( inPowerset = $true )
& ( powersetE1 = $true )
& ( powersetI1 = $true )
& ( subsetemptysetimpeq = $true )
& ( setextsub = $true )
& ( subset2powerset = $true )
& ( setadjoinSub2 = $true )
& ( setadjoinSub = $true )
& ( subsetTrans = $true )
& ( subsetRefl = $true )
& ( notequalI2 = $true )
& ( notequalI1 = $true )
& ( notsubsetI = $true )
& ( subsetE2 = $true )
& ( subsetE = $true )
& ( emptysetsubset = $true )
& ( subsetI2 = $true )
& ( eqimpsubset1 = $true )
& ( eqimpsubset2 = $true )
& ( subsetI1 = $true )
& ( dsetconstr__Cong = $true )
& ( descr__Cong = $true )
& ( exuEu = $true )
& ( omega__Cong = $true )
& ( setunion__Cong = $true )
& ( powerset__Cong = $true )
& ( setadjoin__Cong = $true )
& ( emptyset__Cong = $true )
& ( exu__Cong = $true )
& ( exuE3u = $true )
& ( in__Cong = $true )
& ( inCongP = $true )
& ( exuI2 = $true )
& ( exuI3 = $true )
& ( exuI1 = $true )
& ( notdallE = $true )
& ( notdexE = $true )
& ( prop2set2propI = $true )
& ( prop2setI = $true )
& ( quantDeMorgan4 = $true )
& ( quantDeMorgan3 = $true )
& ( quantDeMorgan2 = $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,[],[f433]) ).
thf(f435,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( ( in @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ ( powerset @ ( binunion @ X0 @ X1 ) ) )
!= $true )
& ( ( in @ X3 @ X1 )
= $true ) )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( upairsubunion = $true )
& ( upairset2E = $true )
& ( singletoninpowunion = $true )
& ( singletoninpowerset = $true )
& ( singletonsubset = $true )
& ( kpairp = $true )
& ( kpairiskpair = $true )
& ( setukpairIR = $true )
& ( setukpairIL = $true )
& ( secondinupair = $true )
& ( symdiffIneg2 = $true )
& ( symdiffIneg1 = $true )
& ( symdiffI2 = $true )
& ( symdiffI1 = $true )
& ( symdiffE = $true )
& ( setminusSubset1 = $true )
& ( setminusLsub = $true )
& ( setminusIRneg = $true )
& ( setminusILneg = $true )
& ( setminusELneg = $true )
& ( setminusERneg = $true )
& ( setminusSubset2 = $true )
& ( setminusER = $true )
& ( setminusEL = $true )
& ( setminusI = $true )
& ( bs114d = $true )
& ( binintersectSubset1 = $true )
& ( binintersectSubset4 = $true )
& ( binintersectRsub = $true )
& ( disjointsetsI1 = $true )
& ( binintersectER = $true )
& ( binintersectSubset3 = $true )
& ( binintersectSubset2 = $true )
& ( binintersectLsub = $true )
& ( binintersectEL = $true )
& ( binintersectSubset5 = $true )
& ( binintersectI = $true )
& ( binunionRsub = $true )
& ( binunionLsub = $true )
& ( binunionE = $true )
& ( binunionEcases = $true )
& ( binunionIR = $true )
& ( upairset2IR = $true )
& ( binunionIL = $true )
& ( sepSubset = $true )
& ( sepInPowerset = $true )
& ( powersetsubset = $true )
& ( inPowerset = $true )
& ( powersetE1 = $true )
& ( powersetI1 = $true )
& ( subsetemptysetimpeq = $true )
& ( setextsub = $true )
& ( subset2powerset = $true )
& ( setadjoinSub2 = $true )
& ( setadjoinSub = $true )
& ( subsetTrans = $true )
& ( subsetRefl = $true )
& ( notequalI2 = $true )
& ( notequalI1 = $true )
& ( notsubsetI = $true )
& ( subsetE2 = $true )
& ( subsetE = $true )
& ( emptysetsubset = $true )
& ( subsetI2 = $true )
& ( eqimpsubset1 = $true )
& ( eqimpsubset2 = $true )
& ( subsetI1 = $true )
& ( dsetconstr__Cong = $true )
& ( descr__Cong = $true )
& ( exuEu = $true )
& ( omega__Cong = $true )
& ( setunion__Cong = $true )
& ( powerset__Cong = $true )
& ( setadjoin__Cong = $true )
& ( emptyset__Cong = $true )
& ( exu__Cong = $true )
& ( exuE3u = $true )
& ( in__Cong = $true )
& ( inCongP = $true )
& ( exuI2 = $true )
& ( exuI3 = $true )
& ( exuI1 = $true )
& ( notdallE = $true )
& ( notdexE = $true )
& ( prop2set2propI = $true )
& ( prop2setI = $true )
& ( quantDeMorgan4 = $true )
& ( quantDeMorgan3 = $true )
& ( quantDeMorgan2 = $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(flattening,[],[f434]) ).
thf(f436,plain,
( ( $true
!= ( in @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( powerset @ ( binunion @ sK0 @ sK1 ) ) ) )
& ( $true
= ( in @ sK3 @ sK1 ) )
& ( $true
= ( in @ sK2 @ sK0 ) )
& ( upairsubunion = $true )
& ( upairset2E = $true )
& ( singletoninpowunion = $true )
& ( singletoninpowerset = $true )
& ( singletonsubset = $true )
& ( kpairp = $true )
& ( kpairiskpair = $true )
& ( setukpairIR = $true )
& ( setukpairIL = $true )
& ( secondinupair = $true )
& ( symdiffIneg2 = $true )
& ( symdiffIneg1 = $true )
& ( symdiffI2 = $true )
& ( symdiffI1 = $true )
& ( symdiffE = $true )
& ( setminusSubset1 = $true )
& ( setminusLsub = $true )
& ( setminusIRneg = $true )
& ( setminusILneg = $true )
& ( setminusELneg = $true )
& ( setminusERneg = $true )
& ( setminusSubset2 = $true )
& ( setminusER = $true )
& ( setminusEL = $true )
& ( setminusI = $true )
& ( bs114d = $true )
& ( binintersectSubset1 = $true )
& ( binintersectSubset4 = $true )
& ( binintersectRsub = $true )
& ( disjointsetsI1 = $true )
& ( binintersectER = $true )
& ( binintersectSubset3 = $true )
& ( binintersectSubset2 = $true )
& ( binintersectLsub = $true )
& ( binintersectEL = $true )
& ( binintersectSubset5 = $true )
& ( binintersectI = $true )
& ( binunionRsub = $true )
& ( binunionLsub = $true )
& ( binunionE = $true )
& ( binunionEcases = $true )
& ( binunionIR = $true )
& ( upairset2IR = $true )
& ( binunionIL = $true )
& ( sepSubset = $true )
& ( sepInPowerset = $true )
& ( powersetsubset = $true )
& ( inPowerset = $true )
& ( powersetE1 = $true )
& ( powersetI1 = $true )
& ( subsetemptysetimpeq = $true )
& ( setextsub = $true )
& ( subset2powerset = $true )
& ( setadjoinSub2 = $true )
& ( setadjoinSub = $true )
& ( subsetTrans = $true )
& ( subsetRefl = $true )
& ( notequalI2 = $true )
& ( notequalI1 = $true )
& ( notsubsetI = $true )
& ( subsetE2 = $true )
& ( subsetE = $true )
& ( emptysetsubset = $true )
& ( subsetI2 = $true )
& ( eqimpsubset1 = $true )
& ( eqimpsubset2 = $true )
& ( subsetI1 = $true )
& ( dsetconstr__Cong = $true )
& ( descr__Cong = $true )
& ( exuEu = $true )
& ( omega__Cong = $true )
& ( setunion__Cong = $true )
& ( powerset__Cong = $true )
& ( setadjoin__Cong = $true )
& ( emptyset__Cong = $true )
& ( exu__Cong = $true )
& ( exuE3u = $true )
& ( in__Cong = $true )
& ( inCongP = $true )
& ( exuI2 = $true )
& ( exuI3 = $true )
& ( exuI1 = $true )
& ( notdallE = $true )
& ( notdexE = $true )
& ( prop2set2propI = $true )
& ( prop2setI = $true )
& ( quantDeMorgan4 = $true )
& ( quantDeMorgan3 = $true )
& ( quantDeMorgan2 = $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(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f435]) ).
thf(f531,plain,
( powersetI1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y0 @ Y1 )
=> ( in @ Y0 @ ( powerset @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f329]) ).
thf(f583,plain,
( upairsubunion
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( subset @ ( setadjoin @ Y0 @ ( setadjoin @ Y3 @ emptyset ) ) @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f431]) ).
thf(f676,plain,
powersetI1 = $true,
inference(cnf_transformation,[],[f436]) ).
thf(f725,plain,
upairsubunion = $true,
inference(cnf_transformation,[],[f436]) ).
thf(f726,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f436]) ).
thf(f727,plain,
( $true
= ( in @ sK3 @ sK1 ) ),
inference(cnf_transformation,[],[f436]) ).
thf(f728,plain,
( $true
!= ( in @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( powerset @ ( binunion @ sK0 @ sK1 ) ) ) ),
inference(cnf_transformation,[],[f436]) ).
thf(f824,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y0 @ Y1 )
=> ( in @ Y0 @ ( powerset @ Y1 ) ) ) ) ) ),
inference(definition_unfolding,[],[f531,f676]) ).
thf(f873,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( subset @ ( setadjoin @ Y0 @ ( setadjoin @ Y3 @ emptyset ) ) @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f583,f725]) ).
thf(f874,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( subset @ ( setadjoin @ Y0 @ ( setadjoin @ Y3 @ emptyset ) ) @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f873]) ).
thf(f875,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ Y2 @ emptyset ) ) @ ( binunion @ Y1 @ Y0 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f874]) ).
thf(f876,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ Y2 @ emptyset ) ) @ ( binunion @ Y1 @ Y0 ) ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f875]) ).
thf(f877,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X2 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ Y1 @ emptyset ) ) @ ( binunion @ Y0 @ X2 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f876]) ).
thf(f878,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X2 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ Y1 @ emptyset ) ) @ ( binunion @ Y0 @ X2 ) ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f877]) ).
thf(f879,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X3 )
=> ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ Y0 @ emptyset ) ) @ ( binunion @ X3 @ X2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f878]) ).
thf(f880,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X1 @ X3 )
= $false )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ Y0 @ emptyset ) ) @ ( binunion @ X3 @ X2 ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f879]) ).
thf(f881,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ( in @ X1 @ X3 )
= $false )
| ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ Y0 @ emptyset ) ) @ ( binunion @ X3 @ X2 ) ) )
@ X4 ) ) ),
inference(pi_proxy_clausification,[],[f880]) ).
thf(f882,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ( in @ X1 @ X3 )
= $false )
| ( $true
= ( ( in @ X4 @ X2 )
=> ( subset @ ( setadjoin @ X1 @ ( setadjoin @ X4 @ emptyset ) ) @ ( binunion @ X3 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f881]) ).
thf(f883,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( $true
= ( subset @ ( setadjoin @ X1 @ ( setadjoin @ X4 @ emptyset ) ) @ ( binunion @ X3 @ X2 ) ) )
| ( ( in @ X4 @ X2 )
= $false )
| ( ( in @ X1 @ X3 )
= $false ) ),
inference(imp_proxy_clausification,[],[f882]) ).
thf(f1251,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y0 @ Y1 )
=> ( in @ Y0 @ ( powerset @ Y1 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f824]) ).
thf(f1252,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ X1 @ Y0 )
=> ( in @ X1 @ ( powerset @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f1251]) ).
thf(f1253,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( subset @ X1 @ Y0 )
=> ( in @ X1 @ ( powerset @ Y0 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f1252]) ).
thf(f1254,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( subset @ X1 @ X2 )
=> ( in @ X1 @ ( powerset @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f1253]) ).
thf(f1255,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( powerset @ X2 ) ) )
| ( ( subset @ X1 @ X2 )
= $false ) ),
inference(imp_proxy_clausification,[],[f1254]) ).
thf(f4172,plain,
( ( $true != $true )
| ( $false
= ( subset @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( binunion @ sK0 @ sK1 ) ) ) ),
inference(constrained_superposition,[],[f728,f1255]) ).
thf(f4190,plain,
( $false
= ( subset @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ ( binunion @ sK0 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f4172]) ).
thf(f55035,plain,
( ( $false = $true )
| ( $false
= ( in @ sK3 @ sK1 ) )
| ( $false
= ( in @ sK2 @ sK0 ) ) ),
inference(constrained_superposition,[],[f883,f4190]) ).
thf(f55084,plain,
( ( $false
= ( in @ sK3 @ sK1 ) )
| ( $false
= ( in @ sK2 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f55035]) ).
thf(f55139,plain,
( ( $false = $true )
| ( $false
= ( in @ sK3 @ sK1 ) ) ),
inference(forward_demodulation,[],[f55084,f726]) ).
thf(f55140,plain,
( $false
= ( in @ sK3 @ sK1 ) ),
inference(trivial_inequality_removal,[],[f55139]) ).
thf(f55886,plain,
$false = $true,
inference(constrained_superposition,[],[f727,f55140]) ).
thf(f55935,plain,
$false,
inference(trivial_inequality_removal,[],[f55886]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU626^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 % Computer : n008.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 13:59:39 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.88/1.16 % (3200560)Will run a generic schedule for satisfiability detection.
% 5.88/1.16 % (3200566)% WARNING: option uhcvi not known.
% 5.88/1.16 % (3200566)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1183608022:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.88/1.16 % (3200566)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.88/1.16 % (3200565)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3984787831_2999 on theBenchmark for (2999ds/0Mi)
% 5.88/1.16 % (3200568)dis+10_1_sil=32000:sp=arity:random_seed=1666231297:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.88/1.16 % (3200567)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=199594117:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.88/1.16 % (3200569)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2665157755:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.88/1.16 % (3200566)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 5.88/1.16 % (3200571)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1902762825:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.88/1.16 % (3200570)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2429858336:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.88/1.16 % (3200569)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.88/1.16 % Exception at run slice level
% 5.88/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.88/1.16 % (3200579)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1352683554:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.88/1.16 % (3200568)Instruction limit reached!
% 5.88/1.16 % (3200568)------------------------------
% 5.88/1.16 % (3200568)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.88/1.16 % (3200568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.88/1.16 % (3200568)CaDiCaL version: 2.1.3
% 5.88/1.16 % (3200568)Termination reason: Instruction limit
% 5.88/1.16 % (3200568)Termination phase: Saturation
% 5.88/1.16 % (3200568)Time elapsed: 0.046 s
% 5.88/1.16 % (3200568)Peak memory usage: 13 MB
% 5.88/1.16 % (3200568)Instructions burned: 103 (million)
% 5.88/1.16 % (3200569)Instruction limit reached!
% 5.88/1.16 % (3200569)------------------------------
% 5.88/1.16 % (3200569)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.88/1.16 % (3200569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.88/1.16 % (3200569)CaDiCaL version: 2.1.3
% 5.88/1.16 % (3200569)Termination reason: Instruction limit
% 5.88/1.16 % (3200569)Termination phase: Saturation
% 5.88/1.16 % (3200569)Time elapsed: 0.053 s
% 5.88/1.16 % (3200569)Peak memory usage: 13 MB
% 5.88/1.16 % (3200569)Instructions burned: 117 (million)
% 5.88/1.16 % (3200588)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2625554485:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 5.88/1.16 % Exception at run slice level
% 5.88/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.88/1.16 % (3200570)Instruction limit reached!
% 5.88/1.16 % (3200570)------------------------------
% 5.88/1.16 % (3200570)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.88/1.16 % (3200570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.88/1.16 % (3200570)CaDiCaL version: 2.1.3
% 5.88/1.16 % (3200570)Termination reason: Instruction limit
% 5.88/1.16 % (3200570)Termination phase: Saturation
% 5.88/1.16 % (3200570)Time elapsed: 0.062 s
% 5.88/1.16 % (3200570)Peak memory usage: 13 MB
% 5.88/1.16 % (3200570)Instructions burned: 133 (million)
% 5.88/1.16 % (3200591)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=192824235:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 5.88/1.16 % (3200571)Instruction limit reached!
% 5.88/1.16 % (3200571)------------------------------
% 5.88/1.16 % (3200571)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.88/1.16 % (3200571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.88/1.16 % (3200571)CaDiCaL version: 2.1.3
% 5.88/1.16 % (3200571)Termination reason: Instruction limit
% 14.63/2.31 % (3200571)Termination phase: Saturation
% 14.63/2.31 % (3200571)Time elapsed: 0.071 s
% 14.63/2.31 % (3200571)Peak memory usage: 14 MB
% 14.63/2.31 % (3200571)Instructions burned: 160 (million)
% 14.63/2.31 % (3200591)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.63/2.31 % (3200598)ott-21_1_sil=16000:fs=off:random_seed=2820309464:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 14.63/2.31 % (3200599)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3032996354:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 14.63/2.31 % (3200601)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1355264853:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 14.63/2.31 % (3200591)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 14.63/2.31 % Exception at run slice level
% 14.63/2.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.63/2.31 % (3200588)Instruction limit reached!
% 14.63/2.31 % (3200588)------------------------------
% 14.63/2.31 % (3200588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200588)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200588)Termination reason: Instruction limit
% 14.63/2.31 % (3200588)Termination phase: Saturation
% 14.63/2.31 % (3200588)Time elapsed: 0.060 s
% 14.63/2.31 % (3200588)Peak memory usage: 13 MB
% 14.63/2.31 % (3200588)Instructions burned: 132 (million)
% 14.63/2.31 % (3200618)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=130952998:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 14.63/2.31 % (3200619)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=941759097:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 14.63/2.31 % Exception at run slice level
% 14.63/2.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.63/2.31 % (3200598)Instruction limit reached!
% 14.63/2.31 % (3200598)------------------------------
% 14.63/2.31 % (3200598)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200598)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200598)Termination reason: Instruction limit
% 14.63/2.31 % (3200598)Termination phase: Saturation
% 14.63/2.31 % (3200598)Time elapsed: 0.085 s
% 14.63/2.31 % (3200598)Peak memory usage: 14 MB
% 14.63/2.31 % (3200598)Instructions burned: 180 (million)
% 14.63/2.31 % (3200637)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1960772510:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 14.63/2.31 % (3200640)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=828021841:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 14.63/2.31 % (3200637)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.63/2.31 % (3200640)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.63/2.31 % (3200599)Instruction limit reached!
% 14.63/2.31 % (3200599)------------------------------
% 14.63/2.31 % (3200599)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200599)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200599)Termination reason: Instruction limit
% 14.63/2.31 % (3200599)Termination phase: Saturation
% 14.63/2.31 % (3200599)Time elapsed: 0.261 s
% 14.63/2.31 % (3200599)Peak memory usage: 14 MB
% 14.63/2.31 % (3200599)Instructions burned: 478 (million)
% 14.63/2.31 % (3200591)Instruction limit reached!
% 14.63/2.31 % (3200591)------------------------------
% 14.63/2.31 % (3200591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200591)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200591)Termination reason: Instruction limit
% 14.63/2.31 % (3200591)Termination phase: Saturation
% 14.63/2.31 % (3200591)Time elapsed: 0.284 s
% 14.63/2.31 % (3200591)Peak memory usage: 14 MB
% 14.63/2.31 % (3200591)Instructions burned: 686 (million)
% 14.63/2.31 % (3200688)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1741652201:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 14.63/2.31 % (3200687)fmb+10_1_sil=64000:random_seed=2819580374:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 14.63/2.31 % (3200687)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 14.63/2.31 % Exception at run slice level
% 14.63/2.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.63/2.31 % Exception at run slice level
% 14.63/2.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.63/2.31 % (3200707)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2584881334:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 14.63/2.31 % (3200706)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=485685648:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 14.63/2.31 % (3200707)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.63/2.31 % Exception at run slice level
% 14.63/2.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.63/2.31 % (3200718)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=275007571:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 14.63/2.31 % (3200637)Instruction limit reached!
% 14.63/2.31 % (3200637)------------------------------
% 14.63/2.31 % (3200637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200637)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200637)Termination reason: Instruction limit
% 14.63/2.31 % (3200637)Termination phase: Saturation
% 14.63/2.31 % (3200637)Time elapsed: 0.295 s
% 14.63/2.31 % (3200637)Peak memory usage: 16 MB
% 14.63/2.31 % (3200637)Instructions burned: 694 (million)
% 14.63/2.31 % (3200730)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2509846392:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 14.63/2.31 % (3200718)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 14.63/2.31 % (3200718)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 14.63/2.31 % Exception at run slice level
% 14.63/2.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.63/2.31 % (3200741)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=382290625:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 14.63/2.31 % Exception at run slice level
% 14.63/2.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.63/2.31 % (3200759)ott-2_1_sil=16000:newcnf=on:random_seed=2772520262:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2993 on theBenchmark for (2993ds/869Mi)
% 14.63/2.31 % (3200759)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.63/2.31 % (3200640)Instruction limit reached!
% 14.63/2.31 % (3200640)------------------------------
% 14.63/2.31 % (3200640)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200640)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200640)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200640)Termination reason: Instruction limit
% 14.63/2.31 % (3200640)Termination phase: Saturation
% 14.63/2.31 % (3200640)Time elapsed: 0.523 s
% 14.63/2.31 % (3200640)Peak memory usage: 17 MB
% 14.63/2.31 % (3200640)Instructions burned: 879 (million)
% 14.63/2.31 % (3200770)ott+10_1_sil=32000:tgt=ground:random_seed=1256386573:i=5114:av=off_2992 on theBenchmark for (2992ds/5114Mi)
% 14.63/2.31 % (3200618)Instruction limit reached!
% 14.63/2.31 % (3200618)------------------------------
% 14.63/2.31 % (3200618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200618)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200618)Termination reason: Instruction limit
% 14.63/2.31 % (3200618)Termination phase: Saturation
% 14.63/2.31 % (3200618)Time elapsed: 0.685 s
% 14.63/2.31 % (3200618)Peak memory usage: 18 MB
% 14.63/2.31 % (3200618)Instructions burned: 1179 (million)
% 14.63/2.31 % (3200779)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1145398661:i=54282_2991 on theBenchmark for (2991ds/54282Mi)
% 14.63/2.31 % Exception at run slice level
% 14.63/2.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.63/2.31 % (3200783)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=1805291634:i=3512:aac=none_2990 on theBenchmark for (2990ds/3512Mi)
% 14.63/2.31 % (3200783)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 14.63/2.31 % (3200759)Instruction limit reached!
% 14.63/2.31 % (3200759)------------------------------
% 14.63/2.31 % (3200759)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200759)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200759)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200759)Termination reason: Instruction limit
% 14.63/2.31 % (3200759)Termination phase: Saturation
% 14.63/2.31 % (3200759)Time elapsed: 0.396 s
% 14.63/2.31 % (3200759)Peak memory usage: 15 MB
% 14.63/2.31 % (3200759)Instructions burned: 870 (million)
% 14.63/2.31 % (3200811)dis+21_1_sil=32000:sas=cadical:random_seed=1371674750:i=3773:amm=off_2989 on theBenchmark for (2989ds/3773Mi)
% 14.63/2.31 % (3200718)Instruction limit reached!
% 14.63/2.31 % (3200718)------------------------------
% 14.63/2.31 % (3200718)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200718)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200718)Termination reason: Instruction limit
% 14.63/2.31 % (3200718)Termination phase: Saturation
% 14.63/2.31 % (3200718)Time elapsed: 0.877 s
% 14.63/2.31 % (3200718)Peak memory usage: 26 MB
% 14.63/2.31 % (3200718)Instructions burned: 1473 (million)
% 14.63/2.31 % (3200892)ott+11_1_sil=16000:gs=on:random_seed=2028547938:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2986 on theBenchmark for (2986ds/2251Mi)
% 14.63/2.31 % (3200892)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 14.63/2.31 % (3200566) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3200560-3200566"...
% 14.63/2.31 % (3200566)...printing done.
% 14.63/2.31 % (3200566)Refutation found. Thanks to Tanya!
% 14.63/2.31 % SZS status Theorem for theBenchmark
% 14.63/2.31 % SZS output start Proof for theBenchmark
% See solution above
% 14.63/2.31 % (3200566)------------------------------
% 14.63/2.31 % (3200566)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.63/2.31 % (3200566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.63/2.31 % (3200566)CaDiCaL version: 2.1.3
% 14.63/2.31 % (3200566)Termination reason: Refutation
% 14.63/2.31 % (3200566)Time elapsed: 2.046 s
% 14.63/2.31 % (3200566)Peak memory usage: 33 MB
% 14.63/2.31 % (3200566)Instructions burned: 7895 (million)
% 14.63/2.31 % (3200560)Success in time 2.085 s
% 14.63/2.31 % Vampire exiting
%------------------------------------------------------------------------------