Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has an exponentialsize and that limited OBDD derivations cannot simulate resolution polynomially. Here we show that any arbitrary OBDD Apply refutation of the pigeonhole formula has an exponentialsize: we prove that the size of one of the intermediate OBDDs is at least (114n). We also present a family of CNFs that require exponential increase for all OBDD refutations based on Apply method to simulate unrestricted resolution refutation.