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

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

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-05-15.xml
MD5SUM194a9771da43b175c5c48a6f0c769610
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark43
Best CPU time to get the best result obtained on this benchmark29.6202
Satisfiable
(Un)Satisfiability was proved
Number of variables150
Number of constraints182
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":75},{"size":9,"count":75}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":75},{"degree":7,"count":4},{"degree":8,"count":32},{"degree":10,"count":39}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":75},{"arity":3,"count":32},{"arity":4,"count":4},{"arity":6,"count":32},{"arity":9,"count":39}]
Number of extensional constraints107
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":107},{"type":"sum","count":75}]
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)4395603OPT43 29.6202 29.6232
choco-solver 2019-09-24 (complete)4406483OPT43 577.311 572.299
AbsCon 2019-07-23 (complete)4391223OPT43 1591.53 1583.42
choco-solver 2019-09-20 (complete)4404083OPT43 2089.4 526.625
choco-solver 2019-09-16 (complete)4400483OPT43 2109.11 531.654
choco-solver 2019-06-14 (complete)4394223OPT43 2124.57 535.623
choco-solver 2019-06-14 parallel (complete)4394523OPT43 2990.14 427.905
choco-solver 2019-09-24 parallel (complete)4407383SAT (TO)43 1995.02 252.095
choco-solver 2019-09-20 parallel (complete)4404983SAT (TO)43 1996.43 252.111
choco-solver 2019-09-16 parallel (complete)4400183SAT (TO)43 1996.92 252.099
cosoco 2.0 parallel (complete)4409943SAT (TO)43 2012.65 252.021
Concrete 3.12.3 (complete)4403183SAT (TO)43 2400.07 2357.63
Concrete 3.10 (complete)4392123SAT (TO)43 2400.09 2347.33
cosoco 2.O parallel (complete)4398683SAT (TO)42 2012.56 252.021
Concrete 3.12.2 (complete)4396503SAT (TO)42 2400.05 2363.33
Concrete 3.12.2 (complete)4401383SAT (TO)42 2400.14 2356.54
cosoco 2 (complete)4390323SAT (TO)41 2400.02 2400.11
cosoco 2.0 (complete)4409043SAT (TO)41 2400.03 2400.11
cosoco 2.0 (complete)4397783SAT (TO)41 2400.04 2399.8

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: 43
Solution found:
<instantiation> <list> x[][] s[][]  </list> <values> 1 0 1 1 0 1 1 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 1 1 1 0 1 0 1 1 0 0 0 1 0 1 0 0 0 0 0 1 0 0
0 1 1 0 1 0 1 0 1 1 1 0 1 0 1 1 1 0 1 1 0 1 1 0 1 0 1 1 0 1 1  2 4 3 2 4 2 3 4 3 4 3 2 4 3 3 2 3 5 3 6 3 5 3 3 3 5 3 5 3 3 4 4 5 2 6 2 5 4 6
4 5 2 5 4 4 2 3 5 3 6 3 5 3 3 3 5 3 5 3 3 2 4 3 2 4 2 3 4 3 4 3 2 4 3 3   </values> </instantiation>