Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB05/aloul/FPGA_SAT05/ normalized-chnl10_15_pb.cnf.cr--soft-33-100-0.wbo |
MD5SUM | 9dd19a07ee6b8e6f4864d631925ae108 |
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 | 21 |
Best CPU time to get the best result obtained on this benchmark | 0.052991 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 300 |
Total number of constraints | 50 |
Number of soft constraints | 35 |
Number of constraints which are clauses | 30 |
Number of constraints which are cardinality constraints (but not clauses) | 20 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 10 |
Maximum length of a constraint | 15 |
Top cost | 1837 |
Min constraint cost | 1 |
Max constraint cost | 98 |
Sum of constraints costs | 1836 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 16 |
Number of bits of the biggest sum of numbers | 5 |
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) | 3447355 | OPTIMUM | 0.052991 | 0.053549 |
clasp 2.0-RC2 (complete) | 3448246 | OPTIMUM | 130.146 | 130.141 |
wbo 1.6 (complete) | 3446618 | OPTIMUM | 838.385 | 838.368 |
Sat4j Resolution 2011-06-08 (complete) | 3492158 | MSAT (TO) | 1800.11 | 1797.63 |
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: 21-x8 -x7 -x6 -x5 -x4 -x3 -x2 x1