2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
PizzaVoucher/
PizzaVoucher-15a_c18.xml

Jump to solvers results

General information on the benchmark

NamePizzaVoucher/
PizzaVoucher-15a_c18.xml
MD5SUMa75ea741f9764b89989098c28f8006bf
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark42
Best CPU time to get the best result obtained on this benchmark252.115
Satisfiable
(Un)Satisfiability was proved
Number of variables56
Number of constraints154
Number of domains19
Minimum domain size1
Maximum domain size27
Distribution of domain sizes[{"size":1,"count":2},{"size":2,"count":31},{"size":3,"count":4},{"size":4,"count":2},{"size":5,"count":1},{"size":7,"count":1},{"size":27,"count":15}]
Minimum variable degree2
Maximum variable degree41
Distribution of variable degrees[{"degree":2,"count":41},{"degree":40,"count":10},{"degree":41,"count":5}]
Minimum constraint arity2
Maximum constraint arity16
Distribution of constraint arities[{"arity":2,"count":128},{"arity":16,"count":26}]
Number of extensional constraints0
Number of intensional constraints128
Distribution of constraint types[{"type":"intension","count":128},{"type":"count","count":26}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2018-08-01 (complete)4312619SAT (TO)42 251.96 252.01
Concrete 3.9.2 (complete)4302381SAT (TO)42 252.115 237.945
Sat4j-CSP 2018-07-11 (complete)4301760SAT (TO)42 252.384 248.497
Concrete 3.9.2-SuperNG (complete)4302731SAT (TO)43 252.142 238.145
Choco-solver 4.0.7b seq (e747e1e) (complete)4301759SAT (TO)44 252.074 248.123
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312217SAT (TO)55 252.039 246.227
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310007SAT (TO)55 252.109 246.039
cosoco 1.12 (complete)4301761SAT (TO)59 252.041 252.01
OscaR - Hybrid 2018-08-14 (complete)4310357? (TO) 252.068 247.13

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: 42
Solution found:
<instantiation type="solution"> <list> v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] np[0] np[1] np[2]
np[3] np[4] np[5] np[6] np[7] np[8] np[9] np[10] np[11] np[12] nf[0] nf[1] nf[2] nf[3] nf[4] nf[5] nf[6] nf[7] nf[8] nf[9] nf[10] nf[11]
nf[12] pp[0] pp[1] pp[2] pp[3] pp[4] pp[5] pp[6] pp[7] pp[8] pp[9] pp[10] pp[11] pp[12] pp[13] pp[14] </list> <values> -2 -13 12 1 -1 12 2 2
13 -12 1 12 12 -12 5 1 1 0 0 0 0 0 0 0 0 0 2 1 2 2 0 0 1 0 0 0 0 0 0 4 1 5 6 0 0 8 0 0 0 0 11 0 0 0 12 0 </values> </instantiation>