We show that any nondeterministic read-once branching program that computes a satisfiable Tseitin formula based on an n\times n grid graph has size at least 2^{\Omega(n)}. Then using the Excluded Grid Theorem by Robertson and Seymour we show that for arbitrary graph G(V,E) any nondeterministic read-once branching program that computes ... more >>>