CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/insertion/full-insertion/
normalized-1-fullins-4-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/insertion/full-insertion/
normalized-1-fullins-4-4.xml
MD5SUM7e376cea6b367ff2f285c56563e4511c
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.039993
Satisfiable
(Un)Satisfiability was proved
Number of variables93
Number of constraints593
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension593
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131090609UNSAT 0.039993 0.047808
Mistral-option 1.3141090608UNSAT 0.046992 0.0525599
MDG-noprobe 2008-06-271090599UNSAT 0.050991 0.0574719
cpHydra k_101090614UNSAT 0.058991 0.0658681
cpHydra k_401090615UNSAT 0.05999 0.066788
MDG-probe 2008-06-271090598UNSAT 0.160974 0.170305
Minion/Tailor 2008-07-041105656UNSAT 0.644901 0.679757
Sugar v1.13+minisat1090602UNSAT 1.12683 1.19684
galac M1090606UNSAT 1.15782 1.22974
galac E1090607UNSAT 1.24881 1.28165
Sugar v1.13+picosat1090601UNSAT 1.26681 1.35868
Concrete + CPS4J 2008-05-301090597UNSAT 1.2968 1.3638
Abscon 112v4 AC1090612UNSAT 1.3158 1.35859
Abscon 112v4 ESAC1090613UNSAT 1.37079 1.40926
choco2_impwdeg 2008-06-261090604UNSAT 2.06569 2.09653
choco2_dwdeg 2008-06-261090605UNSAT 2.06869 2.09912
SAT4J CSP 2008-06-131090600UNSAT 2.50662 2.59458
casper zao1090610UNSAT 23.0185 23.2215
casper zito1090611UNSAT 32.2591 32.2724
bpsolver 2008-06-271090603? (TO) 1800.05 1803.61
Concrete + CSP4J - WMC Engine 2008-05-301090596? (TO) 1800.06 1802.42
Concrete + CSP4J - Tabu Engine 2008-05-301090595? (TO) 1800.09 1801.92

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: