CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-24-3-2/
normalized-radar-8-24-3-2-40.xml
MD5SUMd2c23bcbd82ec2530cf97ecefb1d08ed
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.036993
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 NameTraceIDAnswerCPU timeWall clock time
MDG-probe 2008-06-271080743SAT 0.036993 0.0450181
Mistral-prime 1.3131080754SAT 0.040993 0.0483389
MDG-noprobe 2008-06-271080744SAT 0.040993 0.0438699
cpHydra k_401080760SAT 0.049991 0.06652
cpHydra k_101080759SAT 0.055991 0.0621221
Mistral-option 1.3141080753SAT 0.080987 0.089573
casper zito1080756SAT 0.158974 0.164739
casper zao1080755SAT 0.844871 0.857813
Sugar v1.13+minisat1080747SAT 1.2868 1.34832
Sugar v1.13+picosat1080746SAT 1.39079 1.71977
choco2_dwdeg 2008-06-261080750SAT 1.40379 1.54365
choco2_impwdeg 2008-06-261080749SAT 2.19967 2.25424
Abscon 112v4 AC1080757SAT 3.60245 3.66356
Abscon 112v4 ESAC1080758SAT 7.63984 7.76766
Concrete + CPS4J 2008-05-301080742SAT 137.814 138.603
bpsolver 2008-06-271080748SAT 1340.93 1350.34
Minion/Tailor 2008-07-041106604? 0.380941 0.407136
SAT4J CSP 2008-06-131080745? 256.108 255.744
galac E1080752? (problem) 122.328 122.523
galac M1080751? (problem) 137.343 141.364
Concrete + CSP4J - Tabu Engine 2008-05-301080740? (TO) 1800.04 1817.02
Concrete + CSP4J - WMC Engine 2008-05-301080741? (TO) 1800.08 1801.52

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:
0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 2 0 0 1 1 3 1 0 1 0 0 0 0 2 0 0 0 0 0 0 0 1 2 0 0 3 2 2 1 0 0 1 0 0 2 0 2 2 0 1 2 2 0 0 2 0 0 0
1 0 2 1 1 0 0 0 3 0 2 2 0 3 3 0 1 0 2 2 3 0 0 0 3 1 3 3 0 0 0 3 1 0 1 0 0 0 3 0 2 1 0 0 0 3 3 0 3 1 2 0 1 0 2 1 2 2 0 0 2 2 0 3 0 0 3 3 1 0
0 0 3 2