MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
schurrLemma/
lemma-12-9-mod.xml

Jump to solvers results

General information on the benchmark

NameschurrLemma/
lemma-12-9-mod.xml
MD5SUM3d49d2f245dda30a731f7833344c1bf4
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints29
Best CPU time to get the best result obtained on this benchmark49.0285
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables12
Number of constraints30
Maximum constraint arity3
Maximum domain size9
Number of constraints which are defined in extension0
Number of constraints which are defined in intension30
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC275700OPTIMUM 49.0285 49.3188
AbsconMax 109 EPFC275699OPTIMUM 70.1943 70.5395
CSP4J - MaxCSP 2006-12-19275698MSAT (TO) 2400.02 2411.05