2018 XCSP3 competition: fast COP track: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameBacp/Bacp-m1/
Bacp-m1-07a_c18.xml
MD5SUM31fd8745bd40eddef0de95e701108e5a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark12
Best CPU time to get the best result obtained on this benchmark251.59
Satisfiable
(Un)Satisfiability was proved
Number of variables238
Number of constraints63
Number of domains8
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 degree12
Distribution of variable degrees[{"degree":1,"count":7},{"degree":2,"count":203},{"degree":8,"count":4},{"degree":9,"count":12},{"degree":10,"count":8},{"degree":11,"count":2},{"degree":12,"count":2}]
Minimum constraint arity2
Maximum constraint arity29
Distribution of constraint arities[{"arity":2,"count":21},{"arity":8,"count":28},{"arity":29,"count":14}]
Number of extensional constraints28
Number of intensional constraints21
Distribution of constraint types[{"type":"extension","count":28},{"type":"intension","count":21},{"type":"sum","count":7},{"type":"count","count":7}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312356SAT12 251.59 247.37
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310146SAT12 251.597 247.372
Mistral-2.0 2018-08-01 (complete)4312779SAT (TO)12 251.962 252.009
cosoco 1.12 (complete)4302241SAT (TO)12 252.012 252.009
OscaR - Hybrid 2018-08-14 (complete)4310496SAT (TO)12 252.035 242.538
Choco-solver 4.0.7b seq (e747e1e) (complete)4302239SAT (TO)12 252.036 248.513
Concrete 3.9.2-SuperNG (complete)4302870SAT (TO)12 252.05 233.236
Sat4j-CSP 2018-07-11 (complete)4302240SAT (TO)12 252.113 249.114
Concrete 3.9.2 (complete)4302520SAT (TO)12 252.127 235.163

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> prd[0] prd[1] prd[2] prd[3] prd[4] prd[5] prd[6] prd[7] prd[8] prd[9] prd[10] prd[11] prd[12] prd[13] prd[14] prd[15]
prd[16] prd[17] prd[18] prd[19] prd[20] prd[21] prd[22] prd[23] prd[24] prd[25] prd[26] prd[27] nco[0] nco[1] nco[2] nco[3] nco[4] nco[5]
nco[6] ncr[0] ncr[1] ncr[2] ncr[3] ncr[4] ncr[5] ncr[6] cp[0][0] cp[0][1] cp[0][2] cp[0][3] cp[0][4] cp[0][5] cp[0][6] cp[1][0] cp[1][1]
cp[1][2] cp[1][3] cp[1][4] cp[1][5] cp[1][6] cp[2][0] cp[2][1] cp[2][2] cp[2][3] cp[2][4] cp[2][5] cp[2][6] cp[3][0] cp[3][1] cp[3][2]
cp[3][3] cp[3][4] cp[3][5] cp[3][6] cp[4][0] cp[4][1] cp[4][2] cp[4][3] cp[4][4] cp[4][5] cp[4][6] cp[5][0] cp[5][1] cp[5][2] cp[5][3]
cp[5][4] cp[5][5] cp[5][6] cp[6][0] cp[6][1] cp[6][2] cp[6][3] cp[6][4] cp[6][5] cp[6][6] cp[7][0] cp[7][1] cp[7][2] cp[7][3] cp[7][4]
cp[7][5] cp[7][6] cp[8][0] cp[8][1] cp[8][2] cp[8][3] cp[8][4] cp[8][5] cp[8][6] cp[9][0] cp[9][1] cp[9][2] cp[9][3] cp[9][4] cp[9][5]
cp[9][6] cp[10][0] cp[10][1] cp[10][2] cp[10][3] cp[10][4] cp[10][5] cp[10][6] cp[11][0] cp[11][1] cp[11][2] cp[11][3] cp[11][4] cp[11][5]
cp[11][6] cp[12][0] cp[12][1] cp[12][2] cp[12][3] cp[12][4] cp[12][5] cp[12][6] cp[13][0] cp[13][1] cp[13][2] cp[13][3] cp[13][4] cp[13][5]
cp[13][6] cp[14][0] cp[14][1] cp[14][2] cp[14][3] cp[14][4] cp[14][5] cp[14][6] cp[15][0] cp[15][1] cp[15][2] cp[15][3] cp[15][4] cp[15][5]
cp[15][6] cp[16][0] cp[16][1] cp[16][2] cp[16][3] cp[16][4] cp[16][5] cp[16][6] cp[17][0] cp[17][1] cp[17][2] cp[17][3] cp[17][4] cp[17][5]
cp[17][6] cp[18][0] cp[18][1] cp[18][2] cp[18][3] cp[18][4] cp[18][5] cp[18][6] cp[19][0] cp[19][1] cp[19][2] cp[19][3] cp[19][4] cp[19][5]
cp[19][6] cp[20][0] cp[20][1] cp[20][2] cp[20][3] cp[20][4] cp[20][5] cp[20][6] cp[21][0] cp[21][1] cp[21][2] cp[21][3] cp[21][4] cp[21][5]
cp[21][6] cp[22][0] cp[22][1] cp[22][2] cp[22][3] cp[22][4] cp[22][5] cp[22][6] cp[23][0] cp[23][1] cp[23][2] cp[23][3] cp[23][4] cp[23][5]
cp[23][6] cp[24][0] cp[24][1] cp[24][2] cp[24][3] cp[24][4] cp[24][5] cp[24][6] cp[25][0] cp[25][1] cp[25][2] cp[25][3] cp[25][4] cp[25][5]
cp[25][6] cp[26][0] cp[26][1] cp[26][2] cp[26][3] cp[26][4] cp[26][5] cp[26][6] cp[27][0] cp[27][1] cp[27][2] cp[27][3] cp[27][4] cp[27][5]
cp[27][6] </list> <values> 6 5 6 4 5 4 1 2 6 2 2 0 6 5 5 1 0 3 4 1 4 3 3 0 3 0 1 0 5 4 3 4 4 4 4 11 12 12 12 11 12 12 0 0 0 0 0 0 3 0 0 0 0
0 1 0 0 0 0 0 0 0 2 0 0 0 0 4 0 0 0 0 0 0 0 4 0 0 0 0 0 1 0 0 0 5 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 4 0 0 4 0 0 0 0 0 0 5 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 3 0 0 0 0 0 0 4 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 3 0 0 0 3 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 3
0 0 0 0 0 0 3 0 0 0 3 0 0 0 0 0 0 0 0 0 3 0 0 0 3 0 0 0 0 0 0 0 3 0 0 0 0 0 3 0 0 0 0 0 0 </values> </instantiation>