%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n015.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:15 PM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% 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_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_assoc_pair_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,[],[f262]) ).
fof(f442,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f179]) ).
fof(f444,definition,
( spl0_1
<=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f446,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f444]) ).
fof(f448,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(f449,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,[],[f448]) ).
fof(f451,definition,
( spl0_3
<=> ! [X1] :
( ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(X1,name_skB))) ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f452,plain,
( ! [X1] :
( ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(X1,name_skB))) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f451]) ).
fof(f454,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(f455,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,[],[f454]) ).
fof(f456,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f439,f454,f451,f448,f444]) ).
fof(f457,plain,
( ! [X2] : ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f449,f356]) ).
fof(f467,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_2 ),
inference(resolution,[],[f387,f457]) ).
fof(f468,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f467,f418]) ).
fof(f518,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f468]) ).
fof(f519,plain,
( ! [X1] : ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f452,f356]) ).
fof(f521,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_3 ),
inference(resolution,[],[f389,f519]) ).
fof(f522,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f521,f418]) ).
fof(f573,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f522]) ).
fof(f574,plain,
( ! [X3] : ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f455,f356]) ).
fof(f576,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_4 ),
inference(resolution,[],[f391,f574]) ).
fof(f577,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f576,f418]) ).
fof(f629,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f577]) ).
fof(f630,plain,
( pred_attacker(name_objective)
| ~ spl0_1 ),
inference(resolution,[],[f446,f381]) ).
fof(f631,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f630,f442]) ).
fof(f632,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f631]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f456]) ).
cnf(s21,plain,
~ spl0_2,
inference(sat_conversion,[],[f518]) ).
cnf(s41,plain,
~ spl0_3,
inference(sat_conversion,[],[f573]) ).
cnf(s61,plain,
~ spl0_4,
inference(sat_conversion,[],[f629]) ).
cnf(s62,plain,
~ spl0_1,
inference(sat_conversion,[],[f632]) ).
cnf(s63,plain,
$false,
inference(rat,[],[s1,s61,s41,s21,s62]) ).
fof(f633,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 SAT
% 0.09/0.18 % Computer : n015.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 14:52:17 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.09/0.26 % (2689972)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (2689981)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1570794580:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.26 % (2689978)% WARNING: option uhcvi not known.
% 0.09/0.26 % (2689981) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2689972-2689981"...
% 0.09/0.26 % (2689981)...printing done.
% 0.09/0.26 % (2689981)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (2689981)------------------------------
% 0.09/0.26 % (2689981)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (2689981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (2689981)CaDiCaL version: 2.1.3
% 0.09/0.26 % (2689981)Termination reason: Refutation
% 0.09/0.26 % (2689981)Time elapsed: 0.004 s
% 0.09/0.26 % (2689981)Peak memory usage: 12 MB
% 0.09/0.26 % (2689981)Instructions burned: 10 (million)
% 0.09/0.26 % (2689972)Success in time 0.037 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------