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=5-P1=53-P2=2-P3=3-P4=59-P5=29-P6=47-P7=67-P8=37-P9=43-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=5-P1=53-P2=2-P3=3-P4=59-P5=29-P6=47-P7=67-P8=37-P9=43-B.opb
MD5SUM25f560c7f1432359ec7ec03d2820d955
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.6206
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
clasp 2.0-R4191 [DEPRECATED] (complete)3469265OPT2 2.38864 2.39435
clasp 2.0-R4191-patched (fixed) (complete)3491756OPT2 2.6206 2.62083
Sat4j Resolution 2.3.0 (complete)3458227OPT2 2.70259 1.96717
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450523OPT2 5.40018 5.40004
Sat4j Res//CP 2.3.0 (complete)3453843OPT2 7.2439 3.78314
borg pb-opt-11.04.03 (complete)3481380OPT2 17.6233 17.6075
SCIP spx E_2 2011-06-10 (fixed) (complete)3488443OPT2 18.4622 18.4625
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452183OPT2 23.5964 23.596
SCIP spx 2 2011-06-10 (fixed) (complete)3485001OPT2 24.1793 24.1803
bsolo 3.2 (complete)3462631OPT2 42.2316 42.2373
MinisatID 2.4.8 [DEPRECATED] (complete)3464291OPT2 51.1332 51.1314
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465951OPT2 115.309 115.32
Sat4j CuttingPlanes 2.3.0 (complete)3456035SAT (TO)3 1800.28 1790.57
MinisatID 2.5.2-gmp (fixed) (complete)3496264? (exit code) 0.000999 0.00589905
MinisatID 2.5.2 (fixed) (complete)3490164? (exit code) 0.000999 0.00578489

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