================================================================
reLOC 0.09-vegas : 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
7,6
9,6
11,8
10,9
13,9
7,3
10,7
14,10
12,11
13,12
14,13
Reading initial arrangement...
Reading goal arrangement...
Undirected graph: (|V|=15 |E|=20) [
    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 }
    Vertex: (id = 6) {2 5 7 9 }
    Vertex: (id = 7) {6 3 10 }
    Vertex: (id = 8) {4 11 }
    Vertex: (id = 9) {6 10 13 }
    Vertex: (id = 10) {9 7 14 }
    Vertex: (id = 11) {8 12 }
    Vertex: (id = 12) {11 13 }
    Vertex: (id = 13) {9 12 14 }
    Vertex: (id = 14) {10 13 }
    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: 7 <-> 6
    Edge  10: 9 <-> 6
    Edge  11: 11 <-> 8
    Edge  12: 10 <-> 9
    Edge  13: 13 <-> 9
    Edge  14: 7 <-> 3
    Edge  15: 10 <-> 7
    Edge  16: 14 <-> 10
    Edge  17: 12 <-> 11
    Edge  18: 13 <-> 12
    Edge  19: 14 <-> 13
]
Robot arrangement: (|R| = 6, |V| = 15) [
     robot locations: {1#1 2#13 3#3 4#9 5#4 6#12 }
     vertex occupancy: {0#0 1#1 0#2 3#3 5#4 0#5 0#6 0#7 0#8 4#9 0#10 0#11 6#12 2#13 0#14 }
]
Robot arrangement: (|R| = -1, |V| = 0) [
     robot locations: {}
     vertex occupancy: {}
]
Robot goal: (|R| = 6, |V| = 15) [
    robot goals: {
        1#{12}
        2#{4}
        3#{8}
        4#{11}
        5#{14}
        6#{6}
    }
    vertex compatibilities: {
        0@{}
        1@{}
        2@{}
        3@{}
        4@{2}
        5@{}
        6@{6}
        7@{}
        8@{3}
        9@{}
        10@{}
        11@{4}
        12@{1}
        13@{}
        14@{5}
    }
]
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| = 29, paralellism = 4.833) [
    Step 0: 1#1->0 2#13->14 3#3->2 5#4->8 
    Step 1: 1#0->4 2#14->10 3#2->1 4#9->6 5#8->11 6#12->13 
    Step 2: 1#4->8 2#10->9 3#1->0 4#6->5 5#11->12 6#13->14 
    Step 3: 1#8->11 2#9->6 4#5->4 5#12->13 6#14->10 
    Step 4: 1#11->12 2#6->5 4#4->8 5#13->14 6#10->9 
    Step 5: 2#5->4 4#8->11 6#9->6 
]
Multirobot solution analysis: (
    total makespan           = 6
    total distance           = 20
    total trajectory         = 29
    average parallelism      = 4.833
    average distance         = 3.333
    average trajectory       = 4.833
    parallelism distribution  = [ 0 0 1 1 2 2 ]
    distance distribution     = [ 0 0 2 1 2 ]
    trajectory distribution   = [ 0 0 1 0 4 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                = 29
            Produced CNF variables         = 8480
            Produced CNF clauses           = 1775
            Search steps                   = 0
            Wall clock TIME (seconds)      = 0.289
            CPU/machine TIME (seconds)     = 0.060
        ]
]
----------------------------------------------------------------