MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/radar-9-28-4-2/
normalized-radar-9-28-4-2-47.xml

Jump to solvers results

General information on the benchmark

Namecsp/radar-9-28-4-2/
normalized-radar-9-28-4-2-47.xml
MD5SUM6b5bcc43f421135ea6e150e3eca88984
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 benchmark2.21366
Satisfiable
(Un)Satisfiability was proved
Number of variables168
Number of constraints81
Maximum constraint arity24
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension81
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-inc1109235OPTIMUM2 2.21366 2.08236
Sugar v1.13+minisat1109236OPTIMUM2 2.55961 2.82689
AbsconMax 112 pc-w1109233MSAT (TO)2 3600.08 3633.14
Concrete + CSP4J - MCRW Engine 2008-05-301109231MSAT (TO)2 3600.09 3601.52
AbsconMax 112 pc-d1109234MSAT (TO)3 3600.08 3602.16
Concrete + CSP4J - Tabu Engine 2008-05-301109232MSAT (TO)4 3600.1 3602.22

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