Write in first-order logic the assertion that every key and at least one of every pair of socks will eventually be lost forever, using only the following vocabulary: Key(x), x is a key; Sock(x), x is a sock; Pair (x, y), x and y are a pair; Now, the current time; Before(t₁, t₂), time t₁ comes before time t₂; Lost (x, t), object x is lost at time t.