CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rlfapGraphsMod/
normalized-graph9-f10.xml

Jump to solvers results

General information on the benchmark

Namecsp/rlfapGraphsMod/
normalized-graph9-f10.xml
MD5SUM6c2f102032bae2df336cce2e32238ab9
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.968851
Satisfiable
(Un)Satisfiability was proved
Number of variables916
Number of constraints5246
Maximum constraint arity2
Maximum domain size34
Number of constraints which are defined in extension0
Number of constraints which are defined in intension5246
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271075224UNSAT 0.968851 0.981858
cpHydra k_401075240UNSAT 1.16082 1.18234
cpHydra k_101075239UNSAT 1.3138 1.33045
Mistral-option 1.3141075233UNSAT 3.70644 3.73892
choco2_dwdeg 2008-06-261075230UNSAT 6.30204 6.36624
Mistral-prime 1.3131075234UNSAT 6.39303 6.41436
Abscon 112v4 AC1075237UNSAT 6.92495 6.98357
choco2_impwdeg 2008-06-261075229UNSAT 7.13391 7.25246
Abscon 112v4 ESAC1075238UNSAT 7.67383 7.63508
Sugar v1.13+minisat1075227UNSAT 8.28074 8.45041
Sugar v1.13+picosat1075226UNSAT 10.4424 10.5981
MDG-probe 2008-06-271075223UNSAT 11.1263 11.2279
Concrete + CPS4J 2008-05-301075222UNSAT 14.8737 14.9425
SAT4J CSP 2008-06-131075225UNSAT 17.5193 17.3701
galac E1075232UNSAT 64.7612 64.959
galac M1075231UNSAT 65.829 66.5502
casper zao1075235UNSAT 217.241 218.309
casper zito1075236? (TO) 1800.03 1801.41
Concrete + CSP4J - WMC Engine 2008-05-301075221? (TO) 1800.04 1816.03
Minion/Tailor 2008-07-041106980? (TO) 1800.07 1801.21
Concrete + CSP4J - Tabu Engine 2008-05-301075220? (TO) 1800.1 1806.72
bpsolver 2008-06-271075228? (TO) 1800.11 1801.51

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: