CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/modifiedRenault/
normalized-renault-mod-44_ext.xml
MD5SUMbaa9062d7eb04ea7e8c7179e96e4e434
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.550915
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.3131073875SAT 0.550915 0.550845
cpHydra k_101073880SAT 0.562913 0.570259
MDG-probe 2008-06-271073864SAT 0.579911 0.588494
MDG-noprobe 2008-06-271073865SAT 0.599907 0.609948
cpHydra k_401073881SAT 0.602907 0.609843
Mistral-option 1.3141073874SAT 0.722889 0.728735
mddc-solv 2008-06-091073862SAT 1.04684 1.0576
spider 2008-06-141073863SAT 1.40079 1.41689
Abscon 112v4 AC1073878SAT 1.74973 1.78113
Abscon 112v4 ESAC1073879SAT 1.77573 1.83055
choco2_impwdeg 2008-06-261073870SAT 4.26735 4.33369
choco2_dwdeg 2008-06-261073871SAT 4.50031 4.59739
casper zito1073877SAT 5.18321 5.23881
Minion/Tailor 2008-07-041106045SAT 5.98909 6.07543
Sugar v1.13+minisat1073868SAT 7.12292 7.5409
Sugar v1.13+picosat1073867SAT 7.82281 8.00726
galac M1073872SAT 10.6254 10.7552
galac E1073873SAT 12.3371 12.5038
bpsolver 2008-06-271073869SAT 15.2027 15.2767
casper zao1073876SAT 46.8789 47.1225
Concrete + CPS4J 2008-05-301073861SAT 68.7086 68.7556
Concrete + CSP4J - Tabu Engine 2008-05-301073859SAT 95.7744 95.9837
SAT4J CSP 2008-06-131073866? 78.757 76.7759
Concrete + CSP4J - WMC Engine 2008-05-301073860? (TO) 1800.04 1816.32

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