Choiceless polynomial time with counting does not capture polynomial time

We prove that choiceless polynomial time with counting does not capture polynomial time on unordered finite structures, confirming the noncapture conjecture of Blass, Gurevich and Shelah. A linear-consistency query over 𝔽${}_3$ in a fixed binary vocabulary is decidable in polynomial time but not in the full counting formalism.