%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n002.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:06 PM UTC 2026
% Result : Theorem 3.48s 1.25s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 18 unt; 4 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 139 ( 71 ~; 54 |; 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 : 16 ( 16 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(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(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(f439,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f445,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f255]) ).
fof(f447,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f257]) ).
fof(f449,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(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(f502,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(f503,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,[],[f502]) ).
fof(f505,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(f506,plain,
( ! [X1] :
( ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X1,name_skB))) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f505]) ).
fof(f508,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(f509,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,[],[f508]) ).
fof(f511,definition,
( spl0_4
<=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f513,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f511]) ).
fof(f514,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f497,f511,f508,f505,f502]) ).
fof(f517,plain,
( ! [X0] :
( ~ pred_attacker(X0)
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X0,name_skB))) )
| ~ spl0_2 ),
inference(resolution,[],[f447,f506]) ).
fof(f518,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f517,f401]) ).
fof(f519,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f518,f467]) ).
fof(f558,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f519]) ).
fof(f559,plain,
( ! [X2] : ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f509,f401]) ).
fof(f560,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_3 ),
inference(resolution,[],[f559,f445]) ).
fof(f561,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f560,f467]) ).
fof(f600,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f561]) ).
fof(f601,plain,
( pred_attacker(name_objective)
| ~ spl0_4 ),
inference(resolution,[],[f513,f439]) ).
fof(f602,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f601,f500]) ).
fof(f603,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f602]) ).
fof(f604,plain,
( ! [X3] : ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f503,f401]) ).
fof(f607,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f449,f604]) ).
fof(f608,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f607,f467]) ).
fof(f647,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f608]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f514]) ).
cnf(s18,plain,
~ spl0_2,
inference(sat_conversion,[],[f558]) ).
cnf(s35,plain,
~ spl0_3,
inference(sat_conversion,[],[f600]) ).
cnf(s36,plain,
~ spl0_4,
inference(sat_conversion,[],[f603]) ).
cnf(s53,plain,
~ spl0_1,
inference(sat_conversion,[],[f647]) ).
cnf(s54,plain,
$false,
inference(rat,[],[s1,s36,s35,s18,s53]) ).
fof(f648,plain,
$false,
inference(avatar_sat_refutation,[],[s54]) ).
%------------------------------------------------------------------------------
%----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 THM
% 0.08/0.19 % Computer : n002.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 14:51:52 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 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
% 3.48/1.25 % (401876)Detected formulas, will run a generic FOF schedule.
% 3.48/1.25 % (401882)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=3119834047:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.48/1.25 % (401885)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2606617639:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.48/1.25 % (401883)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=2553195307:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.48/1.25 % (401884)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4008445804:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.48/1.25 % (401881)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=3442504357:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.48/1.25 % (401886)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=982458616:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.48/1.25 % (401884)Refutation not found, incomplete strategy
% 3.48/1.25 % (401884)------------------------------
% 3.48/1.25 % (401884)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.25 % (401884)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.25 % (401884)CaDiCaL version: 2.1.3
% 3.48/1.25 % (401884)Termination reason: Refutation not found, incomplete strategy
% 3.48/1.25 % (401884)Time elapsed: 0.001 s
% 3.48/1.25 % (401884)Peak memory usage: 87 MB
% 3.48/1.25 % (401885)Refutation not found, incomplete strategy
% 3.48/1.25 % (401885)------------------------------
% 3.48/1.25 % (401885)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.25 % (401885)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.25 % (401885)CaDiCaL version: 2.1.3
% 3.48/1.25 % (401885)Termination reason: Refutation not found, incomplete strategy
% 3.48/1.25 % (401885)Time elapsed: 0.001 s
% 3.48/1.25 % (401885)Peak memory usage: 87 MB
% 3.48/1.25 % (401885)Instructions burned: 1 (million)
% 3.48/1.25 % (401886)First to succeed.
% 3.48/1.25 % (401886)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-401876"
% 3.48/1.25 % (401887)dis-21_1_sil=8000:lcm=predicate:random_seed=84277140: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)
% 3.48/1.25 % (401887)Also succeeded, but the first one will report.
% 3.48/1.25 % (401884)------------------------------
% 3.48/1.25 % (401884)------------------------------
% 3.48/1.25 % (401885)------------------------------
% 3.48/1.25 % (401885)------------------------------
% 3.48/1.25 % (401886)Refutation found. Thanks to Tanya!
% 3.48/1.25 % SZS status Theorem for theBenchmark
% 3.48/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.25 % (401886)------------------------------
% 3.48/1.25 % (401886)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.25 % (401886)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.25 % (401886)CaDiCaL version: 2.1.3
% 3.48/1.25 % (401886)Termination reason: Refutation
% 3.48/1.25 % (401886)Time elapsed: 0.006 s
% 3.48/1.25 % (401886)Peak memory usage: 89 MB
% 3.48/1.25 % (401886)Instructions burned: 9 (million)
% 3.48/1.25 % (401886)------------------------------
% 3.48/1.25 % (401886)------------------------------
% 3.48/1.25 % (401876)Success in time 0.41 s
% 3.48/1.25 % Vampire exiting
%------------------------------------------------------------------------------