%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO536^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:22 AM UTC 2026
% Result : Theorem 0.22s 0.30s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of formulae : 56 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 173 ( 78 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 329 ( 38 ~; 24 |; 3 &; 244 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 175 ( 175 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 4 con; 0-4 aty)
% ( 0 !!; 10 ??; 0 @@+; 0 @@-)
% Number of variables : 127 ( 41 ^; 64 !; 22 ?; 127 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
eps: ( $i > $o ) > $i ).
thf(func_def_2,type,
epsii: ( ( $i > $i ) > $o ) > $i > $i ).
thf(func_def_3,type,
epsa: ( ( $i > $i ) > $i > $o ) > $i > $i ).
thf(func_def_4,type,
epsb: ( ( $i > $i ) > $i > $o ) > $i ).
thf(func_def_7,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_10,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_11,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK0: ( $i > $i ) > $i > $o ).
thf(func_def_13,type,
sK1: $i > $i ).
thf(func_def_15,type,
vNOT: $o > $o ).
thf(func_def_16,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_17,type,
sK3: ( ( $i > $i ) > $i > $o ) > $i ).
thf(f1,axiom,
! [X0: $i > $o] :
( ? [X1: $i] : ( X0 @ X1 )
=> ( X0 @ ( eps @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',choiceax) ).
thf(f2,axiom,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] : ( X0 @ X1 )
=> ( X0 @ ( epsii @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',choiceaxii) ).
thf(f3,axiom,
( epsa
= ( ^ [X0: ( $i > $i ) > $i > $o] :
( epsii
@ ^ [X1: $i > $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsad) ).
thf(f4,axiom,
( ( ^ [X0: ( $i > $i ) > $i > $o] :
( eps
@ ^ [X1: $i] : ( X0 @ ( epsa @ X0 ) @ X1 ) ) )
= epsb ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsbd) ).
thf(f5,conjecture,
! [X0: ( $i > $i ) > $i > $o] :
( ? [X2: $i,X1: $i > $i] : ( X0 @ X1 @ X2 )
=> ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f6,negated_conjecture,
~ ! [X0: ( $i > $i ) > $i > $o] :
( ? [X2: $i,X1: $i > $i] : ( X0 @ X1 @ X2 )
=> ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
! [X0: $i > $o] :
( ? [X1: $i] : ( X0 @ X1 )
=> ( X0 @ ( eps @ X0 ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
! [X0: $i > $o] :
( ? [X1: $i] :
( ( X0 @ X1 )
= $true )
=> ( ( X0 @ ( eps @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( ( ^ [X0: ( $i > $i ) > $i > $o] :
( eps
@ ^ [X1: $i] : ( X0 @ ( epsa @ X0 ) @ X1 ) ) )
= epsb ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
( epsb
= ( ^ [Y0: ( $i > $i ) > $i > $o] :
( eps
@ ^ [Y1: $i] : ( Y0 @ ( epsa @ Y0 ) @ Y1 ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] : ( X0 @ X1 )
=> ( X0 @ ( epsii @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f12,plain,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] :
( ( X0 @ X1 )
= $true )
=> ( ( X0 @ ( epsii @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
( epsa
= ( ^ [X0: ( $i > $i ) > $i > $o] :
( epsii
@ ^ [X1: $i > $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f14,plain,
( epsa
= ( ^ [Y0: ( $i > $i ) > $i > $o] :
( epsii
@ ^ [Y1: $i > $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
~ ! [X0: ( $i > $i ) > $i > $o] :
( ? [X1: $i,X2: $i > $i] : ( X0 @ X2 @ X1 )
=> ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) ),
inference(rectify,[],[f6]) ).
thf(f16,plain,
~ ! [X0: ( $i > $i ) > $i > $o] :
( ? [X2: $i > $i,X1: $i] :
( ( X0 @ X2 @ X1 )
= $true )
=> ( ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
? [X0: ( $i > $i ) > $i > $o] :
( ? [X2: $i > $i,X1: $i] :
( ( X0 @ X2 @ X1 )
= $true )
& ( ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) )
!= $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f18,plain,
! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( eps @ X0 ) )
= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f19,plain,
! [X0: ( $i > $i ) > $o] :
( ! [X1: $i > $i] :
( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( epsii @ X0 ) )
= $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f20,plain,
? [X0: ( $i > $i ) > $i > $o] :
( ? [X1: $i > $i,X2: $i] :
( ( X0 @ X1 @ X2 )
= $true )
& ( ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) )
!= $true ) ),
inference(rectify,[],[f17]) ).
thf(f21,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
& ( ( sK0 @ ( epsa @ sK0 ) @ ( epsb @ sK0 ) )
!= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f20]) ).
thf(f22,plain,
( epsa
= ( ^ [Y0: ( $i > $i ) > $i > $o] :
( epsii
@ ^ [Y1: $i > $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f23,plain,
! [X0: $i > $o,X1: $i] :
( ( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( eps @ X0 ) )
= $true ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f24,plain,
! [X0: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( epsii @ X0 ) )
= $true ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f25,plain,
( ( sK0 @ ( epsa @ sK0 ) @ ( epsb @ sK0 ) )
!= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f26,plain,
( $true
= ( sK0 @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f27,plain,
( epsb
= ( ^ [Y0: ( $i > $i ) > $i > $o] :
( eps
@ ^ [Y1: $i] : ( Y0 @ ( epsa @ Y0 ) @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f29,plain,
( epsa
= ( ^ [Y0: ( $i > $i ) > $i > $o] :
( epsii
@ ^ [Y1: $i > $i] : ( ?? @ $i @ ( Y0 @ Y1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f30,plain,
( epsb
= ( ^ [Y0: ( $i > $i ) > $i > $o] : ( eps @ ( Y0 @ ( epsa @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f36,plain,
( ( ( sK0 @ sK1 @ ( eps @ ( sK0 @ sK1 ) ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f23,f26]) ).
thf(f40,plain,
( ( sK0 @ sK1 @ ( eps @ ( sK0 @ sK1 ) ) )
= $true ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f47,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( ^ [Y0: $i > $i] :
~ ( X2 @ Y0 )
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) )
= $true )
| ( ( ^ [Y0: $i > $i] :
~ ( X2 @ Y0 )
@ X1 )
!= $true ) ),
inference(primitive_instantiation,[],[f24]) ).
thf(f51,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( $true
!= ( ~ ( X2 @ X1 ) ) )
| ( ( ~ ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) )
= $true ) ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f52,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( ~ ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) )
= $true )
| ( $true
= ( X2 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f51]) ).
thf(f53,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( $true
= ( X2 @ X1 ) )
| ( $false
= ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f52]) ).
thf(f112,plain,
! [X1: ( $i > $i ) > $i > $o] :
( ( ^ [Y0: ( $i > $i ) > $i > $o] : ( eps @ ( Y0 @ ( epsa @ Y0 ) ) )
@ X1 )
= ( epsb @ X1 ) ),
inference(argument_congruence,[],[f30]) ).
thf(f113,plain,
! [X1: ( $i > $i ) > $i > $o] :
( ( eps @ ( X1 @ ( epsa @ X1 ) ) )
= ( epsb @ X1 ) ),
inference(beta-eta_normalization,[],[f112]) ).
thf(f122,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $true
= ( ^ [Y0: $i > $i] :
~ ( X3 @ Y0 )
@ X1 ) )
| ( $false
= ( ^ [Y0: $i > $i] :
~ ( X3 @ Y0 )
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( ^ [Y1: $i > $i] :
~ ( X3 @ Y1 )
@ Y0 ) ) ) ) ),
inference(primitive_instantiation,[],[f53]) ).
thf(f137,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( ~ ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f122]) ).
thf(f138,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $true
= ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) ) )
| ( $true
= ( ~ ( X3 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f137]) ).
thf(f139,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( X3 @ X1 ) )
| ( $true
= ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f138]) ).
thf(f140,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( X3 @ X1 ) )
| ( $true
= ( X3
@ ( epsii
@ ^ [Y0: $i > $i] : ( X3 @ Y0 ) ) ) ) ),
inference(boolean_simplification,[],[f139]) ).
thf(f141,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( X3 @ X1 ) )
| ( $true
= ( X3 @ ( epsii @ X3 ) ) ) ),
inference(beta-eta_normalization,[],[f140]) ).
thf(f148,plain,
! [X1: ( $i > $i ) > $i > $o] :
( ( ^ [Y0: ( $i > $i ) > $i > $o] :
( epsii
@ ^ [Y1: $i > $i] : ( ?? @ $i @ ( Y0 @ Y1 ) ) )
@ X1 )
= ( epsa @ X1 ) ),
inference(argument_congruence,[],[f29]) ).
thf(f149,plain,
! [X1: ( $i > $i ) > $i > $o] :
( ( epsa @ X1 )
= ( epsii
@ ^ [Y0: $i > $i] : ( ?? @ $i @ ( X1 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f183,plain,
! [X0: ( $i > $i ) > $i > $o,X1: $i > $i] :
( ( ( ^ [Y0: $i > $i] : ( ?? @ $i @ ( X0 @ Y0 ) )
@ X1 )
= $false )
| ( $true
= ( ^ [Y0: $i > $i] : ( ?? @ $i @ ( X0 @ Y0 ) )
@ ( epsa @ X0 ) ) ) ),
inference(superposition,[],[f141,f149]) ).
thf(f184,plain,
! [X0: ( $i > $i ) > $i > $o,X1: $i > $i] :
( ( $true
= ( ?? @ $i @ ( X0 @ ( epsa @ X0 ) ) ) )
| ( ( ?? @ $i @ ( X0 @ X1 ) )
= $false ) ),
inference(beta-eta_normalization,[],[f183]) ).
thf(f185,plain,
! [X0: ( $i > $i ) > $i > $o,X1: $i > $i] :
( ( $true
= ( X0 @ ( epsa @ X0 ) @ ( sK3 @ X0 ) ) )
| ( ( ?? @ $i @ ( X0 @ X1 ) )
= $false ) ),
inference(sigma_proxy_clausification,[],[f184]) ).
thf(f186,plain,
! [X2: $i,X0: ( $i > $i ) > $i > $o,X1: $i > $i] :
( ( ( X0 @ X1 @ X2 )
= $false )
| ( $true
= ( X0 @ ( epsa @ X0 ) @ ( sK3 @ X0 ) ) ) ),
inference(pi_proxy_clausification,[],[f185]) ).
thf(f198,plain,
! [X2: $i,X0: ( $i > $i ) > $i > $o,X1: $i > $i] :
( ( ( X0 @ X1 @ X2 )
= $false )
| ( $true
= ( X0 @ ( epsa @ X0 ) @ ( eps @ ( X0 @ ( epsa @ X0 ) ) ) ) )
| ( $true != $true ) ),
inference(superposition,[],[f23,f186]) ).
thf(f209,plain,
! [X2: $i,X0: ( $i > $i ) > $i > $o,X1: $i > $i] :
( ( $true
= ( X0 @ ( epsa @ X0 ) @ ( eps @ ( X0 @ ( epsa @ X0 ) ) ) ) )
| ( ( X0 @ X1 @ X2 )
= $false ) ),
inference(trivial_inequality_removal,[],[f198]) ).
thf(f215,plain,
! [X2: $i,X0: ( $i > $i ) > $i > $o,X1: $i > $i] :
( ( ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) )
= $true )
| ( ( X0 @ X1 @ X2 )
= $false ) ),
inference(forward_demodulation,[],[f209,f113]) ).
thf(f225,plain,
! [X0: $i > $i,X1: $i] :
( ( $false
= ( sK0 @ X0 @ X1 ) )
| ( $true != $true ) ),
inference(superposition,[],[f25,f215]) ).
thf(f249,plain,
! [X0: $i > $i,X1: $i] :
( $false
= ( sK0 @ X0 @ X1 ) ),
inference(trivial_inequality_removal,[],[f225]) ).
thf(f252,plain,
$true = $false,
inference(superposition,[],[f249,f40]) ).
thf(f268,plain,
$false,
inference(trivial_inequality_removal,[],[f252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO536^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n009.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 17:13:30 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.25 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.22/0.30 % (95532)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.30 % (95541)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4050305411:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.30 % (95537)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2737258349:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.30 % (95538)lrs+10_16_si=on:nwc=1.5:random_seed=1527964199:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.30 % (95539)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2763728605:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.30 % (95540)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=1223517729: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.22/0.30 % (95543)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.30 % (95543)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.22/0.30 % (95541) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-95532-95541"...
% 0.22/0.30 % (95541)...printing done.
% 0.22/0.30 % (95539)Refutation not found, incomplete strategy
% 0.22/0.30 % (95539)------------------------------
% 0.22/0.30 % (95539)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (95539)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (95539)CaDiCaL version: 2.1.3
% 0.22/0.30 % (95539)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (95539)Time elapsed: 0.004 s
% 0.22/0.30 % (95539)Peak memory usage: 12 MB
% 0.22/0.30 % (95539)Instructions burned: 3 (million)
% 0.22/0.30 % (95541)Refutation found. Thanks to Tanya!
% 0.22/0.30 % SZS status Theorem for theBenchmark
% 0.22/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.31 % (95541)------------------------------
% 0.22/0.31 % (95541)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.31 % (95541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.31 % (95541)CaDiCaL version: 2.1.3
% 0.22/0.31 % (95541)Termination reason: Refutation
% 0.22/0.31 % (95541)Time elapsed: 0.008 s
% 0.22/0.31 % (95541)Peak memory usage: 12 MB
% 0.22/0.31 % (95541)Instructions burned: 16 (million)
% 0.22/0.31 % (95532)Success in time 0.047 s
% 0.22/0.31 % Vampire exiting
%------------------------------------------------------------------------------