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

Result page for benchmark
Eternity/
Eternity-06-06_c18.xml

Jump to solvers results

General information on the benchmark

NameEternity/
Eternity-06-06_c18.xml
MD5SUM4056656ba438a73a4a2b41323b2858a8
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.729172
Satisfiable
(Un)Satisfiability was proved
Number of variables120
Number of constraints61
Number of domains2
Minimum domain size9
Maximum domain size36
Distribution of domain sizes[{"size":9,"count":84},{"size":36,"count":36}]
Minimum variable degree1
Maximum variable degree7
Distribution of variable degrees[{"degree":1,"count":5},{"degree":2,"count":114},{"degree":7,"count":1}]
Minimum constraint arity1
Maximum constraint arity36
Distribution of constraint arities[{"arity":1,"count":24},{"arity":5,"count":36},{"arity":36,"count":1}]
Number of extensional constraints36
Number of intensional constraints24
Distribution of constraint types[{"type":"extension","count":36},{"type":"intension","count":24},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD_12 2018.07.27_12 (complete)4300904SAT 0.729172 0.730013
cosoco 1.12 (complete)4300475SAT 1.03377 1.03462
NACRE 1.0.4 (complete)4300478SAT 1.05899 1.06006
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4300481SAT 2.13243 0.906771
GG's minicp 2018-04-29 (complete)4300476SAT 2.16584 0.81226
MiniCPFever 2018-04-29 (complete)4300477SAT 2.70432 1.07323
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4300480SAT 3.0514 1.55078
miniBTD 2018.07.27_3 (complete)4301080SAT 4.37464 4.37641
minimacht 2018.07.27 (complete)4300728SAT 4.4341 4.43557
slowpoke 2018-04-29 (incomplete)4300479SAT 5.84952 3.91049
The dodo solver 2018-04-29 (complete)4300482SAT (TO) 2520.1 2512.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:
Solution found:
<instantiation type="solution"> <list> id[0][0] id[0][1] id[0][2] id[0][3] id[0][4] id[0][5] id[1][0] id[1][1] id[1][2] id[1][3] id[1][4]
id[1][5] id[2][0] id[2][1] id[2][2] id[2][3] id[2][4] id[2][5] id[3][0] id[3][1] id[3][2] id[3][3] id[3][4] id[3][5] id[4][0] id[4][1]
id[4][2] id[4][3] id[4][4] id[4][5] id[5][0] id[5][1] id[5][2] id[5][3] id[5][4] id[5][5] top[0][0] top[0][1] top[0][2] top[0][3] top[0][4]
top[0][5] top[1][0] top[1][1] top[1][2] top[1][3] top[1][4] top[1][5] top[2][0] top[2][1] top[2][2] top[2][3] top[2][4] top[2][5] top[3][0]
top[3][1] top[3][2] top[3][3] top[3][4] top[3][5] top[4][0] top[4][1] top[4][2] top[4][3] top[4][4] top[4][5] top[5][0] top[5][1] top[5][2]
top[5][3] top[5][4] top[5][5] left[0][0] left[0][1] left[0][2] left[0][3] left[0][4] left[0][5] left[1][0] left[1][1] left[1][2] left[1][3]
left[1][4] left[1][5] left[2][0] left[2][1] left[2][2] left[2][3] left[2][4] left[2][5] left[3][0] left[3][1] left[3][2] left[3][3]
left[3][4] left[3][5] left[4][0] left[4][1] left[4][2] left[4][3] left[4][4] left[4][5] left[5][0] left[5][1] left[5][2] left[5][3]
left[5][4] left[5][5] bot[0] bot[1] bot[2] bot[3] bot[4] bot[5] right[0] right[1] right[2] right[3] right[4] right[5] </list> <values> 2 14
13 19 15 1 10 25 27 29 26 18 7 35 30 34 31 8 9 21 20 22 24 4 6 33 23 28 32 16 0 5 11 12 17 3 0 0 0 0 0 0 2 4 7 8 4 1 1 6 7 7 7 3 2 5 4 5 4 1
1 5 7 8 7 1 1 6 6 6 6 3 0 2 3 2 3 3 0 5 7 4 5 7 0 8 8 6 8 8 0 4 5 4 8 6 0 8 6 4 5 5 0 1 2 2 3 2 0 0 0 0 0 0 0 0 0 0 0 0 </values>
</instantiation>