CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/insertion/full-insertion/
normalized-1-fullins-3-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/insertion/full-insertion/
normalized-1-fullins-3-3.xml
MD5SUMc3d0c1818cdafcfe59c7c1beb4678b57
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.006998
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints100
Maximum constraint arity2
Maximum domain size3
Number of constraints which are defined in extension0
Number of constraints which are defined in intension100
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271090767UNSAT 0.006998 0.0101141
Mistral-option 1.3141090776UNSAT 0.007998 0.0162761
Mistral-prime 1.3131090777UNSAT 0.009997 0.015737
casper zito1090779UNSAT 0.010997 0.0116701
MDG-probe 2008-06-271090766UNSAT 0.011997 0.0164079
casper zao1090778UNSAT 0.015996 0.026121
cpHydra k_401090783UNSAT 0.019996 0.02281
cpHydra k_101090782UNSAT 0.021996 0.270424
bpsolver 2008-06-271090771UNSAT 0.034994 0.035559
Minion/Tailor 2008-07-041105655UNSAT 0.341948 0.373946
choco2_impwdeg 2008-06-261090772UNSAT 0.58691 0.624009
choco2_dwdeg 2008-06-261090773UNSAT 0.58891 0.624905
Sugar v1.13+picosat1090769UNSAT 0.615906 0.689846
galac M1090774UNSAT 0.642901 0.664899
Sugar v1.13+minisat1090770UNSAT 0.646901 0.699971
Abscon 112v4 AC1090780UNSAT 0.744886 0.794342
Abscon 112v4 ESAC1090781UNSAT 0.762883 0.783428
Concrete + CPS4J 2008-05-301090765UNSAT 0.775881 0.695645
galac E1090775UNSAT 0.827873 0.88395
SAT4J CSP 2008-06-131090768UNSAT 1.06984 1.14224
Concrete + CSP4J - Tabu Engine 2008-05-301090763? (TO) 1800.05 1808.72
Concrete + CSP4J - WMC Engine 2008-05-301090764? (TO) 1800.1 1807.02

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: