It's an interesting question! You could write a script that parses each constraint and checks the number of separate comparisons in each one although I'm not sure if that is the best way to measure them.
Are you trying to decide if a constraint C1 subsumes C2 (meaning that it is not possible to find a set of values that satisfy C1 and not satisfy C2 -> C2 is true in all scenarios in which C1 is true but maybe not the other way around)?. When C1 subsumes C2 then C2 can be removed since it does not add any semantics to the problem.
If this is the case, I´d recommend you to use a CSP solver for that. It is easier than it seems. For instance, the Eclipse CSP solver (here Eclipse does not referes to the IDE platform, the solver has the same name) can be easily called from your java program through a well-defined API so you could just sent the problem to the solver and see which constraint is weaker