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

Result page for benchmark
BinPacking/
BinPacking-tab-ft/BinPacking-tab-ft120-19.xml

Jump to solvers results

General information on the benchmark

NameBinPacking/
BinPacking-tab-ft/BinPacking-tab-ft120-19.xml
MD5SUM90a7b6352cefaac33401a11faadaca46
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark6
Best CPU time to get the best result obtained on this benchmark245.028
Satisfiable
(Un)Satisfiability was proved
Number of variables142
Number of constraints50
Number of domains2
Minimum domain size48
Maximum domain size88
Distribution of domain sizes[{"size":48,"count":1},{"size":88,"count":141}]
Minimum variable degree2
Maximum variable degree4
Distribution of variable degrees[{"degree":2,"count":1},{"degree":3,"count":94},{"degree":4,"count":47}]
Minimum constraint arity3
Maximum constraint arity141
Distribution of constraint arities[{"arity":3,"count":47},{"arity":48,"count":1},{"arity":141,"count":2}]
Number of extensional constraints47
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":47},{"type":"lex","count":1},{"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
AbsCon-basic 2017-06-11 (complete)4257414SAT (TO)6 245.028 240.01199
OscaR - Hybrid 2017-07-26 (complete)4256420SAT (TO)6 247.60001 240.02699
OscaR - Parallel with EPS 2017-07-26 (complete)4256917SAT (TO)6 1921.23 247.034
OscaR - Parallel with EPS 2017-08-22 (complete)4285691SAT (TO)6 1961.9399 252.144
OscaR - ALNS 2017-07-26 (complete)4255426SAT (TO)5 248.879 240.02499
choco-solver 4.0.5 par (2017-08-18) (complete)4281281SAT (TO)4 1857.78 252.11
choco-solver 4.0.5 par (2017-08-09) (complete)4271471SAT (TO)4 1885.83 252.12199
OscaR - Conflict Ordering 2017-07-26 (complete)4255923SAT (TO)3 244.44901 240.035
choco-solver 4.0.5 par (2017-07-26) (complete)4254432SAT (TO)3 1920.1 259.23199
cosoco-sat 1.12 (complete)4266600? (TO) 240.01801 240.00999
choco-solver 4.0.5 seq (2017-07-26) (complete)4253935? (TO) 244.86 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4270001? (TO) 244.95799 240.022
choco-solver 4.0.5 seq (2017-08-18) (complete)4282751? (TO) 245.036 240.022
choco-solver 5a (2017-07-26) (complete)4254929? (TO) 248.02 240.00999
choco-solver 5a (2017-08-18) (complete)4284221? (TO) 248.05099 240.024
Mistral-2.0 2017-07-28 (complete)4258905? (TO) 251.91701 252.011
cosoco 1.12 (complete)4268531? (TO) 251.953 252.00999
cosoco 1.1 (complete)4258408? (TO) 251.967 252.00999
Concrete 3.4 (complete)4259402? (TO) 259.38 240.472
sat4j-CSP 2017-07-05 (complete)4257911? (TO) 260.00101 100.853

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: 6
Solution found:
<instantiation id='sol4' type='solution' cost='6'>  <list> x b[][] </list>  <values> 6 499 497 0 496 492 0 491 486 0 484 250 250 479 253 250
476 254 251 472 256 251 469 255 253 468 256 251 467 257 253 460 258 253 456 260 253 450 261 254 442 265 254 434 269 257 430 269 259 426 271
259 418 276 260 418 268 267 416 270 265 410 300 271 407 309 271 405 309 275 399 301 296 395 305 298 390 315 292 390 309 281 386 321 279 381
341 275 380 331 276 380 309 277 379 309 273 374 337 273 371 319 274 369 320 272 367 340 276 364 333 288 358 333 282 352 330 291 350 330 291
345 326 296 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values>  </instantiation>