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=23-P1=11-P2=13-P3=17-P4=19-P5=53-P6=67-P7=29-P8=7-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=23-P1=11-P2=13-P3=17-P4=19-P5=53-P6=67-P7=29-P8=7-B.opb
MD5SUM7950e484ba213c1be7d5b467b494899c
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.143978
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 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 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)288
Sum of products size (including duplicates)576
Number of different products288
Sum of products size576

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
SCIP spx 2 2011-06-10 (fixed) (complete)3484896OPT3 0.143978 0.143853
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452078OPT3 0.144977 0.145765
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450418OPT3 0.146977 0.147322
SCIP spx E_2 2011-06-10 (fixed) (complete)3488338OPT3 0.147977 0.148616
borg pb-opt-11.04.03 (complete)3481275OPT3 0.578911 0.653777
clasp 2.0-R4191-patched (fixed) (complete)3491651OPT3 0.956853 0.956433
clasp 2.0-R4191 [DEPRECATED] (complete)3469160OPT3 0.962852 0.963554
Sat4j Resolution 2.3.0 (complete)3458122OPT3 3.47747 2.30069
Sat4j Res//CP 2.3.0 (complete)3453738OPT3 7.72383 3.25738
bsolo 3.2 (complete)3462526OPT3 12.0602 12.061
MinisatID 2.4.8 [DEPRECATED] (complete)3464186OPT3 493.822 493.865
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465846OPT3 1164.32 1164.29
Sat4j CuttingPlanes 2.3.0 (complete)3455930SAT (TO)3 1800.23 1792.02
MinisatID 2.5.2 (fixed) (complete)3490059? (exit code) 0 0.00572007
MinisatID 2.5.2-gmp (fixed) (complete)3496159? (exit code) 0.000999 0.00586896

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