Name | csp/os-gp/ normalized-gp10-09-1112.xml |
MD5SUM | 96dbfd49f37e12d4046152f22e635cbd |
Bench Category | 2-ARY-INT (binary constraints in intension) |
Best result obtained on this benchmark | SAT |
Best CPU time to get the best result obtained on this benchmark | 0.202968 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 101 |
Number of constraints | 1000 |
Maximum constraint arity | 2 |
Maximum domain size | 1113 |
Number of constraints which are defined in extension | 0 |
Number of constraints which are defined in intension | 1000 |
Global constraints used (with number of constraints) |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
Solution found:1112 979 1103 0 373 934 372 1109 921 1108 1007 1107 730 1097 0 397 262 1110 1111 1063 235 630 1 627 1063 730 656 0 509 750 1107 80 503 533 1108 935 0 1 627 1107 929 509 1080 630 1110 1107 2 1098 165 1097 80 1105 1059 1081 929 1 397 435 0 1109 921 656 1013 1080 1059 1110 435 85 992 79 0 1100 1015 1108 1062 921 3 1105 934 1098 262 1007 0 1107 235 750 1 882 5 295 165 5 533 330 295 0 712 80 1 85 79