2018 XCSP3 competition: sequential solvers tracks: solvers results per benchmarks

Result page for benchmark
StillLife/
StillLife-wastage-14_c18.xml

Jump to solvers results

General information on the benchmark

NameStillLife/
StillLife-wastage-14_c18.xml
MD5SUM24e7c51735ec9671261d78753301e43f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark104
Best CPU time to get the best result obtained on this benchmark59.3102
Satisfiable
(Un)Satisfiability was proved
Number of variables529
Number of constraints344
Number of domains4
Minimum domain size2
Maximum domain size513
Distribution of domain sizes[{"size":2,"count":256},{"size":3,"count":256},{"size":197,"count":1},{"size":513,"count":16}]
Minimum variable degree1
Maximum variable degree17
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":253},{"degree":3,"count":19},{"degree":4,"count":56},{"degree":8,"count":52},{"degree":9,"count":144},{"degree":17,"count":1}]
Minimum constraint arity2
Maximum constraint arity18
Distribution of constraint arities[{"arity":2,"count":72},{"arity":3,"count":56},{"arity":10,"count":196},{"arity":16,"count":4},{"arity":17,"count":1},{"arity":18,"count":15}]
Number of extensional constraints252
Number of intensional constraints71
Distribution of constraint types[{"type":"extension","count":252},{"type":"intension","count":71},{"type":"sum","count":17},{"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 2018-08-02 (complete)4302963OPT104 45.7199 45.725
PicatSAT 2018-06-15 (complete)4292928OPT104 54.2358 54.2429
PicatSAT 2018-08-14 (complete)4309303OPT104 59.3102 59.3139
Mistral-2.0 2018-06-15 (complete)4289280SAT (TO)103 2400.01 2399.9
Mistral-2.0 2018-08-01 (complete)4303549SAT (TO)103 2520.03 2520.01
Concrete 3.8-SuperNG 2018-06-13 (complete)4292926SAT (TO)102 2520.06 2465.93
OscaR - Hybrid 2018-07-02 (complete)4291435SAT (TO)101 2400.13 2368.02
Concrete 3.8 2018-06-13 (complete)4292925SAT (TO)100 2520.12 2463.43
Concrete 3.9.2 (complete)4304151SAT (TO)100 2520.14 2463.33
Concrete 3.9.2-SuperNG (complete)4304152SAT (TO)96 2520.07 2459.93
OscaR - Hybrid 2018-08-14 (complete)4308367SAT (TO)96 2520.1 2457.03
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311517SAT (TO)93 2520.1 2492.02
Choco-solver 4.0.7 seq (493a269) (complete)4292193SAT (TO)91 2400.05 2381.42
Choco-solver 4.0.7b seq (e747e1e) (complete)4306487SAT (TO)91 2520.04 2497.52
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290237SAT (TO)88 2400.12 2375.51
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307781SAT (TO)86 2520.04 2493.92
cosoco 1.12 (complete)4292927SAT (TO)68 2520.07 2520.01
Sat4j-CSP 2018-07-11 (complete)4289750? (TO) 2400.11 2345.46

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: 104
Solution found:
<instantiation> <list> z x[][] w[][] ws[]  </list> <values> 104  0 0 0 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 0 0 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 0 0 0 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 0 0 1 0 0 1 0 1 0 0 0 0 1 0 1 1 0 0 0 1 0 1 0 1 0 1 1 0 1
0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 0 1 0 1 0 1 0 0 0 0 1 0 1 1 0 0 1 0 0 1 0 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0
0 0 0 1 1 1 1 1 1 1 0 1 1 0 0 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 1 1 1 0 1 0 1 1 0 0 0 1 1 0 1 1 0 1 0 1 1 0 1 1 0 0 0 0 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 0 2 0
0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 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 1 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 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 1 0 0 1 0 0 0  4 4 4 12 12 12 15 15 16 18 19
21 24 26 27 32   </values> </instantiation>