On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas