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=8-P0=43-P1=131-P2=257-P3=71-P4=149-P5=223-P6=167-B.opb

Jump to solvers results

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=8-P0=43-P1=131-P2=257-P3=71-P4=149-P5=223-P6=167-B.opb
MD5SUM29d9c644cbc560d09c0ca2d5a8d36791
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.111982
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 variables144
Total number of constraints13
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 constraints13
Minimum length of a constraint8
Maximum length of a constraint80
Number of terms in the objective function 8
Biggest coefficient in the objective function 128
Number of bits for the biggest coefficient in the objective function 8
Sum of the numbers in the objective function 255
Number of bits of the sum of numbers in the objective function 8
Biggest number in a constraint 32768
Number of bits of the biggest number in a constraint 16
Biggest sum of numbers in a constraint 130560
Number of bits of the biggest sum of numbers17
Number of products (including duplicates)384
Sum of products size (including duplicates)768
Number of different products384
Sum of products size768

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
SCIP spx 2 2011-06-10 (fixed) (complete)3484894OPT3 0.111982 0.113726
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452076OPT3 0.114982 0.117053
SCIP spx E_2 2011-06-10 (fixed) (complete)3488336OPT3 0.142977 0.142904
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450416OPT3 0.142978 0.143113
borg pb-opt-11.04.03 (complete)3481273OPT3 0.681895 0.781212
Sat4j Resolution 2.3.0 (complete)3458120OPT3 38.8951 37.6348
clasp 2.0-R4191 [DEPRECATED] (complete)3469158OPT3 42.9735 42.9725
clasp 2.0-R4191-patched (fixed) (complete)3491649OPT3 43.4064 43.4073
Sat4j Res//CP 2.3.0 (complete)3453736OPT3 78.639 40.7772
bsolo 3.2 (complete)3462524OPT3 860.321 860.293
MinisatID 2.4.8 [DEPRECATED] (complete)3464184? (TO)3 1800.05 1800.02
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465844? (TO)3 1800.08 1800.02
MinisatID 2.5.2-gmp (fixed) (complete)3496157? (exit code) 0 0.00592591
MinisatID 2.5.2 (fixed) (complete)3490057? (exit code) 0.000999 0.00571904
Sat4j CuttingPlanes 2.3.0 (complete)3455928? (TO) 1800.31 1794.7

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