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=29-P1=61-P2=43-P3=131-P4=2-P5=59-P6=41-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=29-P1=61-P2=43-P3=131-P4=2-P5=59-P6=41-B.opb
MD5SUMaeb6a0e03ee8f8f2b4b438b8148c9b4c
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 benchmark3.51247
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 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
clasp 2.0-R4191-patched (fixed) (complete)3491770OPT2 3.51247 3.51365
clasp 2.0-R4191 [DEPRECATED] (complete)3469279OPT2 3.53746 3.54246
Sat4j Resolution 2.3.0 (complete)3458241OPT2 4.35534 3.27507
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452197OPT2 7.2539 7.25395
SCIP spx 2 2011-06-10 (fixed) (complete)3485015OPT2 7.42287 7.42377
Sat4j Res//CP 2.3.0 (complete)3453857OPT2 9.27959 4.78875
SCIP spx E_2 2011-06-10 (fixed) (complete)3488457OPT2 11.5882 11.5879
borg pb-opt-11.04.03 (complete)3481394OPT2 156.285 155.606
MinisatID 2.4.8 [DEPRECATED] (complete)3464305OPT2 477.032 477.02
bsolo 3.2 (complete)3462645OPT2 692.557 692.612
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465965OPT2 1201.44 1201.4
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450537? 8.45071 8.45053
MinisatID 2.5.2 (fixed) (complete)3490178? (exit code) 0.000999 0.00576709
MinisatID 2.5.2-gmp (fixed) (complete)3496278? (exit code) 0.000999 0.00590494
Sat4j CuttingPlanes 2.3.0 (complete)3456049? (TO) 1800.27 1793.2

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