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

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-05-14.xml
MD5SUMff3476fab8d1f67b2009ab5045109208
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 benchmark28.788
Satisfiable
(Un)Satisfiability was proved
Number of variables140
Number of constraints170
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":30},{"degree":10,"count":36}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":70},{"arity":3,"count":30},{"arity":4,"count":4},{"arity":6,"count":30},{"arity":9,"count":36}]
Number of extensional constraints100
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":100},{"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)4395304OPT40 28.788 28.7902
choco-solver 2019-09-24 (complete)4406184OPT40 417.267 412.569
choco-solver 2019-09-16 (complete)4399284OPT40 616.378 155.896
choco-solver 2019-06-14 (complete)4393324OPT40 734.083 186.033
choco-solver 2019-09-20 (complete)4403784OPT40 779.103 197.014
AbsCon 2019-07-23 (complete)4390924OPT40 786.826 782.184
choco-solver 2019-09-16 parallel (complete)4399884OPT40 1344.41 170.076
choco-solver 2019-09-20 parallel (complete)4404684OPT40 1377.95 174.465
choco-solver 2019-09-24 parallel (complete)4407084OPT40 1381.27 174.836
choco-solver 2019-06-14 parallel (complete)4393924OPT40 1395.05 206.663
Concrete 3.12.3 (complete)4402884OPT40 2074.72 2046.19
cosoco 2.0 (complete)4397104SAT (TO)40 2519.29 2520.01
cosoco 2.0 (complete)4408364SAT (TO)40 2519.62 2520.01
cosoco 2 (complete)4389824SAT (TO)40 2520.02 2519.7
Concrete 3.12.2 (complete)4401084SAT (TO)40 2520.04 2474.24
cosoco 2.O parallel (complete)4398384SAT (TO)40 20125.2 2520.02
cosoco 2.0 parallel (complete)4409644SAT (TO)40 20126.3 2520.02
Concrete 3.10 (complete)4386984SAT (TO)38 2520.08 2464.23
Concrete 3.12.2 (complete)4396204SAT (TO)37 2520.04 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: 40
Solution found:
<instantiation> <list> x[][] s[][]  </list> <values> 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1
0 1 1 0 1 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1  3 3 4 3 3 4 3 3 4 3 3 4 3 3 3 3 4 3 3 4 3 3 4 3 3 4 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 3 3
4 3 3 4 3 3 4 3 3 4 3 3 3 3 4 3 3 4 3 3 4 3 3 4 3 3   </values> </instantiation>