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-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 benchmark30.7526
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)4395299OPT40 30.7526 30.7604
choco-solver 2019-09-24 (complete)4406179OPT40 535.867 531.282
choco-solver 2019-09-16 (complete)4399279OPT40 694.03 175.421
choco-solver 2019-06-14 (complete)4393319OPT40 740.529 187.39
choco-solver 2019-09-20 (complete)4403779OPT40 756.998 191.299
choco-solver 2019-09-20 parallel (complete)4404679OPT40 1381.14 174.966
choco-solver 2019-09-24 parallel (complete)4407079OPT40 1395.29 176.756
choco-solver 2019-09-16 parallel (complete)4399879OPT40 1763.31 223.243
choco-solver 2019-06-14 parallel (complete)4393919OPT40 1769.43 230.32
cosoco 2.O parallel (complete)4398379OPT40 13635.3 1707.37
cosoco 2.0 parallel (complete)4409639OPT40 17074.8 2138.02
cosoco 2 (complete)4389819SAT (TO)40 2519.71 2520.01
cosoco 2.0 (complete)4397099SAT (TO)40 2519.8 2520.01
cosoco 2.0 (complete)4408359SAT (TO)40 2519.87 2520.01
Concrete 3.10 (complete)4386991SAT (TO)40 2520.12 2466.23
Concrete 3.12.2 (complete)4396199SAT (TO)40 2520.13 2488.04
Concrete 3.12.2 (complete)4401079SAT (TO)39 2520.06 2473.53
Concrete 3.12.3 (complete)4402879SAT (TO)39 2520.12 2484.6
AbsCon 2019-07-23 (complete)4390919SAT (TO)38 2520.03 2509.61

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> s[][] x[][]  </list> <values> 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  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   </values> </instantiation>