The revised Szeged index of a graph is defined as , where and are, respectively, the number of vertices of lying closer to vertex than to vertex and the number of vertices of lying closer to vertex than to vertex , and is the number of vertices equidistant to and . Hansen et al. used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph of order : with equality if and only if is the graph obtained from the cycle by duplicating a single vertex. This paper is to give a confirmative proof to this conjecture.