Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j30/ normalized-j3041_4-unsat--soft-66-100-0.wbo |
MD5SUM | f676428e29d52379a445f7afa72f565b |
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 | 5 |
Best CPU time to get the best result obtained on this benchmark | 3.06653 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 4836 |
Total number of constraints | 16649 |
Number of soft constraints | 5540 |
Number of constraints which are clauses | 16341 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 308 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 26 |
Top cost | 277431 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 277430 |
Biggest number in a constraint | 15 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 166 |
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) | 4093455 | OPTIMUM | 3.06653 | 3.0681 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090683 | OPTIMUM | 19.11 | 17.2144 |
NaPS 1.02 (complete) | 4094841 | OPTIMUM | 62.2705 | 62.2913 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092069 | OPTIMUM | 1180.3 | 1171.62 |
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: 5-x4831 -x4832 -x4833 -x4834 -x4835 x4836