CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/insertion/k-insertion/
normalized-4-insertions-3-4.xml

General information on the benchmark

Name	csp/graphColoring/insertion/k-insertion/ normalized-4-insertions-3-4.xml
MD5SUM	ce3da2ca24778425aa8006ff19819a18
Bench Category	2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.010997
Satisfiable
(Un)Satisfiability was proved
Number of variables	79
Number of constraints	156
Maximum constraint arity	2
Maximum domain size	4
Number of constraints which are defined in extension	0
Number of constraints which are defined in intension	156
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver Name	TraceID	Answer	CPU time	Wall clock time
Mistral-prime 1.313	1091029	SAT	0.010997	0.0184431
Mistral-option 1.314	1091028	SAT	0.010997	0.0194779
MDG-noprobe 2008-06-27	1091019	SAT	0.011997	0.0187261
casper zito	1091031	SAT	0.012997	0.0219251
MDG-probe 2008-06-27	1091018	SAT	0.013997	0.0193721
casper zao	1091030	SAT	0.019996	0.028722
cpHydra k_10	1091034	SAT	0.023995	0.030911
cpHydra k_40	1091035	SAT	0.023995	0.030137
bpsolver 2008-06-27	1091023	SAT	0.049992	0.062087
Minion/Tailor 2008-07-04	1105677	SAT	0.499923	0.554208
Concrete + CPS4J 2008-05-30	1091017	SAT	0.796878	0.859942
Sugar v1.13+picosat	1091021	SAT	0.797878	0.875463
Concrete + CSP4J - WMC Engine 2008-05-30	1091016	SAT	0.806877	0.862816
Abscon 112v4 ESAC	1091033	SAT	0.834872	0.835549
choco2_dwdeg 2008-06-26	1091025	SAT	0.865867	0.902765
choco2_impwdeg 2008-06-26	1091024	SAT	0.871866	0.896945
Sugar v1.13+minisat	1091022	SAT	0.886864	0.950117
Concrete + CSP4J - Tabu Engine 2008-05-30	1091015	SAT	0.908861	0.966592
Abscon 112v4 AC	1091032	SAT	0.948855	0.99215
galac E	1091027	SAT	1.3078	1.38557
galac M	1091026	SAT	1.3478	1.37839
SAT4J CSP 2008-06-13	1091020	SAT	1.34879	1.39025

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

CSP 2008 Competition: solvers results per benchmarks

Result page for benchmarkcsp/graphColoring/insertion/k-insertion/normalized-4-insertions-3-4.xml

General information on the benchmark

Results of the different solvers on this benchmark

Additionnal information

Result page for benchmark
csp/graphColoring/insertion/k-insertion/
normalized-4-insertions-3-4.xml