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-14.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-04-14.xml
MD5SUM19ed80590beafaab4553f21dc50e09e4
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark30
Best CPU time to get the best result obtained on this benchmark16.9051
Satisfiable
(Un)Satisfiability was proved
Number of variables112
Number of constraints140
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":56},{"size":9,"count":56}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":56},{"degree":7,"count":4},{"degree":8,"count":28},{"degree":10,"count":24}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":56},{"arity":3,"count":28},{"arity":4,"count":4},{"arity":6,"count":28},{"arity":9,"count":24}]
Number of extensional constraints84
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":84},{"type":"sum","count":56}]
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)4395242OPT30 16.9051 16.9069
choco-solver 2019-09-24 (complete)4406122OPT30 18.122 15.2414
AbsCon 2019-07-23 (complete)4390862OPT30 53.1014 50.5766
choco-solver 2019-09-20 (complete)4403722OPT30 61.944 16.0485
choco-solver 2019-06-14 (complete)4393262OPT30 62.7763 16.1497
choco-solver 2019-09-16 (complete)4399222OPT30 64.269 16.5205
choco-solver 2019-06-14 parallel (complete)4393862OPT30 85.4222 11.342
choco-solver 2019-09-16 parallel (complete)4399822OPT30 114.657 15.0638
choco-solver 2019-09-24 parallel (complete)4407022OPT30 150.981 19.5594
choco-solver 2019-09-20 parallel (complete)4404622OPT30 156.018 20.2561
cosoco 2 (complete)4389762OPT30 343.015 343.01
cosoco 2.0 (complete)4408302OPT30 343.311 344.114
cosoco 2.0 (complete)4397042OPT30 348.863 349.012
cosoco 2.0 parallel (complete)4409582OPT30 485.162 60.7632
Concrete 3.12.3 (complete)4402822OPT30 534.948 532.262
Concrete 3.12.2 (complete)4401022OPT30 591.287 576.589
Concrete 3.10 (complete)4386979OPT30 622.653 596.838
Concrete 3.12.2 (complete)4396142OPT30 679.984 664.069
cosoco 2.O parallel (complete)4398322OPT30 1463.31 183.247

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