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

Result page for benchmark
BinPacking/
BinPacking-mdd-fu/BinPacking-mdd-fu0120-05.xml

Jump to solvers results

General information on the benchmark

NameBinPacking/
BinPacking-mdd-fu/BinPacking-mdd-fu0120-05.xml
MD5SUM9ef2b094cdda1b830103df1ca446c40b
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark18
Best CPU time to get the best result obtained on this benchmark2520.1
Satisfiable
(Un)Satisfiability was proved
Number of variables470
Number of constraints70
Number of domains2
Minimum domain size62
Maximum domain size68
Distribution of domain sizes[{"size":62,"count":469},{"size":68,"count":1}]
Minimum variable degree2
Maximum variable degree4
Distribution of variable degrees[{"degree":2,"count":1},{"degree":3,"count":402},{"degree":4,"count":67}]
Minimum constraint arity7
Maximum constraint arity469
Distribution of constraint arities[{"arity":7,"count":67},{"arity":68,"count":1},{"arity":469,"count":2}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"mdd","count":67},{"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 2019-07-23 (complete)4390992SAT (TO)18 2520.1 2513.91
cosoco 2 (complete)4389892SAT (TO)6 2519.89 2520.01
cosoco 2.0 (complete)4408432SAT (TO)6 2519.89 2520.01
cosoco 2.0 (complete)4397172SAT (TO)6 2520.04 2519.8
PicatSAT 2019-09-12 (complete)4395372? (TO) 2519.99 2520.06
choco-solver 2019-09-24 (complete)4406252? (TO) 2520.05 2507.81
Concrete 3.10 (complete)4387411? (TO) 2520.06 2483.74
Concrete 3.12.2 (complete)4401152? (TO) 2520.08 2482.65
Concrete 3.12.2 (complete)4396272? (TO) 2520.08 2485.14
Concrete 3.12.3 (complete)4402952? (TO) 2520.14 2480.75
choco-solver 2019-09-20 (complete)4403852? (TO) 2520.43 635.04
choco-solver 2019-06-14 (complete)4393392? (TO) 2520.53 635.21
choco-solver 2019-09-16 (complete)4399352? (TO) 2520.65 635.105
choco-solver 2019-09-20 parallel (complete)4404752? (TO) 20015.8 2520.12
choco-solver 2019-09-24 parallel (complete)4407152? (TO) 20026.8 2520.11
choco-solver 2019-09-16 parallel (complete)4399952? (TO) 20039.8 2520.11
choco-solver 2019-06-14 parallel (complete)4393992? (TO) 20042.4 2520.12
cosoco 2.O parallel (complete)4398452? (TO) 20118.2 2520.02
cosoco 2.0 parallel (complete)4409712? (TO) 20120.4 2520.02

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: 18
Solution found:
<instantiation id='sol6' type='solution' cost='18'>  <list> x b[][] </list>  <values> 18 100 48 0 0 0 0 0 100 48 0 0 0 0 0 99 50 0 0 0 0 0
98 51 0 0 0 0 0 97 53 0 0 0 0 0 97 53 0 0 0 0 0 97 53 0 0 0 0 0 97 52 0 0 0 0 0 95 32 20 0 0 0 0 94 56 0 0 0 0 0 92 58 0 0 0 0 0 92 56 0 0 0
0 0 91 38 21 0 0 0 0 91 34 0 0 0 0 0 91 32 0 0 0 0 0 90 58 0 0 0 0 0 88 37 24 0 0 0 0 88 32 26 0 0 0 0 88 31 27 0 0 0 0 87 60 0 0 0 0 0 87
36 25 0 0 0 0 85 37 27 0 0 0 0 84 39 27 0 0 0 0 84 36 21 0 0 0 0 84 34 26 0 0 0 0 83 62 0 0 0 0 0 82 64 0 0 0 0 0 82 60 0 0 0 0 0 82 60 0 0
0 0 0 81 66 0 0 0 0 0 80 70 0 0 0 0 0 80 67 0 0 0 0 0 79 67 0 0 0 0 0 79 67 0 0 0 0 0 78 72 0 0 0 0 0 78 72 0 0 0 0 0 78 70 0 0 0 0 0 78 69
0 0 0 0 0 78 68 0 0 0 0 0 77 42 31 0 0 0 0 75 72 0 0 0 0 0 56 47 46 0 0 0 0 56 46 44 0 0 0 0 55 45 24 23 0 0 0 55 44 44 0 0 0 0 54 34 32 30
0 0 0 48 47 45 0 0 0 0 42 41 21 20 0 0 0 41 40 39 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values>  </instantiation>