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-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.0523
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)4395231OPT32 22.0523 22.0533
AbsCon 2019-07-23 (complete)4390851OPT32 99.4323 96.7671
choco-solver 2019-09-20 (complete)4403711OPT32 100.278 25.5989
choco-solver 2019-09-16 (complete)4399211OPT32 100.404 25.6672
choco-solver 2019-06-14 (complete)4393251OPT32 119.521 30.526
choco-solver 2019-09-24 (complete)4406111OPT32 140.63 136.652
choco-solver 2019-09-16 parallel (complete)4399811OPT32 199.203 25.7287
choco-solver 2019-09-20 parallel (complete)4404611OPT32 228.085 29.4156
choco-solver 2019-09-24 parallel (complete)4407011OPT32 261.698 33.5907
choco-solver 2019-06-14 parallel (complete)4393851OPT32 318.549 41.084
cosoco 2.O parallel (complete)4398311OPT32 626.517 78.4693
Concrete 3.12.3 (complete)4402811OPT32 644.178 629.841
Concrete 3.10 (complete)4386983OPT32 666.045 640.311
cosoco 2.0 parallel (complete)4409571OPT32 938.249 117.496
Concrete 3.12.2 (complete)4401011OPT32 1043.05 1020.91
cosoco 2.0 (complete)4408291OPT32 1499.23 1499.59
cosoco 2 (complete)4389751OPT32 1503.08 1503.48
cosoco 2.0 (complete)4397031OPT32 1510.85 1510.83
Concrete 3.12.2 (complete)4396131SAT (TO)32 2520.05 2482.33

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>