2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Vrp/Vrp-zinc-s1/
Vrp-P-n16-k8.xml

Jump to solvers results

General information on the benchmark

NameVrp/Vrp-zinc-s1/
Vrp-P-n16-k8.xml
MD5SUMcfd5e3ed3d40597c9df5fc0ce0b3cf5f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark450
Best CPU time to get the best result obtained on this benchmark140.336
Satisfiable
(Un)Satisfiability was proved
Number of variables272
Number of constraints255
Number of domains3
Minimum domain size1
Maximum domain size36
Distribution of domain sizes[{"size":1,"count":16},{"size":2,"count":240},{"size":36,"count":15}]
Minimum variable degree0
Maximum variable degree29
Distribution of variable degrees[{"degree":0,"count":1},{"degree":1,"count":16},{"degree":2,"count":30},{"degree":4,"count":210},{"degree":29,"count":15}]
Minimum constraint arity1
Maximum constraint arity15
Distribution of constraint arities[{"arity":1,"count":15},{"arity":3,"count":210},{"arity":15,"count":30}]
Number of extensional constraints0
Number of intensional constraints15
Distribution of constraint types[{"type":"intension","count":15},{"type":"sum","count":210},{"type":"count","count":30}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 2019-09-24 (complete)4406092OPT450 140.336 137.382
PicatSAT 2019-09-12 (complete)4395212OPT450 201.631 201.644
AbsCon 2019-07-23 (complete)4390832OPT450 303.456 299.696
choco-solver 2019-09-16 (complete)4399192OPT450 422.668 107.105
choco-solver 2019-09-20 (complete)4403692OPT450 426.95 108.249
choco-solver 2019-06-14 (complete)4393232OPT450 480.557 123.635
choco-solver 2019-09-20 parallel (complete)4404592OPT450 827.362 105.203
choco-solver 2019-09-24 parallel (complete)4406992OPT450 852.047 108.315
choco-solver 2019-09-16 parallel (complete)4399792OPT450 982.561 124.692
choco-solver 2019-06-14 parallel (complete)4393832OPT450 985.653 205.539
Concrete 3.12.2 (complete)4400992OPT450 2099.64 2061.26
Concrete 3.10 (complete)4387118OPT450 2158.49 2109.25
Concrete 3.12.3 (complete)4402792OPT450 2427.93 2384.98
cosoco 2.O parallel (complete)4398292OPT450 9393.58 1176.31
cosoco 2.0 parallel (complete)4409552OPT450 11141.1 1395.07
cosoco 2 (complete)4389732SAT (TO)450 2519.88 2520.01
cosoco 2.0 (complete)4397012SAT (TO)450 2519.91 2520.01
cosoco 2.0 (complete)4408272SAT (TO)450 2520.01 2519.8
Concrete 3.12.2 (complete)4396112SAT (TO)450 2520.1 2482.04

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function: 450
Solution found:
<instantiation> <list>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[0][10] x[0][11] x[0][12] x[0][13]
x[0][14] x[0][15] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[1][10] x[1][11] x[1][12] x[1][13]
x[1][14] x[1][15] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[2][10] x[2][11] x[2][12] x[2][13]
x[2][14] x[2][15] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9] x[3][10] x[3][11] x[3][12] x[3][13]
x[3][14] x[3][15] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[4][9] x[4][10] x[4][11] x[4][12] x[4][13]
x[4][14] x[4][15] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[5][9] x[5][10] x[5][11] x[5][12] x[5][13]
x[5][14] x[5][15] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[6][10] x[6][11] x[6][12] x[6][13]
x[6][14] x[6][15] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[7][9] x[7][10] x[7][11] x[7][12] x[7][13]
x[7][14] x[7][15] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] x[8][9] x[8][10] x[8][11] x[8][12] x[8][13]
x[8][14] x[8][15] x[9][0] x[9][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8] x[9][9] x[9][10] x[9][11] x[9][12] x[9][13]
x[9][14] x[9][15] x[10][0] x[10][1] x[10][2] x[10][3] x[10][4] x[10][5] x[10][6] x[10][7] x[10][8] x[10][9] x[10][10] x[10][11] x[10][12]
x[10][13] x[10][14] x[10][15] x[11][0] x[11][1] x[11][2] x[11][3] x[11][4] x[11][5] x[11][6] x[11][7] x[11][8] x[11][9] x[11][10] x[11][11]
x[11][12] x[11][13] x[11][14] x[11][15] x[12][0] x[12][1] x[12][2] x[12][3] x[12][4] x[12][5] x[12][6] x[12][7] x[12][8] x[12][9] x[12][10]
x[12][11] x[12][12] x[12][13] x[12][14] x[12][15] x[13][0] x[13][1] x[13][2] x[13][3] x[13][4] x[13][5] x[13][6] x[13][7] x[13][8] x[13][9]
x[13][10] x[13][11] x[13][12] x[13][13] x[13][14] x[13][15] x[14][0] x[14][1] x[14][2] x[14][3] x[14][4] x[14][5] x[14][6] x[14][7] x[14][8]
x[14][9] x[14][10] x[14][11] x[14][12] x[14][13] x[14][14] x[14][15] x[15][0] x[15][1] x[15][2] x[15][3] x[15][4] x[15][5] x[15][6] x[15][7]
x[15][8] x[15][9] x[15][10] x[15][11] x[15][12] x[15][13] x[15][14] x[15][15] u[1] u[2] u[3] u[4] u[5] u[6] u[7] u[8] u[9] u[10] u[11] u[12]
u[13] u[14] u[15] </list> <values>0 1 1 0 0 1 1 1 1 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 19 30 35 31 11
31 15 28 23 33 7 25 29 30 11 </values> </instantiation>