Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.ex.br.mem.RobRegValid_bar.ucl--soft-66-100-0.wbo |
MD5SUM | 68857518c481325121ef79374ff5f3e7 |
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 | 1 |
Best CPU time to get the best result obtained on this benchmark | 1717.57 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 49621 |
Total number of constraints | 138346 |
Number of soft constraints | 47147 |
Number of constraints which are clauses | 127390 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 10956 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 15 |
Top cost | 2382740 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2382739 |
Biggest number in a constraint | 129 |
Number of bits of the biggest number in a constraint | 8 |
Biggest sum of numbers in a constraint | 510 |
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) | 2698042 | OPTIMUM | 1717.57 | 1701.24 |
PB/CT 0.1 fixed (complete) | 2698783 | MSAT (TO) | 1800.11 | 1800.06 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691599 | MSAT (TO) | 1800.33 | 1733.06 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690858 | MSAT (TO) | 1800.34 | 1776.24 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694260 | MSAT (TO) | 1800.42 | 1158.72 |
PB/CT 0.1 (complete) | 2695001 | Signal | 0.970851 | 0.97361 |
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--