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=7-P0=71-P1=79-P2=101-P3=109-P4=107-P5=97-P6=127-P7=127-P8=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=7-P0=71-P1=79-P2=101-P3=109-P4=107-P5=97-P6=127-P7=127-P8=67-B.opb
MD5SUM81c333fcff34b0322e8b1b71c0cda382
Bench CategoryOPT-SMALLINT-NLC (optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark3
Best CPU time to get the best result obtained on this benchmark0.117981
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 3
Optimality of the best value was proved YES
Number of variables168
Total number of constraints17
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 constraints17
Minimum length of a constraint7
Maximum length of a constraint63
Number of terms in the objective function 7
Biggest coefficient in the objective function 64
Number of bits for the biggest coefficient in the objective function 7
Sum of the numbers in the objective function 127
Number of bits of the sum of numbers in the objective function 7
Biggest number in a constraint 8192
Number of bits of the biggest number in a constraint 14
Biggest sum of numbers in a constraint 32512
Number of bits of the biggest sum of numbers15
Number of products (including duplicates)392
Sum of products size (including duplicates)784
Number of different products392
Sum of products size784

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
SCIP spx 2 2011-06-10 (fixed) (complete)3485016OPT3 0.117981 0.118889
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452198OPT3 0.11998 0.12147
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450538OPT3 0.174973 0.174469
SCIP spx E_2 2011-06-10 (fixed) (complete)3488458OPT3 0.176972 0.17795
borg pb-opt-11.04.03 (complete)3481395OPT3 0.710891 0.804232
clasp 2.0-R4191-patched (fixed) (complete)3491771OPT3 5.78412 5.78445
clasp 2.0-R4191 [DEPRECATED] (complete)3469280OPT3 5.82311 5.82329
Sat4j Resolution 2.3.0 (complete)3458242OPT3 10.4714 9.25267
Sat4j Res//CP 2.3.0 (complete)3453858OPT3 21.7327 10.8797
bsolo 3.2 (complete)3462646OPT3 78.717 78.7151
Sat4j CuttingPlanes 2.3.0 (complete)3456050SAT (TO)17 1800.23 1792.58
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465966? (TO)3 1800.05 1800.02
MinisatID 2.4.8 [DEPRECATED] (complete)3464306? (TO)3 1800.06 1800.02
MinisatID 2.5.2-gmp (fixed) (complete)3496279? (exit code) 0.000999 0.00597612
MinisatID 2.5.2 (fixed) (complete)3490179? (exit code) 0.000999 0.00578296

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