Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.burch_dill.4.accl.ucl--soft-66-100-0.wbo |
MD5SUM | 6efaaa0bcc1032ac40f1941f9de82d96 |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small 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 | 1.79273 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 3939 |
Total number of constraints | 10412 |
Number of soft constraints | 3552 |
Number of constraints which are clauses | 9740 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 672 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 178925 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 178924 |
Biggest number in a constraint | 69 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 258 |
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 |
---|---|---|---|---|
toysat 2016-05-02 (complete) | 4110062 | OPTIMUM | 1.79273 | 1.80359 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110060 | OPTIMUM | 2.06369 | 0.922866 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110061 | OPTIMUM | 4.73228 | 2.80702 |
NaPS 1.02 (complete) | 4110063 | OPTIMUM | 36.8294 | 36.8498 |
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-x3931 -x3932 x3933 x3934 x3935 x3936 x3937 x3938 x3939