We consider satisfiable Tseitin formulas TS_G,c based on d-regular expanders G with the absolute value of the second largest eigenvalue less than d3 . We prove that any nondeterministic read-once branching program (1-NBP) representing TS_G,c has size 2(n), where n is the number of vertices in G. It extends the recent result by Itsykson at el. [9] from OBDD to 1-NBP. On the other hand it is easy to see that TS_G,c can be represented as a read-2 branching program (2-BP) of size O(n), as the negation of a nondeterministic read-once branching program (1-coNBP) of size O(n) and as a CNF formula of size O(n). Thus TSG,c gives the best possible separations (up to a constant in the exponent) between 1-NBP and 2-BP, 1-NBP and 1-coNBP and between 1-NBP and CNF.