CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhSat/
normalized-jnh217_ext.xml
MD5SUMdb8816e6feee23a6dd2fe450db19b5e1
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.033994
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.3131046576SAT 0.033994 0.034178
cpHydra k_101046581SAT 0.042993 0.053654
Mistral-option 1.3141046575SAT 0.043992 0.0455349
MDG-noprobe 2008-06-271046566SAT 0.043992 0.102913
cpHydra k_401046582SAT 0.043992 0.0506061
casper zito1046578SAT 0.05999 0.061006
MDG-probe 2008-06-271046565SAT 0.077987 0.078445
casper zao1046577SAT 0.100984 0.107693
spider 2008-06-141046564SAT 0.12298 0.143563
bpsolver 2008-06-271046570SAT 0.262959 0.266264
mddc-solv 2008-06-091046563SAT 0.494924 0.517094
Concrete + CSP4J - Tabu Engine 2008-05-301046560SAT 0.741886 0.924214
Minion/Tailor 2008-07-041105071SAT 0.747886 0.798639
Concrete + CSP4J - WMC Engine 2008-05-301046561SAT 0.788879 0.855829
choco2_dwdeg 2008-06-261046572SAT 0.918859 0.782402
choco2_impwdeg 2008-06-261046571SAT 0.947854 0.856426
Sugar v1.13+picosat1046568SAT 0.98385 1.11895
Sugar v1.13+minisat1046569SAT 1.00985 1.06411
Abscon 112v4 AC1046579SAT 1.09183 0.937972
Abscon 112v4 ESAC1046580SAT 1.10183 0.887265
Concrete + CPS4J 2008-05-301046562SAT 1.16382 1.1412
SAT4J CSP 2008-06-131046567SAT 1.62375 1.14562
galac E1046574SAT 4.5763 5.42661
galac M1046573SAT 4.5803 4.52317

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