MAX-CSP 2006 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NamepseudoSeries/primesDimacs/
bf-1355-638.xml
MD5SUMd4173c08d23547badf1bca6a01d815fe
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints8939
Best CPU time to get the best result obtained on this benchmark306.229
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables4354
Number of constraints8940
Maximum constraint arity6
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension8940
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC275790OPTIMUM 306.229 307.927
AbsconMax 109 EPFC275789OPTIMUM 431.536 435.668
CSP4J - MaxCSP 2006-12-19275788MSAT (TO) 2400.03 2403.24