Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache-ibm-q-unbounded.Ic22arity.ucl--soft-33-100-0.wbo |
MD5SUM | 9139ed650d8e3a05453e5f33c40a0f97 |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 1 |
Best CPU time to get the best result obtained on this benchmark | 173.009 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 87751 |
Total number of constraints | 254772 |
Number of soft constraints | 171160 |
Number of constraints which are clauses | 247060 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 7712 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 15 |
Top cost | 8641599 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 8641598 |
Biggest number in a constraint | 130 |
Number of bits of the biggest number in a constraint | 8 |
Biggest sum of numbers in a constraint | 512 |
Number of bits of the biggest sum of numbers | 10 |
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 |
---|---|---|---|---|
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090294 | OPTIMUM | 51.1362 | 47.9869 |
toysat 2016-05-02 (complete) | 4093066 | OPTIMUM | 173.009 | 173.04 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091680 | OPTIMUM | 1444.13 | 1369.47 |
NaPS 1.02 (complete) | 4094452 | MSAT | 199.285 | 199.317 |
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: 1--too large--