2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
StillLife/StillLife-wst-s1/
StillLife-wastage-10.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-wst-s1/
StillLife-wastage-10.xml
MD5SUMe31de29e6699e81a7472a47d1439bb7a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark54
Best CPU time to get the best result obtained on this benchmark18.4798
Satisfiable
(Un)Satisfiability was proved
Number of variables301
Number of constraints208
Number of domains4
Minimum domain size2
Maximum domain size289
Distribution of domain sizes[{"size":2,"count":144},{"size":3,"count":144},{"size":101,"count":1},{"size":289,"count":12}]
Minimum variable degree1
Maximum variable degree13
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":141},{"degree":3,"count":15},{"degree":4,"count":40},{"degree":8,"count":36},{"degree":9,"count":64},{"degree":13,"count":1}]
Minimum constraint arity2
Maximum constraint arity14
Distribution of constraint arities[{"arity":2,"count":52},{"arity":3,"count":40},{"arity":10,"count":100},{"arity":12,"count":4},{"arity":13,"count":1},{"arity":14,"count":11}]
Number of extensional constraints140
Number of intensional constraints51
Distribution of constraint types[{"type":"extension","count":140},{"type":"intension","count":51},{"type":"sum","count":13},{"type":"instantiation","count":4}]
Optimization problemYES
Type of objectivemax VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395183OPT54 18.4798 18.4819
choco-solver 2019-09-16 parallel (complete)4399763OPT54 98.5085 13.1803
choco-solver 2019-09-20 (complete)4403663OPT54 117.368 29.8753
choco-solver 2019-09-16 (complete)4399163OPT54 124.107 31.5654
choco-solver 2019-06-14 (complete)4393203OPT54 130.729 48.2104
choco-solver 2019-09-20 parallel (complete)4404563OPT54 190.323 24.698
AbsCon 2019-07-23 (complete)4390803OPT54 226.683 222.946
choco-solver 2019-09-24 (complete)4406063OPT54 414.256 409.148
cosoco 2.0 (complete)4396983OPT54 414.744 414.833
cosoco 2 (complete)4389703OPT54 415.341 415.338
cosoco 2.0 (complete)4408243OPT54 417.965 418.782
choco-solver 2019-09-24 parallel (complete)4406963OPT54 448.738 57.0632
choco-solver 2019-06-14 parallel (complete)4393803OPT54 455.22 111.59
Concrete 3.12.3 (complete)4402763OPT54 641.15 635.826
Concrete 3.10 (complete)4386978OPT54 844.529 815.812
cosoco 2.O parallel (complete)4398263OPT54 1454.64 182.211
cosoco 2.0 parallel (complete)4409523OPT54 1820.87 228.062
Concrete 3.12.2 (complete)4400963SAT (TO)54 2520.09 2482.63
Concrete 3.12.2 (complete)4396083SAT (TO)53 2520.14 2488.42

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: 54
Solution found:
<instantiation> <list> ws[] x[][] w[][] z  </list> <values> 3 5 6 9 11 12 14 14 17 18 20 24  0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 1 0
0 0 1 0 1 1 0 1 0 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 0 1 1 1 0 1 1 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 1 1 1 0 1 0 1
1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0  0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0
0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 2 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0
0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 1 0 1 0 0 1 0 0 0  54   </values> </instantiation>