%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW949+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:04 PM UTC 2026
% Result : Theorem 5.37s 1.77s
% Output : Refutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of formulae : 79 ( 34 unt; 2 def)
% Number of atoms : 141 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 127 ( 65 ~; 50 |; 2 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 79 ( 0 sgn 79 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,axiom,
! [X0] : constr_xor(X0,X0) = constr_ZERO,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f80,axiom,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax79) ).
fof(f81,axiom,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f83,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_xor(X0,X1)) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax88) ).
fof(f91,axiom,
! [X0] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax90) ).
fof(f100,axiom,
! [X0] :
( pred_attacker(tuple_R_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax99) ).
fof(f104,axiom,
! [X0] :
( pred_attacker(tuple_R_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax104) ).
fof(f118,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax118) ).
fof(f121,axiom,
pred_attacker(tuple_R_out_1(name_r1)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax122) ).
fof(f124,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/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(f309,plain,
pred_attacker(constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t)),
inference(resolution,[],[f277,f248]) ).
fof(f310,plain,
pred_attacker(constr_xor(name_t,name_r2_from_1st)),
inference(resolution,[],[f277,f247]) ).
fof(f311,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(f316,plain,
! [X0] : constr_xor(constr_ZERO,X0) = X0,
inference(superposition,[],[f240,f239]) ).
fof(f321,plain,
pred_attacker(constr_f(constr_xor(name_r2_from_1st,name_r1_from_1st),name_t)),
inference(superposition,[],[f309,f240]) ).
fof(f346,plain,
! [X0,X1] : constr_xor(X0,constr_xor(X0,X1)) = constr_xor(constr_ZERO,X1),
inference(superposition,[],[f241,f238]) ).
fof(f353,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(X1,constr_xor(X2,X0)),
inference(superposition,[],[f241,f240]) ).
fof(f358,plain,
! [X2,X0,X1] :
( ~ pred_attacker(constr_xor(X0,X1))
| pred_attacker(constr_xor(X0,constr_xor(X1,X2)))
| ~ pred_attacker(X2) ),
inference(superposition,[],[f242,f241]) ).
fof(f360,plain,
( ! [X0,X1] :
( ~ pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(constr_f(constr_xor(name_r1,constr_xor(X0,constr_xor(X1,name_t))),name_t)) )
| ~ spl0_1 ),
inference(superposition,[],[f311,f241]) ).
fof(f378,plain,
! [X0,X1] : constr_xor(X0,constr_xor(X0,X1)) = X1,
inference(forward_demodulation,[],[f346,f316]) ).
fof(f670,plain,
! [X2,X0,X1] : constr_xor(X2,X0) = constr_xor(X1,constr_xor(X0,constr_xor(X1,X2))),
inference(superposition,[],[f378,f353]) ).
fof(f777,plain,
! [X0] :
( pred_attacker(constr_xor(name_t,constr_xor(name_r2_from_1st,X0)))
| ~ pred_attacker(X0) ),
inference(resolution,[],[f358,f310]) ).
fof(f827,plain,
( ! [X0,X1] :
( ~ pred_attacker(constr_f(constr_xor(name_r1,constr_xor(X0,constr_xor(X1,name_t))),name_t))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) )
| ~ spl0_1 ),
inference(resolution,[],[f360,f242]) ).
fof(f4007,plain,
( ! [X0] :
( ~ pred_attacker(constr_f(constr_xor(name_t,X0),name_t))
| ~ pred_attacker(X0)
| ~ pred_attacker(name_r1) )
| ~ spl0_1 ),
inference(superposition,[],[f827,f670]) ).
fof(f4017,plain,
( ! [X0] :
( ~ pred_attacker(constr_f(constr_xor(name_t,X0),name_t))
| ~ pred_attacker(X0) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f4007,f300]) ).
fof(f4043,plain,
( ! [X0] :
( ~ pred_attacker(constr_f(X0,name_t))
| ~ pred_attacker(constr_xor(name_t,X0)) )
| ~ spl0_1 ),
inference(superposition,[],[f4017,f378]) ).
fof(f4060,plain,
( ~ pred_attacker(constr_xor(name_t,constr_xor(name_r2_from_1st,name_r1_from_1st)))
| ~ spl0_1 ),
inference(resolution,[],[f4043,f321]) ).
fof(f4188,plain,
( ~ pred_attacker(name_r1_from_1st)
| ~ spl0_1 ),
inference(resolution,[],[f4060,f777]) ).
fof(f4190,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f4188,f292]) ).
fof(f4191,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f4190]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f290]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f297]) ).
cnf(s12,plain,
~ spl0_1,
inference(sat_conversion,[],[f4191]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s1,s2,s12]) ).
fof(f4192,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWW949+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.28 % Computer : n011.cluster.edu
% 0.23/0.28 % Model : x86_64 x86_64
% 0.23/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.28 % Memory : 8046.5625MB
% 0.23/0.28 % OS : Linux 6.8.0-71-generic
% 0.23/0.28 % CPULimit : 300
% 0.23/0.28 % WCLimit : 300
% 0.23/0.28 % DateTime : Mon Sep 28 14:47:16 UTC 2026
% 0.23/0.29 % CPUTime :
% 0.23/0.29 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.32 Running first-order theorem proving
% 0.23/0.32 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.37/1.77 % (3438495)Detected formulas, will run a generic FOF schedule.
% 5.37/1.77 % (3438503)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=996024052:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.37/1.77 % (3438506)dis-21_1_sil=8000:lcm=predicate:random_seed=4128324838: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)
% 5.37/1.77 % (3438503)Refutation not found, incomplete strategy
% 5.37/1.77 % (3438503)------------------------------
% 5.37/1.77 % (3438503)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.37/1.77 % (3438503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.37/1.77 % (3438503)CaDiCaL version: 2.1.3
% 5.37/1.77 % (3438503)Termination reason: Refutation not found, incomplete strategy
% 5.37/1.77 % (3438503)Time elapsed: 0.001 s
% 5.37/1.77 % (3438503)Peak memory usage: 87 MB
% 5.37/1.77 % (3438506)Refutation not found, incomplete strategy
% 5.37/1.77 % (3438506)------------------------------
% 5.37/1.77 % (3438506)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.37/1.77 % (3438506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.37/1.77 % (3438506)CaDiCaL version: 2.1.3
% 5.37/1.77 % (3438506)Termination reason: Refutation not found, incomplete strategy
% 5.37/1.77 % (3438506)Time elapsed: 0.005 s
% 5.37/1.77 % (3438506)Peak memory usage: 88 MB
% 5.37/1.77 % (3438506)Instructions burned: 6 (million)
% 5.37/1.77 % (3438500)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=2262352916:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.37/1.77 % (3438501)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=2744895466:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.37/1.77 % (3438505)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4106214345:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.37/1.77 % (3438504)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3712726209:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.37/1.77 % (3438504)Refutation not found, incomplete strategy
% 5.37/1.77 % (3438504)------------------------------
% 5.37/1.77 % (3438504)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.37/1.77 % (3438504)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.37/1.77 % (3438504)CaDiCaL version: 2.1.3
% 5.37/1.77 % (3438504)Termination reason: Refutation not found, incomplete strategy
% 5.37/1.77 % (3438504)Time elapsed: 0.002 s
% 5.37/1.77 % (3438504)Peak memory usage: 87 MB
% 5.37/1.77 % (3438504)Instructions burned: 1 (million)
% 5.37/1.77 % (3438502)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=3504709101:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.37/1.77 % (3438505)First to succeed.
% 5.37/1.77 % (3438505)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3438495"
% 5.37/1.77 % (3438503)------------------------------
% 5.37/1.77 % (3438503)------------------------------
% 5.37/1.77 % (3438506)------------------------------
% 5.37/1.77 % (3438506)------------------------------
% 5.37/1.77 % (3438514)lrs+10_1_sil=8000:sp=occurrence:random_seed=2307467944:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 5.37/1.77 % (3438514)Refutation not found, incomplete strategy
% 5.37/1.77 % (3438514)------------------------------
% 5.37/1.77 % (3438514)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.37/1.77 % (3438514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.37/1.77 % (3438514)CaDiCaL version: 2.1.3
% 5.37/1.77 % (3438514)Termination reason: Refutation not found, incomplete strategy
% 5.37/1.77 % (3438514)Time elapsed: 0.001 s
% 5.37/1.77 % (3438514)Peak memory usage: 88 MB
% 5.37/1.77 % (3438514)Instructions burned: 1 (million)
% 5.37/1.77 % (3438504)------------------------------
% 5.37/1.77 % (3438504)------------------------------
% 5.37/1.77 % (3438505)Refutation found. Thanks to Tanya!
% 5.37/1.77 % SZS status Theorem for theBenchmark
% 5.37/1.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.28/2.01 % (3438505)------------------------------
% 0.28/2.01 % (3438505)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.28/2.01 % (3438505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/2.01 % (3438505)CaDiCaL version: 2.1.3
% 0.28/2.01 % (3438505)Termination reason: Refutation
% 0.28/2.01 % (3438505)Time elapsed: 0.130 s
% 0.28/2.01 % (3438505)Peak memory usage: 91 MB
% 0.28/2.01 % (3438505)Instructions burned: 128 (million)
% 0.28/2.01 % (3438505)------------------------------
% 0.28/2.01 % (3438505)------------------------------
% 0.28/2.01 % (3438495)Success in time 0.8 s
% 0.28/2.01 % Vampire exiting
%------------------------------------------------------------------------------