Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j9048_1-unsat--soft-66-100-0.wbo |
MD5SUM | 6fbf16c6c6628a8e757beb1e2cb2761c |
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 | 22 |
Best CPU time to get the best result obtained on this benchmark | 0.096985 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 15106 |
Total number of constraints | 51743 |
Number of soft constraints | 17692 |
Number of constraints which are clauses | 51415 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 328 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 90 |
Top cost | 882854 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 882853 |
Biggest number in a constraint | 105 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 658 |
Number of bits of the biggest sum of numbers | 10 |
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) | 3448356 | OPTIMUM | 0.096985 | 0.0970671 |
wbo 1.6 (complete) | 3446752 | OPTIMUM | 0.156976 | 0.158506 |
Sat4j Resolution 2011-06-08 (complete) | 3492292 | OPTIMUM | 2.83757 | 1.40502 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447489 | MSAT (TO) | 1800.13 | 1800.13 |
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: 22-x15103 -x15104 -x15105 x15106