2018 XCSP3 competition: mini-solvers track: solvers results per benchmarks

Result page for benchmark
Fapp/Fapp-ext/
Fapp-ext-ex2_c18.xml

Jump to solvers results

General information on the benchmark

NameFapp/Fapp-ext/
Fapp-ext-ex2_c18.xml
MD5SUM35250c351d5ebdba5de0833aa33cbdb5
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark13871
Best CPU time to get the best result obtained on this benchmark0.547296
Satisfiable
(Un)Satisfiability was proved
Number of variables61
Number of constraints34
Number of domains13
Minimum domain size1
Maximum domain size100
Distribution of domain sizes[{"size":1,"count":2},{"size":2,"count":21},{"size":6,"count":2},{"size":8,"count":1},{"size":11,"count":14},{"size":12,"count":1},{"size":16,"count":2},{"size":26,"count":1},{"size":65,"count":1},{"size":76,"count":4},{"size":100,"count":12}]
Minimum variable degree2
Maximum variable degree15
Distribution of variable degrees[{"degree":2,"count":45},{"degree":3,"count":4},{"degree":4,"count":6},{"degree":5,"count":4},{"degree":6,"count":1},{"degree":15,"count":1}]
Minimum constraint arity2
Maximum constraint arity6
Distribution of constraint arities[{"arity":2,"count":6},{"arity":3,"count":14},{"arity":6,"count":14}]
Number of extensional constraints34
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":34}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 1.12 (complete)4298990OPT13871 0.547296 0.548239
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4298994OPT13871 4.73809 2.4695
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4298995SAT13871 305.115 300.759
slowpoke 2018-04-29 (incomplete)4298993SAT (TO)13871 2520.05 2515.02
MiniCPFever 2018-04-29 (complete)4298992SAT (TO)13871 2520.06 2497.03
GG's minicp 2018-04-29 (complete)4298991SAT (TO)13871 2520.06 2509.73
The dodo solver 2018-04-29 (complete)4298996SAT (TO)13871 2520.07 2513.62

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: 13871
Solution found:
<instantiation type='solution' cost='13871'> <list>d[0] d[10] d[11] d[12] d[13] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] f[0] f[1] f[2]
f[3] f[4] f[5] f[6] f[7] f[8] k p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] v1[0] v1[10] v1[11] v1[12] v1[13] v1[1] v1[2] v1[3] v1[4] v1[5]
v1[6] v1[7] v1[8] v1[9] v2[0] v2[10] v2[11] v2[12] v2[13] v2[1] v2[2] v2[3] v2[4] v2[5] v2[6] v2[7] v2[8] v2[9] </list> <values>36 39 80 60
20 30 34 69 30 33 66 35 10 99 31 31 67 65 100 1 55 81 61 7 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 2 0 0 0 0 0 0 3 6 0 0 0 0 0
</values> </instantiation>