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=13-P1=5-P2=17-P3=2-P4=29-P5=5-P6=19-P7=17-P8=5-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=13-P1=5-P2=17-P3=2-P4=29-P5=5-P6=19-P7=17-P8=5-B.opb
MD5SUM872806d45eb1cc1623065d320b93ba6e
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 benchmark0.034994
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 variables120
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 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)200
Sum of products size (including duplicates)400
Number of different products200
Sum of products size400

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
clasp 2.0-R4191-patched (fixed) (complete)3491632OPT2 0.034994 0.0354109
clasp 2.0-R4191 [DEPRECATED] (complete)3469141OPT2 0.035994 0.0375199
SCIP spx E_2 2011-06-10 (fixed) (complete)3488319OPT2 0.05799 0.059125
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450399OPT2 0.05799 0.0594409
bsolo 3.2 (complete)3462507OPT2 0.635902 0.636202
Sat4j Resolution 2.3.0 (complete)3458103OPT2 0.840871 0.611537
MinisatID 2.4.8 [DEPRECATED] (complete)3464167OPT2 2.26066 2.26121
Sat4j Res//CP 2.3.0 (complete)3453719OPT2 2.93755 1.70457
borg pb-opt-11.04.03 (complete)3481256OPT2 3.32149 3.39474
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452059OPT2 4.43233 4.43285
SCIP spx 2 2011-06-10 (fixed) (complete)3484877OPT2 4.55631 4.56304
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465827OPT2 5.51516 5.516
Sat4j CuttingPlanes 2.3.0 (complete)3455911OPT2 372.834 369.683
MinisatID 2.5.2-gmp (fixed) (complete)3496140? (exit code) 0.000999 0.0059131
MinisatID 2.5.2 (fixed) (complete)3490040? (exit code) 0.000999 0.00574395

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