Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j6010_2-unsat--soft-33-100-0.wbo |
MD5SUM | c0c0bebc7e31a6df8b165cc7ff9f27e8 |
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 | 6 |
Best CPU time to get the best result obtained on this benchmark | 0.064989 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 7564 |
Total number of constraints | 23412 |
Number of soft constraints | 15681 |
Number of constraints which are clauses | 23168 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 244 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 50 |
Top cost | 793815 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 793814 |
Biggest number in a constraint | 44 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 333 |
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 |
---|---|---|---|---|
clasp 2.0-RC2 (complete) | 3448371 | OPTIMUM | 0.064989 | 0.0660919 |
wbo 1.6 (complete) | 3446767 | OPTIMUM | 0.067989 | 0.0683561 |
Sat4j Resolution 2011-06-08 (complete) | 3492307 | OPTIMUM | 2.09668 | 0.989759 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447504 | MSAT (TO) | 1800.31 | 1800.25 |
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: 6-x7559 -x7560 -x7561 -x7562 -x7563 x7564