Name | GolombRuler/ GolombRuler-a3v18-nodv-10_c18.xml |
MD5SUM | 769ec0f26c47f1b96bb609b2e4d8d5d6 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 55 |
Best CPU time to get the best result obtained on this benchmark | 174.122 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 110 |
Number of constraints | 46 |
Number of domains | 2 |
Minimum domain size | 100 |
Maximum domain size | 101 |
Distribution of domain sizes | [{"size":100,"count":45},{"size":101,"count":10}] |
Minimum variable degree | 0 |
Maximum variable degree | 10 |
Distribution of variable degrees | [{"degree":0,"count":55},{"degree":2,"count":45},{"degree":9,"count":9},{"degree":10,"count":1}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 45 |
Distribution of constraint arities | [{"arity":3,"count":45},{"arity":45,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 45 |
Distribution of constraint types | [{"type":"intension","count":45},{"type":"allDifferent","count":1}] |
Optimization problem | YES |
Type of objective | min VAR |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 1.12 (complete) | 4299353 | OPT | 55 | 174.122 | 174.11 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299357 | OPT | 55 | 1285.07 | 1279.05 |
slowpoke 2018-04-29 (incomplete) | 4299356 | SAT (TO) | 55 | 2520.11 | 2509.62 |
The dodo solver 2018-04-29 (complete) | 4299359 | SAT (TO) | 73 | 2520.04 | 2515.41 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299358 | SAT | 80 | 303.25 | 300.359 |
GG's minicp 2018-04-29 (complete) | 4299354 | SAT (TO) | 80 | 2520.08 | 2507.51 |
MiniCPFever 2018-04-29 (complete) | 4299355 | Wrong UNSAT | 858.026 | 832.42 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 55<instantiation type='solution' cost='55'> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6] y[0][7] y[0][8] y[0][9] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] y[1][8] y[1][9] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[2][9] y[3][0] y[3][1] y[3][2] y[3][3] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[4][7] y[4][8] y[4][9] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] y[5][6] y[5][7] y[5][8] y[5][9] y[6][0] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] y[6][7] y[6][8] y[6][9] y[7][0] y[7][1] y[7][2] y[7][3] y[7][4] y[7][5] y[7][6] y[7][7] y[7][8] y[7][9] y[8][0] y[8][1] y[8][2] y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] y[8][9] y[9][0] y[9][1] y[9][2] y[9][3] y[9][4] y[9][5] y[9][6] y[9][7] y[9][8] y[9][9] </list> <values>0 2 14 21 29 32 45 49 54 55 * 2 14 21 29 32 45 49 54 55 * * 12 19 27 30 43 47 52 53 * * * 7 15 18 31 35 40 41 * * * * 8 11 24 28 33 34 * * * * * 3 16 20 25 26 * * * * * * 13 17 22 23 * * * * * * * 4 9 10 * * * * * * * * 5 6 * * * * * * * * * 1 * * * * * * * * * * </values> </instantiation>