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

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

Jump to solvers results

General information on the benchmark

NameStillLife/
StillLife-wastage-13_c18.xml
MD5SUMd177c6743c5eb3479b13a6ba42c582bf
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark90
Best CPU time to get the best result obtained on this benchmark48.2319
Satisfiable
(Un)Satisfiability was proved
Number of variables466
Number of constraints307
Number of domains4
Minimum domain size2
Maximum domain size451
Distribution of domain sizes[{"size":2,"count":225},{"size":3,"count":225},{"size":170,"count":1},{"size":451,"count":15}]
Minimum variable degree1
Maximum variable degree16
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":222},{"degree":3,"count":18},{"degree":4,"count":52},{"degree":8,"count":48},{"degree":9,"count":121},{"degree":16,"count":1}]
Minimum constraint arity2
Maximum constraint arity17
Distribution of constraint arities[{"arity":2,"count":67},{"arity":3,"count":52},{"arity":10,"count":169},{"arity":15,"count":4},{"arity":16,"count":1},{"arity":17,"count":14}]
Number of extensional constraints221
Number of intensional constraints66
Distribution of constraint types[{"type":"extension","count":221},{"type":"intension","count":66},{"type":"sum","count":16},{"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)4302962OPT90 43.3842 43.3877
PicatSAT 2018-08-14 (complete)4309302OPT90 48.2319 48.2794
PicatSAT 2018-06-15 (complete)4292916OPT90 50.4298 50.435
Mistral-2.0 2018-06-15 (complete)4289277SAT (TO)90 2400.06 2399.9
Mistral-2.0 2018-08-01 (complete)4303548SAT (TO)90 2519.97 2520.01
Concrete 3.9.2 (complete)4304145SAT (TO)89 2520.08 2464.63
Concrete 3.8 2018-06-13 (complete)4292913SAT (TO)88 2520.1 2464.43
Concrete 3.8-SuperNG 2018-06-13 (complete)4292914SAT (TO)88 2520.13 2464.23
Concrete 3.9.2-SuperNG (complete)4304146SAT (TO)86 2520.1 2469.14
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290236SAT (TO)85 2400.11 2374.41
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311516SAT (TO)85 2520.06 2491.72
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307780SAT (TO)83 2520.06 2490.81
Choco-solver 4.0.7 seq (493a269) (complete)4292192SAT (TO)77 2400.11 2381.32
Choco-solver 4.0.7b seq (e747e1e) (complete)4306486SAT (TO)77 2520.12 2497.05
cosoco 1.12 (complete)4292915SAT (TO)72 2520.05 2520.01
OscaR - Hybrid 2018-07-02 (complete)4291434SAT (TO)71 2400.08 2365.82
OscaR - Hybrid 2018-08-14 (complete)4308366SAT (TO)71 2520.06 2486.51
Sat4j-CSP 2018-07-11 (complete)4289749? (TO) 2400.26 2352.67

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: 90
Solution found:
<instantiation> <list> x[][] w[][] ws[] z  </list> <values> 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 0 1 1 0 1 1 0 0 0 1 0 1 0 1 1 1 0
1 0 1 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 1 0 1 1 1 1 0 0 1 1 1 0 0 0 0 0 1 0 0 0 1 1 1 0 0 1 0 0 1 1 0 1 0 1 0 0 0 0 0 1 0 0 0 1 1 0 1
0 1 1 1 1 1 0 1 1 0 0 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 1 1 0 0 0 0 1 0 0 1 0 0 1 0 0 1 1 0 1 1 1 1 1 1 0 1 1 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0
0 1 1 0 1 0 1 1 1 0 1 0 1 1 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 1 0 0 1 0 1 0 0 1 0 0 0 0 1 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 1 1 0 0 0 1 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 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 2 0 0 0 0
1 0 0 1 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 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 0  4 5 6 9 11 13 16 16
20 21 23 26 26 26 30  90   </values> </instantiation>