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

Result page for benchmark
BinPacking/
BinPacking-mdd-ft/BinPacking-mdd-ft120-13.xml

Jump to solvers results

General information on the benchmark

NameBinPacking/
BinPacking-mdd-ft/BinPacking-mdd-ft120-13.xml
MD5SUMf538aabc6a41aa561e8cda6eca1a34a0
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark7
Best CPU time to get the best result obtained on this benchmark244.45599
Satisfiable
(Un)Satisfiability was proved
Number of variables145
Number of constraints51
Number of domains2
Minimum domain size49
Maximum domain size88
Distribution of domain sizes[{"size":49,"count":1},{"size":88,"count":144}]
Minimum variable degree2
Maximum variable degree4
Distribution of variable degrees[{"degree":2,"count":1},{"degree":3,"count":96},{"degree":4,"count":48}]
Minimum constraint arity3
Maximum constraint arity144
Distribution of constraint arities[{"arity":3,"count":48},{"arity":49,"count":1},{"arity":144,"count":2}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"mdd","count":48},{"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)4257378SAT (TO)7 244.45599 240.013
OscaR - ALNS 2017-07-26 (complete)4255390SAT (TO)7 249.58501 240.036
OscaR - Parallel with EPS 2017-08-22 (complete)4285655SAT (TO)7 1870.98 252.153
choco-solver 4.0.5 par (2017-07-26) (complete)4254396SAT (TO)7 1920.74 243.83501
OscaR - Parallel with EPS 2017-07-26 (complete)4256881SAT (TO)7 1920.75 257.92099
choco-solver 4.0.5 par (2017-08-18) (complete)4281245SAT (TO)7 1982.97 252.12801
choco-solver 4.0.5 par (2017-08-09) (complete)4271435SAT (TO)7 1989.46 252.145
OscaR - Hybrid 2017-07-26 (complete)4256384SAT (TO)5 250.34801 240.02499
OscaR - Conflict Ordering 2017-07-26 (complete)4255887SAT (TO)3 245.66901 240.035
choco-solver 4.0.5 seq (2017-08-09) (complete)4269965SAT (TO)0 246.246 240.022
choco-solver 4.0.5 seq (2017-07-26) (complete)4253899SAT (TO)0 246.33 240.00999
choco-solver 4.0.5 seq (2017-08-18) (complete)4282715SAT (TO)0 246.517 240.02299
choco-solver 5a (2017-07-26) (complete)4254893SAT (TO)0 249.89999 240.00999
cosoco 1.12 (complete)4268495? (TO) 240.008 240.00999
choco-solver 5a (2017-08-18) (complete)4284185? (TO) 249.09399 240.02299
Mistral-2.0 2017-07-28 (complete)4258869? (TO) 251.89301 252.011
cosoco-sat 1.12 (complete)4266564? (TO) 251.916 252.00999
cosoco 1.1 (complete)4258372? (TO) 251.94901 252.00999
sat4j-CSP 2017-07-05 (complete)4257875? (TO) 252.13901 223.03101
Concrete 3.4 (complete)4259366? (TO) 258.89301 240.42999

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: 7
Solution found:
<instantiation id='sol8' type='solution' cost='7'>  <list> x b[][] </list>  <values> 7 491 477 0 473 472 0 467 464 0 461 265 253 459 267 251
459 261 250 458 263 250 454 263 254 448 266 255 444 266 255 440 267 255 426 272 255 423 273 256 417 291 258 416 297 261 414 318 256 413 313
259 408 290 267 407 287 268 406 295 265 404 314 263 400 321 261 399 322 264 397 317 269 391 315 270 387 290 273 384 309 302 384 305 305 378
337 273 378 329 278 375 350 275 375 334 278 375 330 274 372 324 290 370 341 278 361 354 280 360 355 283 359 356 283 356 329 291 356 323 299
356 323 297 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values>  </instantiation>