Polynomial-Time Algorithm for an NP-Hard Language Implies $P = NP$