Suppose L = {p, q, r, s, t} is a lattice represented by the following Hasse diagram: For any x, y ∈ L, not necessarily distinct, x ∨ y and x ∧ y are join and meet of x, y, respectively. Let L³ = {(x, y, z): x, y, z ∈ L} be the set of all ordered triplets of the elements of L. Let p_r be the probability that an element (x, y, z) ∈ L³ chosen equiprobably satisfies x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z). Then