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-10.xml

Jump to solvers results

General information on the benchmark

NameBinPacking/
BinPacking-tab-ft/BinPacking-tab-ft120-10.xml
MD5SUM742286b199079809b66c62b35b32659a
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 benchmark245.119
Satisfiable
(Un)Satisfiability was proved
Number of variables145
Number of constraints51
Number of domains2
Minimum domain size49
Maximum domain size84
Distribution of domain sizes[{"size":49,"count":1},{"size":84,"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 constraints48
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","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)4257412SAT (TO)7 245.119 240.01199
OscaR - Hybrid 2017-07-26 (complete)4256418SAT (TO)7 248.261 240.034
OscaR - ALNS 2017-07-26 (complete)4255424SAT (TO)7 250.13 240.026
OscaR - Parallel with EPS 2017-07-26 (complete)4256915SAT (TO)7 1921.33 247.033
OscaR - Parallel with EPS 2017-08-22 (complete)4285689SAT (TO)7 1966.4399 252.146
OscaR - Conflict Ordering 2017-07-26 (complete)4255921SAT (TO)6 244.573 240.03101
choco-solver 4.0.5 par (2017-07-26) (complete)4254430SAT (TO)6 1920.15 258.03601
choco-solver 4.0.5 par (2017-08-18) (complete)4281279SAT (TO)5 1845.03 252.119
choco-solver 4.0.5 par (2017-08-09) (complete)4271469SAT (TO)5 1854.36 252.103
cosoco-sat 1.12 (complete)4266598? (TO) 240.008 240.011
choco-solver 4.0.5 seq (2017-07-26) (complete)4253933? (TO) 244.78999 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4269999? (TO) 245.12199 240.022
choco-solver 4.0.5 seq (2017-08-18) (complete)4282749? (TO) 245.181 240.022
choco-solver 5a (2017-08-18) (complete)4284219? (TO) 248.308 240.02499
choco-solver 5a (2017-07-26) (complete)4254927? (TO) 248.47 240.00999
Mistral-2.0 2017-07-28 (complete)4258903? (TO) 251.84 252.011
cosoco 1.12 (complete)4268529? (TO) 251.92101 252.00999
cosoco 1.1 (complete)4258406? (TO) 251.93201 252.00999
Concrete 3.4 (complete)4259400? (TO) 259.29001 240.40601
sat4j-CSP 2017-07-05 (complete)4257909? (TO) 260.435 103.065

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='sol7' type='solution' cost='7'>  <list> x b[][] </list>  <values> 7 495 495 0 492 491 0 488 479 0 478 251 250 474 254 250
471 255 251 462 264 251 459 265 251 452 266 253 442 269 255 441 269 254 438 272 255 436 272 257 427 287 257 426 277 263 425 292 257 421 303
257 421 281 265 421 273 262 415 300 258 408 306 258 407 306 258 407 294 266 402 305 268 390 298 270 390 297 269 385 312 279 385 308 298 383
316 297 378 339 282 377 346 276 376 345 274 368 329 287 362 330 284 361 324 292 356 352 282 355 342 285 355 339 287 355 315 297 352 319 301
346 320 305 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values>  </instantiation>