%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n016.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:07 PM UTC 2026
% Result : Theorem 2.50s 1.13s
% Output : Refutation 2.50s
% 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(f438,definition,
( spl1_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,[spl1_5])],[avatar_definition]) ).
fof(f439,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)) )
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f438]) ).
fof(f441,definition,
( spl1_6
<=> pred_attacker(tuple_client_B_out_2(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f442,plain,
( pred_attacker(tuple_client_B_out_2(name_objective))
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f441]) ).
fof(f443,plain,
( spl1_5
| spl1_6 ),
inference(avatar_split_clause,[],[f337,f441,f438]) ).
fof(f444,plain,
( ! [X0] : ~ pred_attacker(tuple_client_B_in_1(X0))
| ~ spl1_5 ),
inference(resolution,[],[f282,f439]) ).
fof(f448,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_5 ),
inference(resolution,[],[f297,f444]) ).
fof(f449,plain,
( $false
| ~ spl1_5 ),
inference(resolution,[],[f448,f317]) ).
fof(f479,plain,
~ spl1_5,
inference(avatar_contradiction_clause,[],[f449]) ).
fof(f480,plain,
( pred_attacker(name_objective)
| ~ spl1_6 ),
inference(resolution,[],[f442,f296]) ).
fof(f481,plain,
( $false
| ~ spl1_6 ),
inference(resolution,[],[f480,f340]) ).
fof(f482,plain,
~ spl1_6,
inference(avatar_contradiction_clause,[],[f481]) ).
cnf(s3,plain,
( spl1_5
| spl1_6 ),
inference(sat_conversion,[],[f443]) ).
cnf(s15,plain,
~ spl1_5,
inference(sat_conversion,[],[f479]) ).
cnf(s16,plain,
~ spl1_6,
inference(sat_conversion,[],[f482]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s3,s16,s15]) ).
fof(f483,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % 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 THM
% 0.09/0.19 % Computer : n016.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 14:54:34 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/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.50/1.13 % (3679186)Detected formulas, will run a generic FOF schedule.
% 2.50/1.13 % (3679197)dis-21_1_sil=8000:lcm=predicate:random_seed=1648804085: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.50/1.13 % (3679197)First to succeed.
% 2.50/1.13 % (3679197)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3679186"
% 2.50/1.13 % (3679194)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1382181766:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.50/1.13 % (3679193)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=493781821:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.50/1.13 % (3679192)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=904538818:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.50/1.13 % (3679191)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=279164410:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.50/1.13 % (3679195)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1010561002:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.50/1.13 % (3679196)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=5553202:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.50/1.13 % (3679194)Refutation not found, incomplete strategy
% 2.50/1.13 % (3679194)------------------------------
% 2.50/1.13 % (3679194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.13 % (3679194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.13 % (3679194)CaDiCaL version: 2.1.3
% 2.50/1.13 % (3679194)Termination reason: Refutation not found, incomplete strategy
% 2.50/1.13 % (3679194)Time elapsed: 0.001 s
% 2.50/1.13 % (3679194)Peak memory usage: 87 MB
% 2.50/1.13 % (3679195)Refutation not found, incomplete strategy
% 2.50/1.13 % (3679195)------------------------------
% 2.50/1.13 % (3679195)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.13 % (3679195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.13 % (3679195)CaDiCaL version: 2.1.3
% 2.50/1.13 % (3679195)Termination reason: Refutation not found, incomplete strategy
% 2.50/1.13 % (3679195)Time elapsed: 0.001 s
% 2.50/1.13 % (3679195)Peak memory usage: 87 MB
% 2.50/1.13 % (3679196)Also succeeded, but the first one will report.
% 2.50/1.13 % (3679197)Refutation found. Thanks to Tanya!
% 2.50/1.13 % SZS status Theorem for theBenchmark
% 2.50/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 2.50/1.13 % (3679197)------------------------------
% 2.50/1.13 % (3679197)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.13 % (3679197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.13 % (3679197)CaDiCaL version: 2.1.3
% 2.50/1.13 % (3679197)Termination reason: Refutation
% 2.50/1.13 % (3679197)Time elapsed: 0.002 s
% 2.50/1.13 % (3679197)Peak memory usage: 89 MB
% 2.50/1.13 % (3679197)Instructions burned: 5 (million)
% 2.50/1.13 % (3679197)------------------------------
% 2.50/1.13 % (3679197)------------------------------
% 2.50/1.13 % (3679186)Success in time 0.274 s
% 2.50/1.13 % Vampire exiting
%------------------------------------------------------------------------------