%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV453^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:38:39 AM UTC 2026
% Result : Theorem 0.10s 0.19s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 66 ( 15 unt; 0 typ; 4 def)
% Number of atoms : 335 ( 83 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 400 ( 51 ~; 61 |; 7 &; 276 @)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 7 con; 0-4 aty)
% Number of variables : 85 ( 0 sgn 83 !; 2 ?; 85 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
sK1: $tType ).
thf(func_def_0,type,
'const/sets/UNIV':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_1,type,
'const/sets/INTER':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_2,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
sK0:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK2: sK1 > $o ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(func_def_9,type,
sK3: sK1 ).
thf(f1,axiom,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_') ).
thf(f2,axiom,
! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_UNIV_') ).
thf(f3,axiom,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ X1 ) )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_INTER_') ).
thf(f5,conjecture,
! [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/INTER_UNIV_1') ).
thf(f6,negated_conjecture,
~ ! [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= X1 ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X1 ) )
= ( 'const/sets/IN' @ X0 @ X2 @ X3 ) )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) ),
inference(rectify,[],[f3]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0 > $o] :
( ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
& ( $true
= ( 'const/sets/IN' @ X0 @ X2 @ X3 ) ) )
<=> ( $true
= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X1 ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f10,plain,
! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
inference(rectify,[],[f2]) ).
thf(f11,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
! [X0: $tType,X1: X0,X2: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= ( X2 @ X1 ) ),
inference(rectify,[],[f1]) ).
thf(f13,plain,
? [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
!= X1 ),
inference(ennf_transformation,[],[f6]) ).
thf(f14,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0 > $o] :
( ( ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
& ( $true
= ( 'const/sets/IN' @ X0 @ X2 @ X3 ) ) )
| ( $true
!= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X1 ) ) ) )
& ( ( $true
= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X1 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
!= $true )
| ( $true
!= ( 'const/sets/IN' @ X0 @ X2 @ X3 ) ) ) ),
inference(nnf_transformation,[],[f8]) ).
thf(f15,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0 > $o] :
( ( ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
& ( $true
= ( 'const/sets/IN' @ X0 @ X2 @ X3 ) ) )
| ( $true
!= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X1 ) ) ) )
& ( ( $true
= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X1 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
!= $true )
| ( $true
!= ( 'const/sets/IN' @ X0 @ X2 @ X3 ) ) ) ),
inference(flattening,[],[f14]) ).
thf(f19,plain,
( ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 )
!= sK2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f13]) ).
thf(f20,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0 > $o] :
( ( $true
!= ( 'const/sets/IN' @ X0 @ X2 @ X3 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X1 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f21,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0 > $o] :
( ( $true
!= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X1 ) ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X2 @ X3 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f25,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f26,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= ( X2 @ X1 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f27,plain,
( ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 )
!= sK2 ),
inference(cnf_transformation,[],[f19]) ).
thf(f33,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) )
| ( $false
= ( X2 @ X1 ) ) ),
inference(iff_proxy_clausification,[],[f26]) ).
thf(f34,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(iff_proxy_clausification,[],[f26]) ).
thf(f37,plain,
( ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 @ sK3 )
!= ( sK2 @ sK3 ) ),
inference(negative_extensionality,[],[f27]) ).
thf(f38,plain,
( ( $true
= ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f37]) ).
thf(f39,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 @ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f37]) ).
thf(f41,definition,
( spl4_1
<=> ( $false
= ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f43,plain,
( ( $false
= ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 @ sK3 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f45,definition,
( spl4_2
<=> ( $false
= ( sK2 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f46,plain,
( ( $false
!= ( sK2 @ sK3 ) )
| spl4_2 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f47,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f48,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f39,f45,f41]) ).
thf(f50,definition,
( spl4_3
<=> ( $true
= ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f52,plain,
( ( $true
= ( 'const/sets/INTER' @ sK1 @ sK2 @ 'const/sets/UNIV' @ sK1 @ sK3 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f54,definition,
( spl4_4
<=> ( $true
= ( sK2 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f56,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f57,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f38,f54,f50]) ).
thf(f65,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true != $true )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) )
| ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) ) ),
inference(constrained_superposition,[],[f21,f33]) ).
thf(f66,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f67,plain,
( ( $true
= ( 'const/sets/IN' @ sK1 @ sK3 @ sK2 ) )
| ( $false = $true )
| ~ spl4_3 ),
inference(constrained_superposition,[],[f66,f52]) ).
thf(f69,plain,
( ( $true
= ( 'const/sets/IN' @ sK1 @ sK3 @ sK2 ) )
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f67]) ).
thf(f71,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $false = $true )
| ~ spl4_3 ),
inference(constrained_superposition,[],[f69,f34]) ).
thf(f74,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f71]) ).
thf(f78,plain,
( ( $false = $true )
| ~ spl4_2
| ~ spl4_3 ),
inference(forward_demodulation,[],[f74,f47]) ).
thf(f79,plain,
( $false
| ~ spl4_2
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f78]) ).
thf(f80,plain,
( ~ spl4_2
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[],[f79]) ).
thf(f92,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false
= ( X2 @ X1 ) )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
!= $true )
| ( $true != $true )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) ) ),
inference(constrained_superposition,[],[f20,f33]) ).
thf(f93,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
!= $true )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) )
| ( $false
= ( X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f92]) ).
thf(f160,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INTER' @ X0 @ X2 @ 'const/sets/UNIV' @ X0 ) ) )
| ( $false
= ( X2 @ X1 ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f93,f25]) ).
thf(f168,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INTER' @ X0 @ X2 @ 'const/sets/UNIV' @ X0 ) ) )
| ( $false
= ( X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f160]) ).
thf(f175,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( $false = $true )
| ( $false
= ( X2 @ X1 ) )
| ( ( 'const/sets/INTER' @ X0 @ X2 @ 'const/sets/UNIV' @ X0 @ X1 )
= $true ) ),
inference(constrained_superposition,[],[f34,f168]) ).
thf(f180,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( ( 'const/sets/INTER' @ X0 @ X2 @ 'const/sets/UNIV' @ X0 @ X1 )
= $true )
| ( $false
= ( X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f175]) ).
thf(f190,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false = $true )
| ~ spl4_1 ),
inference(constrained_superposition,[],[f43,f180]) ).
thf(f193,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f190]) ).
thf(f199,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f193,f46]) ).
thf(f200,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f199]) ).
thf(f201,plain,
( ( $false = $true )
| ~ spl4_2
| ~ spl4_4 ),
inference(forward_demodulation,[],[f47,f56]) ).
thf(f202,plain,
( $false
| ~ spl4_2
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f201]) ).
thf(f203,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f202]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f48]) ).
cnf(s2,plain,
( spl4_3
| spl4_4 ),
inference(sat_conversion,[],[f57]) ).
cnf(s4,plain,
( ~ spl4_2
| ~ spl4_3 ),
inference(sat_conversion,[],[f80]) ).
cnf(s9,plain,
( ~ spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f200]) ).
cnf(s10,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(sat_conversion,[],[f203]) ).
cnf(s11,plain,
~ spl4_2,
inference(rat,[],[s2,s4,s10]) ).
cnf(s12,plain,
~ spl4_1,
inference(rat,[],[s9,s11]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s1,s11,s12]) ).
thf(f204,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEV453^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.12 % Computer : n012.cluster.edu
% 0.00/0.12 % Model : x86_64 x86_64
% 0.00/0.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.12 % Memory : 8046.5625MB
% 0.00/0.12 % OS : Linux 6.8.0-71-generic
% 0.00/0.12 % CPULimit : 300
% 0.00/0.12 % WCLimit : 300
% 0.00/0.12 % DateTime : Tue Sep 29 15:48:03 UTC 2026
% 0.00/0.12 % CPUTime :
% 0.00/0.12 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.14 Running higher-order theorem proving
% 0.10/0.15 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.10/0.19 % (276280)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.19 % (276285)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1176889440:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.10/0.19 % (276287)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1431172205:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.10/0.19 % (276288)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=3204016508: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.10/0.19 % (276287)Instruction limit reached!
% 0.10/0.19 % (276287)------------------------------
% 0.10/0.19 % (276287)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.19 % (276287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.19 % (276287)CaDiCaL version: 2.1.3
% 0.10/0.19 % (276287)Termination reason: Instruction limit
% 0.10/0.19 % (276287)Termination phase: Saturation
% 0.10/0.19 % (276287)Time elapsed: 0.002 s
% 0.10/0.19 % (276287)Peak memory usage: 12 MB
% 0.10/0.19 % (276287)Instructions burned: 6 (million)
% 0.10/0.19 % (276285) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-276280-276285"...
% 0.10/0.19 % (276291)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.10/0.19 % (276291)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.10/0.19 % (276285)...printing done.
% 0.10/0.19 % (276289)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2480833235:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.10/0.19 % (276285)Refutation found. Thanks to Tanya!
% 0.10/0.19 % SZS status Theorem for theBenchmark
% 0.10/0.19 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.19 % (276285)------------------------------
% 0.10/0.19 % (276285)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.19 % (276285)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.19 % (276285)CaDiCaL version: 2.1.3
% 0.10/0.19 % (276285)Termination reason: Refutation
% 0.10/0.19 % (276285)Time elapsed: 0.006 s
% 0.10/0.19 % (276285)Peak memory usage: 13 MB
% 0.10/0.19 % (276285)Instructions burned: 15 (million)
% 0.10/0.19 % (276280)Success in time 0.033 s
% 0.10/0.19 % Vampire exiting
%------------------------------------------------------------------------------