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

Result page for benchmark
StillLife/StillLife-m1-s1/
StillLife-05-12.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-05-12.xml
MD5SUMd0005c97ad61d9cead696518787f869e
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark34
Best CPU time to get the best result obtained on this benchmark14.9253
Satisfiable
(Un)Satisfiability was proved
Number of variables120
Number of constraints146
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":60},{"size":9,"count":60}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":60},{"degree":7,"count":4},{"degree":8,"count":26},{"degree":10,"count":30}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":60},{"arity":3,"count":26},{"arity":4,"count":4},{"arity":6,"count":26},{"arity":9,"count":30}]
Number of extensional constraints86
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":86},{"type":"sum","count":60}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395564OPT34 14.9253 14.9288
choco-solver 2019-09-24 (complete)4406444OPT34 77.0728 74.6106
choco-solver 2019-09-16 (complete)4400444OPT34 78.0631 19.9999
choco-solver 2019-06-14 (complete)4394184OPT34 79.1862 20.3106
choco-solver 2019-09-20 (complete)4404044OPT34 79.2921 20.2967
AbsCon 2019-07-23 (complete)4391184OPT34 111.186 107.789
choco-solver 2019-09-24 parallel (complete)4407344OPT34 163.51 21.2837
choco-solver 2019-09-20 parallel (complete)4404944OPT34 181.415 23.4484
choco-solver 2019-06-14 parallel (complete)4394484OPT34 181.493 25.4811
choco-solver 2019-09-16 parallel (complete)4400144OPT34 182.924 23.5727
Concrete 3.10 (complete)4392084OPT34 514.017 490.229
cosoco 2.0 (complete)4409004OPT34 569.983 569.993
cosoco 2 (complete)4390284OPT34 571.545 571.566
cosoco 2.0 (complete)4397744OPT34 571.597 571.573
cosoco 2.O parallel (complete)4398644OPT34 885.835 110.942
Concrete 3.12.2 (complete)4401344OPT34 1282.43 1255.72
Concrete 3.12.3 (complete)4403144OPT34 1984.29 1946.03
cosoco 2.0 parallel (complete)4409904SAT (TO)34 2012.55 252.02
Concrete 3.12.2 (complete)4396464SAT (TO)34 2400.13 2361.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: 34
Solution found:
<instantiation> <list> s[][] x[][]  </list> <values> 2 4 3 2 4 2 3 4 3 4 4 2 2 3 5 3 6 3 5 3 3 3 3 2 4 4 5 2 6 2 5 4 5 5 5 4 2 3 5 3 6 3 5 3
2 4 3 3 2 4 3 2 4 2 3 4 2 4 3 3  1 0 1 1 0 1 1 0 1 0 0 1 1 1 0 1 0 1 0 1 1 1 1 1 0 0 0 1 0 1 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 1 1 0 1 1 0 1
1 0 1 0 1 1   </values> </instantiation>