Four Datasheet Claims

You are reviewing four sentences pulled from vendor datasheets. Judge each one against the definitions used in the CAP proof: C is linearizability, A is that every request received by a non-failing node returns a non-error response (with no bound on how long that takes), and P is a network that may delay or drop messages arbitrarily.

Which sentence survives that test?

"We are CP, which is why every read in our client library is linearizable by default."

"P is not something our product opts into. It describes the network we run on, so the only real decision is what we give up once a partition happens."

"We are a CA store. Our racks are cross-connected with redundant switches, so partitions do not occur and we keep both consistency and availability."

"We are AP, so stale reads are confined to partitions. On a healthy network every read reflects the newest acknowledged write."