Error term in Mertens' third theorem

There's been a lot of work on unconditional results of this sort.

Rosser and Schoenfeld showed in a 1962 paper that one can take

$$\dfrac{e^{-\gamma}}{\log x} \left(1- \frac{1}{2\log^2 x} \right) < \prod_{\substack{ p \leq x \\ \text{p prime} }} \left( 1 - \dfrac{1}{p} \right) < \dfrac{e^{-\gamma}}{\log x} \left(1+ \frac{1}{2\log^2 x} \right).$$ The upper bound is valid for $x>1$ and the lower bound for $x> 285.$

This was subequently improved by Dusart in a 2016 paper that if one has $ x \geq 2278382$ then one has $$\dfrac{e^{-\gamma}}{\log x} \left(1- \frac{1}{5\log^3 x} \right) < \prod_{\substack{ p \leq x \\ \text{p prime} }} \left( 1 - \dfrac{1}{p} \right) < \dfrac{e^{-\gamma}}{\log x} \left(1+ \frac{1}{5\log^3 x} \right).$$

Tighter bounds which as far as I'm aware are best known today with reasonably tight explicit constants are in a paper of Axler http://math.colgate.edu/~integers/s52/s52.pdf although the bounds as written are a bit uglier in form. Note that there's a typo in inequality 6.3 in that paper where the parenthetical should be $$\left(1+\frac{1}{20 \log^3 x} +\frac{3}{16\log^4 x} + \frac{1.02}{(x-1)\log x}\right). $$ Axler's error term is essentially of the same order as that of Dusart but with an improved constant. Axler's paper also contains full references for Dusart as well as Rosser and Schoenfeld. All of these papers also have similar bounds on other functions related to counting primes such as Chebyshev's functions.

Unconditionally, the best known error term (f(x) in the original question) is in

E.A. Vasil’kovskaja, Mertens’ formula for an arithmetic progression, Taškent. Gos. Univ. Nauˇcn. Trudy, VoprosyMat. 548 (1977) 14–17, 139–140

See also the introduction of my paper with Zaccagnini on j.number theory, 127 (2007), 37–46, https://doi.org/10.1016/j.jnt.2006.12.015