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

Result page for benchmark
BinPacking/BinPacking-tab-sw120/
BinPacking-tab-sw120-75.xml

Jump to solvers results

General information on the benchmark

NameBinPacking/BinPacking-tab-sw120/
BinPacking-tab-sw120-75.xml
MD5SUM9cdf82428becd6b5ad716031980a59d2
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark2400.05
Satisfiable
(Un)Satisfiability was proved
Number of variables133
Number of constraints25
Number of domains2
Minimum domain size23
Maximum domain size47
Distribution of domain sizes[{"size":23,"count":1},{"size":47,"count":132}]
Minimum variable degree2
Maximum variable degree4
Distribution of variable degrees[{"degree":2,"count":1},{"degree":3,"count":110},{"degree":4,"count":22}]
Minimum constraint arity6
Maximum constraint arity132
Distribution of constraint arities[{"arity":6,"count":22},{"arity":23,"count":1},{"arity":132,"count":2}]
Number of extensional constraints22
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":22},{"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)4391295SAT (TO)0 2400.05 2381.14
cosoco 2.0 (complete)4409115SAT (TO)0 2400.07 2400.11
cosoco 2 (complete)4390395SAT (TO)0 2400.08 2400.1
cosoco 2.0 (complete)4397855SAT (TO)0 2400.08 2399.8
choco-solver 2019-06-14 (complete)4394295? 112.948 43.4418
choco-solver 2019-09-24 (complete)4406555? 122.009 47.2182
choco-solver 2019-09-20 (complete)4404155? 127.703 47.7246
choco-solver 2019-09-20 parallel (complete)4405055? 554.799 105.306
choco-solver 2019-09-24 parallel (complete)4407455? 564.607 105.868
choco-solver 2019-06-14 parallel (complete)4394595? 573.597 106.328
choco-solver 2019-09-16 (complete)4400555? 854.317 249.828
choco-solver 2019-09-16 parallel (complete)4400255? 906.465 148.545
cosoco 2.0 parallel (complete)4410015? (TO) 1754.4 252.145
cosoco 2.O parallel (complete)4398755? (TO) 1754.66 252.149
PicatSAT 2019-09-12 (complete)4395675? (TO) 2400.06 2400.13
Concrete 3.12.2 (complete)4401455? (TO) 2400.08 2357.55
Concrete 3.12.2 (complete)4396575? (TO) 2400.15 2357.26
Concrete 3.10 (complete)4392195? (TO) 2400.15 2358.16
Concrete 3.12.3 (complete)4403255? (TO) 2400.2 2353.73

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: 0
Solution found:
<instantiation id='sol1' type='solution' cost='0'>  <list> x b[][] </list>  <values> 0 200 200 200 200 200 0 197 197 197 196 196 0 196 196
196 196 195 0 194 194 194 193 192 0 193 193 191 191 189 0 190 190 190 190 189 0 188 187 187 187 186 0 186 185 185 184 181 0 183 183 182 182
182 0 180 179 178 178 178 0 178 176 176 159 153 150 175 174 174 172 150 150 173 173 173 160 158 158 171 171 171 167 166 154 171 171 170 163
161 161 170 169 167 163 163 162 170 168 168 168 161 154 170 166 166 160 153 152 170 166 164 164 161 159 168 161 161 160 0 0 164 163 157 156
156 152 163 163 159 158 156 155 </values>  </instantiation>