CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-1-2/
normalized-composed-25-1-2-0_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-2/
normalized-composed-25-1-2-0_ext.xml
MD5SUMfca88d7e989b0b88b55bfd7946a8a8b5
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.019996
Satisfiable
(Un)Satisfiability was proved
Number of variables33
Number of constraints224
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension224
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.3131098103UNSAT 0.019996 0.0205661
MDG-noprobe 2008-06-271098093UNSAT 0.020995 0.027994
Mistral-option 1.3141098102UNSAT 0.021996 0.0221541
casper zito1098105UNSAT 0.029995 0.0370989
cpHydra k_101098108UNSAT 0.032994 0.0446721
cpHydra k_401098109UNSAT 0.032994 0.0348649
spider 2008-06-141098091UNSAT 0.034993 0.044009
casper zao1098104UNSAT 0.040993 0.0439011
MDG-probe 2008-06-271098092UNSAT 0.049991 0.0570311
bpsolver 2008-06-271098097UNSAT 0.163974 0.170185
Minion/Tailor 2008-07-041105405UNSAT 0.506922 0.565587
Concrete + CPS4J 2008-05-301098090UNSAT 0.567913 0.587207
choco2_dwdeg 2008-06-261098099UNSAT 0.605906 0.622655
choco2_impwdeg 2008-06-261098098UNSAT 0.694894 0.730803
Abscon 112v4 AC1098106UNSAT 0.801877 0.838767
Abscon 112v4 ESAC1098107UNSAT 0.833872 0.897347
galac M1098100UNSAT 0.917859 0.945052
Sugar v1.13+minisat1098096UNSAT 0.944856 1.06901
galac E1098101UNSAT 0.964852 1.01666
Sugar v1.13+picosat1098095UNSAT 1.12183 1.20166
SAT4J CSP 2008-06-131098094UNSAT 1.63575 1.66939
Concrete + CSP4J - Tabu Engine 2008-05-301098088? (TO) 1800 1802.02
Concrete + CSP4J - WMC Engine 2008-05-301098089? (TO) 1800 1802.62

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: