Name | /SOFT-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf9.ucl--soft-0-100-0.wbo |
MD5SUM | dc71b65304b6880f364f240c3456eef4 |
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 | 1 |
Best CPU time to get the best result obtained on this benchmark | 39.406 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 11476 |
Total number of constraints | 33090 |
Number of soft constraints | 33090 |
Number of constraints which are clauses | 32382 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 708 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 1665779 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1665778 |
Biggest number in a constraint | 33 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 126 |
Number of bits of the biggest sum of numbers | 7 |
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) | 2698403 | OPTIMUM | 39.406 | 37.1877 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2691219 | OPTIMUM | 84.6281 | 81.7957 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694621 | OPTIMUM | 327.329 | 302.182 |
PB/CT 0.1 fixed (complete) | 2699144 | MSAT (TO) | 1800.09 | 1800.02 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691960 | MSAT (TO) | 1800.32 | 1767.61 |
SCIPclp SCIP 1.2.1.3 with Clp 1.11.1 (Release Version) as LP solver (complete) | 2705352 | ? (TO) | 1800.09 | 1800.04 |
PB/CT 0.1 (complete) | 2695362 | Signal | 0.197969 | 0.198819 |
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: 1--too large--