| Name | normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/ manquinho/dbsg/normalized-dbsg_50_25_2_5.opb |
| MD5SUM | 5aa99d3bea2fcdaee6df743981593687 |
| Bench Category | DEC-SMALLINT-NLC (no optimisation, small integers, non linear constraints) |
| 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 | 0.06099 |
| 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 | 100 |
| Total number of constraints | 152 |
| Number of constraints which are clauses | 50 |
| Number of constraints which are cardinality constraints (but not clauses) | 1 |
| Number of constraints which are nor clauses,nor cardinality constraints | 101 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 100 |
| 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 | 5 |
| Number of bits of the biggest number in a constraint | 3 |
| Biggest sum of numbers in a constraint | 100 |
| Number of bits of the biggest sum of numbers | 7 |
| Number of products (including duplicates) | 2960 |
| Sum of products size (including duplicates) | 5920 |
| Number of different products | 1480 |
| Sum of products size | 2960 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4106832 | SAT | 0.06099 | 0.0675101 |
| minisatp 2012-10-02 git-d91742b (complete) | 4113961 | SAT | 0.158975 | 0.163156 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4106834 | SAT | 0.984849 | 0.599603 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4106833 | SAT | 2.12268 | 0.853513 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 0x1 -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