CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhSat/
normalized-jnh207_ext.xml
MD5SUM85848f7864c248de5063f96edd2fdb35
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.039993
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
MDG-probe 2008-06-271046864SAT 0.032994 0.033024
Mistral-prime 1.3131046875SAT 0.039993 0.0406441
Mistral-option 1.3141046874SAT 0.042993 0.0439351
MDG-noprobe 2008-06-271046865SAT 0.043992 0.0454191
cpHydra k_101046880SAT 0.050992 0.050559
cpHydra k_401046881SAT 0.05399 0.057782
casper zito1046877SAT 0.146976 0.150606
casper zao1046876SAT 0.247961 0.250693
spider 2008-06-141046863SAT 0.286956 0.307362
mddc-solv 2008-06-091046862SAT 0.514921 0.51482
bpsolver 2008-06-271046869SAT 0.597908 0.598418
Concrete + CPS4J 2008-05-301046861SAT 0.643901 0.570749
Concrete + CSP4J - WMC Engine 2008-05-301046860SAT 0.691894 0.581288
Minion/Tailor 2008-07-041105084SAT 0.873866 0.890261
Sugar v1.13+minisat1046868SAT 0.994848 1.0121
Sugar v1.13+picosat1046867SAT 0.995847 0.880406
Abscon 112v4 ESAC1046879SAT 1.00285 0.836366
Abscon 112v4 AC1046878SAT 1.3358 1.1478
choco2_dwdeg 2008-06-261046871SAT 1.3408 1.18753
Concrete + CSP4J - Tabu Engine 2008-05-301046859SAT 1.43978 1.51829
choco2_impwdeg 2008-06-261046870SAT 1.47677 1.5855
SAT4J CSP 2008-06-131046866SAT 1.84872 1.29084
galac M1046872SAT 4.67529 4.40995
galac E1046873SAT 4.71928 4.53086

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