MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
schurrLemma/
lemma-24-3.xml

Jump to solvers results

General information on the benchmark

NameschurrLemma/
lemma-24-3.xml
MD5SUM2d89d082bab320d272974b2d2c3ae9ce
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints131
Best CPU time to get the best result obtained on this benchmark1.68074
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables24
Number of constraints132
Maximum constraint arity3
Maximum domain size3
Number of constraints which are defined in extension0
Number of constraints which are defined in intension132
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC275715OPTIMUM 1.68074 1.75632
AbsconMax 109 EPFC275714OPTIMUM 2.87956 3.04783
CSP4J - MaxCSP 2006-12-19275713MSAT (TO) 2400.05 2418.18