CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/modifiedRenault/
normalized-renault-mod-46_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/modifiedRenault/
normalized-renault-mod-46_ext.xml
MD5SUMb0921b469e47f43676badfb4b389cf30
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.562914
Satisfiable
(Un)Satisfiability was proved
Number of variables108
Number of constraints149
Maximum constraint arity10
Maximum domain size42
Number of constraints which are defined in extension149
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271073428SAT 0.562914 0.570699
MDG-probe 2008-06-271073427SAT 0.601907 0.616006
Mistral-prime 1.3131073438SAT 0.605907 0.612308
cpHydra k_401073444SAT 0.609907 0.635661
cpHydra k_101073443SAT 0.616905 0.624489
Mistral-option 1.3141073437SAT 0.710891 0.71776
mddc-solv 2008-06-091073425SAT 1.07584 1.09215
spider 2008-06-141073426SAT 1.40379 1.42479
Abscon 112v4 AC1073441SAT 1.62875 1.6875
Abscon 112v4 ESAC1073442SAT 1.72974 1.76931
choco2_dwdeg 2008-06-261073434SAT 4.05838 4.07229
choco2_impwdeg 2008-06-261073433SAT 4.64529 4.71012
Minion/Tailor 2008-07-041106046SAT 4.92225 5.0044
casper zito1073440SAT 5.43217 5.47196
Sugar v1.13+minisat1073431SAT 7.58685 7.73423
Sugar v1.13+picosat1073430SAT 8.02178 8.20923
galac M1073435SAT 12.1911 12.3935
galac E1073436SAT 12.3431 12.4663
bpsolver 2008-06-271073432SAT 14.6758 14.8113
casper zao1073439SAT 46.5989 47.0488
Concrete + CPS4J 2008-05-301073424SAT 92.075 95.9758
Concrete + CSP4J - Tabu Engine 2008-05-301073422SAT 118.658 119.854
SAT4J CSP 2008-06-131073429? 87.2017 84.2874
Concrete + CSP4J - WMC Engine 2008-05-301073423? (TO) 1800.06 1808.22

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 20 1 0 0 0 3 1 1 1 0 1 1 0 1 0 0 1 2 2 1 1 1 9 0 3 0 0 0 1 0 10 2 0 1 0 0 1 2 0 0 0 2 2 0 0 0 1 0 1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 2 0 1
2 0 9 1 1 1 0 0 1 0 1 4 1 4 0 1 0 1 0 0 0 0 0 0 0 0 3 1 3 0 0 2 4 4 2 1 0 8 4