CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhSat/
normalized-jnh213_ext.xml
MD5SUM5d88b1d1cebac19829a029f53b9af5f8
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.032994
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-prime 1.3131046921SAT 0.032994 0.0332839
Mistral-option 1.3141046920SAT 0.033994 0.033685
MDG-noprobe 2008-06-271046911SAT 0.033994 0.034151
MDG-probe 2008-06-271046910SAT 0.034994 0.035537
cpHydra k_101046926SAT 0.042992 0.0433229
cpHydra k_401046927SAT 0.042993 0.042885
casper zito1046923SAT 0.081987 0.0871211
spider 2008-06-141046909SAT 0.145977 0.14805
bpsolver 2008-06-271046915SAT 0.164974 0.16618
casper zao1046922SAT 0.175973 0.176079
mddc-solv 2008-06-091046908SAT 0.483925 0.484558
Concrete + CPS4J 2008-05-301046907SAT 0.681895 0.583984
Concrete + CSP4J - Tabu Engine 2008-05-301046905SAT 0.749885 0.793874
Minion/Tailor 2008-07-041105086SAT 0.808877 0.818985
Concrete + CSP4J - WMC Engine 2008-05-301046906SAT 0.856869 0.826569
choco2_dwdeg 2008-06-261046917SAT 0.994848 0.878039
choco2_impwdeg 2008-06-261046916SAT 0.998847 1.02408
Sugar v1.13+minisat1046914SAT 0.999847 0.807069
Sugar v1.13+picosat1046913SAT 1.00385 0.819492
Abscon 112v4 AC1046924SAT 1.05284 0.836453
Abscon 112v4 ESAC1046925SAT 1.05984 0.896903
SAT4J CSP 2008-06-131046912SAT 1.62075 1.13785
galac M1046918SAT 4.5983 4.44565
galac E1046919SAT 4.70328 4.5949

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