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