%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW963+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 : n018.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:16 PM UTC 2026
% Result : Theorem 0.10s 0.24s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 59 ( 22 unt; 4 def)
% Number of atoms : 126 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 133 ( 66 ~; 52 |; 5 &)
% ( 4 <=>; 6 =>; 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 : 17 ( 17 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,axiom,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax95) ).
fof(f99,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(constr_tuple_3_get_0x30(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax98) ).
fof(f134,axiom,
! [X0] :
( pred_attacker(tuple_client_B_out_6(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax133) ).
fof(f140,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_5(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax139) ).
fof(f142,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax141) ).
fof(f144,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax143) ).
fof(f162,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax161) ).
fof(f193,axiom,
! [X0,X1,X2,X3] :
( ( pred_eq_bitstring_bitstring(name_Nb(X0),constr_ecb_dec_1(X2,name_skB))
& pred_attacker(tuple_client_B_in_5(X2))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(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',ax192) ).
fof(f196,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f197,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f196]) ).
fof(f198,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f197]) ).
fof(f202,plain,
! [X0] :
( pred_attacker(constr_tuple_3_get_0x30(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f99]) ).
fof(f248,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_6(X0)) ),
inference(ennf_transformation,[],[f134]) ).
fof(f255,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f140]) ).
fof(f257,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f142]) ).
fof(f259,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f144]) ).
fof(f300,plain,
! [X0,X1,X2,X3] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_ecb_dec_1(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(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,[],[f193]) ).
fof(f301,plain,
! [X0,X1,X2,X3] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_ecb_dec_1(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(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,[],[f300]) ).
fof(f401,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f96]) ).
fof(f404,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(constr_tuple_3_get_0x30(X0)) ),
inference(cnf_transformation,[],[f202]) ).
fof(f439,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f445,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_5(X0)) ),
inference(cnf_transformation,[],[f255]) ).
fof(f447,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_3(X0)) ),
inference(cnf_transformation,[],[f257]) ).
fof(f449,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_2(X0)) ),
inference(cnf_transformation,[],[f259]) ).
fof(f467,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f162]) ).
fof(f497,plain,
! [X2,X3,X0,X1] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_ecb_dec_1(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(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(cnf_transformation,[],[f301]) ).
fof(f500,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f198]) ).
fof(f510,definition,
( spl0_1
<=> ! [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_2(X3)) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f511,plain,
( ! [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_2(X3)) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f510]) ).
fof(f513,definition,
( spl0_2
<=> ! [X1] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X1)) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f514,plain,
( ! [X1] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X1)) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f513]) ).
fof(f516,definition,
( spl0_3
<=> ! [X2,X0] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_ecb_dec_1(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2)) ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f517,plain,
( ! [X2,X0] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_ecb_dec_1(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2)) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f516]) ).
fof(f519,definition,
( spl0_4
<=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f521,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f519]) ).
fof(f522,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f497,f519,f516,f513,f510]) ).
fof(f523,plain,
( ! [X1] : ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f514,f401]) ).
fof(f560,plain,
pred_attacker(constr_tuple_3_get_0x30(constr_CONST_0x30)),
inference(resolution,[],[f404,f467]) ).
fof(f1151,plain,
pred_attacker(tuple_client_B_in_3(constr_CONST_0x30)),
inference(resolution,[],[f447,f467]) ).
fof(f1266,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f1151,f523]) ).
fof(f1267,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f1266]) ).
fof(f1268,plain,
( ! [X2] : ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f517,f401]) ).
fof(f1284,plain,
pred_attacker(tuple_client_B_in_5(constr_tuple_3_get_0x30(constr_CONST_0x30))),
inference(resolution,[],[f560,f445]) ).
fof(f1286,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f1284,f1268]) ).
fof(f1287,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f1286]) ).
fof(f1288,plain,
( pred_attacker(name_objective)
| ~ spl0_4 ),
inference(resolution,[],[f521,f439]) ).
fof(f1306,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f1288,f500]) ).
fof(f1307,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f1306]) ).
fof(f1308,plain,
( ! [X3] : ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f511,f401]) ).
fof(f1326,plain,
pred_attacker(tuple_client_B_in_2(constr_CONST_0x30)),
inference(resolution,[],[f449,f467]) ).
fof(f1447,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f1326,f1308]) ).
fof(f1448,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f1447]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f522]) ).
cnf(s40,plain,
~ spl0_2,
inference(sat_conversion,[],[f1267]) ).
cnf(s41,plain,
~ spl0_3,
inference(sat_conversion,[],[f1287]) ).
cnf(s42,plain,
~ spl0_4,
inference(sat_conversion,[],[f1307]) ).
cnf(s83,plain,
~ spl0_1,
inference(sat_conversion,[],[f1448]) ).
cnf(s84,plain,
$false,
inference(rat,[],[s1,s42,s41,s40,s83]) ).
fof(f1449,plain,
$false,
inference(avatar_sat_refutation,[],[s84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW963+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.16 % Computer : n018.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Mon Sep 28 14:51:40 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 Running first-order model finding
% 0.10/0.19 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.10/0.24 % (3447564)Will run a generic schedule for satisfiability detection.
% 0.10/0.24 % (3447574)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2547620982:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.24 % (3447570)% WARNING: option uhcvi not known.
% 0.10/0.24 % (3447570)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3824926966:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.24 % (3447571)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2693726998:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.24 % (3447572)dis+10_1_sil=32000:sp=arity:random_seed=1975878595:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.24 % (3447574) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3447564-3447574"...
% 0.10/0.24 % (3447573)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1940092166:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.24 % (3447575)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=673510685:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.24 % (3447574)...printing done.
% 0.10/0.24 % (3447574)Refutation found. Thanks to Tanya!
% 0.10/0.24 % SZS status Theorem for theBenchmark
% 0.10/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.24 % (3447574)------------------------------
% 0.10/0.24 % (3447574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.24 % (3447574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.24 % (3447574)CaDiCaL version: 2.1.3
% 0.10/0.24 % (3447574)Termination reason: Refutation
% 0.10/0.24 % (3447574)Time elapsed: 0.008 s
% 0.10/0.24 % (3447574)Peak memory usage: 13 MB
% 0.10/0.24 % (3447574)Instructions burned: 25 (million)
% 0.10/0.24 % (3447564)Success in time 0.041 s
% 0.10/0.24 % Vampire exiting
%------------------------------------------------------------------------------