| Name | PseudoBoolean/PseudoBoolean-opt-radar/ Pb-radar-10-10-45-095-100.xml |
| MD5SUM | 2e76cba0749e9f6e1c633f9939767035 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 2400.05 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 435 |
| Number of constraints | 501 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":435}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":2,"count":3},{"degree":3,"count":38},{"degree":4,"count":135},{"degree":5,"count":118},{"degree":6,"count":126},{"degree":7,"count":1},{"degree":8,"count":14}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":402},{"arity":3,"count":3},{"arity":4,"count":2},{"arity":5,"count":10},{"arity":6,"count":7},{"arity":7,"count":9},{"arity":8,"count":13},{"arity":9,"count":15},{"arity":10,"count":7},{"arity":11,"count":11},{"arity":12,"count":7},{"arity":13,"count":5},{"arity":14,"count":2},{"arity":15,"count":6},{"arity":16,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":501}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267159 | SAT (TO) | 8 | 2400.05 | 2399.8999 |
| Naxos 1.1.0 (complete) | 4253430 | SAT (TO) | 8 | 2400.07 | 2402.1 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253429 | SAT (TO) | 9 | 2400.07 | 2400.1 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259978 | SAT (TO) | 9 | 2400.1001 | 2400.3101 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 8<instantiation type='solution' cost='-8'> <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[200] x[201] x[202] x[203] x[204] x[205] x[206] x[207] x[208] x[209] x[20] x[210] x[211] x[212] x[213] x[214] x[215] x[216] x[217] x[218] x[219] x[21] x[220] x[221] x[222] x[223] x[224] x[225] x[226] x[227] x[228] x[229] x[22] x[230] x[231] x[232] x[233] x[234] x[235] x[236] x[237] x[238] x[239] x[23] x[240] x[241] x[242] x[243] x[244] x[245] x[246] x[247] x[248] x[249] x[24] x[250] x[251] x[252] x[253] x[254] x[255] x[256] x[257] x[258] x[259] x[25] x[260] x[261] x[262] x[263] x[264] x[265] x[266] x[267] x[268] x[269] x[26] x[270] x[271] x[272] x[273] x[274] x[275] x[276] x[277] x[278] x[279] x[27] x[280] x[281] x[282] x[283] x[284] x[285] x[286] x[287] x[288] x[289] x[28] x[290] x[291] x[292] x[293] x[294] x[295] x[296] x[297] x[298] x[299] x[29] x[2] x[300] x[301] x[302] x[303] x[304] x[305] x[306] x[307] x[308] x[309] x[30] x[310] x[311] x[312] x[313] x[314] x[315] x[316] x[317] x[318] x[319] x[31] x[320] x[321] x[322] x[323] x[324] x[325] x[326] x[327] x[328] x[329] x[32] x[330] x[331] x[332] x[333] x[334] x[335] x[336] x[337] x[338] x[339] x[33] x[340] x[341] x[342] x[343] x[344] x[345] x[346] x[347] x[348] x[349] x[34] x[350] x[351] x[352] x[353] x[354] x[355] x[356] x[357] x[358] x[359] x[35] x[360] x[361] x[362] x[363] x[364] x[365] x[366] x[367] x[368] x[369] x[36] x[370] x[371] x[372] x[373] x[374] x[375] x[376] x[377] x[378] x[379] x[37] x[380] x[381] x[382] x[383] x[384] x[385] x[386] x[387] x[388] x[389] x[38] x[390] x[391] x[392] x[393] x[394] x[395] x[396] x[397] x[398] x[399] x[39] x[3] x[400] x[401] x[402] x[403] x[404] x[405] x[406] x[407] x[408] x[409] x[40] x[410] x[411] x[412] x[413] x[414] x[415] x[416] x[417] x[418] x[419] x[41] x[420] x[421] x[422] x[423] x[424] x[425] x[426] x[427] x[428] x[429] x[42] x[430] x[431] x[432] x[433] x[434] 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>1 1 1 1 0 0 1 0 0 1 1 1 0 0 0 1 1 1 1 1 0 0 1 0 1 1 0 0 1 1 0 0 0 1 1 0 0 1 0 0 0 1 0 0 0 1 1 0 0 0 1 0 0 1 1 1 0 0 0 1 0 0 0 1 1 0 1 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 1 1 1 1 0 0 1 1 1 0 0 1 1 0 0 0 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 0 0 0 1 1 1 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 0 1 0 1 1 1 1 1 1 1 0 1 1 1 0 0 1 1 0 0 1 1 1 0 1 1 1 1 1 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 1 0 1 0 1 1 1 1 0 0 0 0 0 0 0 0 1 0 0 1 1 1 1 0 1 0 0 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 0 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 0 0 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 0 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 0 1 1 0 1 1 0 0 1 1 1 0 1 1 1 1 0 0 1 1 1 0 0 1 1 1 0 0 1 1 1 0 1 1 0 0 0 0 0 1 0 0 0 0 0 1 0 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 1 0 0 0 1 1 0 0 1 1 0 0 0 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 0 0 0 1 1 1 1 1 0 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0 1 1 0 0 0 1 1 1 1 </values> </instantiation>