MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
pseudoSeries/primesDimacs/
bf-2670-001.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/primesDimacs/
bf-2670-001.xml
MD5SUM254fa29df9e9670d71c11b5fd4b239c4
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints4820
Best CPU time to get the best result obtained on this benchmark133.95
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables2786
Number of constraints4821
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension4821
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC275787OPTIMUM 133.95 134.762
AbsconMax 109 EPFC275786OPTIMUM 167.966 168.129
CSP4J - MaxCSP 2006-12-19275785MSAT (TO) 2400.09 2404.35