Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache.inv8.ucl--soft-33-100-0.wbo |
MD5SUM | 95fc93b9bf9d7a2900db6241c7ee4c87 |
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.726888 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 2355 |
Total number of constraints | 6744 |
Number of soft constraints | 4510 |
Number of constraints which are clauses | 6568 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 176 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 9 |
Top cost | 227663 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 227662 |
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) | 4110090 | OPTIMUM | 0.726888 | 0.731431 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110088 | OPTIMUM | 2.30365 | 0.951865 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110089 | OPTIMUM | 4.47332 | 2.59485 |
NaPS 1.02 (complete) | 4110091 | OPTIMUM | 37.8073 | 37.8136 |
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-x2351 x2352 -x2353 -x2354 x2355