%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET630^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:23:25 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of formulae : 59 ( 33 unt; 0 typ; 4 def)
% Number of atoms : 259 ( 45 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 300 ( 62 ~; 33 |; 43 &; 153 @)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 37 ( 33 usr; 8 con; 0-4 aty)
% ( 0 !!; 5 ??; 0 @@+; 0 @@-)
% Number of variables : 58 ( 0 sgn 8 !; 4 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_15,type,
vOR: $o > $o > $o ).
thf(func_def_16,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_19,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_20,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_21,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_22,type,
vAND: $o > $o > $o ).
thf(func_def_23,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_24,type,
vIMP: $o > $o > $o ).
thf(func_def_25,type,
vNOT: $o > $o ).
thf(func_def_28,type,
sK0: $i > $o ).
thf(func_def_29,type,
sK1: $i > $o ).
thf(f7,axiom,
( excl_union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) )
| ( ( X1 @ X2 )
& ~ ( X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',excl_union) ).
thf(f8,axiom,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',intersection) ).
thf(f14,axiom,
( misses
= ( ^ [X0: $i > $o,X1: $i > $o] :
~ ? [X2: $i] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',misses) ).
thf(f15,conjecture,
! [X1: $i > $o,X0: $i > $o] : ( misses @ ( intersection @ X0 @ X1 ) @ ( excl_union @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ! [X1: $i > $o,X0: $i > $o] : ( misses @ ( intersection @ X0 @ X1 ) @ ( excl_union @ X0 @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f25,plain,
~ ! [X0: $i > $o,X1: $i > $o] : ( misses @ ( intersection @ X1 @ X0 ) @ ( excl_union @ X1 @ X0 ) ),
inference(rectify,[],[f16]) ).
thf(f26,plain,
~ ! [X0: $i > $o,X1: $i > $o] :
( $true
= ( misses @ ( intersection @ X1 @ X0 ) @ ( excl_union @ X1 @ X0 ) ) ),
inference(fool_elimination,[],[f25]) ).
thf(f32,plain,
( excl_union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) )
| ( ( X1 @ X2 )
& ~ ( X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f33,plain,
( excl_union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
| ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f32]) ).
thf(f35,plain,
( misses
= ( ^ [X0: $i > $o,X1: $i > $o] :
~ ? [X2: $i] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f14]) ).
thf(f36,plain,
( misses
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
~ ( ?? @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f35]) ).
thf(f39,plain,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f40,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f39]) ).
thf(f41,plain,
? [X0: $i > $o,X1: $i > $o] :
( $true
!= ( misses @ ( intersection @ X1 @ X0 ) @ ( excl_union @ X1 @ X0 ) ) ),
inference(ennf_transformation,[],[f26]) ).
thf(f42,plain,
( $true
!= ( misses @ ( intersection @ sK1 @ sK0 ) @ ( excl_union @ sK1 @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f41]) ).
thf(f48,plain,
( misses
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
~ ( ?? @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f49,plain,
( $true
!= ( misses @ ( intersection @ sK1 @ sK0 ) @ ( excl_union @ sK1 @ sK0 ) ) ),
inference(cnf_transformation,[],[f42]) ).
thf(f50,plain,
( excl_union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
| ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f33]) ).
thf(f57,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f61,plain,
( $true
!= ( ^ [Y0: $i > $o,Y1: $i > $o] :
~ ( ?? @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK1
@ sK0 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( ~ ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
| ( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) )
@ sK1
@ sK0 ) ) ),
inference(definition_unfolding,[],[f49,f48,f57,f50]) ).
thf(f62,plain,
( $true
!= ( ~ ( ?? @ $i
@ ^ [Y0: $i] :
( ( ( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
& ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f61]) ).
thf(f63,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( ( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
& ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ),
inference(not_proxy_clausification,[],[f62]) ).
thf(f64,plain,
( $true
= ( ^ [Y0: $i] :
( ( ( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
& ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK2 ) ),
inference(sigma_proxy_clausification,[],[f63]) ).
thf(f65,plain,
( ( ( ( ~ ( sK1 @ sK2 )
& ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
& ~ ( sK0 @ sK2 ) ) )
& ( sK1 @ sK2 )
& ( sK0 @ sK2 ) )
= $true ),
inference(beta-eta_normalization,[],[f64]) ).
thf(f66,plain,
( ( ( sK1 @ sK2 )
& ( sK0 @ sK2 ) )
= $true ),
inference(and_proxy_clausification,[],[f65]) ).
thf(f67,plain,
( $true
= ( ( ~ ( sK1 @ sK2 )
& ( sK0 @ sK2 ) )
| ( ( sK1 @ sK2 )
& ~ ( sK0 @ sK2 ) ) ) ),
inference(and_proxy_clausification,[],[f65]) ).
thf(f68,plain,
( ( $true
= ( ~ ( sK1 @ sK2 )
& ( sK0 @ sK2 ) ) )
| ( ( ( sK1 @ sK2 )
& ~ ( sK0 @ sK2 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f67]) ).
thf(f70,plain,
( ( ( ~ ( sK1 @ sK2 ) )
= $true )
| ( ( ( sK1 @ sK2 )
& ~ ( sK0 @ sK2 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f68]) ).
thf(f71,plain,
( ( ( ( sK1 @ sK2 )
& ~ ( sK0 @ sK2 ) )
= $true )
| ( $false
= ( sK1 @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f70]) ).
thf(f72,plain,
( ( $true
= ( ~ ( sK0 @ sK2 ) ) )
| ( $false
= ( sK1 @ sK2 ) ) ),
inference(and_proxy_clausification,[],[f71]) ).
thf(f74,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ( ( sK0 @ sK2 )
= $false ) ),
inference(not_proxy_clausification,[],[f72]) ).
thf(f78,plain,
( ( sK0 @ sK2 )
= $true ),
inference(and_proxy_clausification,[],[f66]) ).
thf(f79,plain,
( $true
= ( sK1 @ sK2 ) ),
inference(and_proxy_clausification,[],[f66]) ).
thf(f81,definition,
( spl3_1
<=> ( ( sK0 @ sK2 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
thf(f83,plain,
( ( ( sK0 @ sK2 )
= $false )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f81]) ).
thf(f85,definition,
( spl3_2
<=> ( $false
= ( sK1 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
thf(f87,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f88,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f74,f85,f81]) ).
thf(f90,definition,
( spl3_3
<=> ( ( sK0 @ sK2 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
thf(f92,plain,
( ( ( sK0 @ sK2 )
= $true )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f90]) ).
thf(f94,definition,
( spl3_4
<=> ( $true
= ( sK1 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
thf(f96,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f94]) ).
thf(f98,plain,
spl3_4,
inference(avatar_split_clause,[],[f79,f94]) ).
thf(f99,plain,
spl3_3,
inference(avatar_split_clause,[],[f78,f90]) ).
thf(f100,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_4 ),
inference(forward_demodulation,[],[f87,f96]) ).
thf(f101,plain,
( $false
| ~ spl3_2
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f100]) ).
thf(f102,plain,
( ~ spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f101]) ).
thf(f104,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_demodulation,[],[f83,f92]) ).
thf(f105,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f104]) ).
thf(f106,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f105]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f88]) ).
cnf(s3,plain,
spl3_4,
inference(sat_conversion,[],[f98]) ).
cnf(s4,plain,
spl3_3,
inference(sat_conversion,[],[f99]) ).
cnf(s5,plain,
( ~ spl3_2
| ~ spl3_4 ),
inference(sat_conversion,[],[f102]) ).
cnf(s6,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(sat_conversion,[],[f106]) ).
cnf(s7,plain,
~ spl3_1,
inference(rat,[],[s6,s4]) ).
cnf(s8,plain,
~ spl3_2,
inference(rat,[],[s5,s3]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s8,s7]) ).
thf(f107,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET630^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n020.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:40:50 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 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 % (1065766)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (1065773)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=360855164:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.28 % (1065773)Refutation not found, incomplete strategy
% 0.21/0.28 % (1065773)------------------------------
% 0.21/0.28 % (1065773)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (1065773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (1065773)CaDiCaL version: 2.1.3
% 0.21/0.28 % (1065773)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.28 % (1065773)Time elapsed: 0.001 s
% 0.21/0.28 % (1065773)Peak memory usage: 12 MB
% 0.21/0.28 % (1065773)Instructions burned: 3 (million)
% 0.21/0.28 % (1065773)------------------------------
% 0.21/0.28 % (1065773)------------------------------
% 0.21/0.28 % (1065777)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 % (1065777)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 % (1065772)lrs+10_16_si=on:nwc=1.5:random_seed=2194841399:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.28 % (1065771)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=272234397:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28 % (1065776)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=879978543:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.28 % (1065774)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=3170678327: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.28 % (1065775)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3851088852:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (1065777)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=4216649207:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.28 % (1065771) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1065766-1065771"...
% 0.21/0.28 % (1065772) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1065766-1065772"...
% 0.21/0.28 % (1065776) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1065766-1065776"...
% 0.21/0.28 % (1065779)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=279606125:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.28 % (1065777) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1065766-1065777"...
% 0.21/0.28 % (1065771)...printing done.
% 0.21/0.28 % (1065772)...printing done.
% 0.21/0.28 % (1065779)Instruction limit reached!
% 0.21/0.28 % (1065779)------------------------------
% 0.21/0.28 % (1065779)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (1065779)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (1065779)CaDiCaL version: 2.1.3
% 0.21/0.28 % (1065779)Termination reason: Instruction limit
% 0.21/0.28 % (1065779)Termination phase: Saturation
% 0.21/0.28 % (1065779)Time elapsed: 0.001 s
% 0.21/0.28 % (1065779)Peak memory usage: 11 MB
% 0.21/0.28 % (1065779)Instructions burned: 3 (million)
% 0.21/0.28 % (1065776)...printing done.
% 0.21/0.28 % (1065771)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 % (1065771)------------------------------
% 0.21/0.28 % (1065771)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (1065771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (1065771)CaDiCaL version: 2.1.3
% 0.21/0.28 % (1065771)Termination reason: Refutation
% 0.21/0.28 % (1065771)Time elapsed: 0.004 s
% 0.21/0.28 % (1065771)Peak memory usage: 12 MB
% 0.21/0.28 % (1065771)Instructions burned: 5 (million)
% 0.21/0.28 % (1065766)Success in time 0.038 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------