Name | normalized-PB06/SATUNSAT-MEDINT/submitted-PB06/ manquiho/Aardal_1/normalized-prob8.opb |
MD5SUM | 9a5e6e5ac9dd04defb35f28c3f495740 |
Bench Category | DEC-MEDINT (no optimisation, medium integers) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 0 |
Best CPU time to get the best result obtained on this benchmark | 238.61 |
Has Objective Function | NO |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | |
Optimality of the best value was proved | NO |
Number of variables | 86 |
Total number of constraints | 2 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 2 |
Minimum length of a constraint | 86 |
Maximum length of a constraint | 86 |
Number of terms in the objective function | 0 |
Biggest coefficient in the objective function | 0 |
Number of bits for the biggest coefficient in the objective function | 0 |
Sum of the numbers in the objective function | 0 |
Number of bits of the sum of numbers in the objective function | 0 |
Biggest number in a constraint | 21733991 |
Number of bits of the biggest number in a constraint | 25 |
Biggest sum of numbers in a constraint | 300042743 |
Number of bits of the biggest sum of numbers | 29 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4084301 | SAT | 238.61 | 238.281 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4080221 | SAT | 603.563 | 299.764 |
NaPS 1.02 (complete) | 4081847 | ? (TO) | 1800.02 | 1800.31 |
toysat 2016-05-02 (complete) | 4078595 | ? (TO) | 1800.08 | 1800.37 |
minisatp 2012-10-02 git-d91742b (complete) | 4111517 | ? (TO) | 1800.1 | 1800.4 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 0-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