Name | /SOFT-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-elf.rf6.ucl--soft-0-100-0.wbo |
MD5SUM | 86c5d97f0ed50bca48960b88ee0ccb00 |
Bench Category | SOFT-SMALLINT-LIN (only soft 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.000999 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 67 |
Total number of constraints | 132 |
Number of soft constraints | 132 |
Number of constraints which are clauses | 120 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 12 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 7 |
Top cost | 6582 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 6581 |
Biggest number in a constraint | 10 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 31 |
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 |
---|---|---|---|---|
clasp 2.0-RC2 (complete) | 3448066 | OPTIMUM | 0.000999 | 0.00584811 |
wbo 1.6 (complete) | 3446840 | OPTIMUM | 0.001999 | 0.00579001 |
Sat4j Resolution 2011-06-08 (complete) | 3492388 | OPTIMUM | 0.179972 | 0.156508 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447577 | OPTIMUM | 0.18597 | 0.186004 |
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-x66 -x67