================================================================
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
Solving layer: 15
Computed optimal makespan:14
Makespan optimal solution:
Mulirobot solution: (|moves| = 170, paralellism = 12.143) [
    Step 0: 7#3->4 15#5->6 10#9->10 11#11->12 1#14->19 3#20->16 2#22->30 13#33->34 4#35->27 12#38->37 14#40->39 
    Step 1: 16#2->9 7#4->3 10#10->11 11#12->18 3#16->8 1#19->24 6#25->33 4#27->26 2#30->31 13#34->41 12#37->29 14#39->38 9#43->44 
    Step 2: 7#3->2 16#9->10 10#11->12 11#18->22 1#24->23 4#26->20 12#29->28 2#31->32 6#33->34 14#38->37 13#41->42 9#44->39 
    Step 3: 7#2->1 3#8->9 16#10->11 10#12->18 4#20->16 1#23->31 12#28->29 6#34->26 14#37->36 9#39->40 13#42->46 
    Step 4: 7#1->0 15#6->14 3#9->10 4#16->8 11#22->23 6#26->27 12#29->37 1#31->39 2#32->24 14#36->35 9#40->45 13#46->42 
    Step 5: 4#8->1 3#10->9 16#11->12 8#15->16 10#18->22 6#27->28 14#35->34 12#37->36 1#39->38 13#42->46 
    Step 6: 4#1->2 5#7->15 3#9->8 16#12->18 15#14->13 8#16->20 10#22->30 2#24->19 6#28->29 12#36->35 1#38->37 9#45->50 13#46->42 
    Step 7: 7#0->7 15#13->12 5#15->16 2#19->14 8#20->26 11#23->24 6#29->21 10#30->38 13#42->41 9#50->49 
    Step 8: 7#7->15 3#8->9 15#12->11 2#14->13 5#16->20 16#18->22 6#21->29 8#26->27 12#35->36 13#41->42 9#49->50 
    Step 9: 3#9->8 15#11->10 2#13->12 5#20->26 16#22->23 11#24->32 8#27->35 6#29->30 14#34->33 12#36->28 10#38->39 13#42->41 9#50->49 
    Step 10: 4#2->3 3#8->1 15#10->9 2#12->11 7#15->7 16#23->31 5#26->34 12#28->27 6#30->22 14#33->25 8#35->36 1#37->29 10#39->44 13#41->42 9#49->48 
    Step 11: 3#1->2 4#3->10 7#7->0 15#9->8 2#11->4 6#22->18 14#25->33 12#27->26 1#29->28 16#31->39 5#34->41 8#36->37 13#42->35 10#44->49 9#48->43 
    Step 12: 7#0->1 3#2->9 2#4->3 15#8->16 4#10->17 6#18->12 12#26->20 1#28->27 11#32->31 13#35->34 8#37->38 16#39->44 5#41->42 10#49->48 
    Step 13: 2#3->2 3#9->10 6#12->13 15#16->8 1#27->28 11#31->30 13#34->26 8#38->39 5#42->46 16#44->49 
]
Multirobot solution analysis: (
    total makespan           = 14
    total distance           = 87
    total trajectory         = 170
    average parallelism      = 12.143
    average distance         = 5.438
    average trajectory       = 10.625
    parallelism distribution  = [ 0 0 0 0 0 0 0 0 0 3 3 2 3 1 2 ]
    distance distribution     = [ 1 0 2 0 2 0 3 2 2 3 ]
    trajectory distribution   = [ 0 0 0 0 0 0 0 2 2 4 3 3 1 1 ]
)
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.541
            CPU/machine TIME (seconds)     = 42.490
        ]
        Sub-phases {
            Phase (name = 'SAT') [
                Total SAT solver calls         = 14
                Satisfiable SAT solver calls   = 1
                Unsatisfiable SAT solver calls = 13
                Indeterminate SAT solver calls = 0
                Move executions                = 340
                Produced CNF variables         = 86233
                Produced CNF clauses           = 937934
                Search steps                   = 0
                Wall clock TIME (seconds)      = 379.674
                CPU/machine TIME (seconds)     = 379.300
            ]
        }
]
----------------------------------------------------------------