Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-elf.rf10.ucl--soft-66-100-0.wbo |
MD5SUM | f5ed716c93f40a6a98b33ea846844855 |
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 | 299.714 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 55066 |
Total number of constraints | 160619 |
Number of soft constraints | 54969 |
Number of constraints which are clauses | 156587 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 4032 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 2786820 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2786819 |
Biggest number in a constraint | 67 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 256 |
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) | 2698060 | OPTIMUM | 299.714 | 298.771 |
PB/CT 0.1 fixed (complete) | 2698801 | MSAT (TO) | 1800.1 | 1800.06 |
PB/CT 0.1 (complete) | 2695019 | Signal | 0.957854 | 1.01369 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690876 | Wrong Opt. | 115.642 | 112.25 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691617 | Wrong Opt. | 856.914 | 842.646 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694278 | Wrong Opt. | 902.473 | 868.85 |
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--