| Name | Dubois/ Dubois-023_c18.xml |
| MD5SUM | d9fd0a93a95458fcc98ae1d4ddac20a1 |
| 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.00667 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 69 |
| Number of constraints | 46 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":69}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":69}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":46}] |
| Number of extensional constraints | 46 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":46}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2018.07.27_3 (complete) | 4301059 | UNSAT | 0.00667 | 0.0074451 |
| NACRE 1.0.4 (complete) | 4299456 | UNSAT | 0.007064 | 0.00809012 |
| miniBTD_12 2018.07.27_12 (complete) | 4300883 | UNSAT | 0.007149 | 0.0077769 |
| GG's minicp 2018-04-29 (complete) | 4299454 | UNSAT | 137.666 | 135.355 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299458 | UNSAT | 174.404 | 171.619 |
| MiniCPFever 2018-04-29 (complete) | 4299455 | UNSAT | 177.563 | 174.224 |
| The dodo solver 2018-04-29 (complete) | 4299460 | UNSAT | 189.366 | 186.449 |
| minimacht 2018.07.27 (complete) | 4300707 | UNSAT | 325.883 | 325.891 |
| cosoco 1.12 (complete) | 4299453 | UNSAT | 642.665 | 642.66 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299459 | ? | 380.009 | 375.693 |
| slowpoke 2018-04-29 (incomplete) | 4299457 | ? (TO) | 2520.04 | 2501.71 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: