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=47-P1=43-P2=59-P3=29-P4=31-P5=13-P6=59-P7=53-P8=67-P9=17-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=47-P1=43-P2=59-P3=29-P4=31-P5=13-P6=59-P7=53-P8=67-P9=17-B.opb
MD5SUM505637014c48e331f3dc333f08f65d90
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.140977
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 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
SCIP spx 2 2011-06-10 (fixed) (complete)3485033OPT3 0.140977 0.14563
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452215OPT3 0.142977 0.143037
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450555OPT3 0.158975 0.159311
SCIP spx E_2 2011-06-10 (fixed) (complete)3488475OPT3 0.172972 0.175808
borg pb-opt-11.04.03 (complete)3481412OPT3 0.624904 0.700492
clasp 2.0-R4191-patched (fixed) (complete)3491788OPT3 2.10368 2.10573
clasp 2.0-R4191 [DEPRECATED] (complete)3469297OPT3 2.12768 2.1275
Sat4j Resolution 2.3.0 (complete)3458259OPT3 3.56846 2.69053
Sat4j Res//CP 2.3.0 (complete)3453875OPT3 7.8998 3.77461
bsolo 3.2 (complete)3462663OPT3 11.7862 11.7869
MinisatID 2.4.8 [DEPRECATED] (complete)3464323OPT3 1014.1 1014.08
Sat4j CuttingPlanes 2.3.0 (complete)3456067SAT (TO)3 1800.24 1791.08
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465983? (TO)3 1800.06 1800.02
MinisatID 2.5.2 (fixed) (complete)3490196? (exit code) 0 0.00576508
MinisatID 2.5.2-gmp (fixed) (complete)3496296? (exit code) 0.000999 0.00595593

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:
-x162 x161 x160 x159 x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 x108 x107 -x106 x105 x104 x103 -x150 -x149 -x148 -x147 x146 -x145 x102
x101 x100 x99 -x98 x97 -x144 -x143 -x142 -x141 -x140 -x139 x96 x95 x94 x93 x92 x91 -x138 -x137 -x136 -x135 -x134 -x133 -x90 x89 -x88 x87
-x86 x85 -x132 -x131 -x130 -x129 x128 -x127 -x84 -x83 -x82 x81 x80 x79 -x126 -x125 -x124 -x123 -x122 -x121 x78 -x77 x76 x75 -x74 x73 -x120
-x119 -x118 -x117 -x116 -x115 -x72 -x71 x70 x69 x68 x67 -x114 -x113 -x112 -x111 -x110 x109 -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