Name | Eternity/ Eternity-07-07_c18.xml |
MD5SUM | d2370bf20b8fe6e2b2b2b678a676e404 |
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 | 11.6944 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 161 |
Number of constraints | 78 |
Number of domains | 2 |
Minimum domain size | 10 |
Maximum domain size | 49 |
Distribution of domain sizes | [{"size":10,"count":112},{"size":49,"count":49}] |
Minimum variable degree | 1 |
Maximum variable degree | 8 |
Distribution of variable degrees | [{"degree":1,"count":6},{"degree":2,"count":154},{"degree":8,"count":1}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 49 |
Distribution of constraint arities | [{"arity":1,"count":28},{"arity":5,"count":49},{"arity":49,"count":1}] |
Number of extensional constraints | 49 |
Number of intensional constraints | 28 |
Distribution of constraint types | [{"type":"extension","count":49},{"type":"intension","count":28},{"type":"allDifferent","count":1}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
miniBTD_12 2018.07.27_12 (complete) | 4300905 | SAT | 11.6944 | 11.7011 |
cosoco 1.12 (complete) | 4300587 | SAT | 13.0327 | 13.0346 |
MiniCPFever 2018-04-29 (complete) | 4300589 | SAT | 55.9538 | 53.4301 |
GG's minicp 2018-04-29 (complete) | 4300588 | SAT | 64.0354 | 61.6743 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300593 | SAT | 101.709 | 99.8102 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300592 | SAT | 171.254 | 167.511 |
slowpoke 2018-04-29 (incomplete) | 4300591 | SAT | 171.361 | 168.873 |
NACRE 1.0.4 (complete) | 4300590 | SAT | 375.479 | 375.487 |
miniBTD 2018.07.27_3 (complete) | 4301081 | SAT | 454.314 | 454.283 |
minimacht 2018.07.27 (complete) | 4300729 | SAT | 613.513 | 613.496 |
The dodo solver 2018-04-29 (complete) | 4300594 | ? (TO) | 2520.03 | 2504.12 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> id[0][0] id[0][1] id[0][2] id[0][3] id[0][4] id[0][5] id[0][6] id[1][0] id[1][1] id[1][2] id[1][3] id[1][4] id[1][5] id[1][6] id[2][0] id[2][1] id[2][2] id[2][3] id[2][4] id[2][5] id[2][6] id[3][0] id[3][1] id[3][2] id[3][3] id[3][4] id[3][5] id[3][6] id[4][0] id[4][1] id[4][2] id[4][3] id[4][4] id[4][5] id[4][6] id[5][0] id[5][1] id[5][2] id[5][3] id[5][4] id[5][5] id[5][6] id[6][0] id[6][1] id[6][2] id[6][3] id[6][4] id[6][5] id[6][6] top[0][0] top[0][1] top[0][2] top[0][3] top[0][4] top[0][5] top[0][6] top[1][0] top[1][1] top[1][2] top[1][3] top[1][4] top[1][5] top[1][6] top[2][0] top[2][1] top[2][2] top[2][3] top[2][4] top[2][5] top[2][6] top[3][0] top[3][1] top[3][2] top[3][3] top[3][4] top[3][5] top[3][6] top[4][0] top[4][1] top[4][2] top[4][3] top[4][4] top[4][5] top[4][6] top[5][0] top[5][1] top[5][2] top[5][3] top[5][4] top[5][5] top[5][6] top[6][0] top[6][1] top[6][2] top[6][3] top[6][4] top[6][5] top[6][6] left[0][0] left[0][1] left[0][2] left[0][3] left[0][4] left[0][5] left[0][6] left[1][0] left[1][1] left[1][2] left[1][3] left[1][4] left[1][5] left[1][6] left[2][0] left[2][1] left[2][2] left[2][3] left[2][4] left[2][5] left[2][6] left[3][0] left[3][1] left[3][2] left[3][3] left[3][4] left[3][5] left[3][6] left[4][0] left[4][1] left[4][2] left[4][3] left[4][4] left[4][5] left[4][6] left[5][0] left[5][1] left[5][2] left[5][3] left[5][4] left[5][5] left[5][6] left[6][0] left[6][1] left[6][2] left[6][3] left[6][4] left[6][5] left[6][6] bot[0] bot[1] bot[2] bot[3] bot[4] bot[5] bot[6] right[0] right[1] right[2] right[3] right[4] right[5] right[6] </list> <values> 2 7 5 19 6 23 1 9 38 42 43 35 34 20 22 36 37 39 28 33 14 21 31 30 40 41 47 13 17 32 45 46 29 44 8 4 27 25 24 26 48 15 0 11 18 10 12 16 3 0 0 0 0 0 0 0 1 7 6 5 6 9 1 3 5 9 7 4 4 3 3 9 6 5 8 9 2 3 8 6 7 5 9 2 1 7 7 8 4 6 1 1 5 4 4 7 9 2 0 2 1 1 3 1 3 0 8 5 9 9 8 6 0 8 4 9 5 5 8 0 6 4 7 6 6 8 0 4 7 8 6 7 8 0 5 4 5 4 7 9 0 2 3 2 2 2 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>