Name | TravellingSalesman/TravellingSalesman-xcsp2-s20a4/ TravellingSalesman-4-20-001-a4_X2.xml |
MD5SUM | b8ea00653452363d0c81f6ef3102e485 |
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.830237 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 61 |
Number of constraints | 228 |
Number of domains | 5 |
Minimum domain size | 1 |
Maximum domain size | 1001 |
Distribution of domain sizes | [{"size":1,"count":2},{"size":20,"count":20},{"size":161,"count":19},{"size":1001,"count":20}] |
Minimum variable degree | 1 |
Maximum variable degree | 208 |
Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":37},{"degree":19,"count":1},{"degree":20,"count":18},{"degree":37,"count":1},{"degree":190,"count":1},{"degree":208,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 4 |
Distribution of constraint arities | [{"arity":2,"count":1},{"arity":3,"count":20},{"arity":4,"count":207}] |
Number of extensional constraints | 228 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":228}] |
Optimization problem | NO |
Type of objective |
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>w3 w4 x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16] y[17] y[18] y[19] z[0] z[1] z[2] z[3] z[4] z[5] z[6] z[7] z[8] z[9] z[10] z[11] z[12] z[13] z[14] z[15] z[16] z[17] z[18] </list> <values>160 0 10 3 16 12 4 9 5 18 8 14 13 2 15 7 1 19 6 17 20 11 13 3 1 15 6 0 5 11 2 1 2 20 7 26 0 21 0 3 15 9 16 17 32 38 38 43 54 56 57 59 79 86 112 112 133 133 136 151 160 </values> </instantiation>