CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/jobShop-e0ddr1/
normalized-e0ddr1-10-by-5-10.xml

Jump to solvers results

General information on the benchmark

Namecsp/jobShop-e0ddr1/
normalized-e0ddr1-10-by-5-10.xml
MD5SUMb10ff76d89f0aa1b94e437a7f1e524d7
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.070989
Satisfiable
(Un)Satisfiability was proved
Number of variables50
Number of constraints265
Maximum constraint arity2
Maximum domain size119
Number of constraints which are defined in extension0
Number of constraints which are defined in intension265
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131055243SAT 0.070989 0.0767269
MDG-probe 2008-06-271055232SAT 0.072987 0.079386
bpsolver 2008-06-271055237SAT 0.089985 0.097569
Mistral-option 1.3141055242SAT 0.198969 0.209974
cpHydra k_101055248SAT 0.25596 0.263382
cpHydra k_401055249SAT 0.25696 0.263221
MDG-noprobe 2008-06-271055233SAT 0.344947 0.34981
Minion/Tailor 2008-07-041105159SAT 0.734887 0.809154
Sugar v1.13+minisat1055236SAT 1.05584 1.1269
choco2_dwdeg 2008-06-261055239SAT 1.36779 1.40889
Concrete + CPS4J 2008-05-301055231SAT 1.39379 1.42656
Sugar v1.13+picosat1055235SAT 1.54776 1.62747
Concrete + CSP4J - WMC Engine 2008-05-301055230SAT 1.63675 1.66891
choco2_impwdeg 2008-06-261055238SAT 1.72374 1.7841
Abscon 112v4 ESAC1055247SAT 2.01569 2.03383
Abscon 112v4 AC1055246SAT 2.12968 2.19278
Concrete + CSP4J - Tabu Engine 2008-05-301055229SAT 17.1754 17.3492
casper zao1055244SAT 23.5834 23.7922
SAT4J CSP 2008-06-131055234SAT 33.062 33.105
galac M1055240SAT 33.8948 34.2846
casper zito1055245SAT 34.5367 34.8113
galac E1055241SAT 480.631 484.472

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 3 7 29 75 7 11 21 55 61 0 21 90 100 119 39 71 124 136 144 15 30 100 114 119 0 61 114 124 129 0 36 51 66 100 3 20 36 51 78 11 20 82 90 134
6 29 66 82 89