Most natural problems like RH, twin primes, etc dont fundamentally rely on the inaccessible cardinals. Any problem that depends on them, there is much debate whether they can be called natural.
Many problems may not require even full zfc. zf, peano or even weaker may be enough.
There are also many theorem provers not just lean. lean depends on type theory, but metamath for example depends on zfc directly.
It may be a good but likely tedious exercise to convince yourself by translating the current proof to a zfc dependent prover.