%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW961+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:06 PM UTC 2026
% Result : Theorem 2.62s 1.15s
% Output : Refutation 2.62s
% 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(f90,axiom,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax89) ).
fof(f115,axiom,
! [X0] :
( pred_attacker(tuple_client_B_out_6(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax114) ).
fof(f121,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_5(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax120) ).
fof(f123,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax122) ).
fof(f125,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax124) ).
fof(f152,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax151) ).
fof(f174,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_assoc_pair_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',ax173) ).
fof(f177,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f178,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f177]) ).
fof(f179,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f178]) ).
fof(f208,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_6(X0)) ),
inference(ennf_transformation,[],[f115]) ).
fof(f215,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f121]) ).
fof(f217,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f123]) ).
fof(f219,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f125]) ).
fof(f261,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_assoc_pair_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,[],[f174]) ).
fof(f262,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_assoc_pair_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,[],[f261]) ).
fof(f356,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f90]) ).
fof(f381,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f208]) ).
fof(f387,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f215]) ).
fof(f389,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f217]) ).
fof(f391,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f219]) ).
fof(f418,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f152]) ).
fof(f439,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_assoc_pair_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,[],[f262]) ).
fof(f442,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f179]) ).
fof(f537,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(f538,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,[],[f537]) ).
fof(f540,definition,
( spl1_2
<=> ! [X1] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_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(f541,plain,
( ! [X1] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X1)) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f540]) ).
fof(f543,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(f544,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,[],[f543]) ).
fof(f546,definition,
( spl1_4
<=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f547,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f546]) ).
fof(f548,plain,
( spl1_1
| spl1_2
| spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f439,f546,f543,f540,f537]) ).
fof(f549,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_3(X0))
| ~ spl1_2 ),
inference(resolution,[],[f356,f541]) ).
fof(f560,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_2 ),
inference(resolution,[],[f389,f549]) ).
fof(f561,plain,
( $false
| ~ spl1_2 ),
inference(resolution,[],[f560,f418]) ).
fof(f612,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f561]) ).
fof(f613,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_5(X0))
| ~ spl1_3 ),
inference(resolution,[],[f544,f356]) ).
fof(f614,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_3 ),
inference(resolution,[],[f613,f387]) ).
fof(f615,plain,
( $false
| ~ spl1_3 ),
inference(resolution,[],[f614,f418]) ).
fof(f666,plain,
~ spl1_3,
inference(avatar_contradiction_clause,[],[f615]) ).
fof(f667,plain,
( pred_attacker(name_objective)
| ~ spl1_4 ),
inference(resolution,[],[f547,f381]) ).
fof(f668,plain,
( $false
| ~ spl1_4 ),
inference(resolution,[],[f667,f442]) ).
fof(f669,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f668]) ).
fof(f670,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_2(X0))
| ~ spl1_1 ),
inference(resolution,[],[f538,f356]) ).
fof(f672,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_1 ),
inference(resolution,[],[f391,f670]) ).
fof(f673,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f672,f418]) ).
fof(f725,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f673]) ).
cnf(s1,plain,
( spl1_1
| spl1_2
| spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f548]) ).
cnf(s21,plain,
~ spl1_2,
inference(sat_conversion,[],[f612]) ).
cnf(s41,plain,
~ spl1_3,
inference(sat_conversion,[],[f666]) ).
cnf(s42,plain,
~ spl1_4,
inference(sat_conversion,[],[f669]) ).
cnf(s62,plain,
~ spl1_1,
inference(sat_conversion,[],[f725]) ).
cnf(s63,plain,
$false,
inference(rat,[],[s1,s42,s41,s21,s62]) ).
fof(f726,plain,
$false,
inference(avatar_sat_refutation,[],[s63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW961+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.10/0.19 % Computer : n026.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Mon Sep 28 14:51:42 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running first-order theorem proving
% 0.10/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.62/1.15 % (3901851)Detected formulas, will run a generic FOF schedule.
% 2.62/1.15 % (3901862)dis-21_1_sil=8000:lcm=predicate:random_seed=712116186: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.62/1.15 % (3901862)First to succeed.
% 2.62/1.15 % (3901862)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3901851"
% 2.62/1.15 % (3901856)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=1449732246:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.62/1.15 % (3901861)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1174913717:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.62/1.15 % (3901857)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=756782476:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.62/1.15 % (3901859)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1933419266:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.62/1.15 % (3901858)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=3876427259:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.62/1.15 % (3901859)Refutation not found, incomplete strategy
% 2.62/1.15 % (3901859)------------------------------
% 2.62/1.15 % (3901859)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.15 % (3901859)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.15 % (3901859)CaDiCaL version: 2.1.3
% 2.62/1.15 % (3901859)Termination reason: Refutation not found, incomplete strategy
% 2.62/1.15 % (3901859)Time elapsed: 0.001 s
% 2.62/1.15 % (3901859)Peak memory usage: 87 MB
% 2.62/1.15 % (3901861)Also succeeded, but the first one will report.
% 2.62/1.15 % (3901860)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1542656004:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.62/1.15 % (3901860)Refutation not found, incomplete strategy
% 2.62/1.15 % (3901860)------------------------------
% 2.62/1.15 % (3901860)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.15 % (3901860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.15 % (3901860)CaDiCaL version: 2.1.3
% 2.62/1.15 % (3901860)Termination reason: Refutation not found, incomplete strategy
% 2.62/1.15 % (3901860)Time elapsed: 0.001 s
% 2.62/1.15 % (3901860)Peak memory usage: 87 MB
% 2.62/1.15 % (3901860)Instructions burned: 1 (million)
% 2.62/1.15 % (3901862)Refutation found. Thanks to Tanya!
% 2.62/1.15 % SZS status Theorem for theBenchmark
% 2.62/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 2.62/1.15 % (3901862)------------------------------
% 2.62/1.15 % (3901862)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.15 % (3901862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.15 % (3901862)CaDiCaL version: 2.1.3
% 2.62/1.15 % (3901862)Termination reason: Refutation
% 2.62/1.15 % (3901862)Time elapsed: 0.003 s
% 2.62/1.15 % (3901862)Peak memory usage: 89 MB
% 2.62/1.15 % (3901862)Instructions burned: 7 (million)
% 2.62/1.15 % (3901862)------------------------------
% 2.62/1.15 % (3901862)------------------------------
% 2.62/1.15 % (3901851)Success in time 0.277 s
% 2.62/1.15 % Vampire exiting
%------------------------------------------------------------------------------