================================================================
reLOC 0.08-osaka : Multirobot Solution solver
(C) Copyright 2011-2013 Pavel Surynek
----------------------------------------------------------------
Reading graph...
Reading initial arrangement...
Reading goal arrangement...
Solving layer: 2
Solving layer: 3
Solving layer: 4
Solving layer: 5
Solving layer: 6
Solving layer: 7
Solving layer: 8
Solving layer: 9
Solving layer: 10
Solving layer: 11
Solving layer: 12
Solving layer: 13
Computed optimal makespan:12
Makespan optimal solution:
Mulirobot solution: (|moves| = 101, paralellism = 8.417) [
    Step 0: 1#2->7 3#17->12 4#22->19 8#26->27 9#24->23 11#0->5 
    Step 1: 1#7->13 2#9->10 3#12->6 4#19->16 5#1->0 6#20->24 7#21->22 8#27->28 10#4->3 11#5->11 12#25->26 
    Step 2: 4#16->15 5#0->5 7#22->19 10#3->8 11#11->12 12#26->27 
    Step 3: 3#6->1 4#15->9 5#5->11 6#24->25 7#19->16 10#8->3 11#12->17 12#27->21 
    Step 4: 1#13->12 3#1->2 4#9->8 5#11->5 6#25->26 7#16->15 10#3->4 11#17->20 12#21->22 
    Step 5: 1#12->17 2#10->16 4#8->7 5#5->6 7#15->14 11#20->24 
    Step 6: 1#17->12 2#16->15 3#2->3 5#6->1 6#26->27 10#4->9 11#24->25 12#22->19 
    Step 7: 1#12->11 3#3->4 4#7->6 5#1->2 6#27->21 7#14->13 9#23->24 10#9->8 11#25->26 
    Step 8: 1#11->5 2#15->14 3#4->9 4#6->1 5#2->7 7#13->12 8#28->22 9#24->20 11#26->27 12#19->16 
    Step 9: 1#5->6 3#9->10 4#1->0 5#7->13 7#12->17 8#22->19 9#20->24 10#8->3 11#27->28 12#16->15 
    Step 10: 1#6->7 2#14->8 4#0->5 5#13->12 6#21->27 7#17->20 9#24->23 10#3->2 12#15->9 
    Step 11: 1#7->13 2#8->3 4#5->11 5#12->17 6#27->26 8#19->16 9#23->24 11#28->22 12#9->4 
]
Multirobot solution analysis: (
    total makespan           = 12
    total distance           = 44
    total trajectory         = 101
    average parallelism      = 8.417
    average distance         = 3.667
    average trajectory       = 8.417
    parallelism distribution  = [ 0 0 0 0 0 3 0 2 4 2 1 ]
    distance distribution     = [ 1 0 3 2 0 2 1 1 0 1 ]
    trajectory distribution   = [ 0 0 0 0 1 2 1 2 2 1 3 ]
)
Phase statistics (current phase = 'SAT') [
        Phase (name = 'root_phase') [
            Total SAT solver calls         = 0
            Satisfiable SAT solver calls   = 0
            Unsatisfiable SAT solver calls = 0
            Indeterminate SAT solver calls = 0
            Move executions                = 0
            Produced CNF variables         = 0
            Produced CNF clauses           = 0
            Search steps                   = 0
            Wall clock TIME (seconds)      = 4.169
            CPU/machine TIME (seconds)     = 4.170
        ]
        Sub-phases {
            Phase (name = 'SAT') [
                Total SAT solver calls         = 12
                Satisfiable SAT solver calls   = 1
                Unsatisfiable SAT solver calls = 11
                Indeterminate SAT solver calls = 0
                Move executions                = 101
                Produced CNF variables         = 150852
                Produced CNF clauses           = 102846
                Search steps                   = 0
                Wall clock TIME (seconds)      = 18.406
                CPU/machine TIME (seconds)     = 18.520
            ]
        }
]
----------------------------------------------------------------