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

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

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-wst-s1/
StillLife-wastage-07.xml
MD5SUM006cf0fd5d0b6c1fad06ae59cb3b038a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark28
Best CPU time to get the best result obtained on this benchmark0.60087299
Satisfiable
(Un)Satisfiability was proved
Number of variables172
Number of constraints127
Number of domains4
Minimum domain size2
Maximum domain size163
Distribution of domain sizes[{"size":2,"count":81},{"size":3,"count":81},{"size":50,"count":1},{"size":163,"count":9}]
Minimum variable degree1
Maximum variable degree10
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":78},{"degree":3,"count":12},{"degree":4,"count":28},{"degree":8,"count":24},{"degree":9,"count":25},{"degree":10,"count":1}]
Minimum constraint arity2
Maximum constraint arity11
Distribution of constraint arities[{"arity":2,"count":37},{"arity":3,"count":28},{"arity":9,"count":4},{"arity":10,"count":50},{"arity":11,"count":8}]
Number of extensional constraints77
Number of intensional constraints36
Distribution of constraint types[{"type":"extension","count":77},{"type":"intension","count":36},{"type":"sum","count":10},{"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)4268845OPT28 0.60087299 0.67492402
cosoco 1.1 (complete)4258811OPT28 0.60184401 0.74357301
cosoco-sat 1.12 (complete)4266914OPT28 1.2965699 1.2970901
Mistral-2.0 2017-07-28 (complete)4259308OPT28 2.8808 2.9312899
choco-solver 4.0.5 seq (2017-08-18) (complete)4283065OPT28 3.5767701 1.4053
choco-solver 4.0.5 par (2017-08-09) (complete)4271785OPT28 3.6177101 1.06221
choco-solver 4.0.5 seq (2017-08-09) (complete)4270315OPT28 3.7286501 1.56946
choco-solver 4.0.5 seq (2017-07-26) (complete)4254338OPT28 3.7950699 1.5372
choco-solver 4.0.5 par (2017-07-26) (complete)4254835OPT28 3.96187 1.23999
choco-solver 4.0.5 par (2017-08-18) (complete)4281595OPT28 4.08885 1.0975699
AbsCon-basic 2017-06-11 (complete)4257817OPT28 4.4776502 1.87137
OscaR - Conflict Ordering 2017-07-26 (complete)4256326OPT28 4.8994298 2.8076999
OscaR - Hybrid 2017-07-26 (complete)4256823OPT28 5.1127701 2.87396
OscaR - Parallel with EPS 2017-07-26 (complete)4257320OPT28 10.6055 2.8415501
OscaR - Parallel with EPS 2017-08-22 (complete)4286005OPT28 10.7501 2.7581999
choco-solver 5a (2017-08-18) (complete)4284535OPT28 20.314501 11.5579
choco-solver 5a (2017-07-26) (complete)4255332OPT28 22.883801 12.4294
Concrete 3.4 (complete)4259805OPT28 47.4105 34.4902
OscaR - ALNS 2017-07-26 (complete)4255829SAT (TO)28 248.95599 240.02901
sat4j-CSP 2017-07-05 (complete)4258314? (TO) 248.69 240.22501

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