In the τ-minimizer endgame, let X1′,X2′ be independent copies of X1,X2, set k=d[X1;X2], U=X1+X2, V=X1′+X2, W=X1′+X1, S=X1+X2+X1′+X2′, and I1=I[U:V∣S]. If c[A∣S#A∣S]=∑i=12(d[Xi0;A∣S]−d[Xi0;Xi]), then c[U∣S#U∣S]+c[V∣S#V∣S]+c[W∣S#W∣S]≤(6−3η)k+3(2ηk−I1).