In part 1 of the reduction (Section 3.1.2), this allows us to "guess" arbitrary truth assignments for the variables in the clause φ.
the possibility to write grammars with lexical ambiguity is an essential feature of all interesting formalisms for natural language syntax, including also TAG.