CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/jnhSat/
normalized-jnh204_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/jnhSat/
normalized-jnh204_ext.xml
MD5SUM8fc4c722830724ab4f6bba2f8ce24b53
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.049992
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints800
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension800
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.3131046599SAT 0.049992 0.0505691
cpHydra k_401046605SAT 0.06099 0.062025
cpHydra k_101046604SAT 0.06199 0.0609849
MDG-noprobe 2008-06-271046589SAT 0.065989 0.0708889
Mistral-option 1.3141046598SAT 0.098984 0.107244
casper zito1046601SAT 0.214967 0.218485
casper zao1046600SAT 0.267958 0.269285
spider 2008-06-141046587SAT 0.269958 0.326586
MDG-probe 2008-06-271046588SAT 0.315951 0.316487
mddc-solv 2008-06-091046586SAT 0.623904 0.626249
Sugar v1.13+minisat1046592SAT 0.985849 0.911957
Concrete + CSP4J - Tabu Engine 2008-05-301046583SAT 1.12983 1.12568
Minion/Tailor 2008-07-041105072SAT 1.17182 1.21348
Sugar v1.13+picosat1046591SAT 1.17282 1.2091
bpsolver 2008-06-271046593SAT 1.19282 1.21456
Abscon 112v4 AC1046602SAT 1.21481 0.991914
Abscon 112v4 ESAC1046603SAT 1.24881 1.04248
Concrete + CSP4J - WMC Engine 2008-05-301046584SAT 1.44478 1.36954
Concrete + CPS4J 2008-05-301046585SAT 1.54976 1.62347
choco2_impwdeg 2008-06-261046594SAT 1.74973 1.63444
SAT4J CSP 2008-06-131046590SAT 1.78773 1.31614
choco2_dwdeg 2008-06-261046595SAT 2.05469 1.87525
galac M1046596SAT 7.13491 7.6044
galac E1046597SAT 7.2299 7.63524

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 1 0 1 0 1 1 0 0 0 1 0 0 1 1 1 0 0 0 0 1 1 1 1 1 0 0 1 0 0 0 1 0 0 0 1 0 0 1 1 1 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 0 1 1 0 1 1 0 1 1 0 1
1 0 1 0 1 1 1 1 0 0 1 1 1 0 1 0 0 0 0 0 1 1 1 1 0 1 1 0 1 0