Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache.inv10.ucl--soft-66-100-0.wbo |
MD5SUM | d386dfc8e47349268f453a2b59efbfb7 |
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 | 3 |
Best CPU time to get the best result obtained on this benchmark | 1.59376 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 8937 |
Total number of constraints | 26319 |
Number of soft constraints | 8922 |
Number of constraints which are clauses | 26047 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 272 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 9 |
Top cost | 446674 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 446673 |
Biggest number in a constraint | 17 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 62 |
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 |
---|---|---|---|---|
toysat 2016-05-02 (complete) | 4093437 | OPTIMUM | 1.59376 | 1.59733 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090665 | OPTIMUM | 2.75258 | 1.33326 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092051 | OPTIMUM | 6.00309 | 5.95937 |
NaPS 1.02 (complete) | 4094823 | OPTIMUM | 95.0655 | 95.0814 |
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: 3x8931 -x8932 x8933 -x8934 x8935 -x8936 -x8937