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

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

Jump to solvers results

General information on the benchmark

NameBinPacking/BinPacking-sum-skj1/
BinPacking-sum-n1c3w4r.xml
MD5SUMa67d0fa6b826179476c8a9ead60c2ec9
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 benchmark244.27
Satisfiable
(Un)Satisfiability was proved
Number of variables117
Number of constraints61
Number of domains2
Minimum domain size30
Maximum domain size39
Distribution of domain sizes[{"size":30,"count":1},{"size":39,"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
OscaR - Conflict Ordering 2017-07-26 (complete)4255906SAT (TO)7 244.27 240.02299
OscaR - Hybrid 2017-07-26 (complete)4256403SAT (TO)7 249.66499 240.02499
OscaR - ALNS 2017-07-26 (complete)4255409SAT (TO)7 249.881 240.024
Mistral-2.0 2017-07-28 (complete)4258888SAT (TO)7 251.936 252.00999
choco-solver 4.0.5 par (2017-07-26) (complete)4254415SAT (TO)7 1920.49 241.435
choco-solver 4.0.5 par (2017-08-18) (complete)4281264SAT (TO)7 2005.8101 252.10201
choco-solver 4.0.5 par (2017-08-09) (complete)4271454SAT (TO)7 2007.0699 252.10201
AbsCon-basic 2017-06-11 (complete)4257397SAT (TO)4 242.58299 240.01199
OscaR - Parallel with EPS 2017-07-26 (complete)4256900SAT (TO)4 1920.66 254.52901
OscaR - Parallel with EPS 2017-08-22 (complete)4285674SAT (TO)1 1979.77 252.132
cosoco-sat 1.12 (complete)4266583? (TO) 240.00999 240.00999
cosoco 1.12 (complete)4268514? (TO) 240.03101 240.00999
choco-solver 4.0.5 seq (2017-08-18) (complete)4282734? (TO) 243.547 240.022
choco-solver 4.0.5 seq (2017-07-26) (complete)4253918? (TO) 243.78999 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4269984? (TO) 243.95 240.02299
sat4j-CSP 2017-07-05 (complete)4257894? (TO) 244.67599 240.23801
Concrete 3.4 (complete)4259385? (TO) 251.021 240.248
cosoco 1.1 (complete)4258391? (TO) 251.951 252.00999
choco-solver 5a (2017-07-26) (complete)4254912? (TO) 252.5 240.011
choco-solver 5a (2017-08-18) (complete)4284204? (TO) 252.655 240.022

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> <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> 7 98 31 0 0 94 55 0 0 94 45 0 0 93 57 0 0
92 58 0 0 92 56 0 0 92 48 0 0 91 59 0 0 85 63 0 0 84 65 0 0 84 59 0 0 81 68 0 0 81 61 0 0 79 71 0 0 79 67 0 0 78 67 0 0 76 73 0 0 72 68 0 0
60 47 43 0 60 46 40 0 40 38 37 35 39 34 32 31 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>