Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-16.xml |
MD5SUM | 03765d59360c09d71a4cc0e8e110fff9 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 311 |
Number of constraints | 310 |
Number of domains | 2 |
Minimum domain size | 2 |
Maximum domain size | 256 |
Distribution of domain sizes | [{"size":2,"count":54},{"size":256,"count":257}] |
Minimum variable degree | 2 |
Maximum variable degree | 54 |
Distribution of variable degrees | [{"degree":2,"count":56},{"degree":3,"count":200},{"degree":4,"count":54},{"degree":54,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 256 |
Distribution of constraint arities | [{"arity":2,"count":255},{"arity":3,"count":54},{"arity":256,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 309 |
Distribution of constraint types | [{"type":"intension","count":309},{"type":"allDifferent","count":1}] |
Optimization problem | YES |
Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: