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

Result page for benchmark
StillLife/StillLife-wst-s1/
StillLife-wastage-08.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-wst-s1/
StillLife-wastage-08.xml
MD5SUM7fa074241beecf824461849015848bff
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark36
Best CPU time to get the best result obtained on this benchmark3.4939899
Satisfiable
(Un)Satisfiability was proved
Number of variables211
Number of constraints152
Number of domains4
Minimum domain size2
Maximum domain size201
Distribution of domain sizes[{"size":2,"count":100},{"size":3,"count":100},{"size":65,"count":1},{"size":201,"count":10}]
Minimum variable degree1
Maximum variable degree11
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":97},{"degree":3,"count":13},{"degree":4,"count":32},{"degree":8,"count":28},{"degree":9,"count":36},{"degree":11,"count":1}]
Minimum constraint arity2
Maximum constraint arity12
Distribution of constraint arities[{"arity":2,"count":42},{"arity":3,"count":32},{"arity":10,"count":68},{"arity":11,"count":1},{"arity":12,"count":9}]
Number of extensional constraints96
Number of intensional constraints41
Distribution of constraint types[{"type":"extension","count":96},{"type":"intension","count":41},{"type":"sum","count":11},{"type":"instantiation","count":4}]
Optimization problemYES
Type of objectivemax VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 1.12 (complete)4268846OPT36 3.4939899 3.55128
cosoco 1.1 (complete)4258812OPT36 3.5148001 3.5729301
choco-solver 4.0.5 par (2017-08-18) (complete)4281596OPT36 5.4380002 1.3676701
choco-solver 4.0.5 par (2017-07-26) (complete)4254836OPT36 5.9592299 1.5497
choco-solver 4.0.5 par (2017-08-09) (complete)4271786OPT36 6.1108699 1.45329
AbsCon-basic 2017-06-11 (complete)4257818OPT36 6.7287202 3.76299
cosoco-sat 1.12 (complete)4266915OPT36 8.7894897 8.7963896
Mistral-2.0 2017-07-28 (complete)4259309OPT36 13.3406 13.444
choco-solver 4.0.5 seq (2017-08-09) (complete)4270316OPT36 23.1717 20.1094
choco-solver 4.0.5 seq (2017-08-18) (complete)4283066OPT36 23.2173 19.9732
choco-solver 4.0.5 seq (2017-07-26) (complete)4254339OPT36 23.7665 20.137199
OscaR - Conflict Ordering 2017-07-26 (complete)4256327OPT36 27.3358 24.533701
OscaR - Parallel with EPS 2017-07-26 (complete)4257321OPT36 27.6315 5.3424802
OscaR - Parallel with EPS 2017-08-22 (complete)4286006OPT36 30.4245 5.2334399
choco-solver 5a (2017-08-18) (complete)4284536OPT36 48.018501 38.7202
choco-solver 5a (2017-07-26) (complete)4255333OPT36 49.779598 39.045601
Concrete 3.4 (complete)4259806OPT36 135.52699 112.543
OscaR - Hybrid 2017-07-26 (complete)4256824OPT36 194.276 185.19501
OscaR - ALNS 2017-07-26 (complete)4255830SAT (TO)36 248.799 240.01801
sat4j-CSP 2017-07-05 (complete)4258315? (TO) 250.039 240.237

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: 36
Solution found:
<instantiation type='solution' cost='36'> <list>w[0][0] w[0][1] w[0][2] w[0][3] w[0][4] w[0][5] w[0][6] w[0][7] w[0][8] w[0][9] w[1][0]
w[1][1] w[1][2] w[1][3] w[1][4] w[1][5] w[1][6] w[1][7] w[1][8] w[1][9] w[2][0] w[2][1] w[2][2] w[2][3] w[2][4] w[2][5] w[2][6] w[2][7]
w[2][8] w[2][9] w[3][0] w[3][1] w[3][2] w[3][3] w[3][4] w[3][5] w[3][6] w[3][7] w[3][8] w[3][9] w[4][0] w[4][1] w[4][2] w[4][3] w[4][4]
w[4][5] w[4][6] w[4][7] w[4][8] w[4][9] w[5][0] w[5][1] w[5][2] w[5][3] w[5][4] w[5][5] w[5][6] w[5][7] w[5][8] w[5][9] w[6][0] w[6][1]
w[6][2] w[6][3] w[6][4] w[6][5] w[6][6] w[6][7] w[6][8] w[6][9] w[7][0] w[7][1] w[7][2] w[7][3] w[7][4] w[7][5] w[7][6] w[7][7] w[7][8]
w[7][9] w[8][0] w[8][1] w[8][2] w[8][3] w[8][4] w[8][5] w[8][6] w[8][7] w[8][8] w[8][9] w[9][0] w[9][1] w[9][2] w[9][3] w[9][4] w[9][5]
w[9][6] w[9][7] w[9][8] w[9][9] ws[0] ws[1] ws[2] ws[3] ws[4] ws[5] ws[6] ws[7] ws[8] ws[9] x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5]
x[0][6] x[0][7] x[0][8] x[0][9] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[2][0] x[2][1] x[2][2]
x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9]
x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[4][9] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6]
x[5][7] x[5][8] x[5][9] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[7][0] x[7][1] x[7][2] x[7][3]
x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[7][9] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] x[8][9] x[9][0]
x[9][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8] x[9][9] z </list> <values>0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 1 0 0 2 0 0 2 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 2 0 0 2 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
0 1 0 0 0 2 2 2 8 8 8 14 14 14 16 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 0 1 1
0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 36 </values> </instantiation>