CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-24-3-2/
normalized-radar-8-24-3-2-22.xml
MD5SUM66af4495f2d3015f4845fab8a6c7b092
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.035994
Satisfiable
(Un)Satisfiability was proved
Number of variables144
Number of constraints64
Maximum constraint arity13
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
Mistral-prime 1.3131080796SAT 0.035994 0.042424
MDG-noprobe 2008-06-271080786SAT 0.037993 0.043277
MDG-probe 2008-06-271080785SAT 0.044992 0.051021
cpHydra k_401080802SAT 0.047991 0.0508861
cpHydra k_101080801SAT 0.048992 0.0506641
casper zito1080798SAT 0.090985 0.0994939
Mistral-option 1.3141080795SAT 0.104983 0.110339
casper zao1080797SAT 0.634902 0.650099
Sugar v1.13+minisat1080789SAT 1.39179 1.49069
Sugar v1.13+picosat1080788SAT 1.41279 1.48093
choco2_dwdeg 2008-06-261080792SAT 1.51177 1.58889
choco2_impwdeg 2008-06-261080791SAT 1.86971 1.93955
Abscon 112v4 AC1080799SAT 3.50047 3.54469
Abscon 112v4 ESAC1080800SAT 26.005 26.2836
Concrete + CPS4J 2008-05-301080784SAT 116.951 117.821
Concrete + CSP4J - Tabu Engine 2008-05-301080782SAT 1187.78 1194.68
Minion/Tailor 2008-07-041106598? 0.374942 0.394835
SAT4J CSP 2008-06-131080787? 250.865 249.951
galac M1080793? (problem) 109.979 111.067
galac E1080794? (problem) 119.445 126.083
Concrete + CSP4J - WMC Engine 2008-05-301080783? (TO) 1800.05 1801.92
bpsolver 2008-06-271080790? (TO) 1800.08 1810.32

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