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=5-P0=5-P1=11-P2=11-P3=29-P4=29-P5=23-P6=29-P7=17-P8=29-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=5-P0=5-P1=11-P2=11-P3=29-P4=29-P5=23-P6=29-P7=17-P8=29-P9=17-B.opb
MD5SUMe959fdee0b143510a2016bc4f8055563
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.05899
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 variables135
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 constraint5
Maximum length of a constraint35
Number of terms in the objective function 5
Biggest coefficient in the objective function 16
Number of bits for the biggest coefficient in the objective function 5
Sum of the numbers in the objective function 31
Number of bits of the sum of numbers in the objective function 5
Biggest number in a constraint 512
Number of bits of the biggest number in a constraint 10
Biggest sum of numbers in a constraint 1984
Number of bits of the biggest sum of numbers11
Number of products (including duplicates)225
Sum of products size (including duplicates)450
Number of different products225
Sum of products size450

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
SCIP spx E_2 2011-06-10 (fixed) (complete)3488283OPT3 0.05899 0.0612109
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450363OPT3 0.05999 0.0606489
clasp 2.0-R4191-patched (fixed) (complete)3491596OPT3 0.32695 0.328019
clasp 2.0-R4191 [DEPRECATED] (complete)3469105OPT3 0.330949 0.331603
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452023OPT3 0.98385 0.984127
SCIP spx 2 2011-06-10 (fixed) (complete)3484841OPT3 0.996848 0.99687
Sat4j Resolution 2.3.0 (complete)3458067OPT3 1.53477 0.830667
borg pb-opt-11.04.03 (complete)3481220OPT3 1.76873 2.01613
bsolo 3.2 (complete)3462471OPT3 2.55361 2.5539
Sat4j Res//CP 2.3.0 (complete)3453683OPT3 4.04538 1.70581
MinisatID 2.4.8 [DEPRECATED] (complete)3464131OPT3 81.6346 81.6329
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465791OPT3 196.818 196.818
Sat4j CuttingPlanes 2.3.0 (complete)3455875SAT (TO)3 1800.33 1791.12
MinisatID 2.5.2-gmp (fixed) (complete)3496104? (exit code) 0.000999 0.00588594
MinisatID 2.5.2 (fixed) (complete)3490004? (exit code) 0.001998 0.00572693

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