%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW952+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 : n009.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:05 PM UTC 2026
% Result : Theorem 4.26s 1.34s
% Output : Refutation 5.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of formulae : 80 ( 35 unt; 2 def)
% Number of atoms : 140 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 125 ( 65 ~; 48 |; 2 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f92,axiom,
! [X0] : constr_xor(X0,X0) = constr_ZERO,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax91) ).
fof(f93,axiom,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax92) ).
fof(f94,axiom,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
fof(f95,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',ax94) ).
fof(f96,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_xor(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax95) ).
fof(f103,axiom,
! [X0,X1] :
( pred_attacker(tuple_sess_1_out_2(X0,X1))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax102) ).
fof(f104,axiom,
! [X0,X1] :
( pred_attacker(tuple_sess_1_out_2(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax103) ).
fof(f106,axiom,
! [X0] :
( pred_attacker(tuple_sess_1_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax105) ).
fof(f112,axiom,
! [X0] :
( pred_attacker(tuple_R_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax111) ).
fof(f117,axiom,
! [X0,X1] :
( pred_attacker(tuple_R_out_1(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax116) ).
fof(f118,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(tuple_R_in_2(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax117) ).
fof(f132,axiom,
pred_attacker(tuple_sess_1_out_1(name_r1_s1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax131) ).
fof(f133,axiom,
pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))),constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax132) ).
fof(f135,axiom,
pred_attacker(tuple_R_out_1(constr_QUERY,name_r1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax134) ).
fof(f137,axiom,
! [X0] :
( pred_attacker(tuple_R_in_2(X0,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X0),name_k))),constr_h(constr_xor(constr_xor(name_r1,X0),name_k))))))
=> pred_attacker(tuple_R_out_4(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax136) ).
fof(f138,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f139,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f138]) ).
fof(f140,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f139]) ).
fof(f141,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f96]) ).
fof(f142,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f141]) ).
fof(f149,plain,
! [X0,X1] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_sess_1_out_2(X0,X1)) ),
inference(ennf_transformation,[],[f103]) ).
fof(f150,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_sess_1_out_2(X0,X1)) ),
inference(ennf_transformation,[],[f104]) ).
fof(f152,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_sess_1_out_1(X0)) ),
inference(ennf_transformation,[],[f106]) ).
fof(f157,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_4(X0)) ),
inference(ennf_transformation,[],[f112]) ).
fof(f163,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X0,X1)) ),
inference(ennf_transformation,[],[f117]) ).
fof(f164,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f118]) ).
fof(f165,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f164]) ).
fof(f173,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X0,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X0),name_k))),constr_h(constr_xor(constr_xor(name_r1,X0),name_k)))))) ),
inference(ennf_transformation,[],[f137]) ).
fof(f265,plain,
! [X0] : constr_ZERO = constr_xor(X0,X0),
inference(cnf_transformation,[],[f92]) ).
fof(f266,plain,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f93]) ).
fof(f267,plain,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f94]) ).
fof(f268,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
inference(cnf_transformation,[],[f95]) ).
fof(f269,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f142]) ).
fof(f276,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_sess_1_out_2(X0,X1))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f277,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_sess_1_out_2(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f150]) ).
fof(f279,plain,
! [X0] :
( ~ pred_attacker(tuple_sess_1_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f285,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f290,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_R_out_1(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f163]) ).
fof(f291,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f165]) ).
fof(f305,plain,
pred_attacker(tuple_sess_1_out_1(name_r1_s1)),
inference(cnf_transformation,[],[f132]) ).
fof(f306,plain,
pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))),constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)))))),
inference(cnf_transformation,[],[f133]) ).
fof(f308,plain,
pred_attacker(tuple_R_out_1(constr_QUERY,name_r1)),
inference(cnf_transformation,[],[f135]) ).
fof(f310,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X0,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X0),name_k))),constr_h(constr_xor(constr_xor(name_r1,X0),name_k)))))) ),
inference(cnf_transformation,[],[f173]) ).
fof(f311,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f140]) ).
fof(f313,definition,
( spl0_1
<=> ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X0),name_k))),constr_h(constr_xor(constr_xor(name_r1,X0),name_k)))))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f314,plain,
( ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X0),name_k))),constr_h(constr_xor(constr_xor(name_r1,X0),name_k))))))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f313]) ).
fof(f316,definition,
( spl0_2
<=> pred_attacker(tuple_R_out_4(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f317,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f316]) ).
fof(f318,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f310,f316,f313]) ).
fof(f319,plain,
( pred_attacker(name_objective)
| ~ spl0_2 ),
inference(resolution,[],[f285,f317]) ).
fof(f320,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f319,f311]) ).
fof(f321,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f320]) ).
fof(f322,plain,
( ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_split_L(constr_xor(constr_h(constr_xor(constr_xor(name_r1,X0),name_k)),constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X0),name_k)))))))
| ~ spl0_1 ),
inference(forward_demodulation,[],[f314,f267]) ).
fof(f323,plain,
( ! [X0] : ~ pred_attacker(tuple_R_in_2(X0,constr_split_L(constr_xor(constr_h(constr_xor(name_r1,constr_xor(X0,name_k))),constr_rotate(name_ID,constr_h(constr_xor(name_r1,constr_xor(X0,name_k))))))))
| ~ spl0_1 ),
inference(forward_demodulation,[],[f322,f268]) ).
fof(f329,plain,
! [X0] : constr_xor(constr_ZERO,X0) = X0,
inference(superposition,[],[f266,f267]) ).
fof(f348,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(X2,constr_xor(X0,X1)),
inference(superposition,[],[f267,f268]) ).
fof(f366,plain,
pred_attacker(constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))),constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))))),
inference(resolution,[],[f277,f306]) ).
fof(f367,plain,
pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)),constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)))))),
inference(forward_demodulation,[],[f366,f267]) ).
fof(f368,plain,
pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_r1_s1,constr_xor(name_r2_s1,name_k))),constr_rotate(name_ID,constr_h(constr_xor(name_r1_s1,constr_xor(name_r2_s1,name_k))))))),
inference(forward_demodulation,[],[f367,f268]) ).
fof(f369,plain,
pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))))))),
inference(forward_demodulation,[],[f368,f348]) ).
fof(f370,plain,
pred_attacker(name_r2_s1),
inference(resolution,[],[f276,f306]) ).
fof(f372,plain,
! [X0,X1] : constr_xor(constr_ZERO,X1) = constr_xor(X0,constr_xor(X0,X1)),
inference(superposition,[],[f268,f265]) ).
fof(f374,plain,
! [X0,X1] : constr_xor(X0,constr_xor(X0,X1)) = X1,
inference(forward_demodulation,[],[f372,f329]) ).
fof(f391,plain,
pred_attacker(name_r1_s1),
inference(resolution,[],[f279,f305]) ).
fof(f421,plain,
pred_attacker(name_r1),
inference(resolution,[],[f308,f290]) ).
fof(f424,plain,
( ! [X0] :
( ~ pred_attacker(X0)
| ~ pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_r1,constr_xor(X0,name_k))),constr_rotate(name_ID,constr_h(constr_xor(name_r1,constr_xor(X0,name_k))))))) )
| ~ spl0_1 ),
inference(resolution,[],[f323,f291]) ).
fof(f435,plain,
( ! [X0] :
( ~ pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1,X0))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1,X0)))))))
| ~ pred_attacker(X0) )
| ~ spl0_1 ),
inference(forward_demodulation,[],[f424,f348]) ).
fof(f442,plain,
( ! [X0] :
( ~ pred_attacker(constr_xor(name_r1,X0))
| ~ pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,X0)),constr_rotate(name_ID,constr_h(constr_xor(name_k,X0)))))) )
| ~ spl0_1 ),
inference(superposition,[],[f435,f374]) ).
fof(f446,plain,
( ! [X0] :
( ~ pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,X0)),constr_rotate(name_ID,constr_h(constr_xor(name_k,X0))))))
| ~ pred_attacker(name_r1)
| ~ pred_attacker(X0) )
| ~ spl0_1 ),
inference(resolution,[],[f442,f269]) ).
fof(f453,plain,
( ! [X0] :
( ~ pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,X0)),constr_rotate(name_ID,constr_h(constr_xor(name_k,X0))))))
| ~ pred_attacker(X0) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f446,f421]) ).
fof(f1382,plain,
( ~ pred_attacker(constr_xor(name_r1_s1,name_r2_s1))
| ~ spl0_1 ),
inference(resolution,[],[f453,f369]) ).
fof(f1395,plain,
( ~ pred_attacker(name_r1_s1)
| ~ pred_attacker(name_r2_s1)
| ~ spl0_1 ),
inference(resolution,[],[f1382,f269]) ).
fof(f1397,plain,
( ~ pred_attacker(name_r2_s1)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f1395,f391]) ).
fof(f1398,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f1397,f370]) ).
fof(f1399,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f1398]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f318]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f321]) ).
cnf(s8,plain,
~ spl0_1,
inference(sat_conversion,[],[f1399]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s2,s8]) ).
fof(f1400,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW952+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.10/0.18 % Computer : n009.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Mon Sep 28 14:48:00 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running first-order theorem proving
% 0.10/0.21 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
% 4.26/1.34 % (3080401)Detected formulas, will run a generic FOF schedule.
% 4.26/1.34 % (3080407)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=1020806386:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.26/1.34 % (3080409)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4086938319:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.26/1.34 % (3080411)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1542985090:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.26/1.34 % (3080406)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=134692574:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.26/1.34 % (3080410)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2386033196:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.26/1.34 % (3080408)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=1992499649:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.26/1.34 % (3080409)Refutation not found, incomplete strategy
% 4.26/1.34 % (3080409)------------------------------
% 4.26/1.34 % (3080409)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.34 % (3080409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.34 % (3080409)CaDiCaL version: 2.1.3
% 4.26/1.34 % (3080409)Termination reason: Refutation not found, incomplete strategy
% 4.26/1.34 % (3080409)Time elapsed: 0.001 s
% 4.26/1.34 % (3080409)Peak memory usage: 87 MB
% 4.26/1.34 % (3080410)Refutation not found, incomplete strategy
% 4.26/1.34 % (3080410)------------------------------
% 4.26/1.34 % (3080410)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.34 % (3080410)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.34 % (3080410)CaDiCaL version: 2.1.3
% 4.26/1.34 % (3080410)Termination reason: Refutation not found, incomplete strategy
% 4.26/1.34 % (3080410)Time elapsed: 0.001 s
% 4.26/1.34 % (3080410)Peak memory usage: 87 MB
% 4.26/1.34 % (3080410)Instructions burned: 1 (million)
% 4.26/1.34 % (3080412)dis-21_1_sil=8000:lcm=predicate:random_seed=346570073: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)
% 4.26/1.34 % (3080412)Refutation not found, incomplete strategy
% 4.26/1.34 % (3080412)------------------------------
% 4.26/1.34 % (3080412)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.34 % (3080412)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.34 % (3080412)CaDiCaL version: 2.1.3
% 4.26/1.34 % (3080412)Termination reason: Refutation not found, incomplete strategy
% 4.26/1.34 % (3080412)Time elapsed: 0.005 s
% 4.26/1.34 % (3080412)Peak memory usage: 88 MB
% 4.26/1.34 % (3080412)Instructions burned: 7 (million)
% 4.26/1.34 % (3080411)Instruction limit reached!
% 4.26/1.34 % (3080411)------------------------------
% 4.26/1.34 % (3080411)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.34 % (3080411)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.34 % (3080411)CaDiCaL version: 2.1.3
% 4.26/1.34 % (3080411)Termination reason: Instruction limit
% 4.26/1.34 % (3080411)Termination phase: Saturation
% 4.26/1.34 % (3080411)Time elapsed: 0.075 s
% 4.26/1.34 % (3080411)Peak memory usage: 89 MB
% 4.26/1.34 % (3080411)Instructions burned: 139 (million)
% 4.26/1.34 % (3080420)lrs+10_1_sil=8000:sp=occurrence:random_seed=91769716:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.26/1.34 % (3080420)Refutation not found, incomplete strategy
% 4.26/1.34 % (3080420)------------------------------
% 4.26/1.34 % (3080420)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.34 % (3080420)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.34 % (3080420)CaDiCaL version: 2.1.3
% 4.26/1.34 % (3080420)Termination reason: Refutation not found, incomplete strategy
% 4.26/1.34 % (3080420)Time elapsed: 0.001 s
% 4.26/1.34 % (3080420)Peak memory usage: 88 MB
% 4.26/1.34 % (3080420)Instructions burned: 1 (million)
% 4.26/1.34 % (3080409)------------------------------
% 4.26/1.34 % (3080409)------------------------------
% 4.26/1.34 % (3080410)------------------------------
% 4.26/1.34 % (3080410)------------------------------
% 4.26/1.34 % (3080412)------------------------------
% 4.26/1.34 % (3080412)------------------------------
% 4.26/1.34 % (3080407)First to succeed.
% 4.26/1.34 % (3080407)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3080401"
% 4.26/1.34 % (3080424)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=4074948317:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.26/1.34 % (3080423)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2141261850:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 4.26/1.34 % (3080422)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2171570393:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 4.26/1.34 % (3080422)Refutation not found, incomplete strategy
% 4.26/1.34 % (3080422)------------------------------
% 4.26/1.34 % (3080422)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.34 % (3080422)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.34 % (3080422)CaDiCaL version: 2.1.3
% 4.26/1.34 % (3080422)Termination reason: Refutation not found, incomplete strategy
% 4.26/1.34 % (3080422)Time elapsed: 0.001 s
% 4.26/1.34 % (3080423)Refutation not found, incomplete strategy
% 4.26/1.34 % (3080423)------------------------------
% 4.26/1.34 % (3080423)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.34 % (3080423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.34 % (3080422)Peak memory usage: 88 MB
% 4.26/1.34 % (3080423)CaDiCaL version: 2.1.3
% 4.26/1.34 % (3080422)Instructions burned: 1 (million)
% 4.26/1.34 % (3080423)Termination reason: Refutation not found, incomplete strategy
% 4.26/1.34 % (3080423)Time elapsed: 0.001 s
% 4.26/1.34 % (3080423)Peak memory usage: 88 MB
% 4.26/1.34 % (3080423)Instructions burned: 1 (million)
% 4.26/1.34 % (3080420)------------------------------
% 4.26/1.34 % (3080420)------------------------------
% 4.26/1.34 % (3080424)Instruction limit reached!
% 4.26/1.34 % (3080424)------------------------------
% 4.26/1.34 % (3080424)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.34 % (3080424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.34 % (3080424)CaDiCaL version: 2.1.3
% 4.26/1.34 % (3080424)Termination reason: Instruction limit
% 4.26/1.34 % (3080424)Termination phase: Saturation
% 4.26/1.34 % (3080424)Time elapsed: 0.127 s
% 4.26/1.34 % (3080424)Peak memory usage: 96 MB
% 4.26/1.34 % (3080424)Instructions burned: 250 (million)
% 4.26/1.34 % (3080407)Refutation found. Thanks to Tanya!
% 4.26/1.34 % SZS status Theorem for theBenchmark
% 4.26/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 5.42/1.54 % (3080407)------------------------------
% 5.42/1.54 % (3080407)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.42/1.54 % (3080407)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.42/1.54 % (3080407)CaDiCaL version: 2.1.3
% 5.42/1.54 % (3080407)Termination reason: Refutation
% 5.42/1.54 % (3080407)Time elapsed: 0.400 s
% 5.42/1.54 % (3080407)Peak memory usage: 131 MB
% 5.42/1.54 % (3080407)Instructions burned: 1081 (million)
% 5.42/1.54 % (3080407)------------------------------
% 5.42/1.54 % (3080407)------------------------------
% 5.42/1.54 % (3080401)Success in time 0.681 s
% 5.42/1.54 % Vampire exiting
%------------------------------------------------------------------------------