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

Result page for benchmark
Bacp/Bacp-m2/
Bacp-m2-07a_c18.xml

Jump to solvers results

General information on the benchmark

NameBacp/Bacp-m2/
Bacp-m2-07a_c18.xml
MD5SUMbfa1db9b032b05366fb57651f731455a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark12
Best CPU time to get the best result obtained on this benchmark115.296
Satisfiable
(Un)Satisfiability was proved
Number of variables238
Number of constraints259
Number of domains4
Minimum domain size2
Maximum domain size11
Distribution of domain sizes[{"size":2,"count":196},{"size":6,"count":7},{"size":7,"count":28},{"size":11,"count":7}]
Minimum variable degree1
Maximum variable degree11
Distribution of variable degrees[{"degree":1,"count":7},{"degree":2,"count":7},{"degree":4,"count":196},{"degree":7,"count":4},{"degree":8,"count":12},{"degree":9,"count":8},{"degree":10,"count":2},{"degree":11,"count":2}]
Minimum constraint arity2
Maximum constraint arity29
Distribution of constraint arities[{"arity":2,"count":217},{"arity":7,"count":28},{"arity":29,"count":14}]
Number of extensional constraints196
Number of intensional constraints21
Distribution of constraint types[{"type":"extension","count":196},{"type":"intension","count":21},{"type":"sum","count":42}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2018-08-02 (complete)4303457OPT12 114.916 114.93
PicatSAT 2018-08-14 (complete)4309797OPT12 115.296 115.296
PicatSAT 2018-06-15 (complete)4296232OPT12 131.143 131.148
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4292104SAT (TO)12 2400.05 2377.51
Choco-solver 4.0.7 seq (493a269) (complete)4292687SAT (TO)12 2400.05 2376.31
Mistral-2.0 2018-06-15 (complete)4292102SAT (TO)12 2400.05 2400.11
OscaR - Hybrid 2018-07-02 (complete)4292106SAT (TO)12 2400.11 2349.62
Sat4j-CSP 2018-07-11 (complete)4292103SAT (TO)12 2400.18 2392.81
cosoco 1.12 (complete)4296231SAT (TO)12 2519.91 2520.01
Mistral-2.0 2018-08-01 (complete)4304043SAT (TO)12 2519.95 2520.01
Choco-solver 4.0.7b seq (e747e1e) (complete)4306981SAT (TO)12 2520.03 2492.61
OscaR - Hybrid 2018-08-14 (complete)4308637SAT (TO)12 2520.04 2467.32
Concrete 3.9.2 (complete)4304795SAT (TO)12 2520.04 2459.83
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308275SAT (TO)12 2520.05 2495.71
Concrete 3.8-SuperNG 2018-06-13 (complete)4296230SAT (TO)12 2520.07 2481.34
Concrete 3.9.2-SuperNG (complete)4304796SAT (TO)12 2520.1 2461.85
Concrete 3.8 2018-06-13 (complete)4296229SAT (TO)12 2520.1 2472.43
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312011SAT (TO)12 2520.11 2497.12

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: 12
Solution found:
<instantiation> <list> nco[] prd[] pc[][] ncr[]  </list> <values> 4 4 5 3 3 5 4  6 5 6 1 6 5 3 3 5 2 4 2 6 4 4 1 2 5 1 0 3 2 0 0 5 0 2 1  0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 0 1 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 1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0
0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 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 1 0 0 1 1 0 0 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 1 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0  12 11 12 11 12 12 12  
</values> </instantiation>