A language model is tasked with ranking a set of three candidate responses {R1, R2, R3} for a given prompt. The model has computed the following conditional log-probabilities for selecting the best response from a given set of available options:

• log Pr(R1 | {R1, R2, R3}) = -0.6

• log Pr(R2 | {R1, R2, R3}) = -1.1

• log Pr(R3 | {R1, R2, R3}) = -1.5

• log Pr(R2 | {R2, R3}) = -0.4

• log Pr(R3 | {R2, R3}) = -1.3

• log Pr(R1 | {R1, R3}) = -0.2

• log Pr(R3 | {R1, R3}) = -1.8

• log Pr(R1 | {R1, R2}) = -0.8

• log Pr(R2 | {R1, R2}) = -0.9

Note that the log-probability of selecting the single remaining item from a set of one is always 0 (e.g., log Pr(R3 | {R3}) = 0).

Based on these values, calculate the total log-probability for the specific ranked sequence R1 > R3 > R2.