Name | Eternity/ Eternity-05-05_c18.xml |
MD5SUM | c4864a898575c3e068596f0b6cab168e |
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.052625 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 85 |
Number of constraints | 46 |
Number of domains | 2 |
Minimum domain size | 8 |
Maximum domain size | 25 |
Distribution of domain sizes | [{"size":8,"count":60},{"size":25,"count":25}] |
Minimum variable degree | 1 |
Maximum variable degree | 6 |
Distribution of variable degrees | [{"degree":1,"count":4},{"degree":2,"count":80},{"degree":6,"count":1}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 25 |
Distribution of constraint arities | [{"arity":1,"count":20},{"arity":5,"count":25},{"arity":25,"count":1}] |
Number of extensional constraints | 25 |
Number of intensional constraints | 20 |
Distribution of constraint types | [{"type":"extension","count":25},{"type":"intension","count":20},{"type":"allDifferent","count":1}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
NACRE 1.0.4 (complete) | 4300558 | SAT | 0.052625 | 0.0538619 |
miniBTD 2018.07.27_3 (complete) | 4301079 | SAT | 0.090708 | 0.0917969 |
miniBTD_12 2018.07.27_12 (complete) | 4300903 | SAT | 0.121587 | 0.122112 |
minimacht 2018.07.27 (complete) | 4300727 | SAT | 0.13588 | 0.136583 |
cosoco 1.12 (complete) | 4300555 | SAT | 0.139728 | 0.140354 |
GG's minicp 2018-04-29 (complete) | 4300556 | SAT | 1.01391 | 0.445962 |
slowpoke 2018-04-29 (incomplete) | 4300559 | SAT | 1.02092 | 0.462363 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300561 | SAT | 1.05009 | 0.471375 |
MiniCPFever 2018-04-29 (complete) | 4300557 | SAT | 1.07167 | 0.476384 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300560 | SAT | 1.10418 | 0.480355 |
The dodo solver 2018-04-29 (complete) | 4300562 | SAT (TO) | 2520.1 | 2512.72 |
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[0][4] id[1][0] id[1][1] id[1][2] id[1][3] id[1][4] id[2][0] id[2][1] id[2][2] id[2][3] id[2][4] id[3][0] id[3][1] id[3][2] id[3][3] id[3][4] id[4][0] id[4][1] id[4][2] id[4][3] id[4][4] top[0][0] top[0][1] top[0][2] top[0][3] top[0][4] top[1][0] top[1][1] top[1][2] top[1][3] top[1][4] top[2][0] top[2][1] top[2][2] top[2][3] top[2][4] top[3][0] top[3][1] top[3][2] top[3][3] top[3][4] top[4][0] top[4][1] top[4][2] top[4][3] top[4][4] left[0][0] left[0][1] left[0][2] left[0][3] left[0][4] left[1][0] left[1][1] left[1][2] left[1][3] left[1][4] left[2][0] left[2][1] left[2][2] left[2][3] left[2][4] left[3][0] left[3][1] left[3][2] left[3][3] left[3][4] left[4][0] left[4][1] left[4][2] left[4][3] left[4][4] bot[0] bot[1] bot[2] bot[3] bot[4] right[0] right[1] right[2] right[3] right[4] </list> <values> 3 10 9 15 2 4 17 19 24 8 5 16 23 21 12 13 18 22 20 7 0 6 11 14 1 0 0 0 0 0 1 6 5 7 2 1 5 7 7 1 3 4 5 6 3 1 5 7 6 1 0 3 2 2 3 0 4 4 7 6 0 4 6 7 4 0 6 5 4 5 0 1 2 3 2 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>