================================================================
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
Solving layer: 14
Computed optimal makespan:13
Makespan optimal solution:
Mulirobot solution: (|moves| = 168, paralellism = 12.923) [
    Step 0: 1#22->29 2#32->31 5#4->3 6#18->21 7#15->16 9#20->25 10#5->12 12#23->19 13#36->35 15#27->34 16#37->38 18#9->10 
    Step 1: 1#29->36 3#14->7 5#3->2 6#21->22 9#25->26 10#12->11 12#19->15 13#35->28 14#8->9 15#34->33 16#38->39 17#13->18 18#10->4 
    Step 2: 1#36->37 2#31->30 4#6->13 5#2->8 6#22->23 10#11->10 12#15->14 13#28->35 14#9->3 15#33->32 16#39->40 17#18->21 
    Step 3: 1#37->38 2#30->29 4#13->18 5#8->15 6#23->24 8#1->2 9#26->27 10#10->9 11#0->6 15#32->31 16#40->33 17#21->22 
    Step 4: 1#38->39 2#29->36 3#7->1 4#18->21 5#15->19 6#24->25 9#27->34 10#9->8 11#6->13 13#35->28 15#31->30 16#33->26 18#4->10 
    Step 5: 1#39->40 2#36->37 3#1->0 5#19->23 6#25->32 7#16->9 9#34->27 10#8->15 12#14->7 13#28->35 15#30->29 18#10->4 
    Step 6: 1#40->33 2#37->38 3#0->6 4#21->18 5#23->30 6#32->39 7#9->10 8#2->8 9#27->34 10#15->19 11#13->14 12#7->1 15#29->36 16#26->25 
    Step 7: 1#33->32 2#38->37 3#6->7 4#18->13 5#30->31 6#39->40 7#10->11 8#8->9 9#34->27 10#19->23 11#14->15 12#1->0 13#35->28 14#3->2 16#25->20 17#22->29 
    Step 8: 1#32->33 3#7->8 4#13->14 6#40->39 7#11->10 8#9->16 10#23->22 11#15->19 12#0->6 13#28->21 15#36->35 18#4->3 
    Step 9: 1#33->40 2#37->36 3#8->9 4#14->15 5#31->32 6#39->38 7#10->4 9#27->34 11#19->23 12#6->7 13#21->18 14#2->1 15#35->28 16#20->25 17#29->30 
    Step 10: 1#40->39 3#9->10 4#15->19 5#32->33 10#22->29 11#23->24 12#7->8 14#1->0 15#28->21 16#25->26 17#30->31 18#3->2 
    Step 11: 3#10->11 4#19->23 5#33->40 6#38->37 7#4->3 10#29->28 11#24->25 12#8->9 13#18->13 15#21->22 16#26->27 17#31->32 18#2->1 
    Step 12: 2#36->29 3#11->12 4#23->24 6#37->30 8#16->15 10#28->21 11#25->20 12#9->10 13#13->18 16#27->26 17#32->33 18#1->7 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 94
    total trajectory         = 168
    average parallelism      = 12.923
    average distance         = 5.222
    average trajectory       = 9.333
    parallelism distribution  = [ 0 0 0 0 0 0 0 0 0 0 0 7 3 1 1 1 ]
    distance distribution     = [ 0 0 4 3 4 2 0 1 1 1 1 ]
    trajectory distribution   = [ 0 0 0 0 2 0 1 3 2 3 5 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)      = 17.565
            CPU/machine TIME (seconds)     = 17.570
        ]
        Sub-phases {
            Phase (name = 'SAT') [
                Total SAT solver calls         = 13
                Satisfiable SAT solver calls   = 1
                Unsatisfiable SAT solver calls = 12
                Indeterminate SAT solver calls = 0
                Move executions                = 168
                Produced CNF variables         = 448807
                Produced CNF clauses           = 281582
                Search steps                   = 0
                Wall clock TIME (seconds)      = 89.597
                CPU/machine TIME (seconds)     = 89.740
            ]
        }
]
----------------------------------------------------------------