2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Rcpsp/Rcpsp-m1-j60/
Rcpsp-j60-36-08.xml

Jump to solvers results

General information on the benchmark

NameRcpsp/Rcpsp-m1-j60/
Rcpsp-j60-36-08.xml
MD5SUM0b1e0c7924bcaa294ffaf4f952f89b7c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark69
Best CPU time to get the best result obtained on this benchmark0.78407902
Satisfiable
(Un)Satisfiability was proved
Number of variables62
Number of constraints135
Number of domains2
Minimum domain size1
Maximum domain size335
Distribution of domain sizes[{"size":1,"count":1},{"size":335,"count":61}]
Minimum variable degree3
Maximum variable degree7
Distribution of variable degrees[{"degree":3,"count":1},{"degree":4,"count":4},{"degree":5,"count":43},{"degree":6,"count":9},{"degree":7,"count":5}]
Minimum constraint arity2
Maximum constraint arity19
Distribution of constraint arities[{"arity":2,"count":131},{"arity":10,"count":1},{"arity":14,"count":1},{"arity":17,"count":1},{"arity":19,"count":1}]
Number of extensional constraints0
Number of intensional constraints131
Distribution of constraint types[{"type":"intension","count":131},{"type":"cumulative","count":4}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2017-07-28 (complete)4259217OPT69 0.78407902 0.86245698
choco-solver 4.0.5 seq (2017-08-18) (complete)4282991OPT69 1.29294 0.61367798
choco-solver 4.0.5 seq (2017-08-09) (complete)4270241OPT69 1.30476 0.66114599
choco-solver 4.0.5 seq (2017-07-26) (complete)4254247OPT69 1.31247 0.74544799
choco-solver 5a (2017-08-18) (complete)4284461OPT69 1.35952 0.643803
choco-solver 5a (2017-07-26) (complete)4255241OPT69 1.37528 0.77804798
choco-solver 4.0.5 par (2017-08-18) (complete)4281521OPT69 2.12275 0.82038599
choco-solver 4.0.5 par (2017-07-26) (complete)4254744OPT69 2.18402 0.88200998
choco-solver 4.0.5 par (2017-08-09) (complete)4271711OPT69 2.2088499 0.78166199
OscaR - Conflict Ordering 2017-07-26 (complete)4256235OPT69 2.6243401 1.34567
OscaR - Hybrid 2017-07-26 (complete)4256732OPT69 2.7171099 1.3689899
OscaR - Parallel with EPS 2017-07-26 (complete)4257229OPT69 10.8472 3.8055301
Concrete 3.4 (complete)4259714OPT69 11.836 5.3304601
OscaR - Parallel with EPS 2017-08-22 (complete)4285931OPT69 11.9212 3.9166999
OscaR - ALNS 2017-07-26 (complete)4255738SAT (TO)69 246.65199 240.013
sat4j-CSP 2017-07-05 (complete)4258223? 19.507099 8.0172796
cosoco-sat 1.12 (complete)4266840? (NS) 0.145512 0.146616
cosoco 1.1 (complete)4258720? (NS) 0.145606 0.20299999
cosoco 1.12 (complete)4268771? (NS) 0.16310699 0.16433699
AbsCon-basic 2017-06-11 (complete)4257726? (NS) 1.28377 0.83359897

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function: 69
Solution found:
<instantiation type="optimum" cost="69"> <list> s[0] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] s[15] s[16]
s[17] s[18] s[19] s[20] s[21] s[22] s[23] s[24] s[25] s[26] s[27] s[28] s[29] s[30] s[31] s[32] s[33] s[34] s[35] s[36] s[37] s[38] s[39]
s[40] s[41] s[42] s[43] s[44] s[45] s[46] s[47] s[48] s[49] s[50] s[51] s[52] s[53] s[54] s[55] s[56] s[57] s[58] s[59] s[60] s[61] </list>
<values> 0 0 0 0 3 5 6 6 9 6 9 17 17 6 12 11 19 12 13 27 12 22 20 20 22 27 23 11 18 21 28 36 8 13 32 19 38 15 37 37 23 31 31 33 35 48 42 47
40 32 54 57 42 49 57 52 33 45 60 62 47 69 </values> </instantiation>