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-06-11.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-06-11.xml
MD5SUM5296a674fcd135b0317e95ffe6d81fd1
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 benchmark38.015
Satisfiable
(Un)Satisfiability was proved
Number of variables132
Number of constraints158
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":66},{"size":9,"count":66}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":66},{"degree":7,"count":4},{"degree":8,"count":26},{"degree":10,"count":36}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":66},{"arity":3,"count":26},{"arity":4,"count":4},{"arity":6,"count":26},{"arity":9,"count":36}]
Number of extensional constraints92
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":92},{"type":"sum","count":66}]
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)4395302OPT34 38.015 38.0195
choco-solver 2019-09-20 (complete)4403782OPT34 538.589 136.248
choco-solver 2019-06-14 (complete)4393322OPT34 550.005 139.186
choco-solver 2019-09-16 (complete)4399282OPT34 570.129 144.164
choco-solver 2019-09-24 (complete)4406182OPT34 583.255 575.615
AbsCon 2019-07-23 (complete)4390922OPT34 1218.21 1211.61
choco-solver 2019-09-24 parallel (complete)4407082OPT34 1224.13 155.102
choco-solver 2019-06-14 parallel (complete)4393922OPT34 1251.17 158.179
choco-solver 2019-09-16 parallel (complete)4399882OPT34 1252.57 158.643
choco-solver 2019-09-20 parallel (complete)4404682OPT34 1286.99 162.746
cosoco 2.O parallel (complete)4398382OPT34 15057.5 1885.41
cosoco 2.0 parallel (complete)4409642OPT34 19671.1 2463
cosoco 2.0 (complete)4408362SAT (TO)34 2519.48 2520.01
cosoco 2 (complete)4389822SAT (TO)34 2519.93 2520.01
cosoco 2.0 (complete)4397102SAT (TO)34 2520.05 2520.01
Concrete 3.10 (complete)4386982SAT (TO)34 2520.09 2465.14
Concrete 3.12.2 (complete)4396202SAT (TO)34 2520.12 2481.14
Concrete 3.12.3 (complete)4402882SAT (TO)34 2520.14 2477.63
Concrete 3.12.2 (complete)4401082SAT (TO)34 2520.14 2475.04

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