================================================================
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| = 158, paralellism = 12.154) [
    Step 0: 15#2->1 6#3->4 14#5->13 7#15->16 2#20->26 1#22->18 12#33->34 3#35->42 11#38->39 13#40->45 
    Step 1: 15#1->8 4#7->15 9#9->2 10#11->10 14#13->12 7#16->20 1#18->22 5#25->33 2#26->27 12#34->35 11#39->31 8#43->38 13#45->44 
    Step 2: 9#2->3 6#4->11 15#8->7 10#10->9 14#12->18 4#15->16 7#20->26 1#22->23 2#27->28 11#31->32 12#35->36 8#38->39 3#42->46 13#44->43 
    Step 3: 9#3->4 10#9->2 6#11->10 4#16->20 14#18->22 7#26->27 2#28->29 11#32->24 5#33->34 12#36->37 8#39->40 
    Step 4: 10#2->1 15#7->8 4#20->26 14#22->21 7#27->35 2#29->30 5#34->33 12#37->38 8#40->32 13#43->44 
    Step 5: 9#4->11 15#8->9 6#10->3 14#21->29 1#23->22 11#24->19 4#26->34 8#32->31 5#33->25 7#35->36 12#38->39 13#44->43 3#46->42 
    Step 6: 10#1->8 6#3->2 15#9->10 9#11->12 1#22->21 5#25->26 14#29->28 4#34->35 7#36->37 12#39->40 3#42->41 13#43->44 
    Step 7: 6#2->3 10#8->7 15#10->11 9#12->18 5#26->20 14#28->27 2#30->29 4#35->36 7#37->38 12#40->32 3#41->34 13#44->45 
    Step 8: 6#3->4 10#7->15 15#11->12 9#18->22 11#19->14 5#20->16 14#27->35 2#29->28 8#31->30 12#32->24 3#34->26 4#36->37 7#38->39 13#45->40 
    Step 9: 6#4->11 15#12->18 11#14->13 5#16->8 9#22->23 12#24->19 3#26->34 2#28->27 8#30->29 14#35->36 4#37->38 13#40->32 
    Step 10: 5#8->1 6#11->10 11#13->12 15#18->22 12#19->14 9#23->31 2#27->35 8#29->28 13#32->24 3#34->26 14#36->37 4#38->43 7#39->40 
    Step 11: 5#1->2 6#10->9 11#12->11 12#14->13 10#15->7 15#22->30 3#26->34 8#28->27 9#31->39 2#35->42 7#40->32 4#43->48 
    Step 12: 5#2->3 10#7->0 6#9->8 11#11->4 12#13->12 1#21->22 8#27->35 15#30->38 7#32->31 3#34->33 2#42->46 4#48->47 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 78
    total trajectory         = 158
    average parallelism      = 12.154
    average distance         = 5.200
    average trajectory       = 10.533
    parallelism distribution  = [ 0 0 0 0 0 0 0 0 0 2 1 5 3 2 ]
    distance distribution     = [ 1 0 2 1 1 2 1 2 2 1 0 0 1 ]
    trajectory distribution   = [ 0 0 0 0 0 1 0 0 1 5 4 3 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.361
            CPU/machine TIME (seconds)     = 42.300
        ]
        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                = 316
                Produced CNF variables         = 69693
                Produced CNF clauses           = 591278
                Search steps                   = 0
                Wall clock TIME (seconds)      = 77.073
                CPU/machine TIME (seconds)     = 77.100
            ]
        }
]
----------------------------------------------------------------