MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/schurrLemma/
normalized-lemma-15-9-mod.xml

Jump to solvers results

General information on the benchmark

Namecsp/schurrLemma/
normalized-lemma-15-9-mod.xml
MD5SUM385f043af47298479923ba2256bd9e12
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark926.785
Satisfiable
(Un)Satisfiability was proved
Number of variables15
Number of constraints49
Maximum constraint arity3
Maximum domain size9
Number of constraints which are defined in extension0
Number of constraints which are defined in intension49
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar v1.13+minisat1109608OPTIMUM3 926.785 927.228
Sugar++ v1.13+minisat-inc1109607OPTIMUM3 997.631 1007.03
Concrete + CSP4J - MCRW Engine 2008-05-301109603MSAT (TO)3 3600.03 3601.52
Concrete + CSP4J - Tabu Engine 2008-05-301109604MSAT (TO)3 3600.05 3625.02
AbsconMax 112 pc-d1109606MSAT (TO)3 3600.08 3601.84
AbsconMax 112 pc-w1109605MSAT (TO)3 3600.08 3631.15

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 3
Solution found:
8 8 6 1 5 2 4 3 7 5 0 2 7 4 5