2019 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
BinPacking/BinPacking-sum-skj2/
BinPacking-sum-n1w1b1r5.xml

Jump to solvers results

General information on the benchmark

NameBinPacking/BinPacking-sum-skj2/
BinPacking-sum-n1w1b1r5.xml
MD5SUM15a2bddfb10fd8a6157ce871797528b8
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark3
Best CPU time to get the best result obtained on this benchmark1.72611
Satisfiable
(Un)Satisfiability was proved
Number of variables61
Number of constraints43
Number of domains2
Minimum domain size21
Maximum domain size42
Distribution of domain sizes[{"size":21,"count":1},{"size":42,"count":60}]
Minimum variable degree2
Maximum variable degree5
Distribution of variable degrees[{"degree":2,"count":1},{"degree":4,"count":40},{"degree":5,"count":20}]
Minimum constraint arity3
Maximum constraint arity60
Distribution of constraint arities[{"arity":3,"count":40},{"arity":21,"count":1},{"arity":60,"count":2}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"ordered","count":20},{"type":"lex","count":1},{"type":"sum","count":20},{"type":"count","count":1},{"type":"cardinality","count":1}]
Optimization problemYES
Type of objectivemax VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2.0 parallel (complete)4409821OPT3 1.72611 0.230928
cosoco 2.O parallel (complete)4398561OPT3 2.19243 0.290922
Concrete 3.10 (complete)4392001OPT3 14.5496 6.07645
choco-solver 2019-09-24 parallel (complete)4407261OPT3 15.1474 2.40629
choco-solver 2019-09-20 (complete)4403961OPT3 15.5912 4.22964
choco-solver 2019-06-14 (complete)4394101OPT3 15.6323 4.23826
choco-solver 2019-09-20 parallel (complete)4404861OPT3 15.8466 2.53766
choco-solver 2019-09-16 (complete)4400361OPT3 20.8272 5.83491
AbsCon 2019-07-23 (complete)4391101OPT3 21.0366 18.5853
Concrete 3.12.2 (complete)4396381OPT3 22.4255 12.2184
choco-solver 2019-09-16 parallel (complete)4400061OPT3 31.7227 4.48468
choco-solver 2019-06-14 parallel (complete)4394401OPT3 42.7447 5.92179
Concrete 3.12.2 (complete)4401261OPT3 66.3059 56.8263
PicatSAT 2019-09-12 (complete)4395481OPT3 83.3555 83.3614
cosoco 2.0 (complete)4408921? (TO) 2400.04 2400.01
cosoco 2 (complete)4390201? (TO) 2400.04 2400.11
cosoco 2.0 (complete)4397661? (TO) 2400.05 2399.8
Concrete 3.12.3 (complete)4403061? (TO) 2400.07 2356.15
choco-solver 2019-09-24 (complete)4406361? (TO) 2400.11 2389.14

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: 3
Solution found:
<instantiation type='solution' cost='3'> <list>b[0][0] b[0][1] b[0][2] b[10][0] b[10][1] b[10][2] b[11][0] b[11][1] b[11][2] b[12][0]
b[12][1] b[12][2] b[13][0] b[13][1] b[13][2] b[14][0] b[14][1] b[14][2] b[15][0] b[15][1] b[15][2] b[16][0] b[16][1] b[16][2] b[17][0]
b[17][1] b[17][2] b[18][0] b[18][1] b[18][2] b[19][0] b[19][1] b[19][2] b[1][0] b[1][1] b[1][2] b[2][0] b[2][1] b[2][2] b[3][0] b[3][1]
b[3][2] b[4][0] b[4][1] b[4][2] b[5][0] b[5][1] b[5][2] b[6][0] b[6][1] b[6][2] b[7][0] b[7][1] b[7][2] b[8][0] b[8][1] b[8][2] b[9][0]
b[9][1] b[9][2] x </list> <values>394 326 279 368 317 312 365 326 287 356 338 303 356 337 304 355 339 305 354 335 302 348 333 318 0 0 0 0 0
0 0 0 0 392 332 274 391 321 281 386 267 266 383 326 291 382 342 274 380 278 0 370 321 278 369 324 281 368 333 299 3 </values>
</instantiation>