MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/queenAttacking/
normalized-queenAttacking-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/queenAttacking/
normalized-queenAttacking-3.xml
MD5SUM7c7d2bd47e49bff016e6945f19c1acba
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark1.05984
Satisfiable
(Un)Satisfiability was proved
Number of variables10
Number of constraints40
Maximum constraint arity2
Maximum domain size9
Number of constraints which are defined in extension0
Number of constraints which are defined in intension40
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-inc1112535OPTIMUM1 1.05984 1.28144
Sugar v1.13+minisat1112536OPTIMUM1 1.16282 1.43188
AbsconMax 112 pc-d1112534OPTIMUM1 31.4362 32.8567
AbsconMax 112 pc-w1112533OPTIMUM1 31.5012 33.2252
Concrete + CSP4J - Tabu Engine 2008-05-301112532MSAT (TO)1 3600.01 3617.52
Concrete + CSP4J - MCRW Engine 2008-05-301112531MSAT (TO)1 3600.03 3614.72

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