Comment by whatshisface

How about this:

1. A read is returned with a map of the network the replying node has become consistent with.

2. A client that is not satisfied with the map can read again from the other partition.

These two steps get around the proof by changing one of its assumptions (that the operation to read a value can only involve a request to one node).