CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhSat/
normalized-jnh209_ext.xml
MD5SUM00261cf6827ef210e8e5d161e5a112d3
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.031994
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-option 1.3141046805SAT 0.031994 0.0329131
MDG-noprobe 2008-06-271046796SAT 0.036993 0.037183
Mistral-prime 1.3131046806SAT 0.037993 0.0380829
cpHydra k_101046811SAT 0.046992 0.048355
cpHydra k_401046812SAT 0.052991 0.130652
MDG-probe 2008-06-271046795SAT 0.064989 0.0711019
casper zito1046808SAT 0.092985 0.105989
casper zao1046807SAT 0.152975 0.188208
bpsolver 2008-06-271046800SAT 0.19197 0.215959
spider 2008-06-141046794SAT 0.477927 0.494821
mddc-solv 2008-06-091046793SAT 0.51792 0.523108
Concrete + CPS4J 2008-05-301046792SAT 0.745885 0.626808
Minion/Tailor 2008-07-041105081SAT 0.756884 0.772261
Concrete + CSP4J - WMC Engine 2008-05-301046791SAT 0.771881 0.676579
Sugar v1.13+minisat1046799SAT 0.989849 0.850843
Sugar v1.13+picosat1046798SAT 1.02584 0.984206
choco2_dwdeg 2008-06-261046802SAT 1.06184 0.881969
Abscon 112v4 ESAC1046810SAT 1.23481 1.30865
choco2_impwdeg 2008-06-261046801SAT 1.28081 1.3188
Abscon 112v4 AC1046809SAT 1.41878 1.48543
SAT4J CSP 2008-06-131046797SAT 1.81972 1.23387
Concrete + CSP4J - Tabu Engine 2008-05-301046790SAT 1.9507 1.8864
galac E1046804SAT 4.48232 4.39455
galac M1046803SAT 4.54331 4.27029

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