MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
pseudoSeries/primesDimacs/
bf-1355-075.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/primesDimacs/
bf-1355-075.xml
MD5SUM0cecde6441078a26b03ad47c1da722a7
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints8952
Best CPU time to get the best result obtained on this benchmark281.725
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables4360
Number of constraints8953
Maximum constraint arity6
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension8953
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC275793OPTIMUM 281.725 284.694
AbsconMax 109 EPFC275792OPTIMUM 304.148 304.547
CSP4J - MaxCSP 2006-12-19275791MSAT (TO) 2400.01 2409.9