%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM972_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:26:19 PM UTC 2026
% Result : Theorem 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 58 ( 49 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 37 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 25 ( 16 ~; 7 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 8 con; 0-3 aty)
% Number of variables : 24 ( 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
bit0: int > int ).
tff(func_def_4,type,
bit1: int > int ).
tff(func_def_5,type,
min: int ).
tff(func_def_6,type,
pls: int ).
tff(func_def_7,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_8,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_9,type,
legendre: ( int * int ) > int ).
tff(func_def_10,type,
fFalse: bool ).
tff(func_def_11,type,
fTrue: bool ).
tff(func_def_12,type,
m: int ).
tff(func_def_13,type,
s: int ).
tff(func_def_14,type,
t: int ).
tff(func_def_15,type,
sK0: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
zprime: int > $o ).
tff(pred_def_10,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_11,type,
twoSqu1567020053sum2sq: int > $o ).
tff(pred_def_12,type,
pp: bool > $o ).
tff(f1,axiom,
t = one_one(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__096t_A_061_A1_096) ).
tff(f2,axiom,
twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_qf1pt) ).
tff(f32,axiom,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_31_number__of__is__id) ).
tff(f33,axiom,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_32_add__Pls__right) ).
tff(f35,axiom,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_34_Bit0__def) ).
tff(f44,axiom,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_43_Bit1__def) ).
tff(f47,axiom,
! [X0: $tType] :
( number_ring(X0)
=> ! [X1: X0] : ( times_times(X0,X1,number_number_of(X0,bit1(pls))) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_46_mult__numeral__1__right) ).
tff(f57,axiom,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_56_nat__1__add__1) ).
tff(f60,axiom,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_59_t) ).
tff(f61,axiom,
! [X0: $tType] :
( number_ring(X0)
=> ( one_one(X0) = number_number_of(X0,bit1(pls)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_60_semiring__norm_I110_J) ).
tff(f103,axiom,
number_ring(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Int_Onumber__ring) ).
tff(f113,conjecture,
twoSqu1567020053sum2sq(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f114,negated_conjecture,
~ twoSqu1567020053sum2sq(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(negated_conjecture,[status(cth)],[f113]) ).
tff(f115,plain,
~ twoSqu1567020053sum2sq(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(flattening,[],[f114]) ).
tff(f141,plain,
! [X0: $tType] :
( ! [X1: X0] : ( times_times(X0,X1,number_number_of(X0,bit1(pls))) = X1 )
| ~ number_ring(X0) ),
inference(ennf_transformation,[],[f47]) ).
tff(f149,plain,
! [X0: $tType] :
( ( one_one(X0) = number_number_of(X0,bit1(pls)) )
| ~ number_ring(X0) ),
inference(ennf_transformation,[],[f61]) ).
tff(f187,plain,
t = one_one(int),
inference(cnf_transformation,[],[f1]) ).
tff(f188,plain,
twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
inference(cnf_transformation,[],[f2]) ).
tff(f223,plain,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
inference(cnf_transformation,[],[f32]) ).
tff(f224,plain,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
inference(cnf_transformation,[],[f33]) ).
tff(f226,plain,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
inference(cnf_transformation,[],[f35]) ).
tff(f235,plain,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
inference(cnf_transformation,[],[f44]) ).
tff(f238,plain,
! [X0: $tType,X1: X0] :
( ( times_times(X0,X1,number_number_of(X0,bit1(pls))) = X1 )
| ~ number_ring(X0) ),
inference(cnf_transformation,[],[f141]) ).
tff(f248,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
inference(cnf_transformation,[],[f57]) ).
tff(f250,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(cnf_transformation,[],[f60]) ).
tff(f251,plain,
! [X0: $tType] :
( ( one_one(X0) = number_number_of(X0,bit1(pls)) )
| ~ number_ring(X0) ),
inference(cnf_transformation,[],[f149]) ).
tff(f312,plain,
number_ring(int),
inference(cnf_transformation,[],[f103]) ).
tff(f322,plain,
~ twoSqu1567020053sum2sq(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(cnf_transformation,[],[f115]) ).
tff(f323,plain,
twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t)),
inference(definition_unfolding,[],[f188,f226,f226,f235]) ).
tff(f348,plain,
! [X0: $tType,X1: X0] :
( ( times_times(X0,X1,number_number_of(X0,plus_plus(int,plus_plus(int,one_one(int),pls),pls))) = X1 )
| ~ number_ring(X0) ),
inference(definition_unfolding,[],[f238,f235]) ).
tff(f358,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))),
inference(definition_unfolding,[],[f248,f226,f235]) ).
tff(f360,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),one_one(int)),
inference(definition_unfolding,[],[f250,f226,f226,f235,f226,f235]) ).
tff(f361,plain,
! [X0: $tType] :
( ( one_one(X0) = number_number_of(X0,plus_plus(int,plus_plus(int,one_one(int),pls),pls)) )
| ~ number_ring(X0) ),
inference(definition_unfolding,[],[f251,f235]) ).
tff(f402,plain,
~ twoSqu1567020053sum2sq(plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))),
inference(definition_unfolding,[],[f322,f226,f226,f235]) ).
tff(f412,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat))),one_one(int)),
inference(backward_demodulation,[],[f360,f358]) ).
tff(f418,plain,
! [X0: $tType,X1: X0] :
( ~ number_ring(X0)
| ( times_times(X0,X1,one_one(X0)) = X1 ) ),
inference(forward_subsumption_demodulation,[],[f348,f361]) ).
tff(f428,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls))),
inference(backward_demodulation,[],[f358,f224]) ).
tff(f437,plain,
~ twoSqu1567020053sum2sq(plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)),plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)))),m),one_one(int))),
inference(backward_demodulation,[],[f402,f224]) ).
tff(f448,plain,
twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))),m),one_one(int)),t)),
inference(forward_demodulation,[],[f323,f223]) ).
tff(f468,plain,
plus_plus(int,power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat))),t) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),pls),plus_plus(int,plus_plus(int,t,pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,t,pls),pls),plus_plus(int,plus_plus(int,t,pls),pls)))),m),t),t),
inference(forward_demodulation,[],[f412,f187]) ).
tff(f469,plain,
~ twoSqu1567020053sum2sq(plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)),plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)))),m),t)),
inference(forward_demodulation,[],[f437,f187]) ).
tff(f478,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,plus_plus(int,one_one(int),one_one(int))),
inference(forward_demodulation,[],[f428,f224]) ).
tff(f497,plain,
twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),pls),plus_plus(int,plus_plus(int,t,pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,t,pls),pls),plus_plus(int,plus_plus(int,t,pls),pls))),m),t),t)),
inference(forward_demodulation,[],[f448,f187]) ).
tff(f499,plain,
plus_plus(int,power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat))),t) = times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),pls),plus_plus(int,plus_plus(int,t,pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,t,pls),pls),plus_plus(int,plus_plus(int,t,pls),pls))),m),t),t),
inference(forward_demodulation,[],[f468,f223]) ).
tff(f500,plain,
~ twoSqu1567020053sum2sq(plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)),plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls))),m),t)),
inference(forward_demodulation,[],[f469,f223]) ).
tff(f509,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,plus_plus(int,t,t)),
inference(forward_demodulation,[],[f478,f187]) ).
tff(f521,plain,
twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)),plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls))),m),t),t)),
inference(forward_demodulation,[],[f497,f224]) ).
tff(f523,plain,
plus_plus(int,power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat))),t) = times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)),plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls))),m),t),t),
inference(forward_demodulation,[],[f499,f224]) ).
tff(f524,plain,
~ twoSqu1567020053sum2sq(plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t)),
inference(forward_demodulation,[],[f500,f224]) ).
tff(f533,plain,
twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t),t)),
inference(forward_demodulation,[],[f521,f224]) ).
tff(f535,plain,
plus_plus(int,power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat))),t) = times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t),t),
inference(forward_demodulation,[],[f523,f224]) ).
tff(f538,plain,
times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t),t) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,t,t))),t),
inference(forward_demodulation,[],[f535,f509]) ).
tff(f539,plain,
twoSqu1567020053sum2sq(plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,t,t))),t)),
inference(backward_demodulation,[],[f533,f538]) ).
tff(f547,plain,
! [X0: int] : ( times_times(int,X0,one_one(int)) = X0 ),
inference(resolution,[],[f418,f312]) ).
tff(f548,plain,
! [X0: int] : ( times_times(int,X0,t) = X0 ),
inference(forward_demodulation,[],[f547,f187]) ).
tff(f549,plain,
plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,t,t))),t),
inference(backward_demodulation,[],[f538,f548]) ).
tff(f553,plain,
~ twoSqu1567020053sum2sq(plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,t,t))),t)),
inference(backward_demodulation,[],[f524,f549]) ).
tff(f554,plain,
$false,
inference(forward_subsumption_resolution,[],[f553,f539]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM972_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n016.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 21:53:47 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.52 % (3025059)Will run a generic schedule for satisfiability detection.
% 0.18/0.52 % (3025072)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3961839587:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.52 % (3025071)% WARNING: option uhcvi not known.
% 0.18/0.52 % (3025070)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=539668109_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.52 % (3025073)dis+10_1_sil=32000:sp=arity:random_seed=879709784:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.52 % (3025075)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1942615217:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.52 % (3025074)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2782025362:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.52 % (3025076)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3683203969:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.52 % (3025071)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1420300287:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.52 % Exception at run slice level
% 0.18/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.52 % (3025091)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1278688774:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.52 % Exception at run slice level
% 0.18/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.52 % (3025098)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2562065893:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.52 % (3025098) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3025059-3025098"...
% 0.18/0.52 % (3025073) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3025059-3025073"...
% 0.18/0.52 % (3025098)...printing done.
% 0.18/0.52 % (3025098)Refutation found. Thanks to Tanya!
% 0.18/0.52 % SZS status Theorem for theBenchmark
% 0.18/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52 % (3025098)------------------------------
% 0.18/0.52 % (3025098)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.52 % (3025098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.52 % (3025098)CaDiCaL version: 2.1.3
% 0.18/0.52 % (3025098)Termination reason: Refutation
% 0.18/0.52 % (3025098)Time elapsed: 0.011 s
% 0.18/0.52 % (3025098)Peak memory usage: 12 MB
% 0.18/0.52 % (3025098)Instructions burned: 35 (million)
% 0.18/0.52 % (3025059)Success in time 0.08 s
% 0.18/0.52 % Vampire exiting
%------------------------------------------------------------------------------