Mutilated chessboard problem is exponentially hard for resolution

Mutilated chessboard principle CB_n says that it is impossible to cover by domino tiles the chessboard 2n×2n with two diagonally opposite corners removed. We prove lower bound on the size of minimal resolution refutation of CB_n.