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

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

Jump to solvers results

General information on the benchmark

NameBinPacking/BinPacking-tab-sw120/
BinPacking-tab-sw120-10.xml
MD5SUM67f07639019614dd1d008c87f8253383
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark1
Best CPU time to get the best result obtained on this benchmark254.02699
Satisfiable
(Un)Satisfiability was proved
Number of variables133
Number of constraints25
Number of domains2
Minimum domain size23
Maximum domain size46
Distribution of domain sizes[{"size":23,"count":1},{"size":46,"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-basic 2017-06-11 (complete)4257424SAT (TO)1 254.02699 240.099
OscaR - Hybrid 2017-07-26 (complete)4256430SAT (TO)0 252.088 182.071
OscaR - Conflict Ordering 2017-07-26 (complete)4255933SAT (TO)0 252.105 173.162
OscaR - ALNS 2017-07-26 (complete)4255436SAT (TO)0 252.12801 184.75999
choco-solver 5a (2017-07-26) (complete)4254939? 162.13901 123.21
choco-solver 5a (2017-08-18) (complete)4284231? 165.024 122.953
choco-solver 4.0.5 seq (2017-07-26) (complete)4253945? 165.194 124.994
choco-solver 4.0.5 seq (2017-08-09) (complete)4270011? 167.03799 124.892
choco-solver 4.0.5 seq (2017-08-18) (complete)4282761? 173.745 127.016
choco-solver 4.0.5 par (2017-08-09) (complete)4271481? 481.862 235.37199
choco-solver 4.0.5 par (2017-08-18) (complete)4281291? 482.785 231.048
choco-solver 4.0.5 par (2017-07-26) (complete)4254442? 517.99902 260.59
cosoco-sat 1.12 (complete)4266610? (TO) 240.058 240.02901
cosoco 1.12 (complete)4268541? (TO) 240.062 240.032
Mistral-2.0 2017-07-28 (complete)4258915? (TO) 240.263 240.395
cosoco 1.1 (complete)4258418? (TO) 251.903 252.019
Concrete 3.4 (complete)4259412? (TO) 253.93201 213.063
sat4j-CSP 2017-07-05 (complete)4257921? (TO) 260.15399 88.049103
OscaR - Parallel with EPS 2017-08-22 (complete)4285701? (TO) 608.40802 254.11
OscaR - Parallel with EPS 2017-07-26 (complete)4256927? (TO) 686.83899 254.11

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