%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW949+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 : n010.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.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 79 ( 35 unt; 2 def)
% Number of atoms : 138 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 122 ( 63 ~; 47 |; 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 : 75 ( 0 sgn 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,axiom,
! [X0] : constr_xor(X0,X0) = constr_ZERO,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f80,axiom,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).
fof(f81,axiom,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax80) ).
fof(f82,axiom,
! [X0,X1,X2] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f83,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_xor(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(f88,axiom,
! [X0,X1] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax87) ).
fof(f89,axiom,
! [X0,X1] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax88) ).
fof(f91,axiom,
! [X0] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax90) ).
fof(f100,axiom,
! [X0] :
( pred_attacker(tuple_R_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax99) ).
fof(f104,axiom,
! [X0] :
( pred_attacker(tuple_R_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax103) ).
fof(f105,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(tuple_R_in_2(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax104) ).
fof(f118,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax117) ).
fof(f119,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax118) ).
fof(f121,axiom,
pred_attacker(tuple_R_out_1(name_r1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax120) ).
fof(f123,axiom,
! [X0] :
( pred_attacker(tuple_R_in_2(X0,constr_f(constr_xor(name_r1,constr_xor(X0,name_t)),name_t)))
=> pred_attacker(tuple_R_out_4(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax122) ).
fof(f124,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f125,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f124]) ).
fof(f126,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f125]) ).
fof(f128,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f83]) ).
fof(f129,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f128]) ).
fof(f134,plain,
! [X0,X1] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(ennf_transformation,[],[f88]) ).
fof(f135,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(ennf_transformation,[],[f89]) ).
fof(f137,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0)) ),
inference(ennf_transformation,[],[f91]) ).
fof(f145,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_4(X0)) ),
inference(ennf_transformation,[],[f100]) ).
fof(f149,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_1(X0)) ),
inference(ennf_transformation,[],[f104]) ).
fof(f150,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f105]) ).
fof(f151,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f150]) ).
fof(f159,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X0,constr_f(constr_xor(name_r1,constr_xor(X0,name_t)),name_t))) ),
inference(ennf_transformation,[],[f123]) ).
fof(f238,plain,
! [X0] : constr_ZERO = constr_xor(X0,X0),
inference(cnf_transformation,[],[f79]) ).
fof(f239,plain,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f80]) ).
fof(f240,plain,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f81]) ).
fof(f241,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
inference(cnf_transformation,[],[f82]) ).
fof(f242,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f129]) ).
fof(f247,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f248,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f135]) ).
fof(f250,plain,
! [X0] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f259,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f263,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f264,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f151]) ).
fof(f276,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
inference(cnf_transformation,[],[f118]) ).
fof(f277,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
inference(cnf_transformation,[],[f119]) ).
fof(f279,plain,
pred_attacker(tuple_R_out_1(name_r1)),
inference(cnf_transformation,[],[f121]) ).
fof(f281,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X0,constr_f(constr_xor(name_r1,constr_xor(X0,name_t)),name_t))) ),
inference(cnf_transformation,[],[f159]) ).
fof(f282,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f126]) ).
fof(f284,definition,
( spl0_1
<=> ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_f(constr_xor(name_r1,constr_xor(X0,name_t)),name_t))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f285,plain,
( ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_f(constr_xor(name_r1,constr_xor(X0,name_t)),name_t)))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f287,definition,
( spl0_2
<=> pred_attacker(tuple_R_out_4(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f289,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f290,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f281,f287,f284]) ).
fof(f292,plain,
pred_attacker(name_r1_from_1st),
inference(resolution,[],[f250,f276]) ).
fof(f294,plain,
( pred_attacker(name_objective)
| ~ spl0_2 ),
inference(resolution,[],[f259,f289]) ).
fof(f296,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f294,f282]) ).
fof(f297,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f296]) ).
fof(f300,plain,
pred_attacker(name_r1),
inference(resolution,[],[f263,f279]) ).
fof(f303,plain,
! [X0] : constr_xor(constr_ZERO,X0) = X0,
inference(superposition,[],[f240,f239]) ).
fof(f323,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_r2_from_1st,name_t),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
inference(forward_demodulation,[],[f277,f240]) ).
fof(f324,plain,
( ! [X0] :
( ~ pred_attacker(constr_f(constr_xor(name_r1,constr_xor(X0,name_t)),name_t))
| ~ pred_attacker(X0) )
| ~ spl0_1 ),
inference(resolution,[],[f285,f264]) ).
fof(f340,plain,
pred_attacker(constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t)),
inference(resolution,[],[f323,f248]) ).
fof(f341,plain,
pred_attacker(constr_xor(name_r2_from_1st,name_t)),
inference(resolution,[],[f323,f247]) ).
fof(f342,plain,
! [X0,X1] : constr_xor(X0,constr_xor(X0,X1)) = constr_xor(constr_ZERO,X1),
inference(superposition,[],[f241,f238]) ).
fof(f350,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(X1,constr_xor(X2,X0)),
inference(superposition,[],[f241,f240]) ).
fof(f359,plain,
! [X0,X1] : constr_xor(X0,constr_xor(X0,X1)) = X1,
inference(forward_demodulation,[],[f342,f303]) ).
fof(f376,plain,
! [X2,X0,X1] : constr_xor(X1,constr_xor(X2,constr_xor(constr_xor(X1,X2),X0))) = X0,
inference(superposition,[],[f241,f359]) ).
fof(f377,plain,
! [X2,X0,X1] : constr_xor(X1,constr_xor(X2,constr_xor(X1,constr_xor(X2,X0)))) = X0,
inference(forward_demodulation,[],[f376,f241]) ).
fof(f422,plain,
( ! [X0] :
( ~ pred_attacker(constr_f(constr_xor(name_r1,constr_xor(name_t,X0)),name_t))
| ~ pred_attacker(X0) )
| ~ spl0_1 ),
inference(superposition,[],[f324,f240]) ).
fof(f1014,plain,
( ! [X0] :
( ~ pred_attacker(constr_xor(name_r1,constr_xor(name_t,X0)))
| ~ pred_attacker(constr_f(X0,name_t)) )
| ~ spl0_1 ),
inference(superposition,[],[f422,f377]) ).
fof(f1515,plain,
( ! [X0] :
( ~ pred_attacker(constr_f(X0,name_t))
| ~ pred_attacker(name_r1)
| ~ pred_attacker(constr_xor(name_t,X0)) )
| ~ spl0_1 ),
inference(resolution,[],[f1014,f242]) ).
fof(f1536,plain,
( ! [X0] :
( ~ pred_attacker(constr_f(X0,name_t))
| ~ pred_attacker(constr_xor(name_t,X0)) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f1515,f300]) ).
fof(f1692,plain,
( ~ pred_attacker(constr_xor(name_t,constr_xor(name_r1_from_1st,name_r2_from_1st)))
| ~ spl0_1 ),
inference(resolution,[],[f1536,f340]) ).
fof(f1693,plain,
( ~ pred_attacker(constr_xor(name_r1_from_1st,constr_xor(name_r2_from_1st,name_t)))
| ~ spl0_1 ),
inference(forward_demodulation,[],[f1692,f350]) ).
fof(f1745,plain,
( ~ pred_attacker(name_r1_from_1st)
| ~ pred_attacker(constr_xor(name_r2_from_1st,name_t))
| ~ spl0_1 ),
inference(resolution,[],[f1693,f242]) ).
fof(f1746,plain,
( ~ pred_attacker(constr_xor(name_r2_from_1st,name_t))
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f1745,f292]) ).
fof(f1747,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f1746,f341]) ).
fof(f1748,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f1747]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f290]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f297]) ).
cnf(s10,plain,
~ spl0_1,
inference(sat_conversion,[],[f1748]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s2,s10]) ).
fof(f1749,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW949+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.07/0.18 % Computer : n010.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 14:47:32 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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.19/0.28 % (1976076)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (1976084)dis+10_1_sil=32000:sp=arity:random_seed=2345230114:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (1976082)% WARNING: option uhcvi not known.
% 0.19/0.28 % (1976082)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3564927144:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % (1976083)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3549319942:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (1976081)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3864544693_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % (1976086)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4192344899:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28 % (1976085)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4283658216:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % (1976087)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2158293486:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28 % Detected minimum model sizes of [13]
% 0.19/0.28 % Detected maximum model sizes of [max]
% 0.19/0.28 % TRYING [13]
% 0.19/0.28 % (1976084) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1976076-1976084"...
% 0.19/0.28 % (1976084)...printing done.
% 0.19/0.28 % (1976084)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 % (1976084)------------------------------
% 0.19/0.28 % (1976084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (1976084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (1976084)CaDiCaL version: 2.1.3
% 0.19/0.28 % (1976084)Termination reason: Refutation
% 0.19/0.28 % (1976084)Time elapsed: 0.020 s
% 0.19/0.28 % (1976084)Peak memory usage: 13 MB
% 0.19/0.28 % (1976084)Instructions burned: 62 (million)
% 0.19/0.28 % (1976076)Success in time 0.05 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------