%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU642^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 : 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:32:48 AM UTC 2026
% Result : Theorem 6.27s 1.14s
% Output : Refutation 6.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 8
% Syntax : Number of formulae : 90 ( 59 unt; 0 typ; 2 def)
% Number of atoms : 2881 ( 780 equ; 0 cnn)
% Maximal formula atoms : 164 ( 32 avg)
% Number of connectives : 1793 ( 29 ~; 55 |; 477 &; 528 @)
% ( 2 <=>; 658 =>; 0 <=; 0 <~>)
% Maximal formula depth : 171 ( 15 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 301 ( 297 usr; 167 con; 0-4 aty)
% ( 44 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 148 ( 0 sgn 88 !; 6 ?; 148 :)
% 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,
upairinpowunion: $o ).
thf(func_def_167,type,
ubforcartprodlem1: $o ).
thf(func_def_168,type,
ubforcartprodlem2: $o ).
thf(func_def_169,type,
ubforcartprodlem3: $o ).
thf(func_def_170,type,
cartprodpairin: $o ).
thf(func_def_171,type,
cartprodmempair1: $o ).
thf(func_def_172,type,
cartprodmempair: $o ).
thf(func_def_173,type,
setunionE2: $o ).
thf(func_def_174,type,
setunionsingleton1: $o ).
thf(func_def_175,type,
setunionsingleton2: $o ).
thf(func_def_176,type,
setunionsingleton: $o ).
thf(func_def_177,type,
singleton: $i > $o ).
thf(func_def_178,type,
singletonprop: $o ).
thf(func_def_179,type,
ex1: $i > ( $i > $o ) > $o ).
thf(func_def_180,type,
ex1E1: $o ).
thf(func_def_181,type,
ex1I: $o ).
thf(func_def_182,type,
ex1I2: $o ).
thf(func_def_183,type,
singletonsuniq: $o ).
thf(func_def_184,type,
atmost1p: $i > $o ).
thf(func_def_185,type,
atleast2p: $i > $o ).
thf(func_def_186,type,
atmost2p: $i > $o ).
thf(func_def_187,type,
upairsetp: $i > $o ).
thf(func_def_188,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_189,type,
vAND: $o > $o > $o ).
thf(func_def_190,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_191,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_192,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_193,type,
vIMP: $o > $o > $o ).
thf(func_def_194,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_195,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_196,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_197,type,
vIFF: $o > $o > $o ).
thf(func_def_198,type,
vNOT: $o > $o ).
thf(func_def_199,type,
vOR: $o > $o > $o ).
thf(func_def_200,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_201,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_204,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_208,type,
sK3: ( $i > $o ) > $i > $i ).
thf(func_def_209,type,
sK4: ( $i > $o ) > $i > $i ).
thf(func_def_210,type,
sK5: ( $i > $o ) > $i > $i ).
thf(func_def_211,type,
sK6: $i > $i > ( $i > $o ) > $i ).
thf(func_def_212,type,
sK7: $i > ( $i > $o ) > $i ).
thf(func_def_213,type,
sK8: ( $i > $o ) > $i > $i ).
thf(func_def_214,type,
sK9: ( $i > $o ) > $i > $i ).
thf(func_def_215,type,
sK10: ( $i > $o ) > $i > $i ).
thf(func_def_216,type,
sK11: ( $i > $o ) > $i > $i ).
thf(func_def_217,type,
sK12: $i > $i > $i ).
thf(func_def_218,type,
sK13: $i > $i ).
thf(func_def_219,type,
sK14: $i > $i ).
thf(func_def_220,type,
sK15: $i > $i > $i > $i ).
thf(func_def_221,type,
sK16: $i > $i > $i > $i ).
thf(func_def_222,type,
sK17: $i > $i > $i ).
thf(func_def_223,type,
sK18: $i > $i > $i ).
thf(func_def_224,type,
sK19: $i > $i > $i ).
thf(func_def_225,type,
sK20: $i > $i > $i ).
thf(func_def_226,type,
sK21: $i > $i > $i ).
thf(func_def_227,type,
sK22: $i > $i > $i ).
thf(func_def_228,type,
sK23: $i > $i > $i ).
thf(func_def_229,type,
sK24: ( $i > $o ) > ( $i > $o ) > $i > $i > $i ).
thf(func_def_230,type,
sK25: $i > $i > ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_231,type,
sK26: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_232,type,
sK27: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_233,type,
sK28: ( $i > $o ) > $i > $i ).
thf(func_def_234,type,
sK29: ( $i > $o ) > $i > $i ).
thf(func_def_235,type,
sK30: ( $i > $o ) > $i > $i ).
thf(func_def_236,type,
sK31: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_237,type,
sK32: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_238,type,
sK33: ( $i > $o ) > $i ).
thf(func_def_239,type,
sK34: ( $i > $o ) > $i > $i ).
thf(func_def_240,type,
sK35: ( $i > $o ) > $i ).
thf(func_def_241,type,
sK36: ( $i > $o ) > $i > $i ).
thf(func_def_242,type,
sK37: ( $i > $o ) > $i > $i ).
thf(func_def_243,type,
sK38: ( $i > $o ) > $i ).
thf(func_def_244,type,
sK39: ( $i > $o ) > $i > $i ).
thf(func_def_245,type,
sK40: ( $i > $o ) > $i ).
thf(func_def_246,type,
sK41: ( $i > $o ) > $i > $i ).
thf(func_def_247,type,
sK42: ( $i > $o ) > $i > $i ).
thf(func_def_248,type,
sK43: ( $i > $o ) > $i ).
thf(func_def_249,type,
sK44: ( $i > $o ) > $i > $i ).
thf(func_def_250,type,
sK45: ( $i > $o ) > $i ).
thf(func_def_251,type,
sK46: ( $i > $o ) > $i > $i ).
thf(func_def_252,type,
sK47: ( $i > $o ) > $i > $i ).
thf(func_def_253,type,
sK48: ( $i > $o ) > $i > $i ).
thf(func_def_254,type,
sK49: ( $i > $o ) > $i ).
thf(func_def_255,type,
sK50: ( $i > $o ) > $i > $i ).
thf(func_def_256,type,
sK51: ( $i > $o ) > $i ).
thf(func_def_257,type,
sK52: ( $i > $o ) > $i ).
thf(func_def_258,type,
sK53: ( $i > $o ) > $i ).
thf(func_def_259,type,
sK54: ( $i > $o ) > $i ).
thf(func_def_260,type,
sK55: ( $i > $o ) > $i > $i ).
thf(func_def_261,type,
sK56: ( $i > $o ) > $i > $i ).
thf(func_def_262,type,
sK57: ( $i > $o ) > $i > $i ).
thf(func_def_263,type,
sK58: ( $i > $o ) > $i > $i ).
thf(func_def_264,type,
sK59: ( $i > $o ) > $i > $i ).
thf(func_def_265,type,
sK60: ( $i > $o ) > $i > $i ).
thf(func_def_266,type,
sK61: ( $i > $o ) > $i > $i ).
thf(func_def_267,type,
sK62: $i > $i ).
thf(func_def_268,type,
sK63: ( $i > $o ) > $i ).
thf(func_def_269,type,
sK64: ( $i > $o ) > $i > $i ).
thf(func_def_270,type,
sK65: $i > $o > $i > $i ).
thf(func_def_271,type,
sK66: $i > $i > $i ).
thf(func_def_272,type,
sK67: $i > $i ).
thf(func_def_273,type,
sK68: $i > $i ).
thf(func_def_274,type,
sK69: $i > $i ).
thf(func_def_275,type,
sK70: $i > $i > $i ).
thf(func_def_276,type,
sK71: $i > $i > $i ).
thf(func_def_277,type,
sK72: ( $i > $o ) > $i ).
thf(func_def_278,type,
sK73: ( $i > $o ) > $i > $i ).
thf(func_def_279,type,
sK74: ( $i > $o ) > $i ).
thf(func_def_280,type,
sK75: ( $i > $o ) > $i > $i ).
thf(func_def_281,type,
sK76: ( $i > $o ) > $i > $i ).
thf(func_def_282,type,
sK77: $i > $i ).
thf(func_def_283,type,
sK78: $i > $i > $i > $i ).
thf(func_def_284,type,
sK79: $i > $i > $i ).
thf(func_def_285,type,
sK80: $i > $i > $i ).
thf(func_def_286,type,
sK81: $i > $i > $i ).
thf(func_def_287,type,
sK82: $i > $i ).
thf(func_def_288,type,
sK83: $i > ( $i > $i > $o ) > $i ).
thf(func_def_289,type,
sK84: $i > ( $i > $i > $o ) > $i ).
thf(func_def_290,type,
sK85: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_291,type,
sK86: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_292,type,
sK87: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_293,type,
sK88: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_294,type,
sK89: $i > $i ).
thf(func_def_295,type,
sK90: $i > $i > $i ).
thf(func_def_296,type,
sK91: $i > $i > $i ).
thf(func_def_297,type,
sK92: $i > $i > $i ).
thf(f21,axiom,
( notinemptyset
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',notinemptyset) ).
thf(f35,axiom,
( setadjoinOr
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinOr) ).
thf(f51,axiom,
( upairsetIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsetIL) ).
thf(f145,axiom,
( upairset2E
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X1 )
| ( X2 = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairset2E) ).
thf(f157,axiom,
( setunionsingleton
= ( ! [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionsingleton) ).
thf(f165,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
=> ( upairinpowunion
=> ( ubforcartprodlem1
=> ( ubforcartprodlem2
=> ( ubforcartprodlem3
=> ( cartprodpairin
=> ( cartprodmempair1
=> ( cartprodmempair
=> ( setunionE2
=> ( setunionsingleton1
=> ( setunionsingleton2
=> ( setunionsingleton
=> ( singletonprop
=> ( ex1E1
=> ( ex1I
=> ( ex1I2
=> ( singletonsuniq
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL1) ).
thf(f166,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
=> ( upairinpowunion
=> ( ubforcartprodlem1
=> ( ubforcartprodlem2
=> ( ubforcartprodlem3
=> ( cartprodpairin
=> ( cartprodmempair1
=> ( cartprodmempair
=> ( setunionE2
=> ( setunionsingleton1
=> ( setunionsingleton2
=> ( setunionsingleton
=> ( singletonprop
=> ( ex1E1
=> ( ex1I
=> ( ex1I2
=> ( singletonsuniq
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f165]) ).
thf(f205,plain,
( notinemptyset
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
inference(rectify,[],[f21]) ).
thf(f206,plain,
( notinemptyset
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) ) ),
inference(fool_elimination,[],[f205]) ).
thf(f230,plain,
( setadjoinOr
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ) ),
inference(rectify,[],[f35]) ).
thf(f231,plain,
( setadjoinOr
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
=> ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f230]) ).
thf(f262,plain,
( upairsetIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) ),
inference(rectify,[],[f51]) ).
thf(f263,plain,
( upairsetIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) ) ),
inference(fool_elimination,[],[f262]) ).
thf(f443,plain,
( upairset2E
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X1 )
| ( X2 = X0 ) ) ) ) ),
inference(rectify,[],[f145]) ).
thf(f444,plain,
( upairset2E
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f443]) ).
thf(f467,plain,
( setunionsingleton
= ( !! @ $i
@ ^ [Y0: $i] :
( ( setunion @ ( setadjoin @ Y0 @ emptyset ) )
= Y0 ) ) ),
inference(fool_elimination,[],[f157]) ).
thf(f481,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
=> ( upairinpowunion
=> ( ubforcartprodlem1
=> ( ubforcartprodlem2
=> ( ubforcartprodlem3
=> ( cartprodpairin
=> ( cartprodmempair1
=> ( cartprodmempair
=> ( setunionE2
=> ( setunionsingleton1
=> ( setunionsingleton2
=> ( setunionsingleton
=> ( singletonprop
=> ( ex1E1
=> ( ex1I
=> ( ex1I2
=> ( singletonsuniq
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f166]) ).
thf(f482,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 )
=> ( ( upairinpowunion = $true )
=> ( ( ubforcartprodlem1 = $true )
=> ( ( ubforcartprodlem2 = $true )
=> ( ( ubforcartprodlem3 = $true )
=> ( ( cartprodpairin = $true )
=> ( ( cartprodmempair1 = $true )
=> ( ( cartprodmempair = $true )
=> ( ( setunionE2 = $true )
=> ( ( setunionsingleton1 = $true )
=> ( ( setunionsingleton2 = $true )
=> ( ( setunionsingleton = $true )
=> ( ( singletonprop = $true )
=> ( ( ex1E1 = $true )
=> ( ( ex1I = $true )
=> ( ( ex1I2 = $true )
=> ( ( singletonsuniq = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= $true )
=> ( X0 = X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f481]) ).
thf(f483,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( X0 != X2 )
& ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= $true ) )
& ( singletonsuniq = $true )
& ( ex1I2 = $true )
& ( ex1I = $true )
& ( ex1E1 = $true )
& ( singletonprop = $true )
& ( setunionsingleton = $true )
& ( setunionsingleton2 = $true )
& ( setunionsingleton1 = $true )
& ( setunionE2 = $true )
& ( cartprodmempair = $true )
& ( cartprodmempair1 = $true )
& ( cartprodpairin = $true )
& ( ubforcartprodlem3 = $true )
& ( ubforcartprodlem2 = $true )
& ( ubforcartprodlem1 = $true )
& ( upairinpowunion = $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,[],[f482]) ).
thf(f484,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( X0 != X2 )
& ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= $true ) )
& ( singletonsuniq = $true )
& ( ex1I2 = $true )
& ( ex1I = $true )
& ( ex1E1 = $true )
& ( singletonprop = $true )
& ( setunionsingleton = $true )
& ( setunionsingleton2 = $true )
& ( setunionsingleton1 = $true )
& ( setunionE2 = $true )
& ( cartprodmempair = $true )
& ( cartprodmempair1 = $true )
& ( cartprodpairin = $true )
& ( ubforcartprodlem3 = $true )
& ( ubforcartprodlem2 = $true )
& ( ubforcartprodlem1 = $true )
& ( upairinpowunion = $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,[],[f483]) ).
thf(f485,plain,
( ( sK0 != sK2 )
& ( $true
= ( in @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) ) )
& ( singletonsuniq = $true )
& ( ex1I2 = $true )
& ( ex1I = $true )
& ( ex1E1 = $true )
& ( singletonprop = $true )
& ( setunionsingleton = $true )
& ( setunionsingleton2 = $true )
& ( setunionsingleton1 = $true )
& ( setunionE2 = $true )
& ( cartprodmempair = $true )
& ( cartprodmempair1 = $true )
& ( cartprodpairin = $true )
& ( ubforcartprodlem3 = $true )
& ( ubforcartprodlem2 = $true )
& ( ubforcartprodlem1 = $true )
& ( upairinpowunion = $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(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f484]) ).
thf(f506,plain,
( notinemptyset
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) ) ),
inference(cnf_transformation,[],[f206]) ).
thf(f520,plain,
( setadjoinOr
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
=> ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f231]) ).
thf(f536,plain,
( upairsetIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) ) ),
inference(cnf_transformation,[],[f263]) ).
thf(f630,plain,
( upairset2E
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f444]) ).
thf(f642,plain,
( setunionsingleton
= ( !! @ $i
@ ^ [Y0: $i] :
( ( setunion @ ( setadjoin @ Y0 @ emptyset ) )
= Y0 ) ) ),
inference(cnf_transformation,[],[f467]) ).
thf(f669,plain,
notinemptyset = $true,
inference(cnf_transformation,[],[f485]) ).
thf(f682,plain,
setadjoinOr = $true,
inference(cnf_transformation,[],[f485]) ).
thf(f698,plain,
upairsetIL = $true,
inference(cnf_transformation,[],[f485]) ).
thf(f790,plain,
upairset2E = $true,
inference(cnf_transformation,[],[f485]) ).
thf(f802,plain,
setunionsingleton = $true,
inference(cnf_transformation,[],[f485]) ).
thf(f808,plain,
( $true
= ( in @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(cnf_transformation,[],[f485]) ).
thf(f809,plain,
sK0 != sK2,
inference(cnf_transformation,[],[f485]) ).
thf(f832,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset ) )
= $true ),
inference(definition_unfolding,[],[f506,f669]) ).
thf(f845,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
=> ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f520,f682]) ).
thf(f861,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) ) ),
inference(definition_unfolding,[],[f536,f698]) ).
thf(f953,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f630,f790]) ).
thf(f965,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( setunion @ ( setadjoin @ Y0 @ emptyset ) )
= Y0 ) ) ),
inference(definition_unfolding,[],[f642,f802]) ).
thf(f1090,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( setunion @ ( setadjoin @ Y0 @ emptyset ) )
= Y0 )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f965]) ).
thf(f1091,plain,
! [X1: $i] :
( $true
= ( ( setunion @ ( setadjoin @ X1 @ emptyset ) )
= X1 ) ),
inference(beta-eta_normalization,[],[f1090]) ).
thf(f1092,plain,
! [X1: $i] :
( ( setunion @ ( setadjoin @ X1 @ emptyset ) )
= X1 ),
inference(equality_proxy_clausification,[],[f1091]) ).
thf(f1198,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f953]) ).
thf(f1199,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) )
=> ( ( Y1 = X1 )
| ( Y0 = X1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f1198]) ).
thf(f1200,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) )
=> ( ( Y1 = X1 )
| ( Y0 = X1 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f1199]) ).
thf(f1201,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( Y0 = X1 )
| ( X2 = X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f1200]) ).
thf(f1202,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( Y0 = X1 )
| ( X2 = X1 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f1201]) ).
thf(f1203,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( X3 = X1 )
| ( X2 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f1202]) ).
thf(f1204,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( $true
= ( ( X3 = X1 )
| ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f1203]) ).
thf(f1205,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( $true
= ( X2 = X1 ) )
| ( $true
= ( X3 = X1 ) ) ),
inference(or_proxy_clausification,[],[f1204]) ).
thf(f1206,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( X1 = X2 )
| ( $true
= ( X3 = X1 ) ) ),
inference(equality_proxy_clausification,[],[f1205]) ).
thf(f1207,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( X1 = X2 )
| ( X1 = X3 ) ),
inference(equality_proxy_clausification,[],[f1206]) ).
thf(f2191,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f861]) ).
thf(f2192,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) ),
inference(beta-eta_normalization,[],[f2191]) ).
thf(f2193,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ ( setadjoin @ X1 @ emptyset ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f2192]) ).
thf(f2194,plain,
! [X2: $i,X1: $i] :
( $true
= ( in @ X2 @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ) ),
inference(beta-eta_normalization,[],[f2193]) ).
thf(f2313,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ Y1 ) )
=> ( ( Y2 = Y0 )
| ( in @ Y0 @ Y1 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f845]) ).
thf(f2314,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ Y0 ) )
=> ( ( Y1 = X1 )
| ( in @ X1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f2313]) ).
thf(f2315,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ Y0 ) )
=> ( ( Y1 = X1 )
| ( in @ X1 @ Y0 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f2314]) ).
thf(f2316,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ X2 ) )
=> ( ( Y0 = X1 )
| ( in @ X1 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f2315]) ).
thf(f2317,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ X2 ) )
=> ( ( Y0 = X1 )
| ( in @ X1 @ X2 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f2316]) ).
thf(f2318,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
=> ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f2317]) ).
thf(f2319,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( $true
= ( ( X3 = X1 )
| ( in @ X1 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f2318]) ).
thf(f2320,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( ( in @ X1 @ X2 )
= $true )
| ( $true
= ( X3 = X1 ) ) ),
inference(or_proxy_clausification,[],[f2319]) ).
thf(f2321,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ X2 ) ) )
| ( ( in @ X1 @ X2 )
= $true )
| ( X1 = X3 ) ),
inference(equality_proxy_clausification,[],[f2320]) ).
thf(f2429,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
~ ( in @ Y0 @ emptyset )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f832]) ).
thf(f2430,plain,
! [X1: $i] :
( $true
= ( ~ ( in @ X1 @ emptyset ) ) ),
inference(beta-eta_normalization,[],[f2429]) ).
thf(f2431,plain,
! [X1: $i] :
( ( in @ X1 @ emptyset )
= $false ),
inference(not_proxy_clausification,[],[f2430]) ).
thf(f6201,plain,
( ( $false = $true )
| ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) )
| ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) ) ),
inference(constrained_superposition,[],[f808,f1207]) ).
thf(f6230,plain,
( ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) )
| ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) ) ),
inference(trivial_inequality_removal,[],[f6201]) ).
thf(f6233,definition,
( spl93_17
<=> ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) ) ),
introduced(definition,[new_symbols(definition,[spl93_17])],[avatar_definition]) ).
thf(f6235,plain,
( ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ emptyset ) )
| ~ spl93_17 ),
inference(avatar_component_clause,[],[f6233]) ).
thf(f6237,definition,
( spl93_18
<=> ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) ) ),
introduced(definition,[new_symbols(definition,[spl93_18])],[avatar_definition]) ).
thf(f6239,plain,
( ( ( setadjoin @ sK2 @ emptyset )
= ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) )
| ~ spl93_18 ),
inference(avatar_component_clause,[],[f6237]) ).
thf(f6246,plain,
( spl93_17
| spl93_18 ),
inference(avatar_split_clause,[],[f6230,f6237,f6233]) ).
thf(f6262,plain,
( ( sK2
= ( setunion @ ( setadjoin @ sK0 @ emptyset ) ) )
| ~ spl93_17 ),
inference(constrained_superposition,[],[f1092,f6235]) ).
thf(f6300,plain,
( ( sK0 = sK2 )
| ~ spl93_17 ),
inference(forward_demodulation,[],[f6262,f1092]) ).
thf(f6313,plain,
( $false
| ~ spl93_17 ),
inference(forward_subsumption_resolution,[],[f6300,f809]) ).
thf(f6314,plain,
~ spl93_17,
inference(avatar_contradiction_clause,[],[f6313]) ).
thf(f6343,plain,
( ( $true
= ( in @ sK0 @ ( setadjoin @ sK2 @ emptyset ) ) )
| ~ spl93_18 ),
inference(constrained_superposition,[],[f2194,f6239]) ).
thf(f6349,plain,
( ( $false = $true )
| ( $true
= ( in @ sK0 @ emptyset ) )
| ( sK0 = sK2 )
| ~ spl93_18 ),
inference(constrained_superposition,[],[f6343,f2321]) ).
thf(f6372,plain,
( ( $true
= ( in @ sK0 @ emptyset ) )
| ( sK0 = sK2 )
| ~ spl93_18 ),
inference(trivial_inequality_removal,[],[f6349]) ).
thf(f6378,plain,
( ( $true
= ( in @ sK0 @ emptyset ) )
| ~ spl93_18 ),
inference(forward_subsumption_resolution,[],[f6372,f809]) ).
thf(f6382,plain,
( ( $false = $true )
| ~ spl93_18 ),
inference(forward_demodulation,[],[f6378,f2431]) ).
thf(f6383,plain,
( $false
| ~ spl93_18 ),
inference(trivial_inequality_removal,[],[f6382]) ).
thf(f6384,plain,
~ spl93_18,
inference(avatar_contradiction_clause,[],[f6383]) ).
cnf(s18,plain,
( spl93_17
| spl93_18 ),
inference(sat_conversion,[],[f6246]) ).
cnf(s26,plain,
~ spl93_17,
inference(sat_conversion,[],[f6314]) ).
cnf(s30,plain,
~ spl93_18,
inference(sat_conversion,[],[f6384]) ).
cnf(s32,plain,
$false,
inference(rat,[],[s18,s30,s26]) ).
thf(f6385,plain,
$false,
inference(avatar_sat_refutation,[],[s32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU642^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.08/0.18 % Computer : n017.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:57:22 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.64/1.03 % (382431)Will run a generic schedule for satisfiability detection.
% 5.64/1.03 % (382447)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=73037566:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.64/1.03 % (382446)% WARNING: option uhcvi not known.
% 5.64/1.03 % (382445)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=485362445_2999 on theBenchmark for (2999ds/0Mi)
% 5.64/1.03 % (382448)dis+10_1_sil=32000:sp=arity:random_seed=2093483882:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.64/1.03 % (382449)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2326347233:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.64/1.03 % (382446)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=835613331:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.64/1.03 % (382451)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3735546003:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.64/1.03 % (382452)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1755376234:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.64/1.03 % (382449)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.64/1.03 % (382446)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.64/1.03 % Exception at run slice level
% 5.64/1.03 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.64/1.03 % (382446)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 5.64/1.03 % (382448)Instruction limit reached!
% 5.64/1.03 % (382448)------------------------------
% 5.64/1.03 % (382448)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.64/1.03 % (382448)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.64/1.03 % (382448)CaDiCaL version: 2.1.3
% 5.64/1.03 % (382448)Termination reason: Instruction limit
% 5.64/1.03 % (382448)Termination phase: Saturation
% 5.64/1.03 % (382448)Time elapsed: 0.045 s
% 5.64/1.03 % (382448)Peak memory usage: 12 MB
% 5.64/1.03 % (382448)Instructions burned: 104 (million)
% 5.64/1.03 % (382478)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=61435741:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.64/1.03 % (382449)Instruction limit reached!
% 5.64/1.03 % (382449)------------------------------
% 5.64/1.03 % (382449)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.64/1.03 % (382449)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.64/1.03 % (382449)CaDiCaL version: 2.1.3
% 5.64/1.03 % (382449)Termination reason: Instruction limit
% 5.64/1.03 % (382449)Termination phase: Saturation
% 5.64/1.03 % (382449)Time elapsed: 0.050 s
% 5.64/1.03 % (382449)Peak memory usage: 13 MB
% 5.64/1.03 % (382449)Instructions burned: 117 (million)
% 5.64/1.03 % (382451)Instruction limit reached!
% 5.64/1.03 % (382451)------------------------------
% 5.64/1.03 % (382451)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.64/1.03 % (382451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.64/1.03 % (382451)CaDiCaL version: 2.1.3
% 5.64/1.03 % (382451)Termination reason: Instruction limit
% 5.64/1.03 % (382451)Termination phase: Saturation
% 5.64/1.03 % (382451)Time elapsed: 0.061 s
% 5.64/1.03 % (382451)Peak memory usage: 13 MB
% 5.64/1.03 % (382451)Instructions burned: 138 (million)
% 5.64/1.03 % (382490)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1109374053:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 5.64/1.03 % (382492)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=1324918766:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 5.64/1.03 % (382452)Instruction limit reached!
% 5.64/1.03 % (382452)------------------------------
% 5.64/1.03 % (382452)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.64/1.03 % (382452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.64/1.03 % (382452)CaDiCaL version: 2.1.3
% 5.64/1.03 % (382452)Termination reason: Instruction limit
% 5.64/1.03 % (382452)Termination phase: Saturation
% 5.64/1.03 % (382452)Time elapsed: 0.072 s
% 5.64/1.03 % (382452)Peak memory usage: 14 MB
% 5.64/1.03 % (382452)Instructions burned: 159 (million)
% 5.64/1.03 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % (382496)ott-21_1_sil=16000:fs=off:random_seed=1452790272:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.27/1.14 % (382492)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.27/1.14 % (382504)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3849407972:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 6.27/1.14 % (382506)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2076344476:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 6.27/1.14 % (382492)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.27/1.14 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % (382490)Instruction limit reached!
% 6.27/1.14 % (382490)------------------------------
% 6.27/1.14 % (382490)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.27/1.14 % (382490)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.27/1.14 % (382490)CaDiCaL version: 2.1.3
% 6.27/1.14 % (382490)Termination reason: Instruction limit
% 6.27/1.14 % (382490)Termination phase: Saturation
% 6.27/1.14 % (382490)Time elapsed: 0.059 s
% 6.27/1.14 % (382490)Peak memory usage: 13 MB
% 6.27/1.14 % (382490)Instructions burned: 132 (million)
% 6.27/1.14 % (382529)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2815267986:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 6.27/1.14 % (382532)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3548071581:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 6.27/1.14 % (382496)Instruction limit reached!
% 6.27/1.14 % (382496)------------------------------
% 6.27/1.14 % (382496)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.27/1.14 % (382496)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.27/1.14 % (382496)CaDiCaL version: 2.1.3
% 6.27/1.14 % (382496)Termination reason: Instruction limit
% 6.27/1.14 % (382496)Termination phase: Saturation
% 6.27/1.14 % (382496)Time elapsed: 0.083 s
% 6.27/1.14 % (382496)Peak memory usage: 14 MB
% 6.27/1.14 % (382496)Instructions burned: 182 (million)
% 6.27/1.14 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % (382550)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=2241837485: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)
% 6.27/1.14 % (382554)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=928105885:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 6.27/1.14 % (382550)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.27/1.14 % (382554)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.27/1.14 % (382492)Instruction limit reached!
% 6.27/1.14 % (382492)------------------------------
% 6.27/1.14 % (382492)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.27/1.14 % (382492)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.27/1.14 % (382492)CaDiCaL version: 2.1.3
% 6.27/1.14 % (382492)Termination reason: Instruction limit
% 6.27/1.14 % (382492)Termination phase: Saturation
% 6.27/1.14 % (382492)Time elapsed: 0.270 s
% 6.27/1.14 % (382492)Peak memory usage: 14 MB
% 6.27/1.14 % (382492)Instructions burned: 685 (million)
% 6.27/1.14 % (382504)Instruction limit reached!
% 6.27/1.14 % (382504)------------------------------
% 6.27/1.14 % (382504)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.27/1.14 % (382504)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.27/1.14 % (382504)CaDiCaL version: 2.1.3
% 6.27/1.14 % (382504)Termination reason: Instruction limit
% 6.27/1.14 % (382504)Termination phase: Saturation
% 6.27/1.14 % (382504)Time elapsed: 0.253 s
% 6.27/1.14 % (382504)Peak memory usage: 14 MB
% 6.27/1.14 % (382504)Instructions burned: 478 (million)
% 6.27/1.14 % (382622)fmb+10_1_sil=64000:random_seed=2207403444:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 6.27/1.14 % (382623)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=934062176:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 6.27/1.14 % (382622)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 6.27/1.14 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % (382626)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1031960747:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 6.27/1.14 % (382627)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=667825646:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 6.27/1.14 % (382627)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.27/1.14 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % (382630)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3119439006:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 6.27/1.14 % (382630)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 6.27/1.14 % (382630)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.27/1.14 % (382550)Instruction limit reached!
% 6.27/1.14 % (382550)------------------------------
% 6.27/1.14 % (382550)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.27/1.14 % (382550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.27/1.14 % (382550)CaDiCaL version: 2.1.3
% 6.27/1.14 % (382550)Termination reason: Instruction limit
% 6.27/1.14 % (382550)Termination phase: Saturation
% 6.27/1.14 % (382550)Time elapsed: 0.309 s
% 6.27/1.14 % (382550)Peak memory usage: 16 MB
% 6.27/1.14 % (382550)Instructions burned: 694 (million)
% 6.27/1.14 % (382632)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3810279532:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 6.27/1.14 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % (382634)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1872599291:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 6.27/1.14 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % (382636)ott-2_1_sil=16000:newcnf=on:random_seed=2590616082:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2993 on theBenchmark for (2993ds/869Mi)
% 6.27/1.14 % (382636)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.27/1.14 % (382554)Instruction limit reached!
% 6.27/1.14 % (382554)------------------------------
% 6.27/1.14 % (382554)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.27/1.14 % (382554)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.27/1.14 % (382554)CaDiCaL version: 2.1.3
% 6.27/1.14 % (382554)Termination reason: Instruction limit
% 6.27/1.14 % (382554)Termination phase: Saturation
% 6.27/1.14 % (382554)Time elapsed: 0.436 s
% 6.27/1.14 % (382554)Peak memory usage: 17 MB
% 6.27/1.14 % (382554)Instructions burned: 880 (million)
% 6.27/1.14 % (382638)ott+10_1_sil=32000:tgt=ground:random_seed=1583989001:i=5114:av=off_2993 on theBenchmark for (2993ds/5114Mi)
% 6.27/1.14 % (382529)Instruction limit reached!
% 6.27/1.14 % (382529)------------------------------
% 6.27/1.14 % (382529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.27/1.14 % (382529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.27/1.14 % (382529)CaDiCaL version: 2.1.3
% 6.27/1.14 % (382529)Termination reason: Instruction limit
% 6.27/1.14 % (382529)Termination phase: Saturation
% 6.27/1.14 % (382529)Time elapsed: 0.553 s
% 6.27/1.14 % (382529)Peak memory usage: 18 MB
% 6.27/1.14 % (382529)Instructions burned: 1179 (million)
% 6.27/1.14 % (382640)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2794110691:i=54282_2992 on theBenchmark for (2992ds/54282Mi)
% 6.27/1.14 % Exception at run slice level
% 6.27/1.14 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.27/1.14 % (382642)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2029827981:i=3512:aac=none_2992 on theBenchmark for (2992ds/3512Mi)
% 6.27/1.14 % (382642)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.27/1.14 % (382636) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-382431-382636"...
% 6.27/1.14 % (382636)...printing done.
% 6.27/1.14 % (382636)Refutation found. Thanks to Tanya!
% 6.27/1.14 % SZS status Theorem for theBenchmark
% 6.27/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 6.27/1.14 % (382636)------------------------------
% 6.27/1.14 % (382636)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.27/1.14 % (382636)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.27/1.14 % (382636)CaDiCaL version: 2.1.3
% 6.27/1.14 % (382636)Termination reason: Refutation
% 6.27/1.14 % (382636)Time elapsed: 0.255 s
% 6.27/1.14 % (382636)Peak memory usage: 16 MB
% 6.27/1.14 % (382636)Instructions burned: 516 (million)
% 6.27/1.14 % (382431)Success in time 0.913 s
% 6.27/1.14 % Vampire exiting
%------------------------------------------------------------------------------