Name | Eternity/ Eternity-04-04_c18.xml |
MD5SUM | 888903612ba8c9f4d3271c512caeb5d6 |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 0.006996 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 56 |
Number of constraints | 33 |
Number of domains | 2 |
Minimum domain size | 6 |
Maximum domain size | 16 |
Distribution of domain sizes | [{"size":6,"count":40},{"size":16,"count":16}] |
Minimum variable degree | 1 |
Maximum variable degree | 5 |
Distribution of variable degrees | [{"degree":1,"count":3},{"degree":2,"count":52},{"degree":5,"count":1}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 16 |
Distribution of constraint arities | [{"arity":1,"count":16},{"arity":5,"count":16},{"arity":16,"count":1}] |
Number of extensional constraints | 16 |
Number of intensional constraints | 16 |
Distribution of constraint types | [{"type":"extension","count":16},{"type":"intension","count":16},{"type":"allDifferent","count":1}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
NACRE 1.0.4 (complete) | 4300486 | SAT | 0.006996 | 0.00799199 |
miniBTD_12 2018.07.27_12 (complete) | 4300902 | SAT | 0.007095 | 0.00780492 |
minimacht 2018.07.27 (complete) | 4300726 | SAT | 0.007775 | 0.00846492 |
miniBTD 2018.07.27_3 (complete) | 4301078 | SAT | 0.0085 | 0.00923103 |
cosoco 1.12 (complete) | 4300483 | SAT | 0.012913 | 0.013795 |
GG's minicp 2018-04-29 (complete) | 4300484 | SAT | 0.817991 | 0.401065 |
MiniCPFever 2018-04-29 (complete) | 4300485 | SAT | 0.821934 | 0.403589 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300489 | SAT | 0.831948 | 0.399208 |
slowpoke 2018-04-29 (incomplete) | 4300487 | SAT | 0.834178 | 0.409656 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300488 | SAT | 0.839281 | 0.401604 |
The dodo solver 2018-04-29 (complete) | 4300490 | SAT (TO) | 2520.03 | 2508.52 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list> id[0][0] id[0][1] id[0][2] id[0][3] id[1][0] id[1][1] id[1][2] id[1][3] id[2][0] id[2][1] id[2][2] id[2][3] id[3][0] id[3][1] id[3][2] id[3][3] top[0][0] top[0][1] top[0][2] top[0][3] top[1][0] top[1][1] top[1][2] top[1][3] top[2][0] top[2][1] top[2][2] top[2][3] top[3][0] top[3][1] top[3][2] top[3][3] left[0][0] left[0][1] left[0][2] left[0][3] left[1][0] left[1][1] left[1][2] left[1][3] left[2][0] left[2][1] left[2][2] left[2][3] left[3][0] left[3][1] left[3][2] left[3][3] bot[0] bot[1] bot[2] bot[3] right[0] right[1] right[2] right[3] </list> <values> 3 9 7 2 11 15 13 5 10 12 14 8 0 4 6 1 0 0 0 0 2 4 5 2 2 5 4 1 1 3 4 2 0 2 2 1 0 5 3 3 0 5 3 4 0 1 1 1 0 0 0 0 0 0 0 0 </values> </instantiation>