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

Result page for benchmark
BinPacking/BinPacking-sum-skj1/
BinPacking-sum-n1c3w4d.xml

Jump to solvers results

General information on the benchmark

NameBinPacking/BinPacking-sum-skj1/
BinPacking-sum-n1c3w4d.xml
MD5SUMe17d1f270cb1c92567283195f4efc493
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark8
Best CPU time to get the best result obtained on this benchmark75.319504
Satisfiable
(Un)Satisfiability was proved
Number of variables117
Number of constraints61
Number of domains2
Minimum domain size30
Maximum domain size37
Distribution of domain sizes[{"size":30,"count":1},{"size":37,"count":116}]
Minimum variable degree2
Maximum variable degree5
Distribution of variable degrees[{"degree":2,"count":1},{"degree":4,"count":87},{"degree":5,"count":29}]
Minimum constraint arity4
Maximum constraint arity116
Distribution of constraint arities[{"arity":4,"count":58},{"arity":30,"count":1},{"arity":116,"count":2}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"ordered","count":29},{"type":"lex","count":1},{"type":"sum","count":29},{"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
Mistral-2.0 2017-07-28 (complete)4258887OPT8 75.319504 75.431602
choco-solver 4.0.5 par (2017-07-26) (complete)4254414SAT (TO)7 1920.34 241.536
choco-solver 4.0.5 par (2017-08-18) (complete)4281263SAT (TO)7 2004.48 252.076
choco-solver 4.0.5 par (2017-08-09) (complete)4271453SAT (TO)7 2006.5699 252.10001
AbsCon-basic 2017-06-11 (complete)4257396SAT (TO)5 242.315 240.011
OscaR - Parallel with EPS 2017-08-22 (complete)4285673SAT (TO)5 1745.02 252.03799
OscaR - Parallel with EPS 2017-07-26 (complete)4256899SAT (TO)3 1921.39 244.80901
cosoco 1.12 (complete)4268513? (TO) 240.007 240.009
choco-solver 4.0.5 seq (2017-08-18) (complete)4282733? (TO) 243.856 240.022
choco-solver 4.0.5 seq (2017-08-09) (complete)4269983? (TO) 243.95599 240.022
OscaR - Hybrid 2017-07-26 (complete)4256402? (TO) 243.998 240.01401
OscaR - ALNS 2017-07-26 (complete)4255408? (TO) 244.035 240.01199
OscaR - Conflict Ordering 2017-07-26 (complete)4255905? (TO) 244.142 240.01199
sat4j-CSP 2017-07-05 (complete)4257893? (TO) 244.18201 240.239
choco-solver 4.0.5 seq (2017-07-26) (complete)4253917? (TO) 244.61 240.00999
Concrete 3.4 (complete)4259384? (TO) 251.201 240.239
cosoco-sat 1.12 (complete)4266582? (TO) 251.858 252.00999
cosoco 1.1 (complete)4258390? (TO) 251.92 252.00999
choco-solver 5a (2017-08-18) (complete)4284203? (TO) 253.373 240.02499
choco-solver 5a (2017-07-26) (complete)4254911? (TO) 253.57001 240.00999

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: 8
Solution found:
<instantiation type="optimum" cost="8"> <list> x b[0][0] b[0][1] b[0][2] b[0][3] b[1][0] b[1][1] b[1][2] b[1][3] b[2][0] b[2][1] b[2][2]
b[2][3] b[3][0] b[3][1] b[3][2] b[3][3] b[4][0] b[4][1] b[4][2] b[4][3] b[5][0] b[5][1] b[5][2] b[5][3] b[6][0] b[6][1] b[6][2] b[6][3]
b[7][0] b[7][1] b[7][2] b[7][3] b[8][0] b[8][1] b[8][2] b[8][3] b[9][0] b[9][1] b[9][2] b[9][3] b[10][0] b[10][1] b[10][2] b[10][3] b[11][0]
b[11][1] b[11][2] b[11][3] b[12][0] b[12][1] b[12][2] b[12][3] b[13][0] b[13][1] b[13][2] b[13][3] b[14][0] b[14][1] b[14][2] b[14][3]
b[15][0] b[15][1] b[15][2] b[15][3] b[16][0] b[16][1] b[16][2] b[16][3] b[17][0] b[17][1] b[17][2] b[17][3] b[18][0] b[18][1] b[18][2]
b[18][3] b[19][0] b[19][1] b[19][2] b[19][3] b[20][0] b[20][1] b[20][2] b[20][3] b[21][0] b[21][1] b[21][2] b[21][3] b[22][0] b[22][1]
b[22][2] b[22][3] b[23][0] b[23][1] b[23][2] b[23][3] b[24][0] b[24][1] b[24][2] b[24][3] b[25][0] b[25][1] b[25][2] b[25][3] b[26][0]
b[26][1] b[26][2] b[26][3] b[27][0] b[27][1] b[27][2] b[27][3] b[28][0] b[28][1] b[28][2] b[28][3] </list> <values> 8 100 48 0 0 96 54 0 0
93 56 0 0 90 58 0 0 88 61 0 0 88 58 0 0 86 61 0 0 85 64 0 0 84 58 0 0 84 44 0 0 83 67 0 0 83 47 0 0 80 70 0 0 80 36 34 0 79 37 34 0 77 40 33
0 77 40 31 0 74 43 33 0 68 41 41 0 54 51 45 0 53 49 45 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>