CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/jnhUnsat/
normalized-jnh04_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/jnhUnsat/
normalized-jnh04_ext.xml
MD5SUMd81a4f28fa82d2d233a0f92a9091b666
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.042993
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints850
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension850
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-noprobe 2008-06-271066179UNSAT 0.042993 0.044104
Mistral-prime 1.3131066189UNSAT 0.043993 0.049176
Mistral-option 1.3141066188UNSAT 0.046992 0.0543019
cpHydra k_101066194UNSAT 0.048992 0.054642
cpHydra k_401066195UNSAT 0.053991 0.0603929
casper zito1066191UNSAT 0.060989 0.067087
casper zao1066190UNSAT 0.087986 0.0938021
spider 2008-06-141066177UNSAT 0.282956 0.297473
MDG-probe 2008-06-271066178UNSAT 0.288955 0.296971
mddc-solv 2008-06-091066176UNSAT 0.554915 0.560455
bpsolver 2008-06-271066183UNSAT 0.607907 0.612292
Minion/Tailor 2008-07-041105802UNSAT 0.71589 0.752659
choco2_dwdeg 2008-06-261066185UNSAT 0.809876 0.839026
choco2_impwdeg 2008-06-261066184UNSAT 0.884864 0.944954
Concrete + CPS4J 2008-05-301066175UNSAT 0.970851 1.00027
Sugar v1.13+picosat1066181UNSAT 1.24181 1.49556
Abscon 112v4 ESAC1066193UNSAT 1.3048 1.35597
Sugar v1.13+minisat1066182UNSAT 1.3158 1.39477
Abscon 112v4 AC1066192UNSAT 1.38779 1.41596
SAT4J CSP 2008-06-131066180UNSAT 1.64075 1.74309
galac E1066187UNSAT 4.18036 4.23639
galac M1066186UNSAT 4.29435 4.57951
Concrete + CSP4J - Tabu Engine 2008-05-301066173? (TO) 1800.07 1801.62
Concrete + CSP4J - WMC Engine 2008-05-301066174? (TO) 1800.09 1811.92

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: