Name | /SOFT-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.tag12.ucl--soft-0-100-0.wbo |
MD5SUM | 34b825c7826429a46ba2a8e3ee61f2f7 |
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 | 139.429 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 20605 |
Total number of constraints | 59851 |
Number of soft constraints | 59851 |
Number of constraints which are clauses | 58675 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 1176 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 3025900 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 3025899 |
Biggest number in a constraint | 41 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 134 |
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 Resolution 2011-06-08 (complete) | 3492397 | OPTIMUM | 139.429 | 137.356 |
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--