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

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

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-wst-s1/
StillLife-wastage-10.xml
MD5SUMe31de29e6699e81a7472a47d1439bb7a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark54
Best CPU time to get the best result obtained on this benchmark18.4594
Satisfiable
(Un)Satisfiability was proved
Number of variables301
Number of constraints208
Number of domains4
Minimum domain size2
Maximum domain size289
Distribution of domain sizes[{"size":2,"count":144},{"size":3,"count":144},{"size":101,"count":1},{"size":289,"count":12}]
Minimum variable degree1
Maximum variable degree13
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":141},{"degree":3,"count":15},{"degree":4,"count":40},{"degree":8,"count":36},{"degree":9,"count":64},{"degree":13,"count":1}]
Minimum constraint arity2
Maximum constraint arity14
Distribution of constraint arities[{"arity":2,"count":52},{"arity":3,"count":40},{"arity":10,"count":100},{"arity":12,"count":4},{"arity":13,"count":1},{"arity":14,"count":11}]
Number of extensional constraints140
Number of intensional constraints51
Distribution of constraint types[{"type":"extension","count":140},{"type":"intension","count":51},{"type":"sum","count":13},{"type":"instantiation","count":4}]
Optimization problemYES
Type of objectivemax VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395483OPT54 18.4594 18.4607
choco-solver 2019-09-16 parallel (complete)4400063OPT54 108.736 14.4652
choco-solver 2019-09-20 (complete)4403963OPT54 119.381 30.3844
choco-solver 2019-09-16 (complete)4400363OPT54 191.947 48.5945
choco-solver 2019-06-14 (complete)4394103OPT54 198.784 69.3657
AbsCon 2019-07-23 (complete)4391103OPT54 230.12 225.682
choco-solver 2019-09-24 parallel (complete)4407263OPT54 275.493 35.7536
choco-solver 2019-09-20 parallel (complete)4404863OPT54 411.258 52.3618
cosoco 2.0 (complete)4397663OPT54 411.793 411.778
cosoco 2 (complete)4390203OPT54 418.143 418.171
cosoco 2.0 (complete)4408923OPT54 419.582 419.621
choco-solver 2019-09-24 (complete)4406363OPT54 427.12 420.321
choco-solver 2019-06-14 parallel (complete)4394403OPT54 611.401 110.286
Concrete 3.12.3 (complete)4403063OPT54 619.952 613.424
cosoco 2.0 parallel (complete)4409823OPT54 1690.33 211.732
Concrete 3.10 (complete)4392003OPT54 2058.91 2013.83
cosoco 2.O parallel (complete)4398563SAT (TO)54 2012.08 252.023
Concrete 3.12.2 (complete)4401263SAT (TO)54 2400.12 2364.33
Concrete 3.12.2 (complete)4396383SAT (TO)52 2400.09 2370.93

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: 54
Solution found:
<instantiation> <list> z x[][] ws[] w[][]  </list> <values> 54  0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 1 0 0 0 1 0 1 1 0 1 0 1 1 0 0 1
0 0 0 0 0 1 0 0 0 0 0 1 1 0 1 1 1 0 1 1 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 1 1 1 0 1 0 1 1 0 0 0 0 0 0 0 0 1 0 1 0 0
0 1 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0  3 5 6 9 11 12 14 14 17 18 20 24  0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0
0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 2 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 1 0 1 0 0 1 0 0 0   </values>
</instantiation>