%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV033+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:07:57 PM UTC 2026
% Result : Theorem 2.85s 1.13s
% Output : Refutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 9
% Syntax : Number of formulae : 67 ( 14 unt; 1 def)
% Number of atoms : 284 ( 94 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 332 ( 115 ~; 114 |; 86 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 98 ( 84 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& X0 != X1 )
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt2) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt_pred) ).
fof(f30,axiom,
! [X0] : plus(n1,X0) = succ(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_succ) ).
fof(f48,axiom,
! [X0,X1,X2] : a_select2(tptp_update2(X0,X1,X2),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sel2_update_1) ).
fof(f49,axiom,
! [X0,X1,X2,X3,X4] :
( ( X0 != X1
& a_select2(X2,X1) = X3 )
=> a_select2(tptp_update2(X2,X0,X4),X1) = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sel2_update_2) ).
fof(f53,conjecture,
( ( init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,n2) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n3) )
=> a_select3(simplex7_init,X1,X0) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,minus(pv1376,n1)) )
=> a_select2(s_values7_init,X2) = init ) )
=> ( init = init
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n2) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n3) )
=> a_select3(simplex7_init,X4,X3) = init ) )
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,minus(plus(n1,pv1376),n1)) )
=> a_select2(tptp_update2(s_values7_init,pv1376,init),X5) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0045) ).
fof(f54,negated_conjecture,
~ ( ( init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,n2) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n3) )
=> a_select3(simplex7_init,X1,X0) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,minus(pv1376,n1)) )
=> a_select2(s_values7_init,X2) = init ) )
=> ( init = init
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n2) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n3) )
=> a_select3(simplex7_init,X4,X3) = init ) )
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,minus(plus(n1,pv1376),n1)) )
=> a_select2(tptp_update2(s_values7_init,pv1376,init),X5) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f87,plain,
( ( init != init
| ? [X3] :
( ? [X4] :
( init != a_select3(simplex7_init,X4,X3)
& leq(n0,X4)
& leq(X4,n3) )
& leq(n0,X3)
& leq(X3,n2) )
| ? [X5] :
( init != a_select2(tptp_update2(s_values7_init,pv1376,init),X5)
& leq(n0,X5)
& leq(X5,minus(plus(n1,pv1376),n1)) ) )
& init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X0] :
( ! [X1] :
( a_select3(simplex7_init,X1,X0) = init
| ~ leq(n0,X1)
| ~ leq(X1,n3) )
| ~ leq(n0,X0)
| ~ leq(X0,n2) )
& ! [X2] :
( a_select2(s_values7_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,minus(pv1376,n1)) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
( ( init != init
| ? [X3] :
( ? [X4] :
( init != a_select3(simplex7_init,X4,X3)
& leq(n0,X4)
& leq(X4,n3) )
& leq(n0,X3)
& leq(X3,n2) )
| ? [X5] :
( init != a_select2(tptp_update2(s_values7_init,pv1376,init),X5)
& leq(n0,X5)
& leq(X5,minus(plus(n1,pv1376),n1)) ) )
& init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X0] :
( ! [X1] :
( a_select3(simplex7_init,X1,X0) = init
| ~ leq(n0,X1)
| ~ leq(X1,n3) )
| ~ leq(n0,X0)
| ~ leq(X0,n2) )
& ! [X2] :
( a_select2(s_values7_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,minus(pv1376,n1)) ) ),
inference(flattening,[],[f87]) ).
fof(f102,plain,
! [X0,X1,X2,X3,X4] :
( a_select2(tptp_update2(X2,X0,X4),X1) = X3
| X0 = X1
| a_select2(X2,X1) != X3 ),
inference(ennf_transformation,[],[f49]) ).
fof(f103,plain,
! [X0,X1,X2,X3,X4] :
( a_select2(tptp_update2(X2,X0,X4),X1) = X3
| X0 = X1
| a_select2(X2,X1) != X3 ),
inference(flattening,[],[f102]) ).
fof(f106,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f9]) ).
fof(f107,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f106]) ).
fof(f113,definition,
( ? [X3] :
( ? [X4] :
( init != a_select3(simplex7_init,X4,X3)
& leq(n0,X4)
& leq(X4,n3) )
& leq(n0,X3)
& leq(X3,n2) )
| ~ sP0 ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f114,plain,
( ( init != init
| sP0
| ? [X5] :
( init != a_select2(tptp_update2(s_values7_init,pv1376,init),X5)
& leq(n0,X5)
& leq(X5,minus(plus(n1,pv1376),n1)) ) )
& init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X0] :
( ! [X1] :
( a_select3(simplex7_init,X1,X0) = init
| ~ leq(n0,X1)
| ~ leq(X1,n3) )
| ~ leq(n0,X0)
| ~ leq(X0,n2) )
& ! [X2] :
( a_select2(s_values7_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,minus(pv1376,n1)) ) ),
inference(definition_folding,[],[f88,f113]) ).
fof(f115,plain,
( ? [X3] :
( ? [X4] :
( init != a_select3(simplex7_init,X4,X3)
& leq(n0,X4)
& leq(X4,n3) )
& leq(n0,X3)
& leq(X3,n2) )
| ~ sP0 ),
inference(nnf_transformation,[],[f113]) ).
fof(f116,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(simplex7_init,X1,X0)
& leq(n0,X1)
& leq(X1,n3) )
& leq(n0,X0)
& leq(X0,n2) )
| ~ sP0 ),
inference(rectify,[],[f115]) ).
fof(f117,plain,
( ( init != a_select3(simplex7_init,sK2,sK1)
& leq(n0,sK2)
& leq(sK2,n3)
& leq(n0,sK1)
& leq(sK1,n2) )
| ~ sP0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f116]) ).
fof(f118,plain,
( ( init != init
| sP0
| ? [X0] :
( init != a_select2(tptp_update2(s_values7_init,pv1376,init),X0)
& leq(n0,X0)
& leq(X0,minus(plus(n1,pv1376),n1)) ) )
& init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X1] :
( ! [X2] :
( init = a_select3(simplex7_init,X2,X1)
| ~ leq(n0,X2)
| ~ leq(X2,n3) )
| ~ leq(n0,X1)
| ~ leq(X1,n2) )
& ! [X3] :
( init = a_select2(s_values7_init,X3)
| ~ leq(n0,X3)
| ~ leq(X3,minus(pv1376,n1)) ) ),
inference(rectify,[],[f114]) ).
fof(f119,plain,
( ( init != init
| sP0
| ( init != a_select2(tptp_update2(s_values7_init,pv1376,init),sK3)
& leq(n0,sK3)
& leq(sK3,minus(plus(n1,pv1376),n1)) ) )
& init = init
& leq(n0,pv1376)
& leq(pv1376,n3)
& ! [X1] :
( ! [X2] :
( init = a_select3(simplex7_init,X2,X1)
| ~ leq(n0,X2)
| ~ leq(X2,n3) )
| ~ leq(n0,X1)
| ~ leq(X1,n2) )
& ! [X3] :
( init = a_select2(s_values7_init,X3)
| ~ leq(n0,X3)
| ~ leq(X3,minus(pv1376,n1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f118]) ).
fof(f123,plain,
! [X0,X1] :
( ( leq(X0,pred(X1))
| ~ gt(X1,X0) )
& ( gt(X1,X0)
| ~ leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f124,plain,
( leq(sK1,n2)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f125,plain,
( leq(n0,sK1)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f126,plain,
( leq(sK2,n3)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f127,plain,
( leq(n0,sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f128,plain,
( init != a_select3(simplex7_init,sK2,sK1)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f129,plain,
! [X3] :
( ~ leq(X3,minus(pv1376,n1))
| ~ leq(n0,X3)
| init = a_select2(s_values7_init,X3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f130,plain,
! [X2,X1] :
( init = a_select3(simplex7_init,X2,X1)
| ~ leq(n0,X2)
| ~ leq(X2,n3)
| ~ leq(n0,X1)
| ~ leq(X1,n2) ),
inference(cnf_transformation,[],[f119]) ).
fof(f134,plain,
( init != init
| sP0
| leq(sK3,minus(plus(n1,pv1376),n1)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f135,plain,
( init != init
| sP0
| leq(n0,sK3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f136,plain,
( init != init
| sP0
| init != a_select2(tptp_update2(s_values7_init,pv1376,init),sK3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f149,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f161,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f165,plain,
! [X2,X3,X0,X1,X4] :
( a_select2(tptp_update2(X2,X0,X4),X1) = X3
| X0 = X1
| a_select2(X2,X1) != X3 ),
inference(cnf_transformation,[],[f103]) ).
fof(f166,plain,
! [X2,X0,X1] : a_select2(tptp_update2(X0,X1,X2),X1) = X2,
inference(cnf_transformation,[],[f48]) ).
fof(f174,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f107]) ).
fof(f186,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f188,plain,
! [X0,X1] :
( leq(X0,pred(X1))
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f208,plain,
! [X0] : minus(plus(n1,X0),n1) = X0,
inference(definition_unfolding,[],[f186,f161,f149]) ).
fof(f209,plain,
! [X0,X1] :
( leq(X0,minus(X1,n1))
| ~ gt(X1,X0) ),
inference(definition_unfolding,[],[f188,f161]) ).
fof(f211,plain,
! [X2,X0,X1,X4] :
( a_select2(X2,X1) = a_select2(tptp_update2(X2,X0,X4),X1)
| X0 = X1 ),
inference(equality_resolution,[],[f165]) ).
fof(f212,plain,
( leq(sK3,minus(plus(n1,pv1376),n1))
| sP0 ),
inference(trivial_inequality_removal,[],[f134]) ).
fof(f213,plain,
( leq(n0,sK3)
| sP0 ),
inference(trivial_inequality_removal,[],[f135]) ).
fof(f214,plain,
( init != a_select2(tptp_update2(s_values7_init,pv1376,init),sK3)
| sP0 ),
inference(trivial_inequality_removal,[],[f136]) ).
fof(f218,plain,
( init != init
| ~ sP0
| ~ leq(n0,sK2)
| ~ leq(sK2,n3)
| ~ leq(n0,sK1)
| ~ leq(sK1,n2) ),
inference(superposition,[],[f128,f130]) ).
fof(f219,plain,
( ~ sP0
| ~ leq(n0,sK2)
| ~ leq(sK2,n3)
| ~ leq(n0,sK1)
| ~ leq(sK1,n2) ),
inference(trivial_inequality_removal,[],[f218]) ).
fof(f220,plain,
( ~ sP0
| ~ leq(sK2,n3)
| ~ leq(n0,sK1)
| ~ leq(sK1,n2) ),
inference(forward_subsumption_resolution,[],[f219,f127]) ).
fof(f221,plain,
( ~ sP0
| ~ leq(n0,sK1)
| ~ leq(sK1,n2) ),
inference(forward_subsumption_resolution,[],[f220,f126]) ).
fof(f222,plain,
( ~ sP0
| ~ leq(sK1,n2) ),
inference(forward_subsumption_resolution,[],[f221,f125]) ).
fof(f223,plain,
~ sP0,
inference(forward_subsumption_resolution,[],[f222,f124]) ).
fof(f238,plain,
( leq(sK3,pv1376)
| sP0 ),
inference(superposition,[],[f212,f208]) ).
fof(f239,plain,
leq(sK3,pv1376),
inference(forward_subsumption_resolution,[],[f238,f223]) ).
fof(f288,plain,
! [X0] :
( init = a_select2(s_values7_init,X0)
| ~ leq(n0,X0)
| ~ gt(pv1376,X0) ),
inference(resolution,[],[f209,f129]) ).
fof(f565,plain,
( init != a_select2(s_values7_init,sK3)
| sP0
| pv1376 = sK3 ),
inference(superposition,[],[f214,f211]) ).
fof(f566,plain,
( init != a_select2(s_values7_init,sK3)
| pv1376 = sK3 ),
inference(forward_subsumption_resolution,[],[f565,f223]) ).
fof(f644,plain,
( init != init
| pv1376 = sK3
| ~ leq(n0,sK3)
| ~ gt(pv1376,sK3) ),
inference(superposition,[],[f566,f288]) ).
fof(f646,plain,
( ~ leq(n0,sK3)
| pv1376 = sK3
| ~ gt(pv1376,sK3) ),
inference(trivial_inequality_removal,[],[f644]) ).
fof(f648,plain,
( pv1376 = sK3
| ~ gt(pv1376,sK3)
| sP0 ),
inference(resolution,[],[f646,f213]) ).
fof(f651,plain,
( ~ gt(pv1376,sK3)
| pv1376 = sK3 ),
inference(forward_subsumption_resolution,[],[f648,f223]) ).
fof(f654,plain,
( pv1376 = sK3
| ~ leq(sK3,pv1376)
| pv1376 = sK3 ),
inference(resolution,[],[f651,f174]) ).
fof(f655,plain,
( pv1376 = sK3
| ~ leq(sK3,pv1376) ),
inference(duplicate_literal_removal,[],[f654]) ).
fof(f657,plain,
pv1376 = sK3,
inference(forward_subsumption_resolution,[],[f655,f239]) ).
fof(f664,plain,
( init != a_select2(tptp_update2(s_values7_init,sK3,init),sK3)
| sP0 ),
inference(superposition,[],[f214,f657]) ).
fof(f689,plain,
sP0,
inference(forward_subsumption_resolution,[],[f664,f166]) ).
fof(f691,plain,
$false,
inference(forward_subsumption_resolution,[],[f689,f223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV033+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n008.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 09:44:24 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running first-order theorem proving
% 0.10/0.22 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.85/1.13 % (2139004)Detected formulas, will run a generic FOF schedule.
% 2.85/1.13 % (2139129)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2043004172:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.85/1.13 % (2139128)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1774486339:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.85/1.13 % (2139126)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=3859291111:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.85/1.13 % (2139125)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=4201277681:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.85/1.13 % (2139124)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=1837514767:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.85/1.13 % (2139127)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4083463848:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.85/1.13 % (2139130)dis-21_1_sil=8000:lcm=predicate:random_seed=1266889287: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.85/1.13 % (2139128)First to succeed.
% 2.85/1.13 % (2139128)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2139004"
% 2.85/1.13 % (2139129)Instruction limit reached!
% 2.85/1.13 % (2139129)------------------------------
% 2.85/1.13 % (2139129)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.13 % (2139129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.13 % (2139129)CaDiCaL version: 2.1.3
% 2.85/1.13 % (2139129)Termination reason: Instruction limit
% 2.85/1.13 % (2139129)Termination phase: Saturation
% 2.85/1.13 % (2139129)Time elapsed: 0.050 s
% 2.85/1.13 % (2139129)Peak memory usage: 90 MB
% 2.85/1.13 % (2139129)Instructions burned: 140 (million)
% 2.85/1.13 % (2139127)Instruction limit reached!
% 2.85/1.13 % (2139127)------------------------------
% 2.85/1.13 % (2139127)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.13 % (2139127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.13 % (2139127)CaDiCaL version: 2.1.3
% 2.85/1.13 % (2139127)Termination reason: Instruction limit
% 2.85/1.13 % (2139127)Termination phase: Saturation
% 2.85/1.13 % (2139127)Time elapsed: 0.060 s
% 2.85/1.13 % (2139127)Peak memory usage: 89 MB
% 2.85/1.13 % (2139127)Instructions burned: 109 (million)
% 2.85/1.13 % (2139130)Instruction limit reached!
% 2.85/1.13 % (2139130)------------------------------
% 2.85/1.13 % (2139130)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.13 % (2139130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.13 % (2139130)CaDiCaL version: 2.1.3
% 2.85/1.13 % (2139130)Termination reason: Instruction limit
% 2.85/1.13 % (2139130)Termination phase: Saturation
% 2.85/1.13 % (2139130)Time elapsed: 0.068 s
% 2.85/1.13 % (2139130)Peak memory usage: 89 MB
% 2.85/1.13 % (2139130)Instructions burned: 129 (million)
% 2.85/1.13 % (2139191)lrs+10_1_sil=8000:sp=occurrence:random_seed=3289066882:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.85/1.13 % (2139191)Also succeeded, but the first one will report.
% 2.85/1.13 % (2139209)lrs+1011_1_sil=32000:sp=occurrence:random_seed=430831795:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.85/1.13 % (2139206)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4114975226:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.85/1.13 % (2139128)Refutation found. Thanks to Tanya!
% 2.85/1.13 % SZS status Theorem for theBenchmark
% 2.85/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 3.76/1.32 % (2139128)------------------------------
% 3.76/1.32 % (2139128)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.76/1.32 % (2139128)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.76/1.32 % (2139128)CaDiCaL version: 2.1.3
% 3.76/1.32 % (2139128)Termination reason: Refutation
% 3.76/1.32 % (2139128)Time elapsed: 0.017 s
% 3.76/1.32 % (2139128)Peak memory usage: 88 MB
% 3.76/1.32 % (2139128)Instructions burned: 24 (million)
% 3.76/1.32 % (2139128)------------------------------
% 3.76/1.32 % (2139128)------------------------------
% 3.76/1.32 % (2139004)Success in time 0.424 s
% 3.76/1.32 % Vampire exiting
%------------------------------------------------------------------------------