Name | /SOFT-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9035_1-unsat--soft-0-100-0.wbo |
MD5SUM | 94d0c8f18eb5af264ab651e4b4281462 |
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 | 8 |
Best CPU time to get the best result obtained on this benchmark | 4.5843 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 17836 |
Total number of constraints | 61428 |
Number of soft constraints | 61428 |
Number of constraints which are clauses | 61040 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 388 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 25 |
Top cost | 3090764 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 3090763 |
Biggest number in a constraint | 28 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 185 |
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) | 3492457 | OPTIMUM | 4.5843 | 3.43712 |
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: 8--too large--