CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/schurrLemma/
normalized-lemma-23-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/schurrLemma/
normalized-lemma-23-3.xml
MD5SUMadd801ab5f2b5db29fddde7dd0b9c1f1
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.011997
Satisfiable
(Un)Satisfiability was proved
Number of variables23
Number of constraints121
Maximum constraint arity3
Maximum domain size3
Number of constraints which are defined in extension0
Number of constraints which are defined in intension121
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271048110SAT 0.011997 0.018423
cpHydra k_401048126SAT 0.023996 0.030509
cpHydra k_101048125SAT 0.023996 0.0304989
Mistral-option 1.3141048119SAT 0.029994 0.0351319
casper zito1048122SAT 0.048992 0.0605581
MDG-probe 2008-06-271048109SAT 0.052991 0.0597409
bpsolver 2008-06-271048114SAT 0.05799 0.0645689
casper zao1048121SAT 0.06099 0.0672539
Mistral-prime 1.3131048120SAT 0.069989 0.0748671
choco2_impwdeg 2008-06-261048115SAT 0.679896 0.727926
Minion/Tailor 2008-07-041104814SAT 0.681895 0.705451
choco2_dwdeg 2008-06-261048116SAT 0.788879 0.840396
Concrete + CSP4J - WMC Engine 2008-05-301048107SAT 0.798878 0.862074
Sugar v1.13+minisat1048113SAT 0.837871 0.929175
Abscon 112v4 ESAC1048124SAT 0.84587 0.897361
Abscon 112v4 AC1048123SAT 0.866867 0.886446
Sugar v1.13+picosat1048112SAT 0.874866 0.944197
Concrete + CSP4J - Tabu Engine 2008-05-301048106SAT 0.887864 0.90925
Concrete + CPS4J 2008-05-301048108SAT 0.911861 0.961502
galac M1048117SAT 1.14982 0.932471
galac E1048118SAT 1.23481 1.32565
SAT4J CSP 2008-06-131048111SAT 1.90971 2.10892

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