================================================================
reLOC 0.08-osaka : Multirobot Solution solver
(C) Copyright 2011-2013 Pavel Surynek
----------------------------------------------------------------
Reading graph...
1,0
2,1
4,1
3,2
5,2
5,4
8,4
6,5
9,5
8,7
11,7
9,8
12,8
10,9
13,9
6,3
10,6
12,11
13,12
Reading initial arrangement...
Reading goal arrangement...
Undirected graph: (|V|=14 |E|=19) [
    Vertex: (id = 0) {1 }
    Vertex: (id = 1) {0 2 4 }
    Vertex: (id = 2) {1 3 5 }
    Vertex: (id = 3) {2 6 }
    Vertex: (id = 4) {1 5 8 }
    Vertex: (id = 5) {2 4 6 9 }
    Vertex: (id = 6) {5 3 10 }
    Vertex: (id = 7) {8 11 }
    Vertex: (id = 8) {4 7 9 12 }
    Vertex: (id = 9) {5 8 10 13 }
    Vertex: (id = 10) {9 6 }
    Vertex: (id = 11) {7 12 }
    Vertex: (id = 12) {8 11 13 }
    Vertex: (id = 13) {9 12 }
    Edge  0: 1 <-> 0
    Edge  1: 2 <-> 1
    Edge  2: 4 <-> 1
    Edge  3: 3 <-> 2
    Edge  4: 5 <-> 2
    Edge  5: 5 <-> 4
    Edge  6: 8 <-> 4
    Edge  7: 6 <-> 5
    Edge  8: 9 <-> 5
    Edge  9: 8 <-> 7
    Edge  10: 11 <-> 7
    Edge  11: 9 <-> 8
    Edge  12: 12 <-> 8
    Edge  13: 10 <-> 9
    Edge  14: 13 <-> 9
    Edge  15: 6 <-> 3
    Edge  16: 10 <-> 6
    Edge  17: 12 <-> 11
    Edge  18: 13 <-> 12
]
Robot arrangement: (|R| = 7, |V| = 14) [
     robot locations: {1#13 2#2 3#1 4#0 5#12 6#9 7#10 }
     vertex occupancy: {4#0 3#1 2#2 0#3 0#4 0#5 0#6 0#7 0#8 6#9 7#10 0#11 5#12 1#13 }
]
Robot arrangement: (|R| = -1, |V| = 0) [
     robot locations: {}
     vertex occupancy: {}
]
Robot goal: (|R| = 7, |V| = 14) [
    robot goals: {
        1#{6}
        2#{5,12}
        3#{1,13}
        4#{8,10}
        5#{1}
        6#{2,4}
        7#{3,12}
    }
    vertex compatibilities: {
        0@{}
        1@{3,5}
        2@{6}
        3@{7}
        4@{6}
        5@{2}
        6@{1}
        7@{}
        8@{4}
        9@{}
        10@{4}
        11@{}
        12@{2,7}
        13@{3}
    }
]
Solving layer: 2
Solving layer: 3
Solving layer: 4
Solving layer: 5
Solving layer: 6
Solving layer: 7
Solving layer: 8
Solving layer: 9
Computed optimal makespan:8
Makespan optimal solution:
Mulirobot solution: (|moves| = 30, paralellism = 3.750) [
    Step 0: 3#1->4 2#2->3 6#9->5 
    Step 1: 4#0->1 2#3->6 3#4->8 6#5->2 1#13->9 
    Step 2: 4#1->4 2#6->5 3#8->7 1#9->13 
    Step 3: 6#2->1 4#4->8 2#5->6 3#7->11 
    Step 4: 2#6->5 4#8->7 1#13->9 
    Step 5: 7#10->6 5#12->8 
    Step 6: 6#1->2 7#6->3 5#8->4 1#9->10 3#11->12 
    Step 7: 5#4->1 4#7->8 1#10->6 3#12->13 
]
Multirobot solution analysis: (
    total makespan           = 8
    total distance           = 16
    total trajectory         = 30
    average parallelism      = 3.750
    average distance         = 2.286
    average trajectory       = 4.286
    parallelism distribution  = [ 0 1 2 3 2 ]
    distance distribution     = [ 1 1 3 1 ]
    trajectory distribution   = [ 0 1 1 1 3 1 ]
)
Phase statistics (current phase = 'root_phase') [
        Phase (name = 'root_phase') [
            Total SAT solver calls         = 8
            Satisfiable SAT solver calls   = 1
            Unsatisfiable SAT solver calls = 7
            Indeterminate SAT solver calls = 0
            Move executions                = 60
            Produced CNF variables         = 7332
            Produced CNF clauses           = 35470
            Search steps                   = 0
            Wall clock TIME (seconds)      = 7.094
            CPU/machine TIME (seconds)     = 5.570
        ]
]
----------------------------------------------------------------