================================================================
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| = 166, paralellism = 13.833) [
    Step 0: 1#46->42 3#14->19 4#22->23 5#20->26 7#7->0 9#3->4 10#15->16 12#9->8 13#11->10 14#38->30 15#33->34 17#5->13 
    Step 1: 1#42->41 2#39->44 3#19->24 4#23->31 5#26->27 7#0->1 9#4->11 11#43->38 12#8->9 13#10->17 14#30->22 17#13->12 18#2->3 
    Step 2: 2#44->43 3#24->32 4#31->39 5#27->28 7#1->2 8#25->33 10#16->8 11#38->37 12#9->10 14#22->23 15#34->26 17#12->18 18#3->4 
    Step 3: 1#41->34 2#43->38 3#32->31 4#39->44 5#28->29 6#35->27 7#2->3 9#11->12 10#8->9 11#37->36 14#23->24 15#26->20 16#40->45 17#18->22 
    Step 4: 1#34->26 2#38->37 3#31->39 4#44->43 5#29->30 6#27->28 9#12->18 11#36->35 12#10->11 14#24->19 15#20->16 16#45->50 17#22->21 
    Step 5: 1#26->27 2#37->36 3#39->38 4#43->44 5#30->31 6#28->29 7#3->2 8#33->25 9#18->22 10#9->10 11#35->34 12#11->12 14#19->14 15#16->8 16#50->45 
    Step 6: 2#36->35 3#38->37 4#44->43 5#31->39 6#29->30 7#2->1 8#25->33 9#22->23 10#10->11 11#34->26 12#12->18 14#14->13 15#8->7 16#45->40 18#4->3 
    Step 7: 2#35->34 3#37->36 4#43->48 5#39->44 6#30->38 7#1->8 8#33->25 9#23->31 10#11->4 11#26->20 12#18->22 14#13->12 15#7->0 16#40->32 17#21->29 18#3->2 
    Step 8: 1#27->28 2#34->41 3#36->35 4#48->49 5#44->45 7#8->9 8#25->26 9#31->39 10#4->3 11#20->16 12#22->30 14#12->11 15#0->7 16#32->24 17#29->37 18#2->1 
    Step 9: 1#28->29 2#41->42 3#35->34 4#49->50 5#45->40 8#26->27 9#39->44 10#3->10 11#16->15 12#30->31 14#11->4 15#7->0 16#24->23 17#37->36 18#1->8 
    Step 10: 1#29->30 2#42->46 5#40->32 6#38->43 8#27->35 9#44->49 10#10->11 11#15->7 12#31->39 14#4->3 16#23->22 17#36->28 18#8->16 
    Step 11: 1#30->31 3#34->41 5#32->40 7#9->8 8#35->36 9#49->48 10#11->12 12#39->44 14#3->4 16#22->18 18#16->15 
]
Multirobot solution analysis: (
    total makespan           = 12
    total distance           = 108
    total trajectory         = 166
    average parallelism      = 13.833
    average distance         = 6.000
    average trajectory       = 9.222
    parallelism distribution  = [ 0 0 0 0 0 0 0 0 0 0 1 1 4 1 3 2 ]
    distance distribution     = [ 1 1 0 2 1 4 3 1 2 1 1 ]
    trajectory distribution   = [ 0 1 0 0 0 1 0 2 5 4 3 2 ]
)
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)      = 42.974
            CPU/machine TIME (seconds)     = 42.970
        ]
        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                = 166
                Produced CNF variables         = 368524
                Produced CNF clauses           = 195635
                Search steps                   = 0
                Wall clock TIME (seconds)      = 43.458
                CPU/machine TIME (seconds)     = 43.550
            ]
        }
]
----------------------------------------------------------------