| Name | Rlfap/Rlfap-opt/ Rlfap-scen-02-opt_c18.xml |
| MD5SUM | 716d835829f3ca87bb2599e5056828f4 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 14 |
| Best CPU time to get the best result obtained on this benchmark | 252.001 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 200 |
| Number of constraints | 1235 |
| Number of domains | 3 |
| Minimum domain size | 22 |
| Maximum domain size | 44 |
| Distribution of domain sizes | [{"size":22,"count":2},{"size":36,"count":94},{"size":44,"count":104}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 45 |
| Distribution of variable degrees | [{"degree":2,"count":4},{"degree":3,"count":2},{"degree":4,"count":8},{"degree":5,"count":6},{"degree":6,"count":15},{"degree":7,"count":10},{"degree":8,"count":19},{"degree":9,"count":9},{"degree":10,"count":25},{"degree":11,"count":16},{"degree":12,"count":2},{"degree":13,"count":4},{"degree":14,"count":9},{"degree":15,"count":4},{"degree":16,"count":15},{"degree":17,"count":4},{"degree":18,"count":8},{"degree":19,"count":1},{"degree":20,"count":2},{"degree":21,"count":2},{"degree":22,"count":4},{"degree":23,"count":6},{"degree":24,"count":3},{"degree":26,"count":3},{"degree":27,"count":6},{"degree":28,"count":1},{"degree":29,"count":5},{"degree":31,"count":1},{"degree":33,"count":2},{"degree":34,"count":2},{"degree":39,"count":1},{"degree":45,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":1235}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1235 |
| Distribution of constraint types | [{"type":"intension","count":1235}] |
| Optimization problem | YES |
| Type of objective | min NVALUES |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4301512 | SAT (TO) | 14 | 252.001 | 252.01 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301510 | SAT (TO) | 14 | 252.055 | 243.511 |
| Concrete 3.9.2-SuperNG (complete) | 4302909 | SAT (TO) | 14 | 252.169 | 231.697 |
| Concrete 3.9.2 (complete) | 4302559 | SAT (TO) | 16 | 252.162 | 234.868 |
| Mistral-2.0 2018-08-01 (complete) | 4312536 | SAT (TO) | 28 | 251.982 | 252.01 |
| Sat4j-CSP 2018-07-11 (complete) | 4301511 | SAT (TO) | 38 | 252.238 | 197.635 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310535 | SAT (TO) | 40 | 252.097 | 246.417 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310185 | SAT | 42 | 251.573 | 247.356 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312395 | SAT | 44 | 251.458 | 247.378 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 14<instantiation type='solution' cost='14'> <list>x[0] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[10] x[110] x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[11] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128] x[129] x[12] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[13] x[140] x[141] x[142] x[143] x[144] x[145] x[146] x[147] x[148] x[149] x[14] x[150] x[151] x[152] x[153] x[154] x[155] x[156] x[157] x[158] x[159] x[15] x[160] x[161] x[162] x[163] x[164] x[165] x[166] x[167] x[168] x[169] x[16] x[170] x[171] x[172] x[173] x[174] x[175] x[176] x[177] x[178] x[179] x[17] x[180] x[181] x[182] x[183] x[184] x[185] x[186] x[187] x[188] x[189] x[18] x[190] x[191] x[192] x[193] x[194] x[195] x[196] x[197] x[198] x[199] x[19] x[1] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[3] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[4] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[5] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[6] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[7] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[8] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[9] </list> <values>352 128 366 352 114 352 114 128 366 16 254 156 352 114 352 114 352 114 30 268 30 268 394 44 282 282 44 30 268 282 44 366 128 282 282 44 268 30 268 30 352 114 114 352 44 268 30 30 268 114 352 254 16 16 254 16 30 268 16 254 456 694 16 254 254 16 254 156 394 694 456 352 114 268 30 44 282 114 282 44 268 30 114 352 16 254 394 156 352 16 254 352 114 282 44 30 268 352 114 268 268 30 114 352 30 268 694 456 30 268 30 114 268 30 268 30 44 282 114 352 114 352 366 254 16 394 156 268 30 156 394 254 16 128 254 16 156 394 156 394 254 16 282 44 268 366 128 254 16 268 30 128 366 254 16 30 352 114 16 254 366 128 16 254 366 128 16 44 282 44 282 268 30 282 44 114 352 254 268 30 282 44 44 282 114 352 30 268 352 44 282 366 128 366 128 268 30 254 16 114 </values> </instantiation>