| Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB05/aloul/FPGA_SAT05/ normalized-chnl30_35_pb.cnf.cr--soft-66-100-0.wbo |
| MD5SUM | f839b9b81895c491ec67614997c8bc2d |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 0.144977 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 2100 |
| Total number of constraints | 130 |
| Number of soft constraints | 47 |
| Number of constraints which are clauses | 70 |
| Number of constraints which are cardinality constraints (but not clauses) | 60 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 30 |
| Maximum length of a constraint | 35 |
| Top cost | 2325 |
| Min constraint cost | 1 |
| Max constraint cost | 96 |
| Sum of constraints costs | 2324 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 36 |
| Number of bits of the biggest sum of numbers | 6 |
| 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 |
|---|---|---|---|---|
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447370 | OPTIMUM | 0.144977 | 0.145751 |
| clasp 2.0-RC2 (complete) | 3448256 | MSAT (TO) | 1800.05 | 1800.01 |
| Sat4j Resolution 2011-06-08 (complete) | 3492173 | MSAT (TO) | 1800.15 | 1795.86 |
| wbo 1.6 (complete) | 3446633 | ? (TO) | 1800.07 | 1800.03 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
cost of falsified constraints: 2-x5 -x4 -x3 -x2 -x1