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