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

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

Jump to solvers results

General information on the benchmark

NameStillLife/
StillLife-wastage-12_c18.xml
MD5SUM1705a9e2268f4ba11e634eeea0e95112
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark76
Best CPU time to get the best result obtained on this benchmark39.9207
Satisfiable
(Un)Satisfiability was proved
Number of variables407
Number of constraints272
Number of domains4
Minimum domain size2
Maximum domain size393
Distribution of domain sizes[{"size":2,"count":196},{"size":3,"count":196},{"size":145,"count":1},{"size":393,"count":14}]
Minimum variable degree1
Maximum variable degree15
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":193},{"degree":3,"count":17},{"degree":4,"count":48},{"degree":8,"count":44},{"degree":9,"count":100},{"degree":15,"count":1}]
Minimum constraint arity2
Maximum constraint arity16
Distribution of constraint arities[{"arity":2,"count":62},{"arity":3,"count":48},{"arity":10,"count":144},{"arity":14,"count":4},{"arity":15,"count":1},{"arity":16,"count":13}]
Number of extensional constraints192
Number of intensional constraints61
Distribution of constraint types[{"type":"extension","count":192},{"type":"intension","count":61},{"type":"sum","count":15},{"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-06-15 (complete)4292932OPT76 33.3785 33.3834
PicatSAT 2018-08-14 (complete)4309301OPT76 39.9207 39.9243
PicatSAT 2018-08-02 (complete)4302961OPT76 39.975 39.979
Mistral-2.0 2018-06-15 (complete)4289281SAT (TO)76 2400.08 2400.3
Mistral-2.0 2018-08-01 (complete)4303547SAT (TO)76 2519.64 2520.01
Concrete 3.9.2 (complete)4304153SAT (TO)76 2520.06 2464.33
Concrete 3.8 2018-06-13 (complete)4292929SAT (TO)75 2520.11 2464.33
Concrete 3.8-SuperNG 2018-06-13 (complete)4292930SAT (TO)75 2520.12 2468.04
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311515SAT (TO)74 2520.04 2486.21
Concrete 3.9.2-SuperNG (complete)4304154SAT (TO)74 2520.09 2464.33
Choco-solver 4.0.7 seq (493a269) (complete)4292191SAT (TO)73 2400.03 2383.02
OscaR - Hybrid 2018-07-02 (complete)4291433SAT (TO)73 2400.12 2360.82
OscaR - Hybrid 2018-08-14 (complete)4308365SAT (TO)73 2520.05 2468.21
Choco-solver 4.0.7b seq (e747e1e) (complete)4306485SAT (TO)73 2520.09 2499.74
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307779SAT (TO)72 2520.05 2491.51
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290235SAT (TO)68 2400.02 2376.12
cosoco 1.12 (complete)4292931SAT (TO)68 2520.09 2520.01
Sat4j-CSP 2018-07-11 (complete)4289748? (TO) 2400.16 2367.27

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: 76
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 1 1 0 1 1 0 0 1 1 0 1 1 0 0 0 1 0 1 0 1 0 0 1 0 1
0 0 0 1 0 0 1 0 1 1 0 1 0 0 1 0 0 1 1 1 1 0 0 1 0 1 1 1 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 1 1 1 0 1 0 1 1 1 1 1 0 0 1 0 0 1 0 1 0 1 0 0 0
1 0 0 0 1 0 1 0 1 0 0 1 1 1 0 0 0 1 1 0 1 0 1 1 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 1 1 1 0 0 0 0 1 0 1 0 1 1 0 1 0 0 1 0 0 1 1 0 1 1 0 1 1 0 0 1
1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0  0 0 0 1 0 0 1 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 1 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 1 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 0 1 0 0 0 0 0 0 0 0 0 0 1
0 1 0 0 0 0 0 0 0 0 0 0 0 0 2 1 0 0 0 1 0 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 1 0 0 1 1 0
0 0  4 8 11 11 11 13 13 13 16 19 23 25 28 32  76   </values> </instantiation>