%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM925+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 12:17:34 PM UTC 2026
% Result : Theorem 3.10s 1.35s
% Output : Refutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of formulae : 72 ( 47 unt; 0 def)
% Number of atoms : 149 ( 87 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 140 ( 63 ~; 55 |; 15 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 73 ( 73 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0] : bit1(ti(int,X0)) = bit1(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_OBit1_arg1) ).
fof(f37,axiom,
! [X0] :
( semiring_1(X0)
=> power_power(X0,zero_zero(X0),number_number_of(nat,bit0(bit1(pls)))) = zero_zero(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_zero__power2) ).
fof(f43,axiom,
! [X0] : power_power(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),number_number_of(nat,bit0(bit1(pls)))) = power_power(int,X0,number_number_of(nat,bit0(bit0(bit1(pls))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_10_quartic__square__square) ).
fof(f75,axiom,
! [X0,X1] :
( bit1(X0) = bit1(X1)
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_42_rel__simps_I51_J) ).
fof(f80,axiom,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_47_zadd__commute) ).
fof(f93,axiom,
! [X0,X1] :
( ord_less(int,X0,plus_plus(int,X1,one_one(int)))
<=> ( ord_less(int,X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_60_zless__add1__eq) ).
fof(f94,axiom,
! [X0] : ~ ord_less(int,semiring_1_of_nat(int,X0),zero_zero(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_61_int__less__0__conv) ).
fof(f106,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_73_Pls__def) ).
fof(f108,axiom,
! [X0] : plus_plus(int,X0,pls) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_75_add__Pls__right) ).
fof(f109,axiom,
! [X0] : plus_plus(int,pls,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_76_add__Pls) ).
fof(f119,axiom,
! [X0] :
( ( power(X0)
& mult_zero(X0)
& no_zero_divisors(X0)
& zero_neq_one(X0) )
=> ! [X1,X2] :
( power_power(X0,X1,number_number_of(nat,X2)) = zero_zero(X0)
<=> ( ti(X0,X1) = zero_zero(X0)
& number_number_of(nat,X2) != zero_zero(nat) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_86_power__eq__0__iff__number__of) ).
fof(f125,axiom,
! [X0] : bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_92_Bit1__def) ).
fof(f133,axiom,
no_zero_divisors(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ono__zero__divisors) ).
fof(f136,axiom,
zero_neq_one(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ozero__neq__one) ).
fof(f137,axiom,
semiring_1(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Osemiring__1) ).
fof(f139,axiom,
mult_zero(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Omult__zero) ).
fof(f142,axiom,
power(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Power_Opower) ).
fof(f153,conjecture,
power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls)))) != zero_zero(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(f154,negated_conjecture,
~ ( power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls)))) != zero_zero(int) ),
inference(negated_conjecture,[status(cth)],[f153]) ).
fof(f155,plain,
zero_zero(int) = power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls)))),
inference(flattening,[],[f154]) ).
fof(f189,plain,
! [X0] :
( power_power(X0,zero_zero(X0),number_number_of(nat,bit0(bit1(pls)))) = zero_zero(X0)
| ~ semiring_1(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f221,plain,
! [X0] :
( ! [X1,X2] :
( power_power(X0,X1,number_number_of(nat,X2)) = zero_zero(X0)
<=> ( ti(X0,X1) = zero_zero(X0)
& number_number_of(nat,X2) != zero_zero(nat) ) )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(ennf_transformation,[],[f119]) ).
fof(f222,plain,
! [X0] :
( ! [X1,X2] :
( power_power(X0,X1,number_number_of(nat,X2)) = zero_zero(X0)
<=> ( ti(X0,X1) = zero_zero(X0)
& number_number_of(nat,X2) != zero_zero(nat) ) )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(flattening,[],[f221]) ).
fof(f246,plain,
! [X0,X1] :
( ( bit1(X0) = bit1(X1)
| X0 != X1 )
& ( X0 = X1
| bit1(X0) != bit1(X1) ) ),
inference(nnf_transformation,[],[f75]) ).
fof(f259,plain,
! [X0,X1] :
( ( ord_less(int,X0,plus_plus(int,X1,one_one(int)))
| ( ~ ord_less(int,X0,X1)
& X0 != X1 ) )
& ( ord_less(int,X0,X1)
| X0 = X1
| ~ ord_less(int,X0,plus_plus(int,X1,one_one(int))) ) ),
inference(nnf_transformation,[],[f93]) ).
fof(f260,plain,
! [X0,X1] :
( ( ord_less(int,X0,plus_plus(int,X1,one_one(int)))
| ( ~ ord_less(int,X0,X1)
& X0 != X1 ) )
& ( ord_less(int,X0,X1)
| X0 = X1
| ~ ord_less(int,X0,plus_plus(int,X1,one_one(int))) ) ),
inference(flattening,[],[f259]) ).
fof(f267,plain,
! [X0] :
( ! [X1,X2] :
( ( power_power(X0,X1,number_number_of(nat,X2)) = zero_zero(X0)
| zero_zero(X0) != ti(X0,X1)
| zero_zero(nat) = number_number_of(nat,X2) )
& ( ( ti(X0,X1) = zero_zero(X0)
& number_number_of(nat,X2) != zero_zero(nat) )
| zero_zero(X0) != power_power(X0,X1,number_number_of(nat,X2)) ) )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(nnf_transformation,[],[f222]) ).
fof(f268,plain,
! [X0] :
( ! [X1,X2] :
( ( power_power(X0,X1,number_number_of(nat,X2)) = zero_zero(X0)
| zero_zero(X0) != ti(X0,X1)
| zero_zero(nat) = number_number_of(nat,X2) )
& ( ( ti(X0,X1) = zero_zero(X0)
& number_number_of(nat,X2) != zero_zero(nat) )
| zero_zero(X0) != power_power(X0,X1,number_number_of(nat,X2)) ) )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(flattening,[],[f267]) ).
fof(f285,plain,
! [X0] : bit1(ti(int,X0)) = bit1(X0),
inference(cnf_transformation,[],[f14]) ).
fof(f314,plain,
! [X0] :
( ~ semiring_1(X0)
| zero_zero(X0) = power_power(X0,zero_zero(X0),number_number_of(nat,bit0(bit1(pls)))) ),
inference(cnf_transformation,[],[f189]) ).
fof(f321,plain,
! [X0] : power_power(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),number_number_of(nat,bit0(bit1(pls)))) = power_power(int,X0,number_number_of(nat,bit0(bit0(bit1(pls))))),
inference(cnf_transformation,[],[f43]) ).
fof(f365,plain,
! [X0,X1] :
( bit1(X0) != bit1(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f246]) ).
fof(f373,plain,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(cnf_transformation,[],[f80]) ).
fof(f397,plain,
! [X0,X1] :
( ord_less(int,X0,plus_plus(int,X1,one_one(int)))
| X0 != X1 ),
inference(cnf_transformation,[],[f260]) ).
fof(f399,plain,
! [X0] : ~ ord_less(int,semiring_1_of_nat(int,X0),zero_zero(int)),
inference(cnf_transformation,[],[f94]) ).
fof(f417,plain,
pls = zero_zero(int),
inference(cnf_transformation,[],[f106]) ).
fof(f419,plain,
! [X0] : plus_plus(int,X0,pls) = X0,
inference(cnf_transformation,[],[f108]) ).
fof(f420,plain,
! [X0] : plus_plus(int,pls,X0) = X0,
inference(cnf_transformation,[],[f109]) ).
fof(f431,plain,
! [X2,X0,X1] :
( ~ zero_neq_one(X0)
| zero_zero(X0) != power_power(X0,X1,number_number_of(nat,X2))
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| zero_zero(X0) = ti(X0,X1) ),
inference(cnf_transformation,[],[f268]) ).
fof(f438,plain,
! [X0] : bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0),
inference(cnf_transformation,[],[f125]) ).
fof(f449,plain,
no_zero_divisors(int),
inference(cnf_transformation,[],[f133]) ).
fof(f452,plain,
zero_neq_one(int),
inference(cnf_transformation,[],[f136]) ).
fof(f453,plain,
semiring_1(int),
inference(cnf_transformation,[],[f137]) ).
fof(f455,plain,
mult_zero(int),
inference(cnf_transformation,[],[f139]) ).
fof(f458,plain,
power(int),
inference(cnf_transformation,[],[f142]) ).
fof(f469,plain,
zero_zero(int) = power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls)))),
inference(cnf_transformation,[],[f155]) ).
fof(f475,plain,
! [X1] : ord_less(int,X1,plus_plus(int,X1,one_one(int))),
inference(equality_resolution,[],[f397]) ).
fof(f490,plain,
! [X0] : ~ ord_less(int,semiring_1_of_nat(int,X0),pls),
inference(forward_demodulation,[],[f399,f417]) ).
fof(f501,plain,
! [X0,X1] :
( bit1(X0) != bit1(X1)
| ti(int,X0) = X1 ),
inference(superposition,[],[f365,f285]) ).
fof(f523,plain,
! [X0] : ord_less(int,X0,plus_plus(int,one_one(int),X0)),
inference(superposition,[],[f475,f373]) ).
fof(f590,plain,
! [X0] : ti(int,X0) = X0,
inference(equality_resolution,[],[f501]) ).
fof(f635,plain,
! [X0] : bit1(X0) = plus_plus(int,X0,plus_plus(int,one_one(int),X0)),
inference(forward_demodulation,[],[f438,f373]) ).
fof(f656,plain,
bit1(pls) = plus_plus(int,one_one(int),pls),
inference(superposition,[],[f420,f635]) ).
fof(f657,plain,
one_one(int) = bit1(pls),
inference(forward_demodulation,[],[f656,f419]) ).
fof(f672,plain,
! [X0] : ord_less(int,X0,plus_plus(int,bit1(pls),X0)),
inference(superposition,[],[f523,f657]) ).
fof(f796,plain,
zero_zero(int) = power_power(int,zero_zero(int),number_number_of(nat,bit0(bit1(pls)))),
inference(resolution,[],[f314,f453]) ).
fof(f797,plain,
pls = power_power(int,pls,number_number_of(nat,bit0(bit1(pls)))),
inference(forward_demodulation,[],[f796,f417]) ).
fof(f1504,plain,
! [X0,X1] :
( zero_zero(int) != power_power(int,X0,number_number_of(nat,X1))
| ~ power(int)
| ~ mult_zero(int)
| ~ no_zero_divisors(int)
| ti(int,X0) = zero_zero(int) ),
inference(resolution,[],[f431,f452]) ).
fof(f1505,plain,
! [X0,X1] :
( zero_zero(int) != power_power(int,X0,number_number_of(nat,X1))
| ~ mult_zero(int)
| ~ no_zero_divisors(int)
| ti(int,X0) = zero_zero(int) ),
inference(forward_subsumption_resolution,[],[f1504,f458]) ).
fof(f1507,plain,
! [X0,X1] :
( zero_zero(int) != power_power(int,X0,number_number_of(nat,X1))
| ~ no_zero_divisors(int)
| ti(int,X0) = zero_zero(int) ),
inference(forward_subsumption_resolution,[],[f1505,f455]) ).
fof(f1509,plain,
! [X0,X1] :
( zero_zero(int) != power_power(int,X0,number_number_of(nat,X1))
| ti(int,X0) = zero_zero(int) ),
inference(forward_subsumption_resolution,[],[f1507,f449]) ).
fof(f1511,plain,
! [X0,X1] :
( pls != power_power(int,X0,number_number_of(nat,X1))
| ti(int,X0) = zero_zero(int) ),
inference(forward_demodulation,[],[f1509,f417]) ).
fof(f1512,plain,
! [X0,X1] :
( ti(int,X0) = pls
| pls != power_power(int,X0,number_number_of(nat,X1)) ),
inference(forward_demodulation,[],[f1511,f417]) ).
fof(f1513,plain,
! [X0,X1] :
( pls != power_power(int,X0,number_number_of(nat,X1))
| pls = X0 ),
inference(forward_demodulation,[],[f1512,f590]) ).
fof(f1534,plain,
power_power(int,zero_zero(int),number_number_of(nat,bit0(bit1(pls)))) = power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit0(bit1(pls))))),
inference(superposition,[],[f321,f469]) ).
fof(f1540,plain,
power_power(int,zero_zero(int),number_number_of(nat,bit0(bit1(pls)))) = power_power(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit0(bit1(pls))))),
inference(forward_demodulation,[],[f1534,f657]) ).
fof(f1541,plain,
power_power(int,pls,number_number_of(nat,bit0(bit1(pls)))) = power_power(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit0(bit1(pls))))),
inference(forward_demodulation,[],[f1540,f417]) ).
fof(f1542,plain,
pls = power_power(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit0(bit1(pls))))),
inference(forward_demodulation,[],[f1541,f797]) ).
fof(f2272,plain,
( pls != pls
| pls = plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)) ),
inference(superposition,[],[f1513,f1542]) ).
fof(f2273,plain,
pls = plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),
inference(trivial_inequality_removal,[],[f2272]) ).
fof(f2283,plain,
ord_less(int,semiring_1_of_nat(int,n),pls),
inference(superposition,[],[f672,f2273]) ).
fof(f2292,plain,
$false,
inference(forward_subsumption_resolution,[],[f2283,f490]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM925+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n018.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 21:45:21 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 3.10/1.35 % (2753992)Detected formulas, will run a generic FOF schedule.
% 3.10/1.35 % (2754001)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2545834289:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.10/1.35 % (2754001)Instruction limit reached!
% 3.10/1.35 % (2754001)------------------------------
% 3.10/1.35 % (2754001)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.35 % (2754001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.35 % (2754001)CaDiCaL version: 2.1.3
% 3.10/1.35 % (2754001)Termination reason: Instruction limit
% 3.10/1.35 % (2754001)Termination phase: Saturation
% 3.10/1.35 % (2754001)Time elapsed: 0.035 s
% 3.10/1.35 % (2754001)Peak memory usage: 88 MB
% 3.10/1.35 % (2754001)Instructions burned: 121 (million)
% 3.10/1.35 % (2753999)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=1281549361:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.10/1.35 % (2754000)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=422480286:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.10/1.35 % (2753997)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=774791904:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.10/1.35 % (2753998)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=187375556:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.10/1.35 % (2754002)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1416451998:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.10/1.35 % (2754003)dis-21_1_sil=8000:lcm=predicate:random_seed=1749580088: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)
% 3.10/1.35 % (2754000)Instruction limit reached!
% 3.10/1.35 % (2754000)------------------------------
% 3.10/1.35 % (2754000)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.35 % (2754000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.35 % (2754000)CaDiCaL version: 2.1.3
% 3.10/1.35 % (2754000)Termination reason: Instruction limit
% 3.10/1.35 % (2754000)Termination phase: Saturation
% 3.10/1.35 % (2754000)Time elapsed: 0.064 s
% 3.10/1.35 % (2754000)Peak memory usage: 89 MB
% 3.10/1.35 % (2754000)Instructions burned: 110 (million)
% 3.10/1.35 % (2754002)First to succeed.
% 3.10/1.35 % (2754002)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2753992"
% 3.10/1.35 % (2754003)Instruction limit reached!
% 3.10/1.35 % (2754003)------------------------------
% 3.10/1.35 % (2754003)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.35 % (2754003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.35 % (2754003)CaDiCaL version: 2.1.3
% 3.10/1.35 % (2754003)Termination reason: Instruction limit
% 3.10/1.35 % (2754003)Termination phase: Saturation
% 3.10/1.35 % (2754003)Time elapsed: 0.073 s
% 3.10/1.35 % (2754003)Peak memory usage: 89 MB
% 3.10/1.35 % (2754003)Instructions burned: 129 (million)
% 3.10/1.35 % (2754005)lrs+10_1_sil=8000:sp=occurrence:random_seed=425932558:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.10/1.35 % (2754005)Instruction limit reached!
% 3.10/1.35 % (2754005)------------------------------
% 3.10/1.35 % (2754005)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.35 % (2754005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.35 % (2754005)CaDiCaL version: 2.1.3
% 3.10/1.35 % (2754005)Termination reason: Instruction limit
% 3.10/1.35 % (2754005)Termination phase: Saturation
% 3.10/1.35 % (2754005)Time elapsed: 0.088 s
% 3.10/1.35 % (2754005)Peak memory usage: 91 MB
% 3.10/1.35 % (2754005)Instructions burned: 287 (million)
% 3.10/1.35 % (2754012)lrs+10_1_sil=32000:urr=on:br=off:random_seed=776205115:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.10/1.35 % (2754013)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2257099872:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.10/1.35 % (2754012)Instruction limit reached!
% 3.10/1.35 % (2754012)------------------------------
% 3.10/1.35 % (2754012)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.35 % (2754012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.35 % (2754012)CaDiCaL version: 2.1.3
% 3.10/1.35 % (2754012)Termination reason: Instruction limit
% 3.10/1.35 % (2754012)Termination phase: Saturation
% 3.10/1.35 % (2754012)Time elapsed: 0.086 s
% 3.10/1.35 % (2754012)Peak memory usage: 89 MB
% 3.10/1.35 % (2754012)Instructions burned: 159 (million)
% 3.10/1.35 % (2754015)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=1322313982:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 3.10/1.35 % (2754002)Refutation found. Thanks to Tanya!
% 3.10/1.35 % SZS status Theorem for theBenchmark
% 3.10/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 4.09/1.54 % (2754002)------------------------------
% 4.09/1.54 % (2754002)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.09/1.54 % (2754002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.09/1.54 % (2754002)CaDiCaL version: 2.1.3
% 4.09/1.54 % (2754002)Termination reason: Refutation
% 4.09/1.54 % (2754002)Time elapsed: 0.057 s
% 4.09/1.54 % (2754002)Peak memory usage: 90 MB
% 4.09/1.54 % (2754002)Instructions burned: 85 (million)
% 4.09/1.54 % (2754002)------------------------------
% 4.09/1.54 % (2754002)------------------------------
% 4.09/1.54 % (2753992)Success in time 0.495 s
% 4.09/1.54 % Vampire exiting
%------------------------------------------------------------------------------