%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW965+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 : n016.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 2.59s 0.94s
% Output : Refutation 2.59s
% 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(f104,axiom,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax103) ).
fof(f132,axiom,
! [X0] :
( pred_attacker(tuple_client_B_out_6(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax131) ).
fof(f138,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_5(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax137) ).
fof(f140,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax139) ).
fof(f142,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax141) ).
fof(f163,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax162) ).
fof(f185,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',ax184) ).
fof(f188,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f189,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f188]) ).
fof(f190,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f189]) ).
fof(f223,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_6(X0)) ),
inference(ennf_transformation,[],[f132]) ).
fof(f230,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f138]) ).
fof(f232,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f140]) ).
fof(f234,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f142]) ).
fof(f268,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,[],[f185]) ).
fof(f269,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,[],[f268]) ).
fof(f377,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f104]) ).
fof(f405,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f223]) ).
fof(f411,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f230]) ).
fof(f413,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f232]) ).
fof(f415,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f234]) ).
fof(f436,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f163]) ).
fof(f457,plain,
! [X2,X3,X0,X1] :
( 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(cnf_transformation,[],[f269]) ).
fof(f460,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f190]) ).
fof(f569,definition,
( spl1_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,[spl1_1])],[avatar_definition]) ).
fof(f570,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)) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f572,definition,
( spl1_2
<=> ! [X1] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X1)) ) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f573,plain,
( ! [X1] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X1)) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f572]) ).
fof(f575,definition,
( spl1_3
<=> ! [X2,X0] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2)) ) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f576,plain,
( ! [X2,X0] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2)) )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f575]) ).
fof(f578,definition,
( spl1_4
<=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f579,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f578]) ).
fof(f580,plain,
( spl1_1
| spl1_2
| spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f457,f578,f575,f572,f569]) ).
fof(f581,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_3(X0))
| ~ spl1_2 ),
inference(resolution,[],[f377,f573]) ).
fof(f592,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_2 ),
inference(resolution,[],[f413,f581]) ).
fof(f593,plain,
( $false
| ~ spl1_2 ),
inference(resolution,[],[f592,f436]) ).
fof(f648,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f593]) ).
fof(f649,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_5(X0))
| ~ spl1_3 ),
inference(resolution,[],[f576,f377]) ).
fof(f650,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_3 ),
inference(resolution,[],[f649,f411]) ).
fof(f651,plain,
( $false
| ~ spl1_3 ),
inference(resolution,[],[f650,f436]) ).
fof(f706,plain,
~ spl1_3,
inference(avatar_contradiction_clause,[],[f651]) ).
fof(f707,plain,
( pred_attacker(name_objective)
| ~ spl1_4 ),
inference(resolution,[],[f579,f405]) ).
fof(f708,plain,
( $false
| ~ spl1_4 ),
inference(resolution,[],[f707,f460]) ).
fof(f709,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f708]) ).
fof(f710,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_2(X0))
| ~ spl1_1 ),
inference(resolution,[],[f570,f377]) ).
fof(f712,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_1 ),
inference(resolution,[],[f415,f710]) ).
fof(f713,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f712,f436]) ).
fof(f769,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f713]) ).
cnf(s1,plain,
( spl1_1
| spl1_2
| spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f580]) ).
cnf(s22,plain,
~ spl1_2,
inference(sat_conversion,[],[f648]) ).
cnf(s43,plain,
~ spl1_3,
inference(sat_conversion,[],[f706]) ).
cnf(s44,plain,
~ spl1_4,
inference(sat_conversion,[],[f709]) ).
cnf(s65,plain,
~ spl1_1,
inference(sat_conversion,[],[f769]) ).
cnf(s66,plain,
$false,
inference(rat,[],[s1,s44,s43,s22,s65]) ).
fof(f770,plain,
$false,
inference(avatar_sat_refutation,[],[s66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW965+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.08/0.19 % Computer : n016.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:54:18 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.23 Running first-order theorem proving
% 0.08/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
% 2.59/0.94 % (3678772)Detected formulas, will run a generic FOF schedule.
% 2.59/0.94 % (3678783)dis-21_1_sil=8000:lcm=predicate:random_seed=1541555196: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.59/0.94 % (3678783)First to succeed.
% 2.59/0.94 % (3678783)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3678772"
% 2.59/0.94 % (3678779)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=2041729410:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.59/0.94 % (3678781)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=246657372:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.59/0.94 % (3678782)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1094080881:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.59/0.94 % (3678778)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=1062087466:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.59/0.94 % (3678777)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=1580146119:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.59/0.94 % (3678780)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1289098673:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.59/0.94 % (3678780)Refutation not found, incomplete strategy
% 2.59/0.94 % (3678780)------------------------------
% 2.59/0.94 % (3678780)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/0.94 % (3678780)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/0.94 % (3678780)CaDiCaL version: 2.1.3
% 2.59/0.94 % (3678780)Termination reason: Refutation not found, incomplete strategy
% 2.59/0.94 % (3678780)Time elapsed: 0.001 s
% 2.59/0.94 % (3678780)Peak memory usage: 87 MB
% 2.59/0.94 % (3678781)Refutation not found, incomplete strategy
% 2.59/0.94 % (3678781)------------------------------
% 2.59/0.94 % (3678781)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/0.94 % (3678781)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/0.94 % (3678781)CaDiCaL version: 2.1.3
% 2.59/0.94 % (3678781)Termination reason: Refutation not found, incomplete strategy
% 2.59/0.94 % (3678781)Time elapsed: 0.002 s
% 2.59/0.94 % (3678781)Peak memory usage: 87 MB
% 2.59/0.94 % (3678781)Instructions burned: 1 (million)
% 2.59/0.94 % (3678782)Also succeeded, but the first one will report.
% 2.59/0.94 % (3678783)Refutation found. Thanks to Tanya!
% 2.59/0.94 % SZS status Theorem for theBenchmark
% 2.59/0.94 % SZS output start Proof for theBenchmark
% See solution above
% 2.59/0.94 % (3678783)------------------------------
% 2.59/0.94 % (3678783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/0.94 % (3678783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/0.94 % (3678783)CaDiCaL version: 2.1.3
% 2.59/0.94 % (3678783)Termination reason: Refutation
% 2.59/0.94 % (3678783)Time elapsed: 0.003 s
% 2.59/0.94 % (3678783)Peak memory usage: 89 MB
% 2.59/0.94 % (3678783)Instructions burned: 8 (million)
% 2.59/0.94 % (3678783)------------------------------
% 2.59/0.94 % (3678783)------------------------------
% 2.59/0.94 % (3678772)Success in time 0.309 s
% 2.59/0.94 % Vampire exiting
%------------------------------------------------------------------------------