Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-18.xml |
MD5SUM | c676f6660bfbd7761e9ca0de91c4f968 |
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 | 391 |
Number of constraints | 390 |
Number of domains | 2 |
Minimum domain size | 2 |
Maximum domain size | 324 |
Distribution of domain sizes | [{"size":2,"count":66},{"size":324,"count":325}] |
Minimum variable degree | 2 |
Maximum variable degree | 66 |
Distribution of variable degrees | [{"degree":2,"count":68},{"degree":3,"count":256},{"degree":4,"count":66},{"degree":66,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 324 |
Distribution of constraint arities | [{"arity":2,"count":323},{"arity":3,"count":66},{"arity":324,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 389 |
Distribution of constraint types | [{"type":"intension","count":389},{"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: