Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9039_3-unsat--soft-33-100-0.wbo |
MD5SUM | 6cc35be76a92b4bf23f7bdaafc76a3c9 |
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.16537 |
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 | 51849 |
Number of soft constraints | 34948 |
Number of constraints which are clauses | 51521 |
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 | 50 |
Top cost | 1769987 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1769986 |
Biggest number in a constraint | 42 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 335 |
Number of bits of the biggest sum of numbers | 9 |
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) | 2698134 | OPTIMUM | 4.16537 | 4.46626 |
PB/CT 0.1 fixed (complete) | 2698875 | MSAT (TO) | 1800.03 | 1800.03 |
PB/CT 0.1 (complete) | 2695093 | Signal | 1.03684 | 1.0405 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691691 | Wrong Opt. | 4.18036 | 2.35374 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690950 | Wrong Opt. | 4.66029 | 2.60432 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694352 | Wrong Opt. | 5.9081 | 3.44774 |
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--