Name | /SOFT-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-elf.rf9.ucl--soft-0-100-0.wbo |
MD5SUM | 6a96f81305bc31f40e2a7aa9c05b46b1 |
Bench Category | SOFT-BIGINT-LIN (only soft 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 | 3.83242 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 20445 |
Total number of constraints | 58444 |
Number of soft constraints | 58444 |
Number of constraints which are clauses | 56420 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 2024 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 2944721 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2944720 |
Biggest number in a constraint | 65 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 254 |
Number of bits of the biggest sum of numbers | 8 |
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) | 4090815 | OPTIMUM | 3.83242 | 1.99796 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092201 | OPTIMUM | 7.38388 | 4.19931 |
toysat 2016-05-02 (complete) | 4093587 | OPTIMUM | 12.1262 | 12.1292 |
NaPS 1.02 (complete) | 4094973 | MSAT | 79.2829 | 79.296 |
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--