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