CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhSat/
normalized-jnh205_ext.xml
MD5SUMdae9a600448f80d730be2e6ff52f4e16
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.035993
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.3141046736SAT 0.035993 0.0375821
MDG-noprobe 2008-06-271046727SAT 0.035993 0.0347001
Mistral-prime 1.3131046737SAT 0.036993 0.042973
cpHydra k_401046743SAT 0.048992 0.0483
cpHydra k_101046742SAT 0.049992 0.121106
casper zito1046739SAT 0.068988 0.0687381
MDG-probe 2008-06-271046726SAT 0.116981 0.116988
casper zao1046738SAT 0.138978 0.139398
bpsolver 2008-06-271046731SAT 0.177972 0.178265
spider 2008-06-141046725SAT 0.25496 0.255758
mddc-solv 2008-06-091046724SAT 0.495923 0.499625
Concrete + CSP4J - Tabu Engine 2008-05-301046721SAT 0.771881 0.707511
Concrete + CPS4J 2008-05-301046723SAT 0.78488 0.707682
Concrete + CSP4J - WMC Engine 2008-05-301046722SAT 0.901862 0.817429
Sugar v1.13+picosat1046729SAT 0.988848 0.810852
Minion/Tailor 2008-07-041105078SAT 1.00585 1.06636
Sugar v1.13+minisat1046730SAT 1.00784 1.14112
Abscon 112v4 AC1046740SAT 1.13283 0.946644
choco2_dwdeg 2008-06-261046733SAT 1.17982 1.04379
Abscon 112v4 ESAC1046741SAT 1.19982 1.05258
choco2_impwdeg 2008-06-261046732SAT 1.25081 1.15191
SAT4J CSP 2008-06-131046728SAT 1.69574 1.2047
galac E1046735SAT 4.64829 5.41082
galac M1046734SAT 4.73128 4.85592

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