%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n020.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.19s 0.28s
% Output : Refutation 0.19s
% 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_in_2(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_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(cnf_transformation,[],[f269]) ).
fof(f460,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f190]) ).
fof(f462,definition,
( spl0_1
<=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f464,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f462]) ).
fof(f466,definition,
( spl0_2
<=> ! [X2,X0] :
( ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f467,plain,
( ! [X2,X0] :
( ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f466]) ).
fof(f469,definition,
( spl0_3
<=> ! [X1] :
( ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB))) ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f470,plain,
( ! [X1] :
( ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB))) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f469]) ).
fof(f472,definition,
( spl0_4
<=> ! [X3] :
( ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS)))) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f473,plain,
( ! [X3] :
( ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS)))) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f474,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f457,f472,f469,f466,f462]) ).
fof(f475,plain,
( ! [X2] : ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f467,f377]) ).
fof(f485,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_2 ),
inference(resolution,[],[f411,f475]) ).
fof(f486,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f485,f436]) ).
fof(f540,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f486]) ).
fof(f541,plain,
( ! [X1] : ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f470,f377]) ).
fof(f543,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_3 ),
inference(resolution,[],[f413,f541]) ).
fof(f544,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f543,f436]) ).
fof(f599,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f544]) ).
fof(f600,plain,
( ! [X3] : ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f473,f377]) ).
fof(f602,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_4 ),
inference(resolution,[],[f415,f600]) ).
fof(f603,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f602,f436]) ).
fof(f659,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f603]) ).
fof(f660,plain,
( pred_attacker(name_objective)
| ~ spl0_1 ),
inference(resolution,[],[f464,f405]) ).
fof(f661,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f660,f460]) ).
fof(f662,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f661]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f474]) ).
cnf(s22,plain,
~ spl0_2,
inference(sat_conversion,[],[f540]) ).
cnf(s43,plain,
~ spl0_3,
inference(sat_conversion,[],[f599]) ).
cnf(s64,plain,
~ spl0_4,
inference(sat_conversion,[],[f659]) ).
cnf(s65,plain,
~ spl0_1,
inference(sat_conversion,[],[f662]) ).
cnf(s66,plain,
$false,
inference(rat,[],[s1,s64,s43,s22,s65]) ).
fof(f663,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 SAT
% 0.08/0.19 % Computer : n020.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:50:19 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.19/0.28 % (216098)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (216107)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3607852295:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % (216104)% WARNING: option uhcvi not known.
% 0.19/0.28 % (216107) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-216098-216107"...
% 0.19/0.28 % (216107)...printing done.
% 0.19/0.28 % (216107)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (216107)------------------------------
% 0.19/0.28 % (216107)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (216107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (216107)CaDiCaL version: 2.1.3
% 0.19/0.28 % (216107)Termination reason: Refutation
% 0.19/0.28 % (216107)Time elapsed: 0.004 s
% 0.19/0.28 % (216107)Peak memory usage: 13 MB
% 0.19/0.28 % (216107)Instructions burned: 10 (million)
% 0.19/0.28 % (216098)Success in time 0.037 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------