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

Result page for benchmark
Opd/Opd-sum-small/
Opd-10-031-009.xml

Jump to solvers results

General information on the benchmark

NameOpd/Opd-sum-small/
Opd-10-031-009.xml
MD5SUMc781bc55b7ee4c4bb57d86a03397642c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark2
Best CPU time to get the best result obtained on this benchmark3.79055
Satisfiable
(Un)Satisfiability was proved
Number of variables311
Number of constraints56
Number of domains2
Minimum domain size2
Maximum domain size30
Distribution of domain sizes[{"size":2,"count":310},{"size":30,"count":1}]
Minimum variable degree11
Maximum variable degree46
Distribution of variable degrees[{"degree":11,"count":310},{"degree":46,"count":1}]
Minimum constraint arity31
Maximum constraint arity310
Distribution of constraint arities[{"arity":31,"count":10},{"arity":63,"count":45},{"arity":310,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"lex","count":1},{"type":"sum","count":55}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 2019-09-24 (complete)4406225OPT2 3.79055 1.78596
choco-solver 2019-06-14 (complete)4393365OPT2 7.55587 2.25091
choco-solver 2019-09-20 (complete)4403825OPT2 7.84666 2.2861
choco-solver 2019-09-16 (complete)4399325OPT2 7.95845 2.3355
choco-solver 2019-09-16 parallel (complete)4399925OPT2 12.6525 2.13787
choco-solver 2019-09-20 parallel (complete)4404725OPT2 13.0757 2.24966
choco-solver 2019-09-24 parallel (complete)4407125OPT2 13.3002 2.2083
choco-solver 2019-06-14 parallel (complete)4393965OPT2 14.1293 2.34014
AbsCon 2019-07-23 (complete)4390965OPT2 21.8244 19.3444
PicatSAT 2019-09-12 (complete)4395345OPT2 32.576 32.5824
Concrete 3.10 (complete)4387057OPT2 171.586 149.693
Concrete 3.12.2 (complete)4401125SAT (TO)3 2520.05 2470.14
Concrete 3.12.3 (complete)4402925SAT (TO)3 2520.07 2472.24
Concrete 3.12.2 (complete)4396245SAT (TO)3 2520.13 2480.63
cosoco 2 (complete)4389865? (MO) 1305.05 1306.88
cosoco 2.0 (complete)4408405? (MO) 1306.69 1308.54
cosoco 2.0 (complete)4397145? (MO) 1322.61 1324.35
cosoco 2.O parallel (complete)4398425? (TO) 2521 2523.41
cosoco 2.0 parallel (complete)4409685? (TO) 2521.01 2523.43

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: 2
Solution found:
<instantiation> <list>z 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[0][16] x[0][17] x[0][18] x[0][19] x[0][20] x[0][21] x[0][22] x[0][23] x[0][24] x[0][25] x[0][26] x[0][27] x[0][28]
x[0][29] x[0][30] 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[1][16] x[1][17] x[1][18] x[1][19] x[1][20] x[1][21] x[1][22] x[1][23] x[1][24] x[1][25] x[1][26] x[1][27] x[1][28]
x[1][29] x[1][30] 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[2][16] x[2][17] x[2][18] x[2][19] x[2][20] x[2][21] x[2][22] x[2][23] x[2][24] x[2][25] x[2][26] x[2][27] x[2][28]
x[2][29] x[2][30] 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[3][16] x[3][17] x[3][18] x[3][19] x[3][20] x[3][21] x[3][22] x[3][23] x[3][24] x[3][25] x[3][26] x[3][27] x[3][28]
x[3][29] x[3][30] 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[4][16] x[4][17] x[4][18] x[4][19] x[4][20] x[4][21] x[4][22] x[4][23] x[4][24] x[4][25] x[4][26] x[4][27] x[4][28]
x[4][29] x[4][30] 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[5][16] x[5][17] x[5][18] x[5][19] x[5][20] x[5][21] x[5][22] x[5][23] x[5][24] x[5][25] x[5][26] x[5][27] x[5][28]
x[5][29] x[5][30] 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[6][16] x[6][17] x[6][18] x[6][19] x[6][20] x[6][21] x[6][22] x[6][23] x[6][24] x[6][25] x[6][26] x[6][27] x[6][28]
x[6][29] x[6][30] 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[7][16] x[7][17] x[7][18] x[7][19] x[7][20] x[7][21] x[7][22] x[7][23] x[7][24] x[7][25] x[7][26] x[7][27] x[7][28]
x[7][29] x[7][30] 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[8][16] x[8][17] x[8][18] x[8][19] x[8][20] x[8][21] x[8][22] x[8][23] x[8][24] x[8][25] x[8][26] x[8][27] x[8][28]
x[8][29] x[8][30] 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[9][16] x[9][17] x[9][18] x[9][19] x[9][20] x[9][21] x[9][22] x[9][23] x[9][24] x[9][25] x[9][26] x[9][27] x[9][28]
x[9][29] x[9][30] </list> <values>2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1
1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 1 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 1
0 0 0 0 0 1 0 0 1 1 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 1 0 0 0 1 1 0 0 0 0 0 0 1 0 1 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0
1 1 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 1 1 0 1 0 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 0 1 0 0 0 0 0
1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 </values> </instantiation>