Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf9.ucl--soft-33-100-0.wbo |
MD5SUM | 16edd19565c435db1c6980c47a901d3a |
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 | 123.776 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 11476 |
Total number of constraints | 33090 |
Number of soft constraints | 22107 |
Number of constraints which are clauses | 32382 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 708 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 1114426 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1114425 |
Biggest number in a constraint | 33 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 126 |
Number of bits of the biggest sum of numbers | 7 |
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) | 4090313 | OPTIMUM | 6.599 | 5.37737 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091699 | OPTIMUM | 13.002 | 8.99716 |
toysat 2016-05-02 (complete) | 4093085 | OPTIMUM | 123.776 | 123.797 |
NaPS 1.02 (complete) | 4094471 | MSAT | 296.336 | 296.382 |
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--