%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW948+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:14 PM UTC 2026
% Result : Theorem 0.22s 0.36s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of formulae : 75 ( 32 unt; 2 def)
% Number of atoms : 130 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 113 ( 58 ~; 43 |; 2 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f67,axiom,
! [X0] : constr_xor(X0,X0) = constr_ZERO,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax66) ).
fof(f68,axiom,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax67) ).
fof(f69,axiom,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f70,axiom,
! [X0,X1,X2] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f71,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_xor(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax70) ).
fof(f76,axiom,
! [X0,X1] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax75) ).
fof(f77,axiom,
! [X0,X1] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax76) ).
fof(f79,axiom,
! [X0] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f84,axiom,
! [X0] :
( pred_attacker(tuple_R_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f88,axiom,
! [X0] :
( pred_attacker(tuple_R_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax87) ).
fof(f89,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(tuple_R_in_2(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax88) ).
fof(f102,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax101) ).
fof(f103,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax102) ).
fof(f105,axiom,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax104) ).
fof(f107,axiom,
! [X0] :
( pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k))))
=> pred_attacker(tuple_R_out_4(name_objective_R)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax106) ).
fof(f108,conjecture,
pred_attacker(name_objective_R),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(f109,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(negated_conjecture,[status(cth)],[f108]) ).
fof(f110,plain,
~ pred_attacker(name_objective_R),
inference(flattening,[],[f109]) ).
fof(f112,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f71]) ).
fof(f113,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f112]) ).
fof(f118,plain,
! [X0,X1] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(ennf_transformation,[],[f76]) ).
fof(f119,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(ennf_transformation,[],[f77]) ).
fof(f121,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0)) ),
inference(ennf_transformation,[],[f79]) ).
fof(f124,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_4(X0)) ),
inference(ennf_transformation,[],[f84]) ).
fof(f128,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_1(X0)) ),
inference(ennf_transformation,[],[f88]) ).
fof(f129,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f89]) ).
fof(f130,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f129]) ).
fof(f138,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k)))) ),
inference(ennf_transformation,[],[f107]) ).
fof(f205,plain,
! [X0] : constr_ZERO = constr_xor(X0,X0),
inference(cnf_transformation,[],[f67]) ).
fof(f206,plain,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f68]) ).
fof(f207,plain,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f69]) ).
fof(f208,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
inference(cnf_transformation,[],[f70]) ).
fof(f209,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f214,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f215,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f217,plain,
! [X0] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f222,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f226,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f227,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f130]) ).
fof(f239,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(cnf_transformation,[],[f102]) ).
fof(f240,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
inference(cnf_transformation,[],[f103]) ).
fof(f242,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(cnf_transformation,[],[f105]) ).
fof(f244,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k)))) ),
inference(cnf_transformation,[],[f138]) ).
fof(f245,plain,
~ pred_attacker(name_objective_R),
inference(cnf_transformation,[],[f110]) ).
fof(f247,definition,
( spl0_1
<=> ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k)))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f248,plain,
( ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k))))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f250,definition,
( spl0_2
<=> pred_attacker(tuple_R_out_4(name_objective_R)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f252,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f253,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f244,f250,f247]) ).
fof(f255,plain,
pred_attacker(name_r0x30_from_1st),
inference(resolution,[],[f217,f239]) ).
fof(f257,plain,
( pred_attacker(name_objective_R)
| ~ spl0_2 ),
inference(resolution,[],[f222,f252]) ).
fof(f259,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f257,f245]) ).
fof(f260,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f259]) ).
fof(f263,plain,
pred_attacker(name_r0x30),
inference(resolution,[],[f226,f242]) ).
fof(f265,plain,
! [X0] : constr_xor(constr_ZERO,X0) = X0,
inference(superposition,[],[f207,f206]) ).
fof(f285,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st))))),
inference(forward_demodulation,[],[f240,f207]) ).
fof(f286,plain,
( ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X0)))))
| ~ spl0_1 ),
inference(forward_demodulation,[],[f248,f207]) ).
fof(f287,plain,
pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
inference(resolution,[],[f285,f215]) ).
fof(f288,plain,
pred_attacker(name_r1_from_1st),
inference(resolution,[],[f285,f214]) ).
fof(f289,plain,
( ! [X0] :
( ~ pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30,X0))))
| ~ pred_attacker(X0) )
| ~ spl0_1 ),
inference(resolution,[],[f286,f227]) ).
fof(f295,plain,
! [X0,X1] : constr_xor(X0,constr_xor(X0,X1)) = constr_xor(constr_ZERO,X1),
inference(superposition,[],[f208,f205]) ).
fof(f311,plain,
! [X0,X1] : constr_xor(X0,constr_xor(X0,X1)) = X1,
inference(forward_demodulation,[],[f295,f265]) ).
fof(f350,plain,
( ! [X0] :
( ~ pred_attacker(constr_h(constr_xor(name_k,X0)))
| ~ pred_attacker(constr_xor(name_r0x30,X0)) )
| ~ spl0_1 ),
inference(superposition,[],[f289,f311]) ).
fof(f719,plain,
( ~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))
| ~ spl0_1 ),
inference(resolution,[],[f350,f287]) ).
fof(f734,plain,
( ~ pred_attacker(name_r0x30)
| ~ pred_attacker(constr_xor(name_r0x30_from_1st,name_r1_from_1st))
| ~ spl0_1 ),
inference(resolution,[],[f719,f209]) ).
fof(f735,plain,
( ~ pred_attacker(constr_xor(name_r0x30_from_1st,name_r1_from_1st))
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f734,f263]) ).
fof(f737,plain,
( ~ pred_attacker(name_r0x30_from_1st)
| ~ pred_attacker(name_r1_from_1st)
| ~ spl0_1 ),
inference(resolution,[],[f735,f209]) ).
fof(f738,plain,
( ~ pred_attacker(name_r1_from_1st)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f737,f255]) ).
fof(f739,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f738,f288]) ).
fof(f740,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f739]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f253]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f260]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f740]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f741,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW948+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 % Computer : n013.cluster.edu
% 0.09/0.24 % Model : x86_64 x86_64
% 0.09/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.24 % Memory : 8046.5625MB
% 0.09/0.24 % OS : Linux 6.8.0-71-generic
% 0.09/0.24 % CPULimit : 300
% 0.09/0.24 % WCLimit : 300
% 0.09/0.24 % DateTime : Mon Sep 28 14:46:36 UTC 2026
% 0.09/0.24 % CPUTime :
% 0.09/0.24 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.29 Running first-order model finding
% 0.22/0.29 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.36 % (1234686)Will run a generic schedule for satisfiability detection.
% 0.22/0.36 % (1234695)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3169612373:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.36 % (1234697)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=977508049:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.36 % (1234692)% WARNING: option uhcvi not known.
% 0.22/0.36 % (1234691)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1003351703_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.36 % (1234692)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=724117579:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.36 % (1234694)dis+10_1_sil=32000:sp=arity:random_seed=4275410287:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.36 % (1234693)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1094763103:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.36 % (1234696)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3280766523:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.36 % Detected minimum model sizes of [12]
% 0.22/0.36 % Detected maximum model sizes of [max]
% 0.22/0.36 % TRYING [12]
% 0.22/0.36 % (1234694) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1234686-1234694"...
% 0.22/0.36 % (1234692) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1234686-1234692"...
% 0.22/0.36 % (1234694)...printing done.
% 0.22/0.36 % (1234694)Refutation found. Thanks to Tanya!
% 0.22/0.36 % SZS status Theorem for theBenchmark
% 0.22/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.37 % (1234694)------------------------------
% 0.22/0.37 % (1234694)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.37 % (1234694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.37 % (1234694)CaDiCaL version: 2.1.3
% 0.22/0.37 % (1234694)Termination reason: Refutation
% 0.22/0.37 % (1234694)Time elapsed: 0.024 s
% 0.22/0.37 % (1234694)Peak memory usage: 12 MB
% 0.22/0.37 % (1234694)Instructions burned: 22 (million)
% 0.22/0.37 % (1234686)Success in time 0.063 s
% 0.22/0.37 % Vampire exiting
%------------------------------------------------------------------------------