%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW959+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 0.34s 2.15s
% Output : Refutation 0.34s
% 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/sandbox2/benchmark/theBenchmark.p',ax86) ).
fof(f114,axiom,
! [X0] :
( pred_attacker(tuple_client_B_out_6(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax113) ).
fof(f120,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_5(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax119) ).
fof(f122,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_3(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax121) ).
fof(f124,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_2(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax123) ).
fof(f144,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax165) ).
fof(f169,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/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_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,[],[f248]) ).
fof(f420,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f171]) ).
fof(f512,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(f513,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,[],[f512]) ).
fof(f515,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(f516,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,[],[f515]) ).
fof(f518,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(f519,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,[],[f518]) ).
fof(f521,definition,
( spl1_4
<=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f522,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f521]) ).
fof(f523,plain,
( spl1_1
| spl1_2
| spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f417,f521,f518,f515,f512]) ).
fof(f524,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_3(X0))
| ~ spl1_2 ),
inference(resolution,[],[f339,f516]) ).
fof(f535,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_2 ),
inference(resolution,[],[f374,f524]) ).
fof(f536,plain,
( $false
| ~ spl1_2 ),
inference(resolution,[],[f535,f396]) ).
fof(f589,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f536]) ).
fof(f590,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_5(X0))
| ~ spl1_3 ),
inference(resolution,[],[f519,f339]) ).
fof(f591,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_3 ),
inference(resolution,[],[f590,f372]) ).
fof(f592,plain,
( $false
| ~ spl1_3 ),
inference(resolution,[],[f591,f396]) ).
fof(f645,plain,
~ spl1_3,
inference(avatar_contradiction_clause,[],[f592]) ).
fof(f646,plain,
( pred_attacker(name_objective)
| ~ spl1_4 ),
inference(resolution,[],[f522,f366]) ).
fof(f647,plain,
( $false
| ~ spl1_4 ),
inference(resolution,[],[f646,f420]) ).
fof(f648,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f647]) ).
fof(f649,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_2(X0))
| ~ spl1_1 ),
inference(resolution,[],[f513,f339]) ).
fof(f651,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_1 ),
inference(resolution,[],[f376,f649]) ).
fof(f652,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f651,f396]) ).
fof(f706,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f652]) ).
cnf(s1,plain,
( spl1_1
| spl1_2
| spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f523]) ).
cnf(s21,plain,
~ spl1_2,
inference(sat_conversion,[],[f589]) ).
cnf(s41,plain,
~ spl1_3,
inference(sat_conversion,[],[f645]) ).
cnf(s42,plain,
~ spl1_4,
inference(sat_conversion,[],[f648]) ).
cnf(s62,plain,
~ spl1_1,
inference(sat_conversion,[],[f706]) ).
cnf(s63,plain,
$false,
inference(rat,[],[s1,s42,s41,s21,s62]) ).
fof(f707,plain,
$false,
inference(avatar_sat_refutation,[],[s63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWW959+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.30 % Computer : n011.cluster.edu
% 0.27/0.30 % Model : x86_64 x86_64
% 0.27/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.27/0.30 % Memory : 8046.5625MB
% 0.27/0.30 % OS : Linux 6.8.0-71-generic
% 0.27/0.30 % CPULimit : 300
% 0.27/0.30 % WCLimit : 300
% 0.27/0.30 % DateTime : Mon Sep 28 14:48:45 UTC 2026
% 0.27/0.31 % CPUTime :
% 0.27/0.31 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.36 Running first-order theorem proving
% 0.27/0.36 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.34/2.15 % (3440670)Detected formulas, will run a generic FOF schedule.
% 0.34/2.15 % (3440679)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=547670057:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.34/2.15 % (3440679)Refutation not found, incomplete strategy
% 0.34/2.15 % (3440679)------------------------------
% 0.34/2.15 % (3440679)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.34/2.15 % (3440679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/2.15 % (3440679)CaDiCaL version: 2.1.3
% 0.34/2.15 % (3440679)Termination reason: Refutation not found, incomplete strategy
% 0.34/2.15 % (3440679)Time elapsed: 0.001 s
% 0.34/2.15 % (3440679)Peak memory usage: 87 MB
% 0.34/2.15 % (3440679)Instructions burned: 1 (million)
% 0.34/2.15 % (3440675)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=3637229230:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.34/2.15 % (3440676)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=4047338425:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.34/2.15 % (3440677)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=2672397706:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.34/2.15 % (3440678)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2002260493:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.34/2.15 % (3440678)Refutation not found, incomplete strategy
% 0.34/2.15 % (3440678)------------------------------
% 0.34/2.15 % (3440678)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.34/2.15 % (3440678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/2.15 % (3440678)CaDiCaL version: 2.1.3
% 0.34/2.15 % (3440678)Termination reason: Refutation not found, incomplete strategy
% 0.34/2.15 % (3440678)Time elapsed: 0.002 s
% 0.34/2.15 % (3440678)Peak memory usage: 87 MB
% 0.34/2.15 % (3440680)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3238652016:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.34/2.15 % (3440681)dis-21_1_sil=8000:lcm=predicate:random_seed=3908354096: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)
% 0.34/2.15 % (3440681)First to succeed.
% 0.34/2.15 % (3440680)Also succeeded, but the first one will report.
% 0.34/2.15 % (3440681)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3440670"
% 0.34/2.15 % (3440679)------------------------------
% 0.34/2.15 % (3440679)------------------------------
% 0.34/2.15 % (3440678)------------------------------
% 0.34/2.15 % (3440678)------------------------------
% 0.34/2.15 % (3440681)Refutation found. Thanks to Tanya!
% 0.34/2.15 % SZS status Theorem for theBenchmark
% 0.34/2.15 % SZS output start Proof for theBenchmark
% See solution above
% 0.34/2.15 % (3440681)------------------------------
% 0.34/2.15 % (3440681)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.34/2.15 % (3440681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/2.15 % (3440681)CaDiCaL version: 2.1.3
% 0.34/2.15 % (3440681)Termination reason: Refutation
% 0.34/2.15 % (3440681)Time elapsed: 0.009 s
% 0.34/2.15 % (3440681)Peak memory usage: 89 MB
% 0.34/2.15 % (3440681)Instructions burned: 7 (million)
% 0.34/2.15 % (3440681)------------------------------
% 0.34/2.15 % (3440681)------------------------------
% 0.34/2.15 % (3440670)Success in time 0.718 s
% 0.34/2.15 % Vampire exiting
%------------------------------------------------------------------------------