PB'11 competition: satisfaction and optimization track: solvers results per benchmarks

Result page for benchmark
normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=6-P0=11-P1=37-P2=59-P3=23-P4=53-P5=31-P6=59-P7=29-P8=2-P9=67-B.opb

Jump to solvers results

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=6-P0=11-P1=37-P2=59-P3=23-P4=53-P5=31-P6=59-P7=29-P8=2-P9=67-B.opb
MD5SUM48d9b1801c3e1b4883cb62109d96eb3c
Bench CategoryOPT-SMALLINT-NLC (optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark2
Best CPU time to get the best result obtained on this benchmark2.31065
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 2
Optimality of the best value was proved YES
Number of variables162
Total number of constraints19
Number of constraints which are clauses0
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints19
Minimum length of a constraint6
Maximum length of a constraint48
Number of terms in the objective function 6
Biggest coefficient in the objective function 32
Number of bits for the biggest coefficient in the objective function 6
Sum of the numbers in the objective function 63
Number of bits of the sum of numbers in the objective function 6
Biggest number in a constraint 2048
Number of bits of the biggest number in a constraint 12
Biggest sum of numbers in a constraint 8064
Number of bits of the biggest sum of numbers13
Number of products (including duplicates)324
Sum of products size (including duplicates)648
Number of different products324
Sum of products size648

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Sat4j Resolution 2.3.0 (complete)3458113OPT2 2.31065 1.95522
clasp 2.0-R4191-patched (fixed) (complete)3491642OPT2 2.93355 2.93377
clasp 2.0-R4191 [DEPRECATED] (complete)3469151OPT2 2.96455 2.96926
Sat4j Res//CP 2.3.0 (complete)3453729OPT2 6.18906 3.24531
borg pb-opt-11.04.03 (complete)3481266OPT2 6.20906 6.48313
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450409OPT2 8.19775 8.19998
SCIP spx E_2 2011-06-10 (fixed) (complete)3488329OPT2 23.6884 23.6911
bsolo 3.2 (complete)3462517OPT2 29.1976 29.2137
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452069OPT2 37.0474 37.046
SCIP spx 2 2011-06-10 (fixed) (complete)3484887OPT2 38.0152 38.0153
MinisatID 2.4.8 [DEPRECATED] (complete)3464177OPT2 39.467 39.4651
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465837OPT2 92.7919 92.7896
Sat4j CuttingPlanes 2.3.0 (complete)3455921SAT (TO)5 1800.29 1792.32
MinisatID 2.5.2 (fixed) (complete)3490050? (exit code) 0.000999 0.00570393
MinisatID 2.5.2-gmp (fixed) (complete)3496150? (exit code) 0.000999 0.00591311

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: 2
Solution found:
-x1 x2 -x3 -x4 -x5 -x6 x7 -x8 x9 -x10 -x11 -x12 x13 -x14 x15 -x16 x17 -x18 x19 x20 -x21 -x22 x23 -x24 x25 x26 -x27 -x28 -x29 -x30 x31 -x32
x33 -x34 -x35 -x36 x37 x38 -x39 -x40 -x41 -x42 x43 -x44 -x45 x46 -x47 -x48 x49 -x50 x51 -x52 -x53 -x54 x55 x56 x57 -x58 x59 -x60 -x61 x62
-x63 x64 -x65 -x66 -x67 x68 -x69 -x70 x71 -x72 -x73 x74 x75 -x76 x77 -x78 -x79 x80 -x81 -x82 -x83 -x84 -x85 x86 -x87 x88 -x89 -x90 -x91 x92
x93 x94 x95 -x96 -x97 x98 x99 x100 -x101 -x102 -x103 x104 x105 -x106 -x107 -x108 -x109 -x110 -x111 -x112 -x113 -x114 x115 x116 -x117 -x118
-x119 -x120 x121 -x122 x123 -x124 -x125 -x126 x127 -x128 -x129 -x130 -x131 -x132 -x133 -x134 -x135 -x136 -x137 -x138 -x139 -x140 -x141 -x142
-x143 -x144 -x145 -x146 x147 -x148 -x149 -x150 x151 -x152 -x153 -x154 -x155 -x156 -x157 x158 -x159 -x160 -x161 -x162