CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/allIntervalSeries/
normalized-series-8.xml

Jump to solvers results

General information on the benchmark

Namecsp/allIntervalSeries/
normalized-series-8.xml
MD5SUMcc6af1b4592e974e7987a7f31892c86f
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.007998
Satisfiable
(Un)Satisfiability was proved
Number of variables15
Number of constraints56
Maximum constraint arity3
Maximum domain size8
Number of constraints which are defined in extension0
Number of constraints which are defined in intension56
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131060312SAT 0.007998 0.01479
Mistral-option 1.3141060311SAT 0.008997 0.014467
MDG-probe 2008-06-271060301SAT 0.009998 0.009924
MDG-noprobe 2008-06-271060302SAT 0.013997 0.0143551
casper zito1060314SAT 0.022996 0.0299091
cpHydra k_101060317SAT 0.024995 0.024277
cpHydra k_401060318SAT 0.025996 0.031558
bpsolver 2008-06-271060306SAT 0.029995 0.0335529
casper zao1060313SAT 0.044992 0.0518221
Minion/Tailor 2008-07-041105213SAT 0.370943 0.404618
Sugar v1.13+minisat1060305SAT 0.574912 0.60595
Concrete + CSP4J - Tabu Engine 2008-05-301060298SAT 0.589909 0.641356
Concrete + CPS4J 2008-05-301060300SAT 0.593909 0.493339
Concrete + CSP4J - WMC Engine 2008-05-301060299SAT 0.605907 0.671258
Sugar v1.13+picosat1060304SAT 0.695894 0.77445
choco2_dwdeg 2008-06-261060308SAT 0.705891 0.733311
choco2_impwdeg 2008-06-261060307SAT 0.726888 0.571885
Abscon 112v4 AC1060315SAT 0.757884 0.795056
Abscon 112v4 ESAC1060316SAT 0.78588 0.848459
galac M1060309SAT 1.19782 1.04963
galac E1060310SAT 1.2818 1.329
SAT4J CSP 2008-06-131060303SAT 2.11668 2.1776

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