MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/super-queens/
normalized-super-queens-1.xml
MD5SUMb533018f75b84b97c42ae06595d24f86
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 benchmark3088.74
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints145
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension0
Number of constraints which are defined in intension145
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+minisat1112656OPTIMUM4 3088.74 3117.36
Sugar++ v1.13+minisat-inc1112655OPTIMUM4 3564.83 3599.68
AbsconMax 112 pc-w1112653MSAT (TO)4 1601.3 4000.05
AbsconMax 112 pc-d1112654MSAT (TO)4 1609.14 4000.15
Concrete + CSP4J - MCRW Engine 2008-05-301112651MSAT (TO)4 3600.08 3615.02
Concrete + CSP4J - Tabu Engine 2008-05-301112652MSAT (TO)4 3600.1 3616.83

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 1 7 2 10 1 10 1 6 2 9 1 9 1 4 2 8 1 3 8