%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW970+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:17 PM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 14 unt; 2 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 30 ~; 21 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f80,axiom,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).
fof(f94,axiom,
! [X0] :
( pred_attacker(tuple_client_B_out_2(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
fof(f95,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_1(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax94) ).
fof(f115,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax114) ).
fof(f136,axiom,
! [X0] :
( ( pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
& pred_attacker(tuple_client_B_in_1(X0)) )
=> pred_attacker(tuple_client_B_out_2(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax135) ).
fof(f139,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f140,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f139]) ).
fof(f141,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f140]) ).
fof(f155,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_2(X0)) ),
inference(ennf_transformation,[],[f94]) ).
fof(f156,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_1(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f95]) ).
fof(f199,plain,
! [X0] :
( pred_attacker(tuple_client_B_out_2(name_objective))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
| ~ pred_attacker(tuple_client_B_in_1(X0)) ),
inference(ennf_transformation,[],[f136]) ).
fof(f200,plain,
! [X0] :
( pred_attacker(tuple_client_B_out_2(name_objective))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
| ~ pred_attacker(tuple_client_B_in_1(X0)) ),
inference(flattening,[],[f199]) ).
fof(f282,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f80]) ).
fof(f296,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_2(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f297,plain,
! [X0] :
( pred_attacker(tuple_client_B_in_1(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f317,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f115]) ).
fof(f337,plain,
! [X0] :
( pred_attacker(tuple_client_B_out_2(name_objective))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
| ~ pred_attacker(tuple_client_B_in_1(X0)) ),
inference(cnf_transformation,[],[f200]) ).
fof(f340,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f141]) ).
fof(f358,definition,
( spl0_5
<=> ! [X0] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
| ~ pred_attacker(tuple_client_B_in_1(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f359,plain,
( ! [X0] :
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X0,name_Kbs)))
| ~ pred_attacker(tuple_client_B_in_1(X0)) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f358]) ).
fof(f361,definition,
( spl0_6
<=> pred_attacker(tuple_client_B_out_2(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f363,plain,
( pred_attacker(tuple_client_B_out_2(name_objective))
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f361]) ).
fof(f364,plain,
( spl0_5
| spl0_6 ),
inference(avatar_split_clause,[],[f337,f361,f358]) ).
fof(f394,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_1(X0))
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f359,f282]) ).
fof(f395,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_5 ),
inference(resolution,[],[f394,f297]) ).
fof(f396,plain,
( $false
| ~ spl0_5 ),
inference(resolution,[],[f395,f317]) ).
fof(f443,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f396]) ).
fof(f444,plain,
( pred_attacker(name_objective)
| ~ spl0_6 ),
inference(resolution,[],[f363,f296]) ).
fof(f445,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f444,f340]) ).
fof(f446,plain,
~ spl0_6,
inference(avatar_contradiction_clause,[],[f445]) ).
cnf(s3,plain,
( spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f364]) ).
cnf(s19,plain,
~ spl0_5,
inference(sat_conversion,[],[f443]) ).
cnf(s20,plain,
~ spl0_6,
inference(sat_conversion,[],[f446]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s3,s20,s19]) ).
fof(f447,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW970+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 : n020.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:50:34 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.22 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 % (216506)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (216514)dis+10_1_sil=32000:sp=arity:random_seed=4078318368:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.26 % (216512)% WARNING: option uhcvi not known.
% 0.09/0.26 % (216514) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-216506-216514"...
% 0.09/0.26 % (216514)...printing done.
% 0.09/0.26 % (216514)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 % (216514)------------------------------
% 0.09/0.26 % (216514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (216514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (216514)CaDiCaL version: 2.1.3
% 0.09/0.26 % (216514)Termination reason: Refutation
% 0.09/0.26 % (216514)Time elapsed: 0.003 s
% 0.09/0.26 % (216514)Peak memory usage: 12 MB
% 0.09/0.26 % (216514)Instructions burned: 7 (million)
% 0.09/0.26 % (216506)Success in time 0.033 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------