Before revision:  We show that  competitive ratio of an optimal deterministic online algorithm for OUC is at least 3 and at most 5.
After revision:  We show that competitive ratio of an optimal deterministic online algorithm (with an adaptive deterministic adversary) for Unit Covering in \mathbb{R is at least 3 and at most 5.