Then for all non-uniform probabilistic polynomial time algorithms that output x,x' and open,open' of increasing length k, the probability that x \neq x' and Commit_k(x,open)=Commit_k(x',open') is a negligible function in k.
This is a form of asymptotic analysis.