Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.tag14.ucl--soft-66-100-0.wbo |
MD5SUM | e03e95feed68526713fa955672f1692a |
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 | 1699.28 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 40605 |
Total number of constraints | 118930 |
Number of soft constraints | 40557 |
Number of constraints which are clauses | 117190 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 1740 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 2051228 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2051227 |
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) | 4090316 | OPTIMUM | 21.5907 | 19.6818 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091702 | OPTIMUM | 80.3018 | 50.932 |
toysat 2016-05-02 (complete) | 4093088 | OPTIMUM | 1699.28 | 1699.68 |
NaPS 1.02 (complete) | 4094474 | MSAT (MO) | 112.557 | 112.574 |
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--