%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW967+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 01:38:07 PM UTC 2026
% Result : Theorem 0.67s 0.95s
% Output : Refutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 70 ( 21 unt; 6 def)
% Number of atoms : 180 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 225 ( 115 ~; 91 |; 7 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-3 aty)
% Number of variables : 71 ( 0 sgn 71 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,axiom,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f110,axiom,
! [X0] :
( pred_attacker(tuple_client_A_out_9(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax109) ).
fof(f121,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_A_in_8(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax120) ).
fof(f123,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_A_in_6(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax122) ).
fof(f125,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_A_in_4(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax124) ).
fof(f127,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_A_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax126) ).
fof(f147,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax146) ).
fof(f172,axiom,
! [X0,X1,X2,X3,X4] :
( ( pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
& pred_attacker(tuple_client_A_in_8(X4))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
& pred_attacker(tuple_client_A_in_6(X1))
& pred_attacker(tuple_client_A_in_4(X3))
& pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
& pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
& pred_attacker(tuple_client_A_in_2(X2)) )
=> pred_attacker(tuple_client_A_out_9(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax171) ).
fof(f175,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f176,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f175]) ).
fof(f177,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f176]) ).
fof(f205,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_A_out_9(X0)) ),
inference(ennf_transformation,[],[f110]) ).
fof(f217,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_8(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f121]) ).
fof(f219,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_6(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f123]) ).
fof(f221,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_4(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f125]) ).
fof(f223,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f127]) ).
fof(f272,plain,
! [X0,X1,X2,X3,X4] :
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(tuple_client_A_in_4(X3))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(ennf_transformation,[],[f172]) ).
fof(f273,plain,
! [X0,X1,X2,X3,X4] :
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(tuple_client_A_in_4(X3))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(flattening,[],[f272]) ).
fof(f360,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f84]) ).
fof(f386,plain,
! [X0] :
( ~ pred_attacker(tuple_client_A_out_9(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f205]) ).
fof(f397,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_8(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f217]) ).
fof(f399,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_6(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f219]) ).
fof(f401,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_4(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f221]) ).
fof(f403,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f223]) ).
fof(f423,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f147]) ).
fof(f447,plain,
! [X2,X3,X0,X1,X4] :
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(tuple_client_A_in_4(X3))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(cnf_transformation,[],[f273]) ).
fof(f450,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f177]) ).
fof(f538,definition,
( spl1_1
<=> ! [X2,X4,X0,X3,X1] :
( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_2(X2))
| ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_4(X3))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_8(X4)) ) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f539,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_2(X2))
| ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_4(X3))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_8(X4)) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f538]) ).
fof(f541,definition,
( spl1_2
<=> pred_attacker(tuple_client_A_out_9(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f542,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f543,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f447,f541,f538]) ).
fof(f549,plain,
( pred_attacker(name_objective)
| ~ spl1_2 ),
inference(resolution,[],[f386,f542]) ).
fof(f551,plain,
( $false
| ~ spl1_2 ),
inference(resolution,[],[f549,f450]) ).
fof(f552,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f551]) ).
fof(f553,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_eq_bitstring_bitstring(name_Na(X1),constr_tuple_4_get_0x30(constr_cbc_dec_4(X0,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X0,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_4(X2))
| ~ pred_attacker(tuple_client_A_in_6(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X3,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_8(X4)) )
| ~ spl1_1 ),
inference(resolution,[],[f539,f360]) ).
fof(f555,definition,
( spl1_3
<=> ! [X4] : ~ pred_attacker(tuple_client_A_in_8(X4)) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f556,plain,
( ! [X4] : ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f555]) ).
fof(f558,definition,
( spl1_4
<=> ! [X3] :
( ~ pred_attacker(tuple_client_A_in_6(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X3,name_Kas))) ) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f559,plain,
( ! [X3] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X3,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X3)) )
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f558]) ).
fof(f561,definition,
( spl1_5
<=> ! [X2] : ~ pred_attacker(tuple_client_A_in_4(X2)) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f562,plain,
( ! [X2] : ~ pred_attacker(tuple_client_A_in_4(X2))
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f561]) ).
fof(f564,definition,
( spl1_6
<=> ! [X0,X1] :
( ~ pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X0,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X1),constr_tuple_4_get_0x30(constr_cbc_dec_4(X0,name_Kas))) ) ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f565,plain,
( ! [X0,X1] :
( ~ pred_eq_bitstring_bitstring(name_Na(X1),constr_tuple_4_get_0x30(constr_cbc_dec_4(X0,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X0,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X0)) )
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f564]) ).
fof(f566,plain,
( spl1_3
| spl1_4
| spl1_5
| spl1_6
| ~ spl1_1 ),
inference(avatar_split_clause,[],[f553,f538,f564,f561,f558,f555]) ).
fof(f567,plain,
( ! [X0] : ~ pred_attacker(tuple_client_A_in_6(X0))
| ~ spl1_4 ),
inference(resolution,[],[f559,f360]) ).
fof(f572,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_4 ),
inference(resolution,[],[f399,f567]) ).
fof(f573,plain,
( $false
| ~ spl1_4 ),
inference(resolution,[],[f572,f423]) ).
fof(f613,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f573]) ).
fof(f615,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_5 ),
inference(resolution,[],[f401,f562]) ).
fof(f616,plain,
( $false
| ~ spl1_5 ),
inference(resolution,[],[f615,f423]) ).
fof(f657,plain,
~ spl1_5,
inference(avatar_contradiction_clause,[],[f616]) ).
fof(f658,plain,
( ! [X0] :
( ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X0,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X0)) )
| ~ spl1_6 ),
inference(resolution,[],[f565,f360]) ).
fof(f660,plain,
( ! [X0] : ~ pred_attacker(tuple_client_A_in_2(X0))
| ~ spl1_6 ),
inference(resolution,[],[f658,f360]) ).
fof(f661,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_6 ),
inference(resolution,[],[f403,f660]) ).
fof(f662,plain,
( $false
| ~ spl1_6 ),
inference(resolution,[],[f661,f423]) ).
fof(f704,plain,
~ spl1_6,
inference(avatar_contradiction_clause,[],[f662]) ).
fof(f705,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_3 ),
inference(resolution,[],[f556,f397]) ).
fof(f706,plain,
( $false
| ~ spl1_3 ),
inference(resolution,[],[f705,f423]) ).
fof(f748,plain,
~ spl1_3,
inference(avatar_contradiction_clause,[],[f706]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f543]) ).
cnf(s2,plain,
~ spl1_2,
inference(sat_conversion,[],[f552]) ).
cnf(s3,plain,
( ~ spl1_1
| spl1_3
| spl1_4
| spl1_5
| spl1_6 ),
inference(sat_conversion,[],[f566]) ).
cnf(s15,plain,
~ spl1_4,
inference(sat_conversion,[],[f613]) ).
cnf(s27,plain,
~ spl1_5,
inference(sat_conversion,[],[f657]) ).
cnf(s39,plain,
~ spl1_6,
inference(sat_conversion,[],[f704]) ).
cnf(s51,plain,
~ spl1_3,
inference(sat_conversion,[],[f748]) ).
cnf(s52,plain,
~ spl1_1,
inference(rat,[],[s3,s39,s27,s15,s51]) ).
cnf(s53,plain,
$false,
inference(rat,[],[s1,s2,s52]) ).
fof(f749,plain,
$false,
inference(avatar_sat_refutation,[],[s53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW967+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n026.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 : Mon Sep 28 14:51:57 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.23 Running first-order theorem proving
% 0.09/0.23 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
% 0.67/0.95 % (3902418)Detected formulas, will run a generic FOF schedule.
% 0.67/0.95 % (3902429)dis-21_1_sil=8000:lcm=predicate:random_seed=1097610991: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)
% 0.67/0.95 % (3902429)First to succeed.
% 0.67/0.95 % (3902429)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3902418"
% 0.67/0.95 % (3902423)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=2376951216:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.67/0.95 % (3902424)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=3185746706:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.67/0.95 % (3902426)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1963782730:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.67/0.95 % (3902425)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=3931163054:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.67/0.95 % (3902426)Refutation not found, incomplete strategy
% 0.67/0.95 % (3902426)------------------------------
% 0.67/0.95 % (3902426)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.67/0.95 % (3902426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.67/0.95 % (3902426)CaDiCaL version: 2.1.3
% 0.67/0.95 % (3902426)Termination reason: Refutation not found, incomplete strategy
% 0.67/0.95 % (3902426)Time elapsed: 0.001 s
% 0.67/0.95 % (3902426)Peak memory usage: 87 MB
% 0.67/0.95 % (3902427)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1956340377:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.67/0.95 % (3902428)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2618523887:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.67/0.95 % (3902427)Refutation not found, incomplete strategy
% 0.67/0.95 % (3902427)------------------------------
% 0.67/0.95 % (3902427)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.67/0.95 % (3902427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.67/0.95 % (3902427)CaDiCaL version: 2.1.3
% 0.67/0.95 % (3902427)Termination reason: Refutation not found, incomplete strategy
% 0.67/0.95 % (3902427)Time elapsed: 0.001 s
% 0.67/0.95 % (3902427)Peak memory usage: 87 MB
% 0.67/0.95 % (3902427)Instructions burned: 1 (million)
% 0.67/0.95 % (3902428)Also succeeded, but the first one will report.
% 0.67/0.95 % (3902429)Refutation found. Thanks to Tanya!
% 0.67/0.95 % SZS status Theorem for theBenchmark
% 0.67/0.95 % SZS output start Proof for theBenchmark
% See solution above
% 2.62/1.14 % (3902429)------------------------------
% 2.62/1.14 % (3902429)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.14 % (3902429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.14 % (3902429)CaDiCaL version: 2.1.3
% 2.62/1.14 % (3902429)Termination reason: Refutation
% 2.62/1.14 % (3902429)Time elapsed: 0.003 s
% 2.62/1.14 % (3902429)Peak memory usage: 89 MB
% 2.62/1.14 % (3902429)Instructions burned: 8 (million)
% 2.62/1.14 % (3902429)------------------------------
% 2.62/1.14 % (3902429)------------------------------
% 2.62/1.14 % (3902418)Success in time 0.275 s
% 2.62/1.14 % Vampire exiting
%------------------------------------------------------------------------------