%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW959+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 : Tue Sep 29 01:45:15 PM UTC 2026
% Result : Theorem 0.08s 0.16s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 18 unt; 4 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 137 ( 70 ~; 53 |; 5 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f87,axiom,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax86) ).
fof(f114,axiom,
! [X0] :
( pred_attacker(tuple_client_B_out_6(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax113) ).
fof(f120,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_5(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax119) ).
fof(f122,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax121) ).
fof(f124,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax123) ).
fof(f144,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax143) ).
fof(f166,axiom,
! [X0,X1,X2,X3] :
( ( pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
& pred_attacker(tuple_client_B_in_5(X2))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
& pred_attacker(tuple_client_B_in_3(X1))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_2(X3)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax165) ).
fof(f169,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f170,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f169]) ).
fof(f171,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f170]) ).
fof(f202,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_6(X0)) ),
inference(ennf_transformation,[],[f114]) ).
fof(f209,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f120]) ).
fof(f211,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f122]) ).
fof(f213,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f124]) ).
fof(f247,plain,
! [X0,X1,X2,X3] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X3)) ),
inference(ennf_transformation,[],[f166]) ).
fof(f248,plain,
! [X0,X1,X2,X3] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X3)) ),
inference(flattening,[],[f247]) ).
fof(f339,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f87]) ).
fof(f366,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f372,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f209]) ).
fof(f374,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f211]) ).
fof(f376,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f213]) ).
fof(f396,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f144]) ).
fof(f417,plain,
! [X2,X3,X0,X1] :
( ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(cnf_transformation,[],[f248]) ).
fof(f420,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f171]) ).
fof(f422,definition,
( spl0_1
<=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f424,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f422]) ).
fof(f426,definition,
( spl0_2
<=> ! [X2,X0] :
( ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f427,plain,
( ! [X2,X0] :
( ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f426]) ).
fof(f429,definition,
( spl0_3
<=> ! [X1] :
( ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB))) ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f430,plain,
( ! [X1] :
( ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB))) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f429]) ).
fof(f432,definition,
( spl0_4
<=> ! [X3] :
( ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS)))) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f433,plain,
( ! [X3] :
( ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS)))) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f432]) ).
fof(f434,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f417,f432,f429,f426,f422]) ).
fof(f435,plain,
( ! [X2] : ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f427,f339]) ).
fof(f445,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_2 ),
inference(resolution,[],[f372,f435]) ).
fof(f446,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f445,f396]) ).
fof(f498,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f446]) ).
fof(f499,plain,
( ! [X1] : ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f430,f339]) ).
fof(f501,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_3 ),
inference(resolution,[],[f374,f499]) ).
fof(f502,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f501,f396]) ).
fof(f555,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f502]) ).
fof(f556,plain,
( ! [X3] : ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f433,f339]) ).
fof(f558,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_4 ),
inference(resolution,[],[f376,f556]) ).
fof(f559,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f558,f396]) ).
fof(f613,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f559]) ).
fof(f614,plain,
( pred_attacker(name_objective)
| ~ spl0_1 ),
inference(resolution,[],[f424,f366]) ).
fof(f615,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f614,f420]) ).
fof(f616,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f615]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f434]) ).
cnf(s21,plain,
~ spl0_2,
inference(sat_conversion,[],[f498]) ).
cnf(s41,plain,
~ spl0_3,
inference(sat_conversion,[],[f555]) ).
cnf(s61,plain,
~ spl0_4,
inference(sat_conversion,[],[f613]) ).
cnf(s62,plain,
~ spl0_1,
inference(sat_conversion,[],[f616]) ).
cnf(s63,plain,
$false,
inference(rat,[],[s1,s61,s41,s21,s62]) ).
fof(f617,plain,
$false,
inference(avatar_sat_refutation,[],[s63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWW959+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 14:48:19 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12 Running first-order model finding
% 0.08/0.12 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.16 % (3430037)Will run a generic schedule for satisfiability detection.
% 0.08/0.16 % (3430043)% WARNING: option uhcvi not known.
% 0.08/0.16 % (3430042)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3263201384_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16 % (3430043)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4021995874:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16 % (3430044)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=497840118:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16 % (3430045)dis+10_1_sil=32000:sp=arity:random_seed=3981076953:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16 % (3430046)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=385412495:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16 % (3430047)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1586222731:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.16 % (3430048)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3132455616:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16 % (3430046) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3430037-3430046"...
% 0.08/0.16 % (3430045) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3430037-3430045"...
% 0.08/0.16 % Detected minimum model sizes of [13]
% 0.08/0.16 % Detected maximum model sizes of [max]
% 0.08/0.16 % TRYING [13]
% 0.08/0.16 % (3430046)...printing done.
% 0.08/0.16 % (3430045)...printing done.
% 0.08/0.16 % (3430046)Refutation found. Thanks to Tanya!
% 0.08/0.16 % SZS status Theorem for theBenchmark
% 0.08/0.16 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.16 % (3430046)------------------------------
% 0.08/0.16 % (3430046)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16 % (3430046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16 % (3430046)CaDiCaL version: 2.1.3
% 0.08/0.16 % (3430046)Termination reason: Refutation
% 0.08/0.16 % (3430046)Time elapsed: 0.003 s
% 0.08/0.16 % (3430046)Peak memory usage: 12 MB
% 0.08/0.16 % (3430046)Instructions burned: 9 (million)
% 0.08/0.16 % (3430037)Success in time 0.039 s
% 0.08/0.16 % Vampire exiting
%------------------------------------------------------------------------------