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

Result page for benchmark
StillLife/StillLife-m1-s1/
StillLife-08-09.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-08-09.xml
MD5SUM6fd932c8bfa1fb1c2de56266b40b08cd
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark40
Best CPU time to get the best result obtained on this benchmark32.0099
Satisfiable
(Un)Satisfiability was proved
Number of variables144
Number of constraints170
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":72},{"size":9,"count":72}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":72},{"degree":7,"count":4},{"degree":8,"count":26},{"degree":10,"count":42}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":72},{"arity":3,"count":26},{"arity":4,"count":4},{"arity":6,"count":26},{"arity":9,"count":42}]
Number of extensional constraints98
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":98},{"type":"sum","count":72}]
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)4395599OPT40 32.0099 32.0124
choco-solver 2019-09-24 (complete)4406479OPT40 541.253 536.215
choco-solver 2019-09-16 (complete)4400479OPT40 693.51 175.438
choco-solver 2019-09-20 (complete)4404079OPT40 731.646 184.922
choco-solver 2019-06-14 (complete)4394219OPT40 809.811 204.591
choco-solver 2019-09-24 parallel (complete)4407379OPT40 1145.73 145.15
choco-solver 2019-09-20 parallel (complete)4404979OPT40 1362.28 172.855
choco-solver 2019-09-16 parallel (complete)4400179OPT40 1617.54 204.57
choco-solver 2019-06-14 parallel (complete)4394519OPT40 1774.32 244.221
cosoco 2.0 parallel (complete)4409939SAT (TO)40 2012.55 252.021
cosoco 2.0 (complete)4397779SAT (TO)40 2400.03 2400.01
cosoco 2.0 (complete)4409039SAT (TO)40 2400.04 2400.01
cosoco 2 (complete)4390319SAT (TO)40 2400.04 2400.2
Concrete 3.12.2 (complete)4396499SAT (TO)40 2400.11 2364.03
Concrete 3.12.3 (complete)4403179SAT (TO)40 2400.12 2357.33
cosoco 2.O parallel (complete)4398679SAT (TO)39 2012.62 252.021
Concrete 3.10 (complete)4392119SAT (TO)39 2400.04 2347.63
Concrete 3.12.2 (complete)4401379SAT (TO)38 2400.05 2356.83
AbsCon 2019-07-23 (complete)4391219SAT (TO)38 2400.07 2388.31

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