MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/radar-8-24-3-2/
normalized-radar-8-24-3-2-18.xml

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-24-3-2/
normalized-radar-8-24-3-2-18.xml
MD5SUM9e2c993d6ee78d3d6a0fcf40db794a07
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints2
Best CPU time to get the best result obtained on this benchmark1.91971
Satisfiable
(Un)Satisfiability was proved
Number of variables144
Number of constraints64
Maximum constraint arity16
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension64
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-inc1112147OPTIMUM2 1.91971 2.03671
Sugar v1.13+minisat1112148OPTIMUM2 2.15967 2.35263
Concrete + CSP4J - MCRW Engine 2008-05-301112143MSAT (TO)2 3600.08 3612.02
Concrete + CSP4J - Tabu Engine 2008-05-301112144MSAT (TO)3 3600.02 3601.52
AbsconMax 112 pc-d1112146? 31.2482 31.6723
AbsconMax 112 pc-w1112145? 31.3342 31.7246

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: 2
Solution found:
3 2 0 1 3 3 3 3 0 3 0 3 3 0 0 0 2 3 3 2 1 0 0 3 3 3 3 0 2 3 3 0 1 1 3 3 3 2 0 0 3 3 3 1 0 3 1 0 0 1 1 0 0 0 0 3 1 3 3 0 1 0 0 3 2 0 3 3 2 0
2 1 3 3 3 3 3 1 0 0 0 0 3 3 0 0 3 1 3 1 0 0 3 3 1 1 1 3 3 0 2 0 1 0 0 3 0 0 0 1 2 3 3 3 0 3 3 3 2 0 0 1 3 0 3 0 0 2 3 3 2 2 3 3 3 3 3 3 0 1
3 3 3 1