MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/super-queens/
normalized-super-queens-11.xml

Jump to solvers results

General information on the benchmark

Namecsp/super-queens/
normalized-super-queens-11.xml
MD5SUMd024b00d7492160e14e33ed9f6aa64a5
Bench Category2-ARY-INT (binary 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 benchmark0.943856
Satisfiable
(Un)Satisfiability was proved
Number of variables8
Number of constraints22
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension22
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+minisat-inc1112637OPTIMUM3 0.943856 1.44081
Sugar v1.13+minisat1112638OPTIMUM3 0.945855 1.14014
AbsconMax 112 pc-w1112635OPTIMUM3 30.8913 32.1382
AbsconMax 112 pc-d1112636OPTIMUM3 31.0263 31.539
Concrete + CSP4J - MCRW Engine 2008-05-301112633MSAT (TO)3 3600.03 3615.52
Concrete + CSP4J - Tabu Engine 2008-05-301112634MSAT (TO)3 3600.05 3603.32

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:
1 2 4 3 1 2 4 3