CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhSat/
normalized-jnh218_ext.xml
MD5SUM2a230a97bbf60a6b498cbd1adc1d9a37
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.034994
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints797
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension797
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-option 1.3141046897SAT 0.034994 0.0350051
Mistral-prime 1.3131046898SAT 0.035994 0.0352371
MDG-probe 2008-06-271046887SAT 0.040993 0.040533
MDG-noprobe 2008-06-271046888SAT 0.040993 0.0423829
cpHydra k_401046904SAT 0.044993 0.0456131
cpHydra k_101046903SAT 0.045992 0.0621519
casper zito1046900SAT 0.073988 0.0770461
spider 2008-06-141046886SAT 0.137978 0.139122
casper zao1046899SAT 0.150976 0.153173
bpsolver 2008-06-271046892SAT 0.205968 0.206697
mddc-solv 2008-06-091046885SAT 0.499923 0.498536
Concrete + CSP4J - Tabu Engine 2008-05-301046882SAT 0.684895 0.64285
Concrete + CPS4J 2008-05-301046884SAT 0.691894 0.582712
Concrete + CSP4J - WMC Engine 2008-05-301046883SAT 0.751885 0.656491
Minion/Tailor 2008-07-041105085SAT 0.788879 0.657542
choco2_impwdeg 2008-06-261046893SAT 0.841871 0.723883
Sugar v1.13+picosat1046890SAT 0.990848 0.852276
Sugar v1.13+minisat1046891SAT 1.01684 1.0157
Abscon 112v4 AC1046901SAT 1.05484 0.889099
choco2_dwdeg 2008-06-261046894SAT 1.07084 0.920355
Abscon 112v4 ESAC1046902SAT 1.09983 1.01345
SAT4J CSP 2008-06-131046889SAT 1.65675 1.19989
galac E1046896SAT 4.66029 4.41243
galac M1046895SAT 4.75328 4.63596

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