Let D = { (k_1, v_1), (k_2, v_2), ..., (k_n, v_n) }
For all x (For all y (P(x, y) implies P(x + 1, y + 1)))
There exists x (There exists y (Q(x, y) and not P(x + 1, y + 1)))
Where:
D is a dictionary with n key-value pairs (k_i, v_i).
P(x, y) is a predicate representing printing "Deranged" for key x and value y.
Q(x, y) is a predicate representing printing "Post" for key x and value y.