================================================================
reLOC 0.08-osaka : Multirobot Solution solver
(C) Copyright 2011-2013 Pavel Surynek
----------------------------------------------------------------
Reading graph...
1,0
5,0
2,1
6,1
3,2
7,2
8,3
6,5
11,5
7,6
12,6
8,7
13,7
9,8
14,8
10,9
15,9
12,11
17,11
13,12
18,12
14,13
19,13
15,14
20,14
16,15
18,17
22,17
19,18
20,19
23,19
24,20
27,22
24,23
29,23
25,24
30,24
26,25
31,25
10,4
16,10
21,16
26,21
32,26
28,27
29,28
30,29
31,30
32,31
Reading initial arrangement...
Reading goal arrangement...
Undirected graph: (|V|=33 |E|=49) [
    Vertex: (id = 0) {1 5 }
    Vertex: (id = 1) {0 2 6 }
    Vertex: (id = 2) {1 3 7 }
    Vertex: (id = 3) {2 8 }
    Vertex: (id = 4) {10 }
    Vertex: (id = 5) {0 6 11 }
    Vertex: (id = 6) {1 5 7 12 }
    Vertex: (id = 7) {2 6 8 13 }
    Vertex: (id = 8) {3 7 9 14 }
    Vertex: (id = 9) {8 10 15 }
    Vertex: (id = 10) {9 4 16 }
    Vertex: (id = 11) {5 12 17 }
    Vertex: (id = 12) {6 11 13 18 }
    Vertex: (id = 13) {7 12 14 19 }
    Vertex: (id = 14) {8 13 15 20 }
    Vertex: (id = 15) {9 14 16 }
    Vertex: (id = 16) {15 10 21 }
    Vertex: (id = 17) {11 18 22 }
    Vertex: (id = 18) {12 17 19 }
    Vertex: (id = 19) {13 18 20 23 }
    Vertex: (id = 20) {14 19 24 }
    Vertex: (id = 21) {16 26 }
    Vertex: (id = 22) {17 27 }
    Vertex: (id = 23) {19 24 29 }
    Vertex: (id = 24) {20 23 25 30 }
    Vertex: (id = 25) {24 26 31 }
    Vertex: (id = 26) {25 21 32 }
    Vertex: (id = 27) {22 28 }
    Vertex: (id = 28) {27 29 }
    Vertex: (id = 29) {23 28 30 }
    Vertex: (id = 30) {24 29 31 }
    Vertex: (id = 31) {25 30 32 }
    Vertex: (id = 32) {26 31 }
    Edge  0: 1 <-> 0
    Edge  1: 5 <-> 0
    Edge  2: 2 <-> 1
    Edge  3: 6 <-> 1
    Edge  4: 3 <-> 2
    Edge  5: 7 <-> 2
    Edge  6: 8 <-> 3
    Edge  7: 6 <-> 5
    Edge  8: 11 <-> 5
    Edge  9: 7 <-> 6
    Edge  10: 12 <-> 6
    Edge  11: 8 <-> 7
    Edge  12: 13 <-> 7
    Edge  13: 9 <-> 8
    Edge  14: 14 <-> 8
    Edge  15: 10 <-> 9
    Edge  16: 15 <-> 9
    Edge  17: 12 <-> 11
    Edge  18: 17 <-> 11
    Edge  19: 13 <-> 12
    Edge  20: 18 <-> 12
    Edge  21: 14 <-> 13
    Edge  22: 19 <-> 13
    Edge  23: 15 <-> 14
    Edge  24: 20 <-> 14
    Edge  25: 16 <-> 15
    Edge  26: 18 <-> 17
    Edge  27: 22 <-> 17
    Edge  28: 19 <-> 18
    Edge  29: 20 <-> 19
    Edge  30: 23 <-> 19
    Edge  31: 24 <-> 20
    Edge  32: 27 <-> 22
    Edge  33: 24 <-> 23
    Edge  34: 29 <-> 23
    Edge  35: 25 <-> 24
    Edge  36: 30 <-> 24
    Edge  37: 26 <-> 25
    Edge  38: 31 <-> 25
    Edge  39: 10 <-> 4
    Edge  40: 16 <-> 10
    Edge  41: 21 <-> 16
    Edge  42: 26 <-> 21
    Edge  43: 32 <-> 26
    Edge  44: 28 <-> 27
    Edge  45: 29 <-> 28
    Edge  46: 30 <-> 29
    Edge  47: 31 <-> 30
    Edge  48: 32 <-> 31
]
Robot arrangement: (|R| = 5, |V| = 33) [
     robot locations: {1#12 2#11 3#22 4#8 5#1 }
     vertex occupancy: {0#0 5#1 0#2 0#3 0#4 0#5 0#6 0#7 4#8 0#9 0#10 2#11 1#12 0#13 0#14 0#15 0#16 0#17 0#18 0#19 0#20 0#21 3#22 0#23 0#24 0#25 0#26 0#27 0#28 0#29 0#30 0#31 0#32 }
]
Robot arrangement: (|R| = -1, |V| = 0) [
     robot locations: {}
     vertex occupancy: {}
]
Robot goal: (|R| = 5, |V| = 33) [
    robot goals: {
        1#{13,26}
        2#{3,16,30}
        3#{29}
        4#{8,17}
        5#{25}
    }
    vertex compatibilities: {
        0@{}
        1@{}
        2@{}
        3@{2}
        4@{}
        5@{}
        6@{}
        7@{}
        8@{4}
        9@{}
        10@{}
        11@{}
        12@{}
        13@{1}
        14@{}
        15@{}
        16@{2}
        17@{4}
        18@{}
        19@{}
        20@{}
        21@{}
        22@{}
        23@{}
        24@{}
        25@{5}
        26@{1}
        27@{}
        28@{}
        29@{3}
        30@{2}
        31@{}
        32@{}
    }
]
Solving layer: 2
Solving layer: 3
Solving layer: 4
Solving layer: 5
Solving layer: 6
Solving layer: 7
Solving layer: 8
Computed optimal makespan:7
Makespan optimal solution:
Mulirobot solution: (|moves| = 27, paralellism = 3.857) [
    Step 0: 5#1->6 4#8->14 1#12->18 3#22->27 
    Step 1: 5#6->7 2#11->12 4#14->13 1#18->17 
    Step 2: 5#7->8 2#12->6 1#17->18 
    Step 3: 2#6->7 5#8->14 4#13->12 1#18->19 3#27->28 
    Step 4: 2#7->8 4#12->18 5#14->20 3#28->29 
    Step 5: 2#8->3 1#19->13 5#20->24 3#29->23 
    Step 6: 4#18->17 3#23->29 5#24->25 
]
Multirobot solution analysis: (
    total makespan           = 7
    total distance           = 14
    total trajectory         = 27
    average parallelism      = 3.857
    average distance         = 2.800
    average trajectory       = 5.400
    parallelism distribution  = [ 0 0 2 4 1 ]
    distance distribution     = [ 1 0 1 0 2 ]
    trajectory distribution   = [ 0 0 0 0 4 0 1 ]
)
Phase statistics (current phase = 'root_phase') [
        Phase (name = 'root_phase') [
            Total SAT solver calls         = 7
            Satisfiable SAT solver calls   = 1
            Unsatisfiable SAT solver calls = 6
            Indeterminate SAT solver calls = 0
            Move executions                = 54
            Produced CNF variables         = 13818
            Produced CNF clauses           = 72974
            Search steps                   = 0
            Wall clock TIME (seconds)      = 0.620
            CPU/machine TIME (seconds)     = 0.440
        ]
]
----------------------------------------------------------------