CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-10-20/
normalized-composed-25-10-20-5_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-10-20/
normalized-composed-25-10-20-5_ext.xml
MD5SUM80cc978ba841a78be9434244930a6f7e
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.047992
Satisfiable
(Un)Satisfiability was proved
Number of variables105
Number of constraints620
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension620
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.3131099313SAT 0.047992 0.0482379
MDG-noprobe 2008-06-271099303SAT 0.050991 0.0572719
MDG-probe 2008-06-271099302SAT 0.052991 0.0606201
cpHydra k_401099319SAT 0.06299 0.0685969
cpHydra k_101099318SAT 0.06299 0.0691339
Mistral-option 1.3141099312SAT 0.063989 0.0650201
spider 2008-06-141099301SAT 0.119981 0.127691
casper zito1099315SAT 0.640901 0.648847
Concrete + CPS4J 2008-05-301099300SAT 0.743886 0.787859
Concrete + CSP4J - WMC Engine 2008-05-301099299SAT 0.751884 0.784854
Minion/Tailor 2008-07-041105398SAT 0.764883 0.823868
Concrete + CSP4J - Tabu Engine 2008-05-301099298SAT 0.793878 0.851497
choco2_impwdeg 2008-06-261099308SAT 0.852869 0.889631
choco2_dwdeg 2008-06-261099309SAT 0.895862 0.943139
Abscon 112v4 AC1099316SAT 0.98285 1.04912
Abscon 112v4 ESAC1099317SAT 1.13083 1.30503
Sugar v1.13+picosat1099305SAT 1.34579 1.52889
Sugar v1.13+minisat1099306SAT 1.56676 1.66252
bpsolver 2008-06-271099307SAT 1.58976 1.61457
casper zao1099314SAT 1.9357 1.95528
galac M1099310SAT 2.30765 2.39383
galac E1099311SAT 2.49862 2.57876
SAT4J CSP 2008-06-131099304SAT 2.99154 2.55528

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:
3 1 0 1 5 0 5 1 6 0 1 6 4 0 8 2 2 0 3 0 6 9 0 0 6 0 1 1 3 3 4 1 9 2 9 2 8 8 9 8 8 9 0 0 5 0 5 2 4 8 0 8 2 4 3 3 5 4 5 5 7 7 1 4 9 3 8 6 4 1
2 7 7 7 1 0 6 3 4 4 9 3 6 6 2 4 2 0 7 1 0 9 8 0 6 4 4 4 8 0 0 9 3 2 0