Name | /SOFT-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9048_1-unsat--soft-0-100-0.wbo |
MD5SUM | 0cba3d1e27d8fa6d3faa677b5a7dc4e3 |
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 | 18 |
Best CPU time to get the best result obtained on this benchmark | 3.62945 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 15106 |
Total number of constraints | 51743 |
Number of soft constraints | 51743 |
Number of constraints which are clauses | 51415 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 328 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 90 |
Top cost | 2612877 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2612876 |
Biggest number in a constraint | 105 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 658 |
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 Resolution 2011-06-08 (complete) | 3492469 | OPTIMUM | 3.62945 | 2.65782 |
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: 18--too large--