Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.ex.mem.LdValue.ucl--soft-66-100-0.wbo |
MD5SUM | d64ce0bd078e6525611d61225eb16a6d |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MSAT TO |
Best cost obtained on this benchmark | 1 |
Best CPU time to get the best result obtained on this benchmark | 1800.32 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 77106 |
Total number of constraints | 218779 |
Number of soft constraints | 74126 |
Number of constraints which are clauses | 205559 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 13220 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 15 |
Top cost | 3737047 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 3737046 |
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 Resolution 2011-06-08 (complete) | 3492059 | MSAT (TO) | 1800.32 | 1797.32 |
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--