| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9048_1-unsat--soft-33-100-0.wbo |
| MD5SUM | b52f4371da43cfec5ed1cc41a72b95c0 |
| 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 | 10 |
| Best CPU time to get the best result obtained on this benchmark | 4.10637 |
| 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 | 34693 |
| 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 | 1746055 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1746054 |
| 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 PB Resolution 2.2.1 (complete) | 2698128 | OPTIMUM | 4.10637 | 4.28838 |
| PB/CT 0.1 fixed (complete) | 2698869 | MSAT (TO) | 1800.07 | 1800.02 |
| PB/CT 0.1 (complete) | 2695087 | Signal | 6.12707 | 6.12686 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691685 | Wrong Opt. | 3.78042 | 2.12839 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690944 | Wrong Opt. | 4.56731 | 2.59768 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694346 | Wrong Opt. | 5.71513 | 3.48219 |
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: 10--too large--