================================================================
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
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| = 9, |V| = 15) [
     robot locations: {1#2 2#10 3#0 4#1 5#13 6#3 7#9 8#4 9#12 }
     vertex occupancy: {3#0 4#1 1#2 6#3 8#4 0#5 0#6 0#7 0#8 7#9 2#10 0#11 9#12 5#13 0#14 }
]
Robot arrangement: (|R| = -1, |V| = 0) [
     robot locations: {}
     vertex occupancy: {}
]
Robot goal: (|R| = 9, |V| = 15) [
    robot goals: {
        1#{4}
        2#{2}
        3#{1,6}
        4#{13}
        5#{1,8}
        6#{6}
        7#{0,9}
        8#{3,4}
        9#{2}
    }
    vertex compatibilities: {
        0@{7}
        1@{3,5}
        2@{2,9}
        3@{8}
        4@{1,8}
        5@{}
        6@{3,6}
        7@{}
        8@{5}
        9@{7}
        10@{}
        11@{}
        12@{}
        13@{4}
        14@{}
    }
]
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| = 34, paralellism = 4.250) [
    Step 0: 2#10->7 4#1->5 9#12->11 
    Step 1: 4#5->6 5#13->12 7#9->10 9#11->8 
    Step 2: 1#2->1 4#6->9 7#10->14 8#4->5 
    Step 3: 4#9->10 5#12->11 7#14->13 8#5->6 
    Step 4: 1#1->5 4#10->14 6#3->2 7#13->12 8#6->9 
    Step 5: 2#7->3 3#0->1 6#2->6 7#12->13 8#9->10 9#8->4 
    Step 6: 2#3->2 7#13->9 8#10->7 9#4->0 
    Step 7: 1#5->4 4#14->13 5#11->8 8#7->3 
]
Multirobot solution analysis: (
    total makespan           = 8
    total distance           = 20
    total trajectory         = 34
    average parallelism      = 4.250
    average distance         = 2.222
    average trajectory       = 3.778
    parallelism distribution  = [ 0 0 1 5 1 1 ]
    distance distribution     = [ 1 1 1 3 2 ]
    trajectory distribution   = [ 1 1 3 1 0 3 ]
)
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                = 34
            Produced CNF variables         = 47480
            Produced CNF clauses           = 684
            Search steps                   = 0
            Wall clock TIME (seconds)      = 0.724
            CPU/machine TIME (seconds)     = 0.690
        ]
]
----------------------------------------------------------------