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