2019 XCSP3 competition: main track (CSP and COP, 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.4975
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)4395303OPT43 29.4975 29.5156
choco-solver 2019-09-24 (complete)4406183OPT43 677.996 670.698
AbsCon 2019-07-23 (complete)4390923OPT43 1599.78 1591.04
choco-solver 2019-09-20 (complete)4403783OPT43 1771.76 447.053
choco-solver 2019-06-14 (complete)4393323OPT43 2038.02 514.485
choco-solver 2019-09-16 (complete)4399283OPT43 2222.69 560.416
choco-solver 2019-06-14 parallel (complete)4393923OPT43 3646.98 472.467
choco-solver 2019-09-20 parallel (complete)4404683OPT43 3650.5 460.101
choco-solver 2019-09-16 parallel (complete)4399883OPT43 3936.56 496.247
choco-solver 2019-09-24 parallel (complete)4407083OPT43 4502.78 567.314
Concrete 3.10 (complete)4386987SAT (TO)43 2520.05 2464.33
Concrete 3.12.3 (complete)4402883SAT (TO)43 2520.07 2486.14
cosoco 2.O parallel (complete)4398383SAT (TO)43 20126.8 2520.02
cosoco 2.0 parallel (complete)4409643SAT (TO)43 20128 2520.02
Concrete 3.12.2 (complete)4396203SAT (TO)42 2520.14 2482.63
Concrete 3.12.2 (complete)4401083SAT (TO)42 2520.24 2477.73
cosoco 2 (complete)4389823SAT (TO)41 2519.36 2520.01
cosoco 2.0 (complete)4408363SAT (TO)41 2519.83 2520.01
cosoco 2.0 (complete)4397103SAT (TO)41 2519.92 2520.01

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>