CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/niklas/
normalized-lseu.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/niklas/
normalized-lseu.xml
MD5SUMdcc3715e7cca48c1419f9fead500680f
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.019996
Satisfiable
(Un)Satisfiability was proved
Number of variables89
Number of constraints28
Maximum constraint arity47
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension28
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271062591SAT 0.019996 0.026919
Mistral-prime 1.3131062601SAT 0.020996 0.0278779
Mistral-option 1.3141062600SAT 0.027995 0.033093
cpHydra k_401062607SAT 0.030995 0.0393751
MDG-probe 2008-06-271062590SAT 0.032994 0.0384789
cpHydra k_101062606SAT 0.032994 0.0394509
bpsolver 2008-06-271062595SAT 0.052991 0.064988
casper zao1062602SAT 0.090985 0.0921091
casper zito1062603SAT 0.109982 0.11881
Minion/Tailor 2008-07-041106530SAT 0.539917 0.601985
choco2_dwdeg 2008-06-261062597SAT 0.680895 0.736392
choco2_impwdeg 2008-06-261062596SAT 0.859868 0.900604
Abscon 112v4 AC1062604SAT 1.35379 1.30696
Abscon 112v4 ESAC1062605SAT 1.48477 1.52328
Sugar v1.13+minisat1062594SAT 36.2645 36.9416
Concrete + CPS4J 2008-05-301062589SAT 68.2786 68.672
Sugar v1.13+picosat1062593SAT 156.611 159.442
Concrete + CSP4J - WMC Engine 2008-05-301062588SAT 1001.18 1009.99
galac M1062598? (TO) 1800.02 1825.93
Concrete + CSP4J - Tabu Engine 2008-05-301062587? (TO) 1800.03 1806.02
galac E1062599? (TO) 1800.05 1818.43
SAT4J CSP 2008-06-131062592? (TO) 1800.16 1802.29

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