Name | ColouredQueens/ ColouredQueens-06_c18.xml |
MD5SUM | 7b867b166641a9e2c5ffb0d7a40768d4 |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 0.666306 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 36 |
Number of constraints | 30 |
Number of domains | 1 |
Minimum domain size | 6 |
Maximum domain size | 6 |
Distribution of domain sizes | [{"size":6,"count":36}] |
Minimum variable degree | 3 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":32}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 6 |
Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":4},{"arity":6,"count":14}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"allDifferent","count":30}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
miniBTD 2018.07.27_3 (complete) | 4301033 | UNSAT | 0.666306 | 0.672298 |
minimacht 2018.07.27 (complete) | 4300681 | UNSAT | 0.878148 | 0.946665 |
miniBTD_12 2018.07.27_12 (complete) | 4300857 | UNSAT | 0.950512 | 0.953709 |
MiniCPFever 2018-04-29 (complete) | 4297951 | UNSAT | 1.40839 | 0.721676 |
GG's minicp 2018-04-29 (complete) | 4297950 | UNSAT | 1.63954 | 0.859995 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4297954 | UNSAT | 1.93602 | 1.08494 |
cosoco 1.12 (complete) | 4297949 | UNSAT | 2.02443 | 2.16206 |
The dodo solver 2018-04-29 (complete) | 4297956 | UNSAT | 2.26784 | 1.05596 |
NACRE 1.0.4 (complete) | 4297952 | UNSAT | 7.15592 | 7.19123 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4297955 | ? | 304.191 | 300.523 |
slowpoke 2018-04-29 (incomplete) | 4297953 | ? (TO) | 2520.05 | 2500.61 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: