%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU591^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:30:13 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 88 ( 35 unt; 0 typ; 12 def)
% Number of atoms : 397 ( 80 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 421 ( 53 ~; 55 |; 6 &; 257 @)
% ( 8 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 27 usr; 19 con; 0-4 aty)
% ( 21 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 97 ( 0 sgn 40 !; 6 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_2,type,
dsetconstrEL: $o ).
thf(func_def_4,type,
binintersect: $i > $i > $i ).
thf(func_def_5,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_8,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_9,type,
vIMP: $o > $o > $o ).
thf(func_def_10,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
sF3: $o ).
thf(func_def_17,type,
sF4: $o ).
thf(func_def_19,type,
sF6: $o ).
thf(func_def_21,type,
sK8: $i > $o ).
thf(f1,axiom,
! [X2: $i,X1: $i > $o,X0: $i] :
( ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X0 ) )
= dsetconstrEL ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrEL) ).
thf(f2,axiom,
( ( ^ [X0: $i,X1: $i] :
( dsetconstr @ X0
@ ^ [X2: $i] : ( in @ X2 @ X1 ) ) )
= binintersect ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersect) ).
thf(f3,conjecture,
( dsetconstrEL
=> ! [X1: $i,X2: $i,X0: $i] :
( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
=> ( in @ X2 @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectEL) ).
thf(f4,negated_conjecture,
~ ( dsetconstrEL
=> ! [X1: $i,X2: $i,X0: $i] :
( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
=> ( in @ X2 @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( ( ^ [X0: $i,X1: $i] :
( dsetconstr @ X0
@ ^ [X2: $i] : ( in @ X2 @ X1 ) ) )
= binintersect ),
inference(rectify,[],[f2]) ).
thf(f6,plain,
( binintersect
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X0
@ ( dsetconstr @ X2
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X0 @ X2 ) )
= dsetconstrEL ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( dsetconstrEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2
@ ( dsetconstr @ Y0
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y2 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( dsetconstrEL
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ ( binintersect @ X2 @ X0 ) )
=> ( in @ X1 @ X2 ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( dsetconstrEL = $true )
=> ! [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X1 @ ( binintersect @ X2 @ X0 ) )
= $true )
=> ( ( in @ X1 @ X2 )
= $true ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ( dsetconstrEL = $true )
& ? [X0: $i,X2: $i,X1: $i] :
( ( ( in @ X1 @ X2 )
!= $true )
& ( ( in @ X1 @ ( binintersect @ X2 @ X0 ) )
= $true ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ( dsetconstrEL = $true )
& ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( ( in @ X2 @ ( binintersect @ X1 @ X0 ) )
= $true ) ) ),
inference(rectify,[],[f11]) ).
thf(f13,plain,
( ( dsetconstrEL = $true )
& ( $true
!= ( in @ sK2 @ sK1 ) )
& ( ( in @ sK2 @ ( binintersect @ sK1 @ sK0 ) )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12]) ).
thf(f14,plain,
( binintersect
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( dsetconstrEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2
@ ( dsetconstr @ Y0
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y2 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
( ( in @ sK2 @ ( binintersect @ sK1 @ sK0 ) )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
( $true
!= ( in @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
dsetconstrEL = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f21,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2
@ ( dsetconstr @ Y0
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y2 @ Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f18]) ).
thf(f22,plain,
( ( in @ sK2
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) )
@ sK1
@ sK0 ) )
= $true ),
inference(definition_unfolding,[],[f16,f14]) ).
thf(f23,definition,
( sF3
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2
@ ( dsetconstr @ Y0
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y2 @ Y0 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f24,plain,
sF3 = $true,
inference(definition_folding,[],[f21,f23]) ).
thf(f25,definition,
( sF4
= ( in @ sK2 @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f26,plain,
$true != sF4,
inference(definition_folding,[],[f17,f25]) ).
thf(f27,definition,
( sF5
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) )
@ sK1
@ sK0 ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f28,definition,
( sF6
= ( in @ sK2 @ sF5 ) ),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
thf(f29,plain,
( ( in @ sK2 @ sF5 )
= sF6 ),
inference(reorient_equations,[],[f28]) ).
thf(f30,plain,
$true = sF6,
inference(definition_folding,[],[f22,f29,f27]) ).
thf(f31,plain,
( ( $false
= ( in @ sK2 @ sK1 ) )
| ( $true = sF4 ) ),
inference(iff_proxy_clausification,[],[f25]) ).
thf(f34,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2
@ ( dsetconstr @ Y0
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y2 @ Y0 ) ) ) ) )
= $true )
| ( sF3 = $false ) ),
inference(iff_proxy_clausification,[],[f23]) ).
thf(f35,plain,
! [X1: $i] :
( ( sF3 = $false )
| ( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2
@ ( dsetconstr @ Y0
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y2 @ Y0 ) ) ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f34]) ).
thf(f36,plain,
! [X1: $i] :
( ( sF3 = $false )
| ( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( dsetconstr @ X1 @ Y0 ) )
=> ( in @ Y1 @ X1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( dsetconstr @ X1 @ Y0 ) )
=> ( in @ Y1 @ X1 ) ) )
@ X2 ) )
| ( sF3 = $false ) ),
inference(pi_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( dsetconstr @ X1 @ X2 ) )
=> ( in @ Y0 @ X1 ) ) ) )
| ( sF3 = $false ) ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f39,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( dsetconstr @ X1 @ X2 ) )
=> ( in @ Y0 @ X1 ) )
@ X3 ) )
| ( sF3 = $false ) ),
inference(pi_proxy_clausification,[],[f38]) ).
thf(f40,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X3 @ ( dsetconstr @ X1 @ X2 ) )
=> ( in @ X3 @ X1 ) ) )
| ( sF3 = $false ) ),
inference(beta-eta_normalization,[],[f39]) ).
thf(f41,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( in @ X3 @ X1 )
= $true )
| ( sF3 = $false )
| ( $false
= ( in @ X3 @ ( dsetconstr @ X1 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f40]) ).
thf(f50,plain,
( sF5
= ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ Y0 @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f51,plain,
( ( ( in @ sK2 @ sF5 )
= $true )
| ( $false = sF6 ) ),
inference(iff_proxy_clausification,[],[f29]) ).
thf(f63,definition,
( spl10_3
<=> ( $false
= ( in @ sK2 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
thf(f65,plain,
( ( $false
= ( in @ sK2 @ sK1 ) )
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f67,definition,
( spl10_4
<=> ( $true = sF4 ) ),
introduced(definition,[new_symbols(definition,[spl10_4])],[avatar_definition]) ).
thf(f70,plain,
( spl10_3
| spl10_4 ),
inference(avatar_split_clause,[],[f31,f67,f63]) ).
thf(f71,plain,
~ spl10_4,
inference(avatar_split_clause,[],[f26,f67]) ).
thf(f73,definition,
( spl10_5
<=> ! [X2: $i > $o,X1: $i,X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
| ( $false
= ( in @ X3 @ ( dsetconstr @ X1 @ X2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
thf(f74,plain,
( ! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X3 @ ( dsetconstr @ X1 @ X2 ) ) )
| ( ( in @ X3 @ X1 )
= $true ) )
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f73]) ).
thf(f76,definition,
( spl10_6
<=> ( sF3 = $false ) ),
introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition]) ).
thf(f78,plain,
( ( sF3 = $false )
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f79,plain,
( spl10_5
| spl10_6 ),
inference(avatar_split_clause,[],[f41,f76,f73]) ).
thf(f85,definition,
( spl10_8
<=> ( sF3 = $true ) ),
introduced(definition,[new_symbols(definition,[spl10_8])],[avatar_definition]) ).
thf(f87,plain,
( ( sF3 = $true )
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f94,plain,
spl10_8,
inference(avatar_split_clause,[],[f24,f85]) ).
thf(f96,definition,
( spl10_10
<=> ( $true = sF6 ) ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
thf(f98,plain,
( ( $true = sF6 )
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f96]) ).
thf(f105,definition,
( spl10_12
<=> ( ( in @ sK2 @ sF5 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl10_12])],[avatar_definition]) ).
thf(f107,plain,
( ( ( in @ sK2 @ sF5 )
= $true )
| ~ spl10_12 ),
inference(avatar_component_clause,[],[f105]) ).
thf(f109,definition,
( spl10_13
<=> ( $false = sF6 ) ),
introduced(definition,[new_symbols(definition,[spl10_13])],[avatar_definition]) ).
thf(f111,plain,
( ( $false = sF6 )
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f109]) ).
thf(f112,plain,
( spl10_12
| spl10_13 ),
inference(avatar_split_clause,[],[f51,f109,f105]) ).
thf(f113,plain,
spl10_10,
inference(avatar_split_clause,[],[f30,f96]) ).
thf(f126,plain,
( ! [X0: $i] :
( ( $true
= ( in @ X0 @ sK1 ) )
| ( $false
= ( in @ X0 @ sF5 ) ) )
| ~ spl10_5 ),
inference(constrained_superposition,[],[f74,f50]) ).
thf(f129,plain,
( ( $true = $false )
| ( ( in @ sK2 @ sF5 )
= $false )
| ~ spl10_3
| ~ spl10_5 ),
inference(constrained_superposition,[],[f126,f65]) ).
thf(f132,plain,
( ( ( in @ sK2 @ sF5 )
= $false )
| ~ spl10_3
| ~ spl10_5 ),
inference(trivial_inequality_removal,[],[f129]) ).
thf(f136,plain,
( ( $true = $false )
| ~ spl10_3
| ~ spl10_5
| ~ spl10_12 ),
inference(forward_demodulation,[],[f132,f107]) ).
thf(f137,plain,
( $false
| ~ spl10_3
| ~ spl10_5
| ~ spl10_12 ),
inference(trivial_inequality_removal,[],[f136]) ).
thf(f138,plain,
( ~ spl10_3
| ~ spl10_5
| ~ spl10_12 ),
inference(avatar_contradiction_clause,[],[f137]) ).
thf(f140,plain,
( ( $true = $false )
| ~ spl10_10
| ~ spl10_13 ),
inference(forward_demodulation,[],[f111,f98]) ).
thf(f141,plain,
( $false
| ~ spl10_10
| ~ spl10_13 ),
inference(trivial_inequality_removal,[],[f140]) ).
thf(f142,plain,
( ~ spl10_10
| ~ spl10_13 ),
inference(avatar_contradiction_clause,[],[f141]) ).
thf(f144,plain,
( ( $true = $false )
| ~ spl10_6
| ~ spl10_8 ),
inference(forward_demodulation,[],[f78,f87]) ).
thf(f145,plain,
( $false
| ~ spl10_6
| ~ spl10_8 ),
inference(trivial_inequality_removal,[],[f144]) ).
thf(f146,plain,
( ~ spl10_6
| ~ spl10_8 ),
inference(avatar_contradiction_clause,[],[f145]) ).
cnf(s2,plain,
( spl10_3
| spl10_4 ),
inference(sat_conversion,[],[f70]) ).
cnf(s3,plain,
~ spl10_4,
inference(sat_conversion,[],[f71]) ).
cnf(s4,plain,
( spl10_5
| spl10_6 ),
inference(sat_conversion,[],[f79]) ).
cnf(s7,plain,
spl10_8,
inference(sat_conversion,[],[f94]) ).
cnf(s9,plain,
( spl10_12
| spl10_13 ),
inference(sat_conversion,[],[f112]) ).
cnf(s10,plain,
spl10_10,
inference(sat_conversion,[],[f113]) ).
cnf(s12,plain,
( ~ spl10_3
| ~ spl10_5
| ~ spl10_12 ),
inference(sat_conversion,[],[f138]) ).
cnf(s14,plain,
( ~ spl10_10
| ~ spl10_13 ),
inference(sat_conversion,[],[f142]) ).
cnf(s16,plain,
( ~ spl10_6
| ~ spl10_8 ),
inference(sat_conversion,[],[f146]) ).
cnf(s17,plain,
~ spl10_13,
inference(rat,[],[s14,s10]) ).
cnf(s18,plain,
spl10_12,
inference(rat,[],[s9,s17]) ).
cnf(s19,plain,
~ spl10_6,
inference(rat,[],[s16,s7]) ).
cnf(s20,plain,
spl10_5,
inference(rat,[],[s4,s19]) ).
cnf(s21,plain,
~ spl10_3,
inference(rat,[],[s12,s18,s20]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s2,s3,s21]) ).
thf(f147,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU591^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n016.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 13:58:49 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.24 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.21/0.28 % (397721)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (397732)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.28 % (397732)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.28 % (397732)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=899813952:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.28 % (397732) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-397721-397732"...
% 0.21/0.28 % (397732)...printing done.
% 0.21/0.28 % (397732)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (397732)------------------------------
% 0.21/0.28 % (397732)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (397732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (397732)CaDiCaL version: 2.1.3
% 0.21/0.28 % (397732)Termination reason: Refutation
% 0.21/0.28 % (397732)Time elapsed: 0.003 s
% 0.21/0.28 % (397732)Peak memory usage: 13 MB
% 0.21/0.28 % (397732)Instructions burned: 6 (million)
% 0.21/0.28 % (397721)Success in time 0.031 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------