If the counting function N(x) of integers of a Beurling generalized number system satisfies both ${\int }_1^{\infty }{x}^{-2}|N\left(x\right)-Ax|dx<\infty$ and $x^{-1}\left(logx\right)(N\left(x\right)-Ax)=O\left(1\right)$, then the counting function π(x) of the primes of this system is known to satisfy the Chebyshev bound π(x) ≪ x/logx. Let f(x) increase to infinity arbitrarily slowly. We give a construction showing that ${\int }_1^{\infty }|N\left(x\right)-Ax|x^{-2}dx<\infty$ and $x^{-1}\left(logx\right)(N\left(x\right)-Ax)=O\left(f\left(x\right)\right)$ do not imply the Chebyshev bound.