| Name | Dubois/ Dubois-025_c18.xml |
| MD5SUM | 973963fd5ae0545f9f330e30fdec40c5 |
| 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.006859 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 75 |
| Number of constraints | 50 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":75}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":75}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":50}] |
| Number of extensional constraints | 50 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":50}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2018.07.27_3 (complete) | 4301061 | UNSAT | 0.006859 | 0.00758288 |
| miniBTD_12 2018.07.27_12 (complete) | 4300885 | UNSAT | 0.007141 | 0.00778706 |
| NACRE 1.0.4 (complete) | 4299520 | UNSAT | 0.007448 | 0.00827396 |
| GG's minicp 2018-04-29 (complete) | 4299518 | UNSAT | 560.109 | 553.582 |
| MiniCPFever 2018-04-29 (complete) | 4299519 | UNSAT | 729.84 | 718.415 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299522 | UNSAT | 734.976 | 725.029 |
| The dodo solver 2018-04-29 (complete) | 4299524 | UNSAT | 771.319 | 762.889 |
| minimacht 2018.07.27 (complete) | 4300709 | UNSAT | 1004.9 | 1004.97 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299523 | ? | 800.706 | 792.069 |
| slowpoke 2018-04-29 (incomplete) | 4299521 | ? (TO) | 2520.03 | 2500.51 |
| cosoco 1.12 (complete) | 4299517 | ? (TO) | 2520.09 | 2519.9 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: