%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO483^6 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:48:05 AM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 40 unt; 0 typ; 0 def)
% Number of atoms : 172 ( 53 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 241 ( 39 ~; 14 |; 0 &; 166 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 42 ( 42 >; 0 *; 0 +; 0 <<)
% Number of symbols : 55 ( 51 usr; 5 con; 0-4 aty)
% ( 22 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 112 ( 99 ^; 13 !; 0 ?; 112 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mu: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
meq_ind: mu > mu > $i > $o ).
thf(func_def_1,type,
meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_3,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_5,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_6,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_11,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_12,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_13,type,
mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_14,type,
mtrue: $i > $o ).
thf(func_def_15,type,
mfalse: $i > $o ).
thf(func_def_16,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_17,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_18,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
mserial: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(func_def_23,type,
mpartially_functional: ( $i > $i > $o ) > $o ).
thf(func_def_24,type,
mfunctional: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
mweakly_dense: ( $i > $i > $o ) > $o ).
thf(func_def_26,type,
mweakly_connected: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
mweakly_directed: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_29,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_30,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_31,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_32,type,
rel_s5: $i > $i > $o ).
thf(func_def_33,type,
mbox_s5: ( $i > $o ) > $i > $o ).
thf(func_def_34,type,
mdia_s5: ( $i > $o ) > $i > $o ).
thf(func_def_35,type,
a: mu ).
thf(func_def_36,type,
vNOT: $o > $o ).
thf(func_def_37,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_40,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_41,type,
vIMP: $o > $o > $o ).
thf(func_def_42,type,
vAND: $o > $o > $o ).
thf(func_def_43,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_44,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_46,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_49,type,
vOR: $o > $o > $o ).
thf(func_def_50,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_52,type,
sK1: mu > $i ).
thf(f1,axiom,
( meq_ind
= ( ^ [X0: mu,X1: mu,X2: $i] : ( X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',meq_ind) ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f10,axiom,
( mforall_ind
= ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] : ( X0 @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(f12,axiom,
( mexists_ind
= ( ^ [X0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mexists_ind) ).
thf(f28,axiom,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ~ ( rel_s5 @ X1 @ X2 )
| ( X0 @ X2 ) ) )
= mbox_s5 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^6.ax',mbox_s5) ).
thf(f37,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X0: mu] : ( mbox_s5 @ ( meq_ind @ X0 @ a ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(f38,negated_conjecture,
~ ( mvalid
@ ( mexists_ind
@ ^ [X0: mu] : ( mbox_s5 @ ( meq_ind @ X0 @ a ) ) ) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
thf(f39,plain,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
inference(rectify,[],[f3]) ).
thf(f40,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f39]) ).
thf(f47,plain,
( mforall_ind
= ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] : ( X0 @ X2 @ X1 ) ) ),
inference(rectify,[],[f10]) ).
thf(f48,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f47]) ).
thf(f61,plain,
( mexists_ind
= ( ^ [X0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f12]) ).
thf(f62,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [Y1: mu] : ( mnot @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f61]) ).
thf(f70,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f28]) ).
thf(f71,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f70]) ).
thf(f86,plain,
~ ( mvalid
@ ( mexists_ind
@ ^ [X0: mu] : ( mbox_s5 @ ( meq_ind @ X0 @ a ) ) ) ),
inference(rectify,[],[f38]) ).
thf(f87,plain,
( $true
!= ( mvalid
@ ( mexists_ind
@ ^ [Y0: mu] : ( mbox_s5 @ ( meq_ind @ Y0 @ a ) ) ) ) ),
inference(fool_elimination,[],[f86]) ).
thf(f88,plain,
( ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ~ ( rel_s5 @ X1 @ X2 )
| ( X0 @ X2 ) ) )
= mbox_s5 ),
inference(rectify,[],[f32]) ).
thf(f89,plain,
( mbox_s5
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
| ~ ( rel_s5 @ Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f88]) ).
thf(f98,plain,
( meq_ind
= ( ^ [Y0: mu,Y1: mu,Y2: $i] : ( Y0 = Y1 ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f101,plain,
( $true
!= ( mvalid
@ ( mexists_ind
@ ^ [Y0: mu] : ( mbox_s5 @ ( meq_ind @ Y0 @ a ) ) ) ) ),
inference(flattening,[],[f87]) ).
thf(f109,plain,
( mbox_s5
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
| ~ ( rel_s5 @ Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f89]) ).
thf(f123,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f71]) ).
thf(f126,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f128,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [Y1: mu] : ( mnot @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f62]) ).
thf(f129,plain,
( $true
!= ( mvalid
@ ( mexists_ind
@ ^ [Y0: mu] : ( mbox_s5 @ ( meq_ind @ Y0 @ a ) ) ) ) ),
inference(cnf_transformation,[],[f101]) ).
thf(f133,plain,
( meq_ind
= ( ^ [Y0: mu,Y1: mu,Y2: $i] : ( Y0 = Y1 ) ) ),
inference(cnf_transformation,[],[f98]) ).
thf(f138,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f48]) ).
thf(f146,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( Y0 @ Y1 ) ) ) ) ) ),
inference(definition_unfolding,[],[f128,f126,f138,f126]) ).
thf(f153,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( Y0 @ Y1 ) ) ) )
@ ^ [Y0: mu] :
( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
| ~ ( rel_s5 @ Y2 @ Y3 ) ) )
@ ( ^ [Y1: mu,Y2: mu,Y3: $i] : ( Y1 = Y2 )
@ Y0
@ a ) ) ) ) ),
inference(definition_unfolding,[],[f129,f123,f146,f109,f133]) ).
thf(f167,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
~ ( !! @ mu
@ ^ [Y1: mu] :
~ ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 = a )
| ~ ( rel_s5 @ Y0 @ Y2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f153]) ).
thf(f168,plain,
( $false
= ( ^ [Y0: $i] :
~ ( !! @ mu
@ ^ [Y1: mu] :
~ ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 = a )
| ~ ( rel_s5 @ Y0 @ Y2 ) ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f167]) ).
thf(f169,plain,
( $false
= ( ~ ( !! @ mu
@ ^ [Y0: mu] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 = a )
| ~ ( rel_s5 @ sK0 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f168]) ).
thf(f170,plain,
( $true
= ( !! @ mu
@ ^ [Y0: mu] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 = a )
| ~ ( rel_s5 @ sK0 @ Y1 ) ) ) ) ),
inference(not_proxy_clausification,[],[f169]) ).
thf(f171,plain,
! [X1: mu] :
( $true
= ( ^ [Y0: mu] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 = a )
| ~ ( rel_s5 @ sK0 @ Y1 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f170]) ).
thf(f172,plain,
! [X1: mu] :
( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 = a )
| ~ ( rel_s5 @ sK0 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f171]) ).
thf(f173,plain,
! [X1: mu] :
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 = a )
| ~ ( rel_s5 @ sK0 @ Y0 ) ) ) ),
inference(not_proxy_clausification,[],[f172]) ).
thf(f174,plain,
! [X1: mu] :
( $false
= ( ^ [Y0: $i] :
( ( X1 = a )
| ~ ( rel_s5 @ sK0 @ Y0 ) )
@ ( sK1 @ X1 ) ) ),
inference(sigma_proxy_clausification,[],[f173]) ).
thf(f175,plain,
! [X1: mu] :
( $false
= ( ( X1 = a )
| ~ ( rel_s5 @ sK0 @ ( sK1 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f174]) ).
thf(f177,plain,
! [X1: mu] :
( $false
= ( X1 = a ) ),
inference(or_proxy_clausification,[],[f175]) ).
thf(f178,plain,
! [X1: mu] : ( a != X1 ),
inference(equality_proxy_clausification,[],[f177]) ).
thf(f186,plain,
$false,
inference(equality_resolution,[],[f178]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO483^6 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n005.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 17:08:31 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 Running higher-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.28 % (1943144)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.19/0.28 % (1943152)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=947549928: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.19/0.28 % (1943155)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.19/0.28 % (1943155)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.19/0.28 % (1943149)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3897967039:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.19/0.28 % (1943150)lrs+10_16_si=on:nwc=1.5:random_seed=780592934:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.19/0.28 % (1943151)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3486068693:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.19/0.28 % (1943153)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4249954086:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.19/0.28 % (1943154)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2634432511:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.19/0.28 % (1943155)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=2922300945:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.19/0.28 % (1943151)Instruction limit reached!
% 0.19/0.28 % (1943151)------------------------------
% 0.19/0.28 % (1943151)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (1943151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (1943151)CaDiCaL version: 2.1.3
% 0.19/0.28 % (1943151)Termination reason: Instruction limit
% 0.19/0.28 % (1943151)Termination phase: shuffling
% 0.19/0.28 % (1943151)Time elapsed: 0.002 s
% 0.19/0.28 % (1943151)Peak memory usage: 10 MB
% 0.19/0.28 % (1943151)Instructions burned: 4 (million)
% 0.19/0.28 % (1943149) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1943144-1943149"...
% 0.19/0.28 % (1943150) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1943144-1943150"...
% 0.19/0.28 % (1943154) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1943144-1943154"...
% 0.19/0.28 % (1943155) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1943144-1943155"...
% 0.19/0.28 % (1943150)...printing done.
% 0.19/0.28 % (1943149)...printing done.
% 0.19/0.28 % (1943150)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (1943150)------------------------------
% 0.19/0.28 % (1943150)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (1943150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (1943150)CaDiCaL version: 2.1.3
% 0.19/0.28 % (1943150)Termination reason: Refutation
% 0.19/0.28 % (1943150)Time elapsed: 0.006 s
% 0.19/0.28 % (1943150)Peak memory usage: 12 MB
% 0.19/0.28 % (1943150)Instructions burned: 11 (million)
% 0.19/0.28 % (1943144)Success in time 0.049 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------