MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/super-queens/
normalized-super-queens-13.xml
MD5SUM7ca64d29f7b92f5ea95caa9cf94f3ae0
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints4
Best CPU time to get the best result obtained on this benchmark34.5457
Satisfiable
(Un)Satisfiability was proved
Number of variables16
Number of constraints92
Maximum constraint arity2
Maximum domain size8
Number of constraints which are defined in extension0
Number of constraints which are defined in intension92
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+minisat1112680OPTIMUM4 34.5457 35.4751
Sugar++ v1.13+minisat-inc1112679OPTIMUM4 45.1321 45.5382
AbsconMax 112 pc-w1112677OPTIMUM4 638.256 1568.97
AbsconMax 112 pc-d1112678MSAT (TO)4 1591.9 4000.08
Concrete + CSP4J - Tabu Engine 2008-05-301112676MSAT (TO)4 3600.01 3601.52
Concrete + CSP4J - MCRW Engine 2008-05-301112675MSAT (TO)4 3600.1 3612.42

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: 4
Solution found:
5 2 8 1 8 2 6 1 3 2 7 1 7 2 4 1