%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PUZ081_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 : Tue Sep 29 12:31:32 PM UTC 2026
% Result : Theorem 2.91s 1.29s
% Output : Refutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of formulae : 99 ( 13 unt; 0 typ; 10 def)
% Number of atoms : 331 ( 52 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 221 ( 101 ~; 87 |; 13 &)
% ( 12 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 175 ( 116 fml; 59 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 16 usr; 13 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 66 ( 0 sgn 62 !; 4 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_4,type,
bG0: $o > $o ).
tff(func_def_5,type,
bG1: $o > $o ).
tff(func_def_6,type,
bG2: $o ).
tff(func_def_7,type,
bG3: $o ).
tff(pred_def_3,type,
says: ( $i * $o ) > $o ).
tff(f1,axiom,
! [X0: $i] :
( knight(X0)
<~> knave(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knights_xor_knaves) ).
tff(f2,axiom,
! [X0: $i,X1: $o] :
( ( knight(X0)
& says(X0,(X1)) )
=> (X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knights_tell_truth) ).
tff(f3,axiom,
! [X0: $i,X1: $o] :
( ( knave(X0)
& says(X0,(X1)) )
=> ~ (X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knaves_lie) ).
tff(f4,axiom,
says(zoey,knave(mel)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zoey_speaks) ).
tff(f6,conjecture,
? [X0: $i,X1: $i] :
( knight(X0)
& knave(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',who_is_knight_and_knave) ).
tff(f7,negated_conjecture,
~ ? [X0: $i,X1: $i] :
( knight(X0)
& knave(X1) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
tff(f8,plain,
! [X0: $i,X1: $o] :
( ( knight(X0)
& says(X0,(X1)) )
=> (X1) ),
inference(rectify,[],[f2]) ).
tff(f9,definition,
! [X1: $o] :
( ( $true = (X1) )
<=> ( $true = bG0((X1)) ) ),
introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition]) ).
tff(f10,plain,
! [X0: $i,X1: $o] :
( ( knight(X0)
& says(X0,bG0((X1))) )
=> ( $true = (X1) ) ),
inference(fool_elimination,[],[f8,f9]) ).
tff(f11,plain,
! [X0: $i,X1: $o] :
( ( knave(X0)
& says(X0,(X1)) )
=> ~ (X1) ),
inference(rectify,[],[f3]) ).
tff(f12,definition,
! [X1: $o] :
( ( $true = (X1) )
<=> ( $true = bG1((X1)) ) ),
introduced(definition,[new_symbols(definition,[bG1])],[fool_formula_definition]) ).
tff(f13,plain,
! [X0: $i,X1: $o] :
( ( knave(X0)
& says(X0,bG1((X1))) )
=> ( $true != (X1) ) ),
inference(fool_elimination,[],[f11,f12]) ).
tff(f14,definition,
( knave(mel)
<=> ( $true = bG2 ) ),
introduced(definition,[new_symbols(definition,[bG2])],[fool_formula_definition]) ).
tff(f15,plain,
says(zoey,bG2),
inference(fool_elimination,[],[f4,f14]) ).
tff(f18,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG1((X0)) ) ),
inference(rectify,[],[f12]) ).
tff(f19,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG0((X0)) ) ),
inference(rectify,[],[f9]) ).
tff(f20,plain,
! [X0: $i,X1: $o] :
( ( knave(X0)
& says(X0,bG1((X1))) )
=> ( $true != (X1) ) ),
inference(flattening,[],[f13]) ).
tff(f21,plain,
! [X0: $i,X1: $o] :
( ( $true = (X1) )
| ~ knight(X0)
| ~ says(X0,bG0((X1))) ),
inference(ennf_transformation,[],[f10]) ).
tff(f22,plain,
! [X0: $i,X1: $o] :
( ( $true = (X1) )
| ~ knight(X0)
| ~ says(X0,bG0((X1))) ),
inference(flattening,[],[f21]) ).
tff(f23,plain,
! [X0: $i,X1: $o] :
( ( $true != (X1) )
| ~ knave(X0)
| ~ says(X0,bG1((X1))) ),
inference(ennf_transformation,[],[f20]) ).
tff(f24,plain,
! [X0: $i,X1: $o] :
( ( $true != (X1) )
| ~ knave(X0)
| ~ says(X0,bG1((X1))) ),
inference(flattening,[],[f23]) ).
tff(f25,plain,
! [X0: $i,X1: $i] :
( ~ knight(X0)
| ~ knave(X1) ),
inference(ennf_transformation,[],[f7]) ).
tff(f28,plain,
( ( knave(mel)
| ( $true != bG2 ) )
& ( ( $true = bG2 )
| ~ knave(mel) ) ),
inference(nnf_transformation,[],[f14]) ).
tff(f29,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG1((X0)) ) )
& ( ( $true = bG1((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f18]) ).
tff(f30,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG0((X0)) ) )
& ( ( $true = bG0((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f19]) ).
tff(f31,plain,
! [X0: $i] :
( ( ~ knave(X0)
| ~ knight(X0) )
& ( knave(X0)
| knight(X0) ) ),
inference(nnf_transformation,[],[f1]) ).
tff(f35,plain,
( ( $true = bG2 )
| ~ knave(mel) ),
inference(cnf_transformation,[],[f28]) ).
tff(f36,plain,
( knave(mel)
| ( $true != bG2 ) ),
inference(cnf_transformation,[],[f28]) ).
tff(f37,plain,
! [X0: $o] :
( ( $true = bG1((X0)) )
| ( $true != (X0) ) ),
inference(cnf_transformation,[],[f29]) ).
tff(f40,plain,
! [X0: $o] :
( ( $true != bG0((X0)) )
| ( $true = (X0) ) ),
inference(cnf_transformation,[],[f30]) ).
tff(f41,plain,
! [X0: $i] :
( knave(X0)
| knight(X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f43,plain,
! [X0: $i,X1: $o] :
( ( $true = (X1) )
| ~ knight(X0)
| ~ says(X0,bG0((X1))) ),
inference(cnf_transformation,[],[f22]) ).
tff(f44,plain,
! [X0: $i,X1: $o] :
( ( $true != (X1) )
| ~ knave(X0)
| ~ says(X0,bG1((X1))) ),
inference(cnf_transformation,[],[f24]) ).
tff(f45,plain,
says(zoey,bG2),
inference(cnf_transformation,[],[f15]) ).
tff(f47,plain,
! [X0: $i,X1: $i] :
( ~ knight(X0)
| ~ knave(X1) ),
inference(cnf_transformation,[],[f25]) ).
tff(f49,plain,
! [X0: $o] :
( ( $false = (X0) )
| ( $true = (X0) ) ),
introduced(definition,[],[fool_exhaustiveness_axiom]) ).
tff(f50,plain,
$true = bG1($true),
inference(equality_resolution,[],[f37]) ).
tff(f52,plain,
! [X0: $i] :
( ~ knave(X0)
| ~ says(X0,bG1($true)) ),
inference(equality_resolution,[],[f44]) ).
tff(f54,definition,
( spl4_1
<=> ! [X1: $i] : ~ knave(X1) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
tff(f55,plain,
( ! [X1: $i] : ~ knave(X1)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f54]) ).
tff(f57,definition,
( spl4_2
<=> ! [X0: $i] : ~ knight(X0) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
tff(f58,plain,
( ! [X0: $i] : ~ knight(X0)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f57]) ).
tff(f59,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f47,f57,f54]) ).
tff(f61,definition,
( spl4_3
<=> knave(mel) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
tff(f62,plain,
( knave(mel)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f61]) ).
tff(f63,plain,
( ~ knave(mel)
| spl4_3 ),
inference(avatar_component_clause,[],[f61]) ).
tff(f65,definition,
( spl4_4
<=> ( $true = bG2 ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
tff(f66,plain,
( ( $true != bG2 )
| spl4_4 ),
inference(avatar_component_clause,[],[f65]) ).
tff(f67,plain,
( ( $true = bG2 )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f65]) ).
tff(f68,plain,
( ~ spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f35,f65,f61]) ).
tff(f69,plain,
( ~ spl4_4
| spl4_3 ),
inference(avatar_split_clause,[],[f36,f61,f65]) ).
tff(f81,plain,
( says(zoey,$true)
| ~ spl4_4 ),
inference(forward_demodulation,[],[f45,f67]) ).
tff(f82,plain,
( ! [X0: $i] : knave(X0)
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f41,f58]) ).
tff(f83,plain,
( ! [X0: $i] : ~ says(X0,bG1($true))
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f52,f82]) ).
tff(f84,plain,
( ! [X0: $i] : ~ says(X0,$true)
| ~ spl4_2 ),
inference(superposition,[],[f83,f50]) ).
tff(f85,plain,
( $false
| ~ spl4_2
| ~ spl4_4 ),
inference(resolution,[],[f84,f81]) ).
tff(f86,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f85]) ).
tff(f88,plain,
( $false
| ~ spl4_1
| ~ spl4_3 ),
inference(resolution,[],[f55,f62]) ).
tff(f89,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[],[f88]) ).
tff(f90,plain,
( $false
| ~ spl4_2
| spl4_3 ),
inference(forward_subsumption_resolution,[],[f63,f82]) ).
tff(f91,plain,
( ~ spl4_2
| spl4_3 ),
inference(avatar_contradiction_clause,[],[f90]) ).
tff(f93,plain,
( ! [X0: $i] : knight(X0)
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f41,f55]) ).
tff(f94,plain,
( ! [X0: $i,X1: $o] :
( ~ says(X0,bG0((X1)))
| ( $true = (X1) ) )
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f43,f93]) ).
tff(f96,plain,
( ! [X0: $i,X1: $o] :
( ~ says(X0,$false)
| ( $true = (X1) )
| ( $true = bG0((X1)) ) )
| ~ spl4_1 ),
inference(superposition,[],[f94,f49]) ).
tff(f99,plain,
( says(zoey,$false)
| ( $true = bG2 ) ),
inference(superposition,[],[f45,f49]) ).
tff(f107,plain,
( says(zoey,$false)
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f99,f66]) ).
tff(f109,definition,
( spl4_7
<=> ! [X1: $o] :
( ( $true = (X1) )
| ( $true = bG0((X1)) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_7])],[avatar_definition]) ).
tff(f110,plain,
( ! [X1: $o] :
( ( $true = bG0((X1)) )
| ( $true = (X1) ) )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f109]) ).
tff(f112,definition,
( spl4_8
<=> ! [X0: $i] : ~ says(X0,$false) ),
introduced(definition,[new_symbols(definition,[spl4_8])],[avatar_definition]) ).
tff(f113,plain,
( ! [X0: $i] : ~ says(X0,$false)
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f112]) ).
tff(f114,plain,
( spl4_7
| spl4_8
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f96,f54,f112,f109]) ).
tff(f121,definition,
( spl4_9
<=> ! [X1: $o] : ( $true = (X1) ) ),
introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition]) ).
tff(f122,plain,
( ! [X1: $o] : ( $true = (X1) )
| ~ spl4_9 ),
inference(avatar_component_clause,[],[f121]) ).
tff(f127,plain,
( ! [X0: $o] : ( $true = (X0) )
| ~ spl4_7 ),
inference(forward_subsumption_resolution,[],[f40,f110]) ).
tff(f128,plain,
( spl4_9
| ~ spl4_7 ),
inference(avatar_split_clause,[],[f127,f109,f121]) ).
tff(f137,plain,
( ( $true != $true )
| spl4_4
| ~ spl4_9 ),
inference(superposition,[],[f66,f122]) ).
tff(f139,plain,
( $false
| spl4_4
| ~ spl4_9 ),
inference(trivial_inequality_removal,[],[f137]) ).
tff(f140,plain,
( spl4_4
| ~ spl4_9 ),
inference(avatar_contradiction_clause,[],[f139]) ).
tff(f146,plain,
( $false
| spl4_4
| ~ spl4_8 ),
inference(forward_subsumption_resolution,[],[f107,f113]) ).
tff(f147,plain,
( spl4_4
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f146]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f59]) ).
cnf(s2,plain,
( ~ spl4_3
| spl4_4 ),
inference(sat_conversion,[],[f68]) ).
cnf(s3,plain,
( spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f69]) ).
cnf(s7,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(sat_conversion,[],[f86]) ).
cnf(s8,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(sat_conversion,[],[f89]) ).
cnf(s9,plain,
( ~ spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f91]) ).
cnf(s10,plain,
( ~ spl4_1
| spl4_7
| spl4_8 ),
inference(sat_conversion,[],[f114]) ).
cnf(s12,plain,
( ~ spl4_7
| spl4_9 ),
inference(sat_conversion,[],[f128]) ).
cnf(s13,plain,
( spl4_4
| ~ spl4_9 ),
inference(sat_conversion,[],[f140]) ).
cnf(s14,plain,
( spl4_4
| ~ spl4_8 ),
inference(sat_conversion,[],[f147]) ).
cnf(s15,plain,
~ spl4_2,
inference(rat,[],[s2,s7,s9]) ).
cnf(s16,plain,
spl4_1,
inference(rat,[],[s1,s15]) ).
cnf(s17,plain,
~ spl4_3,
inference(rat,[],[s8,s16]) ).
cnf(s18,plain,
~ spl4_4,
inference(rat,[],[s3,s17]) ).
cnf(s19,plain,
~ spl4_8,
inference(rat,[],[s14,s18]) ).
cnf(s20,plain,
~ spl4_9,
inference(rat,[],[s13,s18]) ).
cnf(s21,plain,
spl4_7,
inference(rat,[],[s10,s16,s19]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s12,s20,s21]) ).
tff(f148,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ081_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 22:42:11 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.91/1.29 % (990604)Detected formulas, will run a generic FOF schedule.
% 2.91/1.29 % (990609)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=78005067:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.91/1.29 % (990610)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3009482333:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.91/1.29 % (990611)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2615752349:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.91/1.29 % (990615)dis-21_1_sil=8000:lcm=predicate:random_seed=322353149:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.91/1.29 % (990614)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1239464983:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.91/1.29 % (990613)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3364066948:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.91/1.29 % (990612)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2710455080:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.91/1.29 % (990613)Refutation not found, incomplete strategy
% 2.91/1.29 % (990613)------------------------------
% 2.91/1.29 % (990613)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.29 % (990613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.29 % (990613)CaDiCaL version: 2.1.3
% 2.91/1.29 % (990613)Termination reason: Refutation not found, incomplete strategy
% 2.91/1.29 % (990613)Time elapsed: 0.001 s
% 2.91/1.29 % (990613)Peak memory usage: 87 MB
% 2.91/1.29 % (990612)Refutation not found, incomplete strategy
% 2.91/1.29 % (990612)------------------------------
% 2.91/1.29 % (990612)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.29 % (990612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.29 % (990612)CaDiCaL version: 2.1.3
% 2.91/1.29 % (990612)Termination reason: Refutation not found, incomplete strategy
% 2.91/1.29 % (990612)Time elapsed: 0.001 s
% 2.91/1.29 % (990612)Peak memory usage: 88 MB
% 2.91/1.29 % (990615)Refutation not found, incomplete strategy
% 2.91/1.29 % (990615)------------------------------
% 2.91/1.29 % (990615)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.29 % (990615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.29 % (990615)CaDiCaL version: 2.1.3
% 2.91/1.29 % (990615)Termination reason: Refutation not found, incomplete strategy
% 2.91/1.29 % (990615)Time elapsed: 0.002 s
% 2.91/1.29 % (990615)Peak memory usage: 89 MB
% 2.91/1.29 % (990615)Instructions burned: 1 (million)
% 2.91/1.29 % (990614)First to succeed.
% 2.91/1.29 % (990614)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-990604"
% 2.91/1.29 % (990615)------------------------------
% 2.91/1.29 % (990615)------------------------------
% 2.91/1.29 % (990612)------------------------------
% 2.91/1.29 % (990612)------------------------------
% 2.91/1.29 % (990613)------------------------------
% 2.91/1.29 % (990613)------------------------------
% 2.91/1.29 % (990614)Refutation found. Thanks to Tanya!
% 2.91/1.29 % SZS status Theorem for theBenchmark
% 2.91/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.56/1.39 % (990614)------------------------------
% 3.56/1.39 % (990614)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.39 % (990614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.39 % (990614)CaDiCaL version: 2.1.3
% 3.56/1.39 % (990614)Termination reason: Refutation
% 3.56/1.39 % (990614)Time elapsed: 0.005 s
% 3.56/1.39 % (990614)Peak memory usage: 90 MB
% 3.56/1.39 % (990614)Instructions burned: 4 (million)
% 3.56/1.39 % (990614)------------------------------
% 3.56/1.39 % (990614)------------------------------
% 3.56/1.39 % (990604)Success in time 0.439 s
% 3.56/1.39 % Vampire exiting
%------------------------------------------------------------------------------