Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12041_4-unsat--soft-66-100-0.wbo |
MD5SUM | 14ab67185b6bce14318908cc36011524 |
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 | 2 |
Best CPU time to get the best result obtained on this benchmark | 96.4023 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 28072 |
Total number of constraints | 97590 |
Number of soft constraints | 33203 |
Number of constraints which are clauses | 97130 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 460 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 36 |
Top cost | 1670101 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1670100 |
Biggest number in a constraint | 13 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 231 |
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 |
---|---|---|---|---|
toysat 2016-05-02 (complete) | 4093102 | OPTIMUM | 96.4023 | 96.4204 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090330 | OPTIMUM | 175.67 | 172.58 |
NaPS 1.02 (complete) | 4094488 | MSAT | 233.438 | 233.49 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091716 | MSAT (TO) | 1800.96 | 1773.55 |
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: 2-x28071 x28072