We study the provability of formulae in Hilbert-style calculi for propositional non-classical logics by methods of automated theorem proving.