This note presents an example that disproves, forn=4, Weinbaum’s conjecture, that ifw is a cyclically reduced primitive word inF n such that all the generatorsx∈X appear inw then some cyclic permutation ofw can be partitioned inton words generatingF n :w≡uv,vu≡s 1 s 2…s n , =F n .