%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU502^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 : n012.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:49 AM UTC 2026
% Result : Theorem 0.08s 0.19s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 508 ( 140 equ; 0 cnn)
% Maximal formula atoms : 21 ( 22 avg)
% Number of connectives : 248 ( 23 ~; 8 |; 57 &; 46 @)
% ( 2 <=>; 112 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 94 ( 91 usr; 26 con; 0-4 aty)
% Number of variables : 20 ( 0 ^; 16 !; 4 ?; 20 :)
% 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_31,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_32,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_33,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_34,type,
vAND: $o > $o > $o ).
thf(func_def_35,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_36,type,
vIMP: $o > $o > $o ).
thf(func_def_37,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_40,type,
sP0: $o ).
thf(func_def_41,type,
sP1: $i > $i > $o ).
thf(func_def_42,type,
sP2: $i > $o ).
thf(func_def_43,type,
sP3: $i > $i > $o ).
thf(func_def_44,type,
sP4: $i > $i > $o ).
thf(func_def_45,type,
sK5: $i > $i > $o ).
thf(func_def_47,type,
sK7: $i > $i ).
thf(func_def_48,type,
sK8: $i > $i ).
thf(func_def_49,type,
sK9: $i > ( $i > $i > $o ) > $i ).
thf(func_def_50,type,
sK10: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_51,type,
sK11: $i > ( $i > $i > $o ) > $i ).
thf(func_def_52,type,
sK12: $o ).
thf(func_def_55,type,
sK15: $o ).
thf(func_def_56,type,
sK16: $i > $i > $i ).
thf(func_def_57,type,
sK17: $i > $i > $i ).
thf(func_def_58,type,
sK18: $i > $i > $i ).
thf(func_def_59,type,
sK19: $i > $i > $i ).
thf(func_def_60,type,
sK20: $i > $i > $i > $i ).
thf(func_def_61,type,
sK21: $i > $i ).
thf(func_def_62,type,
sK22: $i > $i ).
thf(func_def_63,type,
sK23: $i > $i ).
thf(func_def_64,type,
sK24: $i > $i ).
thf(func_def_65,type,
sK25: $i > $i > $i ).
thf(func_def_66,type,
sK26: $i > $i > $i > $i ).
thf(func_def_67,type,
sK27: $i > $i > $i > $i ).
thf(func_def_68,type,
sK28: $i > $i > $i ).
thf(func_def_69,type,
sK29: $i > $i > $i ).
thf(func_def_71,type,
sK31: $i > $i ).
thf(func_def_72,type,
sK32: $i > $i ).
thf(func_def_73,type,
sK33: $i > $i ).
thf(func_def_74,type,
sK34: $i > $i > $i ).
thf(func_def_75,type,
sK35: $i > $i ).
thf(func_def_78,type,
sK38: $i > $i ).
thf(func_def_79,type,
sK39: $i > $o ).
thf(func_def_85,type,
sK45: $i > $i > $i ).
thf(func_def_87,type,
sK47: $i > $o ).
thf(func_def_89,type,
sK49: $i > $o ).
thf(func_def_94,type,
sK54: $i > $o ).
thf(func_def_99,type,
sK59: ( $i > $o ) > $i ).
thf(func_def_100,type,
sK60: $i > $o ).
thf(func_def_101,type,
sK61: $i > $i ).
thf(func_def_102,type,
sK62: $i > $i > $i ).
thf(func_def_108,type,
sK68: $i > $i > $i ).
thf(func_def_109,type,
sK69: $i > $i ).
thf(func_def_112,type,
vNOT: $o > $o ).
thf(func_def_113,type,
sK72: ( $i > $o ) > $i > $i ).
thf(func_def_114,type,
sK73: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_115,type,
sK74: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_116,type,
sK75: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_117,type,
sK76: $i > ( $i > $o ) > $i ).
thf(func_def_118,type,
sK77: $i > ( $i > $o ) > $i ).
thf(func_def_119,type,
sK78: $i > $i ).
thf(f3,axiom,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetAx) ).
thf(f21,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetimpfalse) ).
thf(f22,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f21]) ).
thf(f27,plain,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
=> $false ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f22]) ).
thf(f28,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 )
=> ! [X0: $i] :
( ( ( in @ X0 @ emptyset )
= $true )
=> $false ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f27]) ).
thf(f61,plain,
( emptysetAx
= ( ! [X0: $i] :
~ ( in @ X0 @ emptyset ) ) ),
inference(rectify,[],[f3]) ).
thf(f62,plain,
( ( emptysetAx = $true )
<=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ),
inference(fool_elimination,[],[f61]) ).
thf(f64,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 )
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(true_and_false_elimination,[],[f28]) ).
thf(f65,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 )
=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(flattening,[],[f64]) ).
thf(f67,plain,
( ( emptysetAx = $true )
<=> ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true ) ),
inference(flattening,[],[f62]) ).
thf(f75,plain,
( ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $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,[],[f65]) ).
thf(f76,plain,
( ( prop2setE = $true )
& ( dsetconstrEL = $true )
& ( omegaSAx = $true )
& ( dsetconstrI = $true )
& ( omega0Ax = $true )
& ( omegaIndAx = $true )
& ( setunionAx = $true )
& ( descrp = $true )
& ( replAx = $true )
& ( dsetconstrER = $true )
& ( emptysetE = $true )
& ( emptysetAx = $true )
& ( setextAx = $true )
& ( exuE1 = $true )
& ( setadjoinAx = $true )
& ( wellorderingAx = $true )
& ( powersetAx = $true )
& ( foundationAx = $true )
& ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $true ) ),
inference(flattening,[],[f75]) ).
thf(f144,plain,
( ( prop2setE = $true )
& ( dsetconstrEL = $true )
& ( omegaSAx = $true )
& ( dsetconstrI = $true )
& ( omega0Ax = $true )
& ( omegaIndAx = $true )
& ( setunionAx = $true )
& ( descrp = $true )
& ( replAx = $true )
& ( dsetconstrER = $true )
& ( emptysetE = $true )
& ( emptysetAx = $true )
& ( setextAx = $true )
& ( exuE1 = $true )
& ( setadjoinAx = $true )
& ( wellorderingAx = $true )
& ( powersetAx = $true )
& ( foundationAx = $true )
& ( $true
= ( in @ sK57 @ emptyset ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK57]),skolemize(X0,sK57)],[f76]) ).
thf(f145,plain,
( ( ( emptysetAx = $true )
| ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $true ) )
& ( ! [X0: $i] :
( ( in @ X0 @ emptyset )
!= $true )
| ( emptysetAx != $true ) ) ),
inference(nnf_transformation,[],[f67]) ).
thf(f146,plain,
( ( ( emptysetAx = $true )
| ? [X0: $i] :
( ( in @ X0 @ emptyset )
= $true ) )
& ( ! [X1: $i] :
( $true
!= ( in @ X1 @ emptyset ) )
| ( emptysetAx != $true ) ) ),
inference(rectify,[],[f145]) ).
thf(f147,plain,
( ( ( emptysetAx = $true )
| ( ( in @ sK58 @ emptyset )
= $true ) )
& ( ! [X1: $i] :
( $true
!= ( in @ X1 @ emptyset ) )
| ( emptysetAx != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK58]),skolemize(X0,sK58)],[f146]) ).
thf(f248,plain,
( $true
= ( in @ sK57 @ emptyset ) ),
inference(cnf_transformation,[],[f144]) ).
thf(f255,plain,
emptysetAx = $true,
inference(cnf_transformation,[],[f144]) ).
thf(f267,plain,
! [X1: $i] :
( ( $true
!= ( in @ X1 @ emptyset ) )
| ( emptysetAx != $true ) ),
inference(cnf_transformation,[],[f147]) ).
thf(f349,plain,
! [X1: $i] :
( ( $true
!= ( in @ X1 @ emptyset ) )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f267,f255]) ).
thf(f416,plain,
! [X1: $i] :
( $true
!= ( in @ X1 @ emptyset ) ),
inference(trivial_inequality_removal,[],[f349]) ).
thf(f541,plain,
$true != $true,
inference(constrained_superposition,[],[f416,f248]) ).
thf(f542,plain,
$false,
inference(trivial_inequality_removal,[],[f541]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU502^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 13:46:18 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.13 Running higher-order theorem proving
% 0.08/0.14 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.08/0.19 % (124267)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.08/0.19 % (124274)lrs+10_16_si=on:nwc=1.5:random_seed=3830475802:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.08/0.19 % (124275)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=865448341:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.08/0.19 % (124276)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=1894797357: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.08/0.19 % (124275)Instruction limit reached!
% 0.08/0.19 % (124275)------------------------------
% 0.08/0.19 % (124275)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.19 % (124275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.19 % (124275)CaDiCaL version: 2.1.3
% 0.08/0.19 % (124275)Termination reason: Instruction limit
% 0.08/0.19 % (124275)Termination phase: Property scanning
% 0.08/0.19 % (124275)Time elapsed: 0.001 s
% 0.08/0.19 % (124275)Peak memory usage: 9 MB
% 0.08/0.19 % (124275)Instructions burned: 5 (million)
% 0.08/0.19 % (124274)Instruction limit reached!
% 0.08/0.19 % (124274)------------------------------
% 0.08/0.19 % (124274)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.19 % (124274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.19 % (124274)CaDiCaL version: 2.1.3
% 0.08/0.19 % (124274)Termination reason: Instruction limit
% 0.08/0.19 % (124274)Termination phase: Saturation
% 0.08/0.19 % (124274)Time elapsed: 0.005 s
% 0.08/0.19 % (124274)Peak memory usage: 11 MB
% 0.08/0.19 % (124274)Instructions burned: 21 (million)
% 0.08/0.19 % (124278)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2886118342:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.08/0.19 % (124273)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=488868777:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.08/0.19 % (124279)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.08/0.19 % (124279)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.08/0.19 % (124279)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=4178367871:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.08/0.19 % (124277)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1896131352:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.08/0.19 % (124273) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-124267-124273"...
% 0.08/0.19 % (124285)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=4172213767:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.08/0.19 % (124278) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-124267-124278"...
% 0.08/0.19 % (124273)...printing done.
% 0.08/0.19 % (124278)...printing done.
% 0.08/0.19 % (124276) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-124267-124276"...
% 0.08/0.19 % (124273)Refutation found. Thanks to Tanya!
% 0.08/0.19 % SZS status Theorem for theBenchmark
% 0.08/0.19 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.19 % (124273)------------------------------
% 0.08/0.19 % (124273)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.19 % (124273)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.19 % (124273)CaDiCaL version: 2.1.3
% 0.08/0.19 % (124273)Termination reason: Refutation
% 0.08/0.19 % (124273)Time elapsed: 0.009 s
% 0.08/0.19 % (124273)Peak memory usage: 12 MB
% 0.08/0.19 % (124273)Instructions burned: 35 (million)
% 0.08/0.19 % (124267)Success in time 0.049 s
% 0.08/0.19 % Vampire exiting
%------------------------------------------------------------------------------