Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j903_10-unsat--soft-66-100-0.wbo |
MD5SUM | dedae6261f3c03a02c47ea0595dc06e5 |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 4 |
Best CPU time to get the best result obtained on this benchmark | 3.18851 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 11830 |
Total number of constraints | 36862 |
Number of soft constraints | 12660 |
Number of constraints which are clauses | 36606 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 256 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 29 |
Top cost | 641154 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 641153 |
Biggest number in a constraint | 36 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 203 |
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) | 4090707 | OPTIMUM | 1.9427 | 0.864307 |
toysat 2016-05-02 (complete) | 4093479 | OPTIMUM | 3.18851 | 3.19327 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092093 | OPTIMUM | 4.08238 | 2.09622 |
NaPS 1.02 (complete) | 4094865 | OPTIMUM | 66.8238 | 66.8353 |
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: 4--too large--