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

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

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-04-15.xml
MD5SUMcca0fe077f2d073d0e0e51ff08e17328
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark32
Best CPU time to get the best result obtained on this benchmark22.5937
Satisfiable
(Un)Satisfiability was proved
Number of variables120
Number of constraints150
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":30},{"degree":10,"count":26}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":60},{"arity":3,"count":30},{"arity":4,"count":4},{"arity":6,"count":30},{"arity":9,"count":26}]
Number of extensional constraints90
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":90},{"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)4395531OPT32 22.5937 22.6032
AbsCon 2019-07-23 (complete)4391151OPT32 117.933 114.491
choco-solver 2019-09-20 (complete)4404011OPT32 129.318 32.9477
choco-solver 2019-09-24 (complete)4406411OPT32 137.122 133.672
choco-solver 2019-09-16 (complete)4400411OPT32 160.842 40.9188
choco-solver 2019-06-14 (complete)4394151OPT32 177.698 45.2562
choco-solver 2019-09-20 parallel (complete)4404911OPT32 229.377 29.5955
choco-solver 2019-09-16 parallel (complete)4400111OPT32 233.086 30.0442
choco-solver 2019-06-14 parallel (complete)4394451OPT32 268.416 34.4293
choco-solver 2019-09-24 parallel (complete)4407311OPT32 285.913 36.6661
cosoco 2.0 parallel (complete)4409871OPT32 457.428 57.2904
Concrete 3.12.3 (complete)4403111OPT32 483.533 470.192
Concrete 3.12.2 (complete)4401311OPT32 746.788 728.841
Concrete 3.10 (complete)4392051OPT32 1003.99 972.41
cosoco 2.0 (complete)4397711OPT32 1498.86 1498.77
cosoco 2.0 (complete)4408971OPT32 1500.58 1500.62
cosoco 2 (complete)4390251OPT32 1516.15 1516.4
cosoco 2.O parallel (complete)4398611SAT (TO)32 2012.49 252.021
Concrete 3.12.2 (complete)4396431SAT (TO)32 2400.07 2362.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: 32
Solution found:
<instantiation> <list> x[][] s[][]  </list> <values> 1 1 0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0 1 1 0 0 0 1 0 1 0 0 1 0 1 0 1
0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 1  2 2 4 2 2 2 2 2 4 2 3 2 2 2 2 4 3 4 3 4 4 4 3 5 3 6 2 4 4 3 3 4 4 4 3 4 3 4 4 2 6 3 5 3 4 2 2 2 2 2 4 2 2 2
2 3 2 4 2 2   </values> </instantiation>