premise: Exactly seven toy-truck models—F, G, H, J, K, M, and S—are assembled on seven assembly lines, exactly one model to a line. The seven lines are arranged side by side and numbered consecutively 1 through 7. Assignment of models to lines must meet the following conditions: F is assembled on a lower-numbered line than J. M is assembled on the line numbered one lower than the line on which G is assembled. H is assembled on line 1 or else line 7. S is assembled on line 4. It must be true that the lowest-numbered line on which
hypothesis: J can be assembled is line 2