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

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

Jump to solvers results

General information on the benchmark

NameBacp/Bacp-m2/
Bacp-m2-07b_c18.xml
MD5SUM5b65144cb3b3f40823d8710b9c84d78c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark13
Best CPU time to get the best result obtained on this benchmark1198.76
Satisfiable
(Un)Satisfiability was proved
Number of variables262
Number of constraints284
Number of domains4
Minimum domain size2
Maximum domain size11
Distribution of domain sizes[{"size":2,"count":217},{"size":6,"count":7},{"size":7,"count":31},{"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":217},{"degree":7,"count":6},{"degree":8,"count":12},{"degree":9,"count":9},{"degree":10,"count":2},{"degree":11,"count":2}]
Minimum constraint arity2
Maximum constraint arity32
Distribution of constraint arities[{"arity":2,"count":239},{"arity":7,"count":31},{"arity":32,"count":14}]
Number of extensional constraints217
Number of intensional constraints22
Distribution of constraint types[{"type":"extension","count":217},{"type":"intension","count":22},{"type":"sum","count":45}]
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)4303463OPT13 957.984 957.977
PicatSAT 2018-08-14 (complete)4309803OPT13 1198.76 1198.8
PicatSAT 2018-06-15 (complete)4296236OPT13 1521 1521.01
OscaR - Hybrid 2018-07-02 (complete)4292111SAT (TO)13 2400.03 2350.12
Choco-solver 4.0.7 seq (493a269) (complete)4292693SAT (TO)13 2400.07 2377.51
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4292109SAT (TO)13 2400.08 2375.61
Sat4j-CSP 2018-07-11 (complete)4292108SAT (TO)13 2400.08 2391.93
Mistral-2.0 2018-06-15 (complete)4292107SAT (TO)13 2400.1 2400.01
cosoco 1.12 (complete)4296235SAT (TO)13 2519.8 2520.01
Mistral-2.0 2018-08-01 (complete)4304049SAT (TO)13 2520.03 2519.9
Choco-solver 4.0.7b seq (e747e1e) (complete)4306987SAT (TO)13 2520.05 2495.61
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308281SAT (TO)13 2520.05 2495.51
Concrete 3.9.2 (complete)4304797SAT (TO)13 2520.06 2458.64
Concrete 3.9.2-SuperNG (complete)4304798SAT (TO)13 2520.09 2463.83
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312017SAT (TO)13 2520.1 2494.91
OscaR - Hybrid 2018-08-14 (complete)4308643SAT (TO)13 2520.11 2467.41
Concrete 3.8 2018-06-13 (complete)4296233SAT (TO)13 2520.13 2472.04
Concrete 3.8-SuperNG 2018-06-13 (complete)4296234SAT (TO)13 2520.13 2481.83

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