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-07-10.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-07-10.xml
MD5SUMebe39bf25244fda615bb1bf8fe88192a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark39
Best CPU time to get the best result obtained on this benchmark31.2202
Satisfiable
(Un)Satisfiability was proved
Number of variables140
Number of constraints166
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":70},{"size":9,"count":70}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":70},{"degree":7,"count":4},{"degree":8,"count":26},{"degree":10,"count":40}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":70},{"arity":3,"count":26},{"arity":4,"count":4},{"arity":6,"count":26},{"arity":9,"count":40}]
Number of extensional constraints96
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":96},{"type":"sum","count":70}]
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)4395300OPT39 31.2202 31.2288
choco-solver 2019-09-24 (complete)4406180OPT39 417.208 412.199
choco-solver 2019-09-16 (complete)4399280OPT39 438.932 111.159
choco-solver 2019-09-20 (complete)4403780OPT39 448.453 113.842
choco-solver 2019-06-14 (complete)4393320OPT39 462.338 123.954
choco-solver 2019-09-24 parallel (complete)4407080OPT39 913.877 115.918
choco-solver 2019-09-16 parallel (complete)4399880OPT39 933.536 118.433
choco-solver 2019-09-20 parallel (complete)4404680OPT39 973.527 123.539
choco-solver 2019-06-14 parallel (complete)4393920OPT39 1087.67 137.663
cosoco 2.0 parallel (complete)4409640OPT39 9586.36 1200.29
cosoco 2.O parallel (complete)4398380OPT39 12233.8 1531.69
cosoco 2 (complete)4389820SAT (TO)39 2519.42 2520.01
cosoco 2.0 (complete)4397100SAT (TO)39 2519.79 2520.01
AbsCon 2019-07-23 (complete)4390920SAT (TO)39 2520.04 2508.71
cosoco 2.0 (complete)4408360SAT (TO)39 2520.06 2520.01
Concrete 3.12.2 (complete)4401080SAT (TO)39 2520.08 2474.63
Concrete 3.10 (complete)4386992SAT (TO)39 2520.08 2464.43
Concrete 3.12.2 (complete)4396200SAT (TO)39 2520.1 2481.04
Concrete 3.12.3 (complete)4402880SAT (TO)39 2520.16 2483.86

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