%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU511^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:29:52 AM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 569 ( 156 equ; 0 cnn)
% Maximal formula atoms : 29 ( 19 avg)
% Number of connectives : 291 ( 29 ~; 8 |; 87 &; 53 @)
% ( 2 <=>; 112 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 115 ( 112 usr; 36 con; 0-4 aty)
% Number of variables : 28 ( 4 ^; 14 !; 10 ?; 28 :)
% 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_41,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_42,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_43,type,
vNOT: $o > $o ).
thf(func_def_44,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_45,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_47,type,
vAND: $o > $o > $o ).
thf(func_def_48,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_49,type,
vIMP: $o > $o > $o ).
thf(func_def_50,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
sP0: $o ).
thf(func_def_52,type,
sP1: $i > $i > $o ).
thf(func_def_53,type,
sP2: $i > $o ).
thf(func_def_54,type,
sP3: $i > $i > $o ).
thf(func_def_55,type,
sP4: $i > $i > $o ).
thf(func_def_56,type,
sK5: $i > $i ).
thf(func_def_60,type,
sK9: $o ).
thf(func_def_61,type,
sK10: $i > $i > $i ).
thf(func_def_65,type,
sK14: ( $i > $o ) > $i ).
thf(func_def_66,type,
sK15: $i > $o ).
thf(func_def_69,type,
sK18: $i > $i > $i ).
thf(func_def_70,type,
sK19: $i > $i > $i ).
thf(func_def_72,type,
sK21: $i > $i ).
thf(func_def_74,type,
sK23: $i > $i ).
thf(func_def_80,type,
sK29: $i > $o ).
thf(func_def_82,type,
sK31: $i > $i ).
thf(func_def_87,type,
sK36: $i > $i > $i ).
thf(func_def_89,type,
sK38: $i > $i ).
thf(func_def_93,type,
sK42: $i > $o ).
thf(func_def_95,type,
sK44: $o ).
thf(func_def_97,type,
sK46: $i > $i > $o ).
thf(func_def_98,type,
sK47: $i > $i ).
thf(func_def_99,type,
sK48: $i > $i ).
thf(func_def_100,type,
sK49: ( $i > $i > $o ) > $i > $i ).
thf(func_def_101,type,
sK50: ( $i > $i > $o ) > $i > $i ).
thf(func_def_102,type,
sK51: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_103,type,
sK52: $i > $o ).
thf(func_def_108,type,
sK57: $i > $o ).
thf(func_def_109,type,
sK58: $i > $o ).
thf(func_def_110,type,
sK59: $i > $i ).
thf(func_def_111,type,
sK60: ( $i > $o ) > $i ).
thf(func_def_114,type,
sK63: $i > $o ).
thf(func_def_117,type,
sK66: $i > $o ).
thf(func_def_118,type,
sK67: $i > $i ).
thf(func_def_124,type,
sK73: $i > $i > $i ).
thf(func_def_125,type,
sK74: $i > $i > $i ).
thf(func_def_126,type,
sK75: $i > $i > $i ).
thf(func_def_127,type,
sK76: $i > $i > $i ).
thf(func_def_128,type,
sK77: $i > $i > $i ).
thf(func_def_129,type,
sK78: $i > $i > $i ).
thf(func_def_130,type,
sK79: $i > $i > $i > $i ).
thf(func_def_131,type,
sK80: $i > $i ).
thf(func_def_132,type,
sK81: $i > $i ).
thf(func_def_133,type,
sK82: $i > $i ).
thf(func_def_134,type,
sK83: $i > $i ).
thf(func_def_135,type,
sK84: $i > $i > $i > $i ).
thf(func_def_136,type,
sK85: $i > $i > $i > $i ).
thf(func_def_137,type,
sK86: $i > $i > $i ).
thf(func_def_138,type,
sK87: $i > $i > $i ).
thf(func_def_139,type,
sK88: $i > $i > $i ).
thf(func_def_141,type,
sK90: $i > $i ).
thf(func_def_142,type,
sK91: $i > $i ).
thf(func_def_143,type,
sK92: $i > $i ).
thf(func_def_144,type,
sK93: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_145,type,
sK94: $i > $i ).
thf(func_def_146,type,
sK95: ( $i > $o ) > $i > $i ).
thf(func_def_147,type,
sK96: ( $i > $o ) > $i > $i ).
thf(func_def_148,type,
sK97: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_149,type,
sK98: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_150,type,
sK99: ( $i > $o ) > $i > $i ).
thf(func_def_151,type,
sK100: $i > ( $i > $o ) > $i ).
thf(f3,axiom,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetAx) ).
thf(f28,axiom,
( ( ^ [X0: $i] : ( X0 != emptyset ) )
= nonempty ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonempty) ).
thf(f31,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
=> ! [X0: $i] :
( ? [X1: $i] : ( in @ X1 @ X0 )
=> ( nonempty @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyI1) ).
thf(f32,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
=> ! [X0: $i] :
( ? [X1: $i] : ( in @ X1 @ X0 )
=> ( nonempty @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f31]) ).
thf(f33,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
=> ! [X0: $i] :
( ? [X1: $i] : ( in @ X1 @ X0 )
=> ( nonempty @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f32]) ).
thf(f34,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 )
=> ! [X0: $i] :
( ? [X1: $i] :
( ( in @ X1 @ X0 )
= $true )
=> ( ( nonempty @ X0 )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f33]) ).
thf(f35,plain,
( nonempty
= ( ^ [Y0: $i] : ( emptyset != Y0 ) ) ),
inference(fool_elimination,[],[f28]) ).
thf(f78,plain,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
inference(rectify,[],[f3]) ).
thf(f79,plain,
( ( emptysetAx = $true )
<=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ),
inference(fool_elimination,[],[f78]) ).
thf(f99,plain,
( ( emptysetAx = $true )
<=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ),
inference(flattening,[],[f79]) ).
thf(f101,plain,
( ? [X0: $i] :
( ( ( nonempty @ X0 )
!= $true )
& ? [X1: $i] :
( ( in @ X1 @ X0 )
= $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,[],[f34]) ).
thf(f102,plain,
( ( dsetconstrEL = $true )
& ( notinemptyset = $true )
& ( nonemptyI = $true )
& ? [X0: $i] :
( ( ( nonempty @ X0 )
!= $true )
& ? [X1: $i] :
( ( in @ X1 @ X0 )
= $true ) )
& ( foundationAx = $true )
& ( prop2setE = $true )
& ( omega0Ax = $true )
& ( wellorderingAx = $true )
& ( omegaIndAx = $true )
& ( exuE3e = $true )
& ( descrp = $true )
& ( emptysetAx = $true )
& ( setunionAx = $true )
& ( dsetconstrI = $true )
& ( setadjoinAx = $true )
& ( dsetconstrER = $true )
& ( powersetAx = $true )
& ( emptysetimpfalse = $true )
& ( omegaSAx = $true )
& ( emptysetE = $true )
& ( nonemptyE1 = $true )
& ( setextAx = $true )
& ( noeltsimpempty = $true )
& ( replAx = $true )
& ( setbeta = $true )
& ( setext = $true )
& ( emptyI = $true )
& ( exuE1 = $true ) ),
inference(flattening,[],[f101]) ).
thf(f158,plain,
( ( ( emptysetAx = $true )
| ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $true ) )
& ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true )
| ( emptysetAx != $true ) ) ),
inference(nnf_transformation,[],[f99]) ).
thf(f159,plain,
( ( ( emptysetAx = $true )
| ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $true ) )
& ( ! [X1: $i] :
( $true
!= ( in @ X1 @ emptyset ) )
| ( emptysetAx != $true ) ) ),
inference(rectify,[],[f158]) ).
thf(f160,plain,
( ( ( emptysetAx = $true )
| ( $true
= ( in @ sK27 @ emptyset ) ) )
& ( ! [X1: $i] :
( $true
!= ( in @ X1 @ emptyset ) )
| ( emptysetAx != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK27]),skolemize(X0,sK27)],[f159]) ).
thf(f198,plain,
( ( dsetconstrEL = $true )
& ( notinemptyset = $true )
& ( nonemptyI = $true )
& ( ( nonempty @ sK61 )
!= $true )
& ( ( in @ sK62 @ sK61 )
= $true )
& ( foundationAx = $true )
& ( prop2setE = $true )
& ( omega0Ax = $true )
& ( wellorderingAx = $true )
& ( omegaIndAx = $true )
& ( exuE3e = $true )
& ( descrp = $true )
& ( emptysetAx = $true )
& ( setunionAx = $true )
& ( dsetconstrI = $true )
& ( setadjoinAx = $true )
& ( dsetconstrER = $true )
& ( powersetAx = $true )
& ( emptysetimpfalse = $true )
& ( omegaSAx = $true )
& ( emptysetE = $true )
& ( nonemptyE1 = $true )
& ( setextAx = $true )
& ( noeltsimpempty = $true )
& ( replAx = $true )
& ( setbeta = $true )
& ( setext = $true )
& ( emptyI = $true )
& ( exuE1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK61,sK62]),skolemize(X0,sK61),skolemize(X1,sK62)],[f102]) ).
thf(f267,plain,
! [X1: $i] :
( ( $true
!= ( in @ X1 @ emptyset ) )
| ( emptysetAx != $true ) ),
inference(cnf_transformation,[],[f160]) ).
thf(f318,plain,
( nonempty
= ( ^ [Y0: $i] : ( emptyset != Y0 ) ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f335,plain,
emptysetAx = $true,
inference(cnf_transformation,[],[f198]) ).
thf(f343,plain,
( ( in @ sK62 @ sK61 )
= $true ),
inference(cnf_transformation,[],[f198]) ).
thf(f344,plain,
( ( nonempty @ sK61 )
!= $true ),
inference(cnf_transformation,[],[f198]) ).
thf(f443,plain,
! [X1: $i] :
( ( $true
!= ( in @ X1 @ emptyset ) )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f267,f335]) ).
thf(f486,plain,
( ( ^ [Y0: $i] : ( emptyset != Y0 )
@ sK61 )
!= $true ),
inference(definition_unfolding,[],[f344,f318]) ).
thf(f599,plain,
! [X1: $i] :
( $true
!= ( in @ X1 @ emptyset ) ),
inference(trivial_inequality_removal,[],[f443]) ).
thf(f625,plain,
( ( emptyset != sK61 )
!= $true ),
inference(beta-eta_normalization,[],[f486]) ).
thf(f626,plain,
( ( emptyset = sK61 )
= $true ),
inference(not_proxy_clausification,[],[f625]) ).
thf(f627,plain,
emptyset = sK61,
inference(equality_proxy_clausification,[],[f626]) ).
thf(f705,plain,
( ( in @ sK62 @ emptyset )
= $true ),
inference(backward_demodulation,[],[f343,f627]) ).
thf(f718,plain,
$false,
inference(forward_subsumption_resolution,[],[f705,f599]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU511^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n016.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:52:19 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.29 % (378926)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.29 % (378936)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4006348108:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.29 % (378937)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.29 % (378937)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.21/0.29 % (378932)lrs+10_16_si=on:nwc=1.5:random_seed=711108382:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.29 % (378931)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2247240796:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.29 % (378933)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2310994309:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.29 % (378935)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2340945691:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.29 % (378934)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1422040628:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.21/0.29 % (378937)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=247135492:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.29 % (378933)Instruction limit reached!
% 0.21/0.29 % (378933)------------------------------
% 0.21/0.29 % (378933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (378933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (378933)CaDiCaL version: 2.1.3
% 0.21/0.29 % (378933)Termination reason: Instruction limit
% 0.21/0.29 % (378933)Termination phase: Property scanning
% 0.21/0.29 % (378933)Time elapsed: 0.002 s
% 0.21/0.29 % (378933)Peak memory usage: 9 MB
% 0.21/0.29 % (378933)Instructions burned: 5 (million)
% 0.21/0.29 % (378936) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-378926-378936"...
% 0.21/0.29 % (378936)...printing done.
% 0.21/0.29 % (378936)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (378936)------------------------------
% 0.21/0.29 % (378936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (378936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (378936)CaDiCaL version: 2.1.3
% 0.21/0.29 % (378936)Termination reason: Refutation
% 0.21/0.29 % (378936)Time elapsed: 0.012 s
% 0.21/0.29 % (378936)Peak memory usage: 12 MB
% 0.21/0.29 % (378936)Instructions burned: 44 (million)
% 0.21/0.29 % (378926)Success in time 0.04 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------