CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/modifiedRenault/
normalized-renault-mod-49_ext.xml
MD5SUM4e1becc36d2e4ba485918b5efe05807d
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.623904
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
Mistral-prime 1.3131074289SAT 0.623904 0.634144
cpHydra k_101074294SAT 0.631902 0.638087
MDG-noprobe 2008-06-271074279SAT 0.644901 0.657307
cpHydra k_401074295SAT 0.668897 0.679062
Mistral-option 1.3141074288SAT 1.02184 1.03945
mddc-solv 2008-06-091074276SAT 1.06084 1.07283
spider 2008-06-141074277SAT 1.58876 1.60847
MDG-probe 2008-06-271074278SAT 1.66875 1.6905
Abscon 112v4 AC1074292SAT 2.01369 2.04614
Abscon 112v4 ESAC1074293SAT 2.10468 2.15102
choco2_impwdeg 2008-06-261074284SAT 4.30035 4.39337
choco2_dwdeg 2008-06-261074285SAT 4.89225 4.96574
Minion/Tailor 2008-07-041106049SAT 5.34019 5.45803
casper zito1074291SAT 5.44817 6.75099
Sugar v1.13+picosat1074281SAT 7.93979 8.14671
Sugar v1.13+minisat1074282SAT 8.68868 8.8878
galac E1074287SAT 11.2083 11.3414
galac M1074286SAT 11.4783 11.6596
bpsolver 2008-06-271074283SAT 15.9876 16.1397
casper zao1074290SAT 22.6816 22.8989
Concrete + CPS4J 2008-05-301074275SAT 67.6587 67.7091
Concrete + CSP4J - Tabu Engine 2008-05-301074273SAT 877.011 878.712
SAT4J CSP 2008-06-131074280? 49.9004 48.0121
Concrete + CSP4J - WMC Engine 2008-05-301074274? (TO) 1800.02 1816.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 4 8 0 0 0 3 0 1 1 0 0 3 1 0 0 0 1 2 2 0 1 1 6 1 4 0 0 0 1 0 3 0 0 1 2 1 1 2 0 0 1 1 1 0 0 0 0 3 1 1 1 1 1 10 1 0 0 1 0 1 3 1 1 3 0 0 1 2
0 9 3 3 4 0 0 0 0 1 1 0 4 0 0 1 1 0 0 0 0 0 0 0 0 1 2 8 1 0 1 5 6 7 3 3 2 6