%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU613^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:40 AM UTC 2026
% Result : Theorem 69.09s 10.09s
% Output : Refutation 69.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 4
% Syntax : Number of formulae : 54 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 2661 ( 716 equ; 0 cnn)
% Maximal formula atoms : 132 ( 49 avg)
% Number of connectives : 1578 ( 39 ~; 20 |; 393 &; 407 @)
% ( 0 <=>; 689 =>; 0 <=; 0 <~>)
% Maximal formula depth : 139 ( 22 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 242 ( 238 usr; 135 con; 0-4 aty)
% ( 30 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 126 ( 60 ^; 60 !; 6 ?; 126 :)
% 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,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_151,type,
vAND: $o > $o > $o ).
thf(func_def_152,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_153,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_154,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_155,type,
vIMP: $o > $o > $o ).
thf(func_def_156,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_157,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_158,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_159,type,
vIFF: $o > $o > $o ).
thf(func_def_160,type,
vNOT: $o > $o ).
thf(func_def_161,type,
vOR: $o > $o > $o ).
thf(func_def_162,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_163,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_166,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_170,type,
sK3: $i > $i > $i ).
thf(func_def_171,type,
sK4: $i > $i > $i ).
thf(func_def_172,type,
sK5: $i > $i > $i ).
thf(func_def_173,type,
sK6: ( $i > $o ) > ( $i > $o ) > $i > $i > $i ).
thf(func_def_174,type,
sK7: $i > $i > ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_175,type,
sK8: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_176,type,
sK9: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_177,type,
sK10: ( $i > $o ) > $i > $i ).
thf(func_def_178,type,
sK11: ( $i > $o ) > $i > $i ).
thf(func_def_179,type,
sK12: ( $i > $o ) > $i > $i ).
thf(func_def_180,type,
sK13: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_181,type,
sK14: ( $i > $o ) > ( $i > $o ) > $i ).
thf(func_def_182,type,
sK15: ( $i > $o ) > $i ).
thf(func_def_183,type,
sK16: ( $i > $o ) > $i > $i ).
thf(func_def_184,type,
sK17: ( $i > $o ) > $i ).
thf(func_def_185,type,
sK18: ( $i > $o ) > $i > $i ).
thf(func_def_186,type,
sK19: ( $i > $o ) > $i > $i ).
thf(func_def_187,type,
sK20: ( $i > $o ) > $i ).
thf(func_def_188,type,
sK21: ( $i > $o ) > $i > $i ).
thf(func_def_189,type,
sK22: ( $i > $o ) > $i ).
thf(func_def_190,type,
sK23: ( $i > $o ) > $i > $i ).
thf(func_def_191,type,
sK24: ( $i > $o ) > $i > $i ).
thf(func_def_192,type,
sK25: ( $i > $o ) > $i ).
thf(func_def_193,type,
sK26: ( $i > $o ) > $i > $i ).
thf(func_def_194,type,
sK27: ( $i > $o ) > $i ).
thf(func_def_195,type,
sK28: ( $i > $o ) > $i > $i ).
thf(func_def_196,type,
sK29: ( $i > $o ) > $i > $i ).
thf(func_def_197,type,
sK30: ( $i > $o ) > $i > $i ).
thf(func_def_198,type,
sK31: ( $i > $o ) > $i ).
thf(func_def_199,type,
sK32: ( $i > $o ) > $i > $i ).
thf(func_def_200,type,
sK33: ( $i > $o ) > $i ).
thf(func_def_201,type,
sK34: ( $i > $o ) > $i ).
thf(func_def_202,type,
sK35: ( $i > $o ) > $i ).
thf(func_def_203,type,
sK36: ( $i > $o ) > $i ).
thf(func_def_204,type,
sK37: ( $i > $o ) > $i > $i ).
thf(func_def_205,type,
sK38: ( $i > $o ) > $i > $i ).
thf(func_def_206,type,
sK39: ( $i > $o ) > $i > $i ).
thf(func_def_207,type,
sK40: ( $i > $o ) > $i > $i ).
thf(func_def_208,type,
sK41: ( $i > $o ) > $i > $i ).
thf(func_def_209,type,
sK42: ( $i > $o ) > $i > $i ).
thf(func_def_210,type,
sK43: ( $i > $o ) > $i > $i ).
thf(func_def_211,type,
sK44: $i > $i ).
thf(func_def_212,type,
sK45: ( $i > $o ) > $i ).
thf(func_def_213,type,
sK46: ( $i > $o ) > $i > $i ).
thf(func_def_214,type,
sK47: $i > $o > $i > $i ).
thf(func_def_215,type,
sK48: $i > $i > $i ).
thf(func_def_216,type,
sK49: $i > $i ).
thf(func_def_217,type,
sK50: $i > $i ).
thf(func_def_218,type,
sK51: $i > $i ).
thf(func_def_219,type,
sK52: $i > $i > $i ).
thf(func_def_220,type,
sK53: $i > $i > $i ).
thf(func_def_221,type,
sK54: ( $i > $o ) > $i ).
thf(func_def_222,type,
sK55: ( $i > $o ) > $i > $i ).
thf(func_def_223,type,
sK56: ( $i > $o ) > $i ).
thf(func_def_224,type,
sK57: ( $i > $o ) > $i > $i ).
thf(func_def_225,type,
sK58: ( $i > $o ) > $i > $i ).
thf(func_def_226,type,
sK59: $i > $i ).
thf(func_def_227,type,
sK60: $i > $i > $i > $i ).
thf(func_def_228,type,
sK61: $i > $i > $i ).
thf(func_def_229,type,
sK62: $i > $i > $i ).
thf(func_def_230,type,
sK63: $i > $i > $i ).
thf(func_def_231,type,
sK64: $i > $i ).
thf(func_def_232,type,
sK65: $i > ( $i > $i > $o ) > $i ).
thf(func_def_233,type,
sK66: $i > ( $i > $i > $o ) > $i ).
thf(func_def_234,type,
sK67: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_235,type,
sK68: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_236,type,
sK69: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_237,type,
sK70: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_238,type,
sK71: $i > $i ).
thf(func_def_239,type,
sK72: $i > $i > $i ).
thf(func_def_240,type,
sK73: $i > $i > $i ).
thf(func_def_241,type,
sK74: $i > $i > $i ).
thf(f14,axiom,
( dsetconstrI
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI) ).
thf(f103,axiom,
( binunionIR
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( binunion @ X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIR) ).
thf(f130,axiom,
( symdiff
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( binunion @ X0 @ X1 )
@ ^ [X2: $i] :
( ~ ( in @ X2 @ X1 )
| ~ ( in @ X2 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiff) ).
thf(f133,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ~ ( in @ X2 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( symdiff @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiffI2) ).
thf(f134,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ~ ( in @ X2 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( symdiff @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f133]) ).
thf(f159,plain,
( dsetconstrI
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
inference(rectify,[],[f14]) ).
thf(f160,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f159]) ).
thf(f329,plain,
( binunionIR
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( binunion @ X0 @ X1 ) ) ) ) ),
inference(rectify,[],[f103]) ).
thf(f330,plain,
( binunionIR
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f329]) ).
thf(f382,plain,
( symdiff
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( binunion @ X0 @ X1 )
@ ^ [X2: $i] :
( ~ ( in @ X2 @ X1 )
| ~ ( in @ X2 @ X0 ) ) ) ) ),
inference(rectify,[],[f130]) ).
thf(f383,plain,
( symdiff
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y0 )
| ~ ( in @ Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f382]) ).
thf(f388,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
=> ! [X0: $i,X1: $i,X2: $i] :
( ~ ( in @ X2 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( symdiff @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f134]) ).
thf(f389,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 )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
!= $true )
=> ( ( ( in @ X2 @ X1 )
= $true )
=> ( ( in @ X2 @ ( symdiff @ X0 @ X1 ) )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f388]) ).
thf(f390,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 )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
!= $true )
=> ( ( ( in @ X2 @ X1 )
= $true )
=> ( ( in @ X2 @ ( symdiff @ X0 @ X1 ) )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(flattening,[],[f389]) ).
thf(f391,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( symdiff @ X0 @ X1 ) )
!= $true )
& ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X2 @ X0 )
!= $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,[],[f390]) ).
thf(f392,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( symdiff @ X0 @ X1 ) )
!= $true )
& ( ( in @ X2 @ X1 )
= $true )
& ( ( in @ X2 @ X0 )
!= $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,[],[f391]) ).
thf(f393,plain,
( ( $true
!= ( in @ sK2 @ ( symdiff @ sK0 @ sK1 ) ) )
& ( $true
= ( in @ sK2 @ sK1 ) )
& ( $true
!= ( in @ sK2 @ sK0 ) )
& ( 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)],[f392]) ).
thf(f407,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f160]) ).
thf(f496,plain,
( binunionIR
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f330]) ).
thf(f523,plain,
( symdiff
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y0 )
| ~ ( in @ Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f383]) ).
thf(f538,plain,
dsetconstrI = $true,
inference(cnf_transformation,[],[f393]) ).
thf(f626,plain,
binunionIR = $true,
inference(cnf_transformation,[],[f393]) ).
thf(f655,plain,
( $true
!= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f393]) ).
thf(f656,plain,
( $true
= ( in @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f393]) ).
thf(f657,plain,
( $true
!= ( in @ sK2 @ ( symdiff @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f393]) ).
thf(f672,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f407,f538]) ).
thf(f760,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f496,f626]) ).
thf(f789,plain,
( $true
!= ( in @ sK2
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y0 )
| ~ ( in @ Y2 @ Y1 ) ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f657,f523]) ).
thf(f790,plain,
( $true
!= ( in @ sK2
@ ( dsetconstr @ ( binunion @ sK0 @ sK1 )
@ ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK0 )
| ~ ( in @ Y0 @ sK1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f789]) ).
thf(f1026,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f760]) ).
thf(f1027,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binunion @ Y1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f1026]) ).
thf(f1028,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binunion @ Y1 @ Y0 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f1027]) ).
thf(f1029,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binunion @ Y0 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f1028]) ).
thf(f1030,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binunion @ Y0 @ X2 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f1029]) ).
thf(f1031,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binunion @ X3 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f1030]) ).
thf(f1032,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( binunion @ X3 @ X2 ) ) )
| ( ( in @ X1 @ X2 )
= $false ) ),
inference(imp_proxy_clausification,[],[f1031]) ).
thf(f1982,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f672]) ).
thf(f1983,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f1982]) ).
thf(f1984,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f1983]) ).
thf(f1985,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f1984]) ).
thf(f1986,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f1985]) ).
thf(f1987,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X3 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f1986]) ).
thf(f1988,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( in @ X1 @ X3 )
= $false )
| ( $true
= ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f1987]) ).
thf(f1989,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $false
= ( X2 @ X1 ) )
| ( ( in @ X1 @ X3 )
= $false ) ),
inference(imp_proxy_clausification,[],[f1988]) ).
thf(f13739,plain,
( ( $true != $true )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK0 )
| ~ ( in @ Y0 @ sK1 ) )
@ sK2 ) )
| ( $false
= ( in @ sK2 @ ( binunion @ sK0 @ sK1 ) ) ) ),
inference(constrained_superposition,[],[f790,f1989]) ).
thf(f13752,plain,
( ( $false
= ( ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK0 )
| ~ ( in @ Y0 @ sK1 ) )
@ sK2 ) )
| ( $false
= ( in @ sK2 @ ( binunion @ sK0 @ sK1 ) ) ) ),
inference(trivial_inequality_removal,[],[f13739]) ).
thf(f13753,plain,
( ( $false
= ( ~ ( in @ sK2 @ sK0 )
| ~ ( in @ sK2 @ sK1 ) ) )
| ( $false
= ( in @ sK2 @ ( binunion @ sK0 @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f13752]) ).
thf(f13755,plain,
( ( $false
= ( ~ ( in @ sK2 @ sK0 ) ) )
| ( $false
= ( in @ sK2 @ ( binunion @ sK0 @ sK1 ) ) ) ),
inference(or_proxy_clausification,[],[f13753]) ).
thf(f13756,plain,
( ( $true
= ( in @ sK2 @ sK0 ) )
| ( $false
= ( in @ sK2 @ ( binunion @ sK0 @ sK1 ) ) ) ),
inference(not_proxy_clausification,[],[f13755]) ).
thf(f13759,plain,
( $false
= ( in @ sK2 @ ( binunion @ sK0 @ sK1 ) ) ),
inference(forward_subsumption_resolution,[],[f13756,f655]) ).
thf(f14076,plain,
( ( $false = $true )
| ( $false
= ( in @ sK2 @ sK1 ) ) ),
inference(constrained_superposition,[],[f1032,f13759]) ).
thf(f14078,plain,
( $false
= ( in @ sK2 @ sK1 ) ),
inference(trivial_inequality_removal,[],[f14076]) ).
thf(f14121,plain,
$false = $true,
inference(constrained_superposition,[],[f656,f14078]) ).
thf(f14122,plain,
$false,
inference(trivial_inequality_removal,[],[f14121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU613^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 % Computer : n026.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 14:00:52 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.25 Running first-order model finding
% 0.09/0.25 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.12/1.16 % (642901)Will run a generic schedule for satisfiability detection.
% 6.12/1.16 % (642916)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3810730429:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.12/1.16 % (642913)% WARNING: option uhcvi not known.
% 6.12/1.16 % (642916)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.12/1.16 % (642913)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2081742794:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.12/1.16 % (642912)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1262927015_2999 on theBenchmark for (2999ds/0Mi)
% 6.12/1.16 % (642915)dis+10_1_sil=32000:sp=arity:random_seed=4166439677:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.12/1.16 % (642914)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2733609521:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.12/1.16 % (642917)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3191633826:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.12/1.16 % (642918)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=926645430:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.12/1.16 % (642913)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.12/1.16 % (642913)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.12/1.16 % (642916)Instruction limit reached!
% 6.12/1.16 % (642916)------------------------------
% 6.12/1.16 % (642916)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.12/1.16 % (642916)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.12/1.16 % (642916)CaDiCaL version: 2.1.3
% 6.12/1.16 % (642916)Termination reason: Instruction limit
% 6.12/1.16 % (642916)Termination phase: Saturation
% 6.12/1.16 % (642916)Time elapsed: 0.050 s
% 6.12/1.16 % (642916)Peak memory usage: 13 MB
% 6.12/1.16 % (642916)Instructions burned: 117 (million)
% 6.12/1.16 % Exception at run slice level
% 6.12/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.12/1.16 % (642939)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3799728588:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.12/1.16 % (642915)Instruction limit reached!
% 6.12/1.16 % (642915)------------------------------
% 6.12/1.16 % (642915)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.12/1.16 % (642915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.12/1.16 % (642915)CaDiCaL version: 2.1.3
% 6.12/1.16 % (642915)Termination reason: Instruction limit
% 6.12/1.16 % (642915)Termination phase: Saturation
% 6.12/1.16 % (642915)Time elapsed: 0.086 s
% 6.12/1.16 % (642915)Peak memory usage: 13 MB
% 6.12/1.16 % (642915)Instructions burned: 103 (million)
% 6.12/1.16 % (642936)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3609857561:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.12/1.16 % (642917)Instruction limit reached!
% 6.12/1.16 % (642917)------------------------------
% 6.12/1.16 % (642917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.12/1.16 % (642917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.12/1.16 % (642917)CaDiCaL version: 2.1.3
% 6.12/1.16 % (642917)Termination reason: Instruction limit
% 6.12/1.16 % (642917)Termination phase: Saturation
% 6.12/1.16 % (642917)Time elapsed: 0.110 s
% 6.12/1.16 % (642917)Peak memory usage: 14 MB
% 6.12/1.16 % (642917)Instructions burned: 131 (million)
% 6.12/1.16 % (642942)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=4283327313:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.12/1.16 % (642947)ott-21_1_sil=16000:fs=off:random_seed=1509802464:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.12/1.16 % (642918)Instruction limit reached!
% 6.12/1.16 % (642918)------------------------------
% 6.12/1.16 % (642918)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.12/1.16 % (642918)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.12/1.16 % (642918)CaDiCaL version: 2.1.3
% 6.12/1.16 % (642918)Termination reason: Instruction limit
% 6.12/1.16 % (642918)Termination phase: Saturation
% 6.12/1.16 % (642918)Time elapsed: 0.132 s
% 17.82/3.12 % (642918)Peak memory usage: 14 MB
% 17.82/3.12 % (642918)Instructions burned: 159 (million)
% 17.82/3.12 % (642942)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.82/3.12 % (642939)Instruction limit reached!
% 17.82/3.12 % (642939)------------------------------
% 17.82/3.12 % (642939)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.82/3.12 % (642939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.82/3.12 % (642939)CaDiCaL version: 2.1.3
% 17.82/3.12 % (642939)Termination reason: Instruction limit
% 17.82/3.12 % (642939)Termination phase: Saturation
% 17.82/3.12 % (642939)Time elapsed: 0.083 s
% 17.82/3.12 % (642939)Peak memory usage: 13 MB
% 17.82/3.12 % (642939)Instructions burned: 131 (million)
% 17.82/3.12 % (642942)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 17.82/3.12 % (642951)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3979423211:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 17.82/3.12 % Exception at run slice level
% 17.82/3.12 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.82/3.12 % (642956)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3701758875:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 17.82/3.12 % (642960)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3030501928:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 17.82/3.12 % (642947)Instruction limit reached!
% 17.82/3.12 % (642947)------------------------------
% 17.82/3.12 % (642947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.82/3.12 % (642947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.82/3.12 % (642947)CaDiCaL version: 2.1.3
% 17.82/3.12 % (642947)Termination reason: Instruction limit
% 17.82/3.12 % (642947)Termination phase: Saturation
% 17.82/3.12 % (642947)Time elapsed: 0.082 s
% 17.82/3.12 % (642947)Peak memory usage: 14 MB
% 17.82/3.12 % (642947)Instructions burned: 182 (million)
% 17.82/3.12 % (642965)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1541142135:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 17.82/3.12 % Exception at run slice level
% 17.82/3.12 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.82/3.12 % Exception at run slice level
% 17.82/3.12 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.82/3.12 % (642970)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2111279922:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 17.82/3.12 % (642970)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.82/3.12 % (642969)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=2600122066: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)
% 17.82/3.12 % (642969)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.82/3.12 % (642942)Instruction limit reached!
% 17.82/3.12 % (642942)------------------------------
% 17.82/3.12 % (642942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.82/3.12 % (642942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.82/3.12 % (642942)CaDiCaL version: 2.1.3
% 17.82/3.12 % (642942)Termination reason: Instruction limit
% 17.82/3.12 % (642942)Termination phase: Saturation
% 17.82/3.12 % (642942)Time elapsed: 0.395 s
% 17.82/3.12 % (642942)Peak memory usage: 14 MB
% 17.82/3.12 % (642942)Instructions burned: 687 (million)
% 17.82/3.12 % (642951)Instruction limit reached!
% 17.82/3.12 % (642951)------------------------------
% 17.82/3.12 % (642951)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.82/3.12 % (642951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.82/3.12 % (642951)CaDiCaL version: 2.1.3
% 17.82/3.12 % (642951)Termination reason: Instruction limit
% 17.82/3.12 % (642951)Termination phase: Saturation
% 17.82/3.12 % (642951)Time elapsed: 0.357 s
% 17.82/3.12 % (642951)Peak memory usage: 14 MB
% 17.82/3.12 % (642951)Instructions burned: 477 (million)
% 17.82/3.12 % (642991)fmb+10_1_sil=64000:random_seed=4167847044:i=22061:nm=2:gsp=on_2994 on theBenchmark for (2994ds/22061Mi)
% 17.82/3.12 % (642997)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=377344868:i=9515:nm=5_2994 on theBenchmark for (2994ds/9515Mi)
% 42.19/6.76 % (642991)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 42.19/6.76 % Exception at run slice level
% 42.19/6.76 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 42.19/6.76 % (642970)Instruction limit reached!
% 42.19/6.76 % (642970)------------------------------
% 42.19/6.76 % (642970)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.19/6.76 % (642970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.19/6.76 % (642970)CaDiCaL version: 2.1.3
% 42.19/6.76 % (642970)Termination reason: Instruction limit
% 42.19/6.76 % (642970)Termination phase: Saturation
% 42.19/6.76 % (642970)Time elapsed: 0.292 s
% 42.19/6.76 % (642970)Peak memory usage: 17 MB
% 42.19/6.76 % (642970)Instructions burned: 880 (million)
% 42.19/6.76 % Exception at run slice level
% 42.19/6.76 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 42.19/6.76 % (643011)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=75579614:fmbsr=1.7:i=920_2994 on theBenchmark for (2994ds/920Mi)
% 42.19/6.76 % (643017)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3941889312:i=5131_2993 on theBenchmark for (2993ds/5131Mi)
% 42.19/6.76 % (643017)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 42.19/6.76 % (643019)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3991137465:i=1472:ins=7:fdi=8:gsp=on_2993 on theBenchmark for (2993ds/1472Mi)
% 42.19/6.76 % Exception at run slice level
% 42.19/6.76 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 42.19/6.76 % (643019)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 42.19/6.76 % (643019)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 42.19/6.76 % (643036)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2182610877:i=6324_2993 on theBenchmark for (2993ds/6324Mi)
% 42.19/6.76 % Exception at run slice level
% 42.19/6.76 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 42.19/6.76 % (642969)Instruction limit reached!
% 42.19/6.76 % (642969)------------------------------
% 42.19/6.76 % (642969)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.19/6.76 % (642969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.19/6.76 % (642969)CaDiCaL version: 2.1.3
% 42.19/6.76 % (642969)Termination reason: Instruction limit
% 42.19/6.76 % (642969)Termination phase: Saturation
% 42.19/6.76 % (642969)Time elapsed: 0.360 s
% 42.19/6.76 % (642969)Peak memory usage: 16 MB
% 42.19/6.76 % (642969)Instructions burned: 694 (million)
% 42.19/6.76 % (643052)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2423228962:fmbsr=2.30978:i=2174_2993 on theBenchmark for (2993ds/2174Mi)
% 42.19/6.76 % (643058)ott-2_1_sil=16000:newcnf=on:random_seed=758351113:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2993 on theBenchmark for (2993ds/869Mi)
% 42.19/6.76 % Exception at run slice level
% 42.19/6.76 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 42.19/6.76 % (643058)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 42.19/6.76 % (643070)ott+10_1_sil=32000:tgt=ground:random_seed=2758720559:i=5114:av=off_2992 on theBenchmark for (2992ds/5114Mi)
% 42.19/6.76 % (642960)Instruction limit reached!
% 42.19/6.76 % (642960)------------------------------
% 42.19/6.76 % (642960)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.19/6.76 % (642960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.19/6.76 % (642960)CaDiCaL version: 2.1.3
% 42.19/6.76 % (642960)Termination reason: Instruction limit
% 42.19/6.76 % (642960)Termination phase: Saturation
% 42.19/6.76 % (642960)Time elapsed: 0.607 s
% 42.19/6.76 % (642960)Peak memory usage: 18 MB
% 42.19/6.76 % (642960)Instructions burned: 1180 (million)
% 42.19/6.76 % (643106)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2504295378:i=54282_2991 on theBenchmark for (2991ds/54282Mi)
% 42.19/6.76 % Exception at run slice level
% 42.19/6.76 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 42.19/6.76 % (643112)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2037869233:i=3512:aac=none_2991 on theBenchmark for (2991ds/3512Mi)
% 69.09/10.09 % (643112)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 69.09/10.09 % (643058)Instruction limit reached!
% 69.09/10.09 % (643058)------------------------------
% 69.09/10.09 % (643058)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643058)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643058)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643058)Termination reason: Instruction limit
% 69.09/10.09 % (643058)Termination phase: Saturation
% 69.09/10.09 % (643058)Time elapsed: 0.375 s
% 69.09/10.09 % (643058)Peak memory usage: 16 MB
% 69.09/10.09 % (643058)Instructions burned: 871 (million)
% 69.09/10.09 % (643161)dis+21_1_sil=32000:sas=cadical:random_seed=1627024698:i=3773:amm=off_2989 on theBenchmark for (2989ds/3773Mi)
% 69.09/10.09 % (643019)Instruction limit reached!
% 69.09/10.09 % (643019)------------------------------
% 69.09/10.09 % (643019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643019)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643019)Termination reason: Instruction limit
% 69.09/10.09 % (643019)Termination phase: Saturation
% 69.09/10.09 % (643019)Time elapsed: 0.702 s
% 69.09/10.09 % (643019)Peak memory usage: 27 MB
% 69.09/10.09 % (643019)Instructions burned: 1474 (million)
% 69.09/10.09 % (643163)ott+11_1_sil=16000:gs=on:random_seed=625901446:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2986 on theBenchmark for (2986ds/2251Mi)
% 69.09/10.09 % (643163)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 69.09/10.09 % (643017)Instruction limit reached!
% 69.09/10.09 % (643017)------------------------------
% 69.09/10.09 % (643017)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643017)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643017)Termination reason: Instruction limit
% 69.09/10.09 % (643017)Termination phase: Saturation
% 69.09/10.09 % (643017)Time elapsed: 1.215 s
% 69.09/10.09 % (643017)Peak memory usage: 25 MB
% 69.09/10.09 % (643017)Instructions burned: 5135 (million)
% 69.09/10.09 % (643165)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=3025691164:fmbsr=1.6:i=67534_2981 on theBenchmark for (2981ds/67534Mi)
% 69.09/10.09 % Exception at run slice level
% 69.09/10.09 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 69.09/10.09 % (643167)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=3723067338:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2981 on theBenchmark for (2981ds/4591Mi)
% 69.09/10.09 % (643163)Instruction limit reached!
% 69.09/10.09 % (643163)------------------------------
% 69.09/10.09 % (643163)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643163)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643163)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643163)Termination reason: Instruction limit
% 69.09/10.09 % (643163)Termination phase: Saturation
% 69.09/10.09 % (643163)Time elapsed: 0.924 s
% 69.09/10.09 % (643163)Peak memory usage: 15 MB
% 69.09/10.09 % (643163)Instructions burned: 2251 (million)
% 69.09/10.09 % (643169)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=1644124831:i=29340_2977 on theBenchmark for (2977ds/29340Mi)
% 69.09/10.09 % (643112)Instruction limit reached!
% 69.09/10.09 % (643112)------------------------------
% 69.09/10.09 % (643112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643112)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643112)Termination reason: Instruction limit
% 69.09/10.09 % (643112)Termination phase: Saturation
% 69.09/10.09 % (643112)Time elapsed: 1.599 s
% 69.09/10.09 % (643112)Peak memory usage: 23 MB
% 69.09/10.09 % (643112)Instructions burned: 3514 (million)
% 69.09/10.09 % (643171)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=1973124495:i=5211_2974 on theBenchmark for (2974ds/5211Mi)
% 69.09/10.09 % (643161)Instruction limit reached!
% 69.09/10.09 % (643161)------------------------------
% 69.09/10.09 % (643161)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643161)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643161)Termination reason: Instruction limit
% 69.09/10.09 % (643161)Termination phase: Saturation
% 69.09/10.09 % (643161)Time elapsed: 1.753 s
% 69.09/10.09 % (643161)Peak memory usage: 24 MB
% 69.09/10.09 % (643161)Instructions burned: 3775 (million)
% 69.09/10.09 % (643173)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=1625211363:i=5497:nm=2_2971 on theBenchmark for (2971ds/5497Mi)
% 69.09/10.09 % Exception at run slice level
% 69.09/10.09 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 69.09/10.09 % (643175)fmb+10_1_fmbas=predicate:sil=64000:tgt=full:sas=cadical:fmbss=15:random_seed=1543939564:fmbsr=2:i=46332_2970 on theBenchmark for (2970ds/46332Mi)
% 69.09/10.09 % Exception at run slice level
% 69.09/10.09 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 69.09/10.09 % (643167)Instruction limit reached!
% 69.09/10.09 % (643167)------------------------------
% 69.09/10.09 % (643167)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643167)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643167)Termination reason: Instruction limit
% 69.09/10.09 % (643167)Termination phase: Saturation
% 69.09/10.09 % (643167)Time elapsed: 1.079 s
% 69.09/10.09 % (643167)Peak memory usage: 23 MB
% 69.09/10.09 % (643167)Instructions burned: 4594 (million)
% 69.09/10.09 % (643178)dis+10_161_sil=128000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=909652419:i=22565:add=on:rawr=on_2970 on theBenchmark for (2970ds/22565Mi)
% 69.09/10.09 % (643177)fmb+10_1_sil=128000:tgt=full:sas=cadical:fmbss=12:random_seed=299196152:i=14071_2970 on theBenchmark for (2970ds/14071Mi)
% 69.09/10.09 % Exception at run slice level
% 69.09/10.09 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 69.09/10.09 % (643070)Instruction limit reached!
% 69.09/10.09 % (643070)------------------------------
% 69.09/10.09 % (643070)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643070)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643070)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643070)Termination reason: Instruction limit
% 69.09/10.09 % (643070)Termination phase: Saturation
% 69.09/10.09 % (643070)Time elapsed: 2.264 s
% 69.09/10.09 % (643070)Peak memory usage: 27 MB
% 69.09/10.09 % (643070)Instructions burned: 5114 (million)
% 69.09/10.09 % (643181)ott+4_1_sil=16000:sp=arity:gs=on:random_seed=1179071570:i=8173:av=off_2970 on theBenchmark for (2970ds/8173Mi)
% 69.09/10.09 % (643182)dis+10_16:1_sil=16000:random_seed=670224001:i=9155:fsr=off_2969 on theBenchmark for (2969ds/9155Mi)
% 69.09/10.09 % (643171)Instruction limit reached!
% 69.09/10.09 % (643171)------------------------------
% 69.09/10.09 % (643171)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643171)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643171)Termination reason: Instruction limit
% 69.09/10.09 % (643171)Termination phase: Saturation
% 69.09/10.09 % (643171)Time elapsed: 2.540 s
% 69.09/10.09 % (643171)Peak memory usage: 34 MB
% 69.09/10.09 % (643171)Instructions burned: 5211 (million)
% 69.09/10.09 % (643315)ott-3_8_sil=64000:random_seed=2799601451:i=20139:bs=on_2949 on theBenchmark for (2949ds/20139Mi)
% 69.09/10.09 % (643181)Instruction limit reached!
% 69.09/10.09 % (643181)------------------------------
% 69.09/10.09 % (643181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643181)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643181)Termination reason: Instruction limit
% 69.09/10.09 % (643181)Termination phase: Saturation
% 69.09/10.09 % (643181)Time elapsed: 3.426 s
% 69.09/10.09 % (643181)Peak memory usage: 29 MB
% 69.09/10.09 % (643181)Instructions burned: 8174 (million)
% 69.09/10.09 % (643595)fmb+10_1_sil=64000:tgt=ground:sas=cadical:bce=on:fmbss=9:random_seed=4205730011:fmbsr=2:i=32576_2935 on theBenchmark for (2935ds/32576Mi)
% 69.09/10.09 % Exception at run slice level
% 69.09/10.09 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 69.09/10.09 % (643597)ott+10_8:1_sil=16000:sp=arity:gs=on:random_seed=3738024162:i=11404_2935 on theBenchmark for (2935ds/11404Mi)
% 69.09/10.09 % (643178)Instruction limit reached!
% 69.09/10.09 % (643178)------------------------------
% 69.09/10.09 % (643178)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643178)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643178)Termination reason: Instruction limit
% 69.09/10.09 % (643178)Termination phase: Saturation
% 69.09/10.09 % (643178)Time elapsed: 3.853 s
% 69.09/10.09 % (643178)Peak memory usage: 21 MB
% 69.09/10.09 % (643178)Instructions burned: 22569 (million)
% 69.09/10.09 % (643599)ott-11_1_sil=16000:alpa=false:sac=on:random_seed=1921587852:i=14134_2931 on theBenchmark for (2931ds/14134Mi)
% 69.09/10.09 % (643599)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 69.09/10.09 % (643182)Instruction limit reached!
% 69.09/10.09 % (643182)------------------------------
% 69.09/10.09 % (643182)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643182)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643182)Termination reason: Instruction limit
% 69.09/10.09 % (643182)Termination phase: Saturation
% 69.09/10.09 % (643182)Time elapsed: 4.132 s
% 69.09/10.09 % (643182)Peak memory usage: 36 MB
% 69.09/10.09 % (643182)Instructions burned: 9156 (million)
% 69.09/10.09 % (643601)dis+33_16_sil=32000:sac=on:random_seed=80113538:i=15851:nm=0_2928 on theBenchmark for (2928ds/15851Mi)
% 69.09/10.09 % (643601) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-642901-643601"...
% 69.09/10.09 % (643601)...printing done.
% 69.09/10.09 % (643601)Refutation found. Thanks to Tanya!
% 69.09/10.09 % SZS status Theorem for theBenchmark
% 69.09/10.09 % SZS output start Proof for theBenchmark
% See solution above
% 69.09/10.09 % (643601)------------------------------
% 69.09/10.09 % (643601)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 69.09/10.09 % (643601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 69.09/10.09 % (643601)CaDiCaL version: 2.1.3
% 69.09/10.09 % (643601)Termination reason: Refutation
% 69.09/10.09 % (643601)Time elapsed: 2.636 s
% 69.09/10.09 % (643601)Peak memory usage: 16 MB
% 69.09/10.09 % (643601)Instructions burned: 7339 (million)
% 69.09/10.09 % (642901)Success in time 9.829 s
% 69.09/10.09 % Vampire exiting
%------------------------------------------------------------------------------