================================================================
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
Computed optimal makespan:11
Makespan optimal solution:
Mulirobot solution: (|moves| = 115, paralellism = 10.455) [
    Step 0: 5#1->2 7#5->12 1#6->7 15#9->10 4#15->14 3#18->21 6#20->25 9#23->24 13#37->30 
    Step 1: 1#7->1 11#8->9 15#10->11 7#12->5 14#13->18 3#21->22 9#24->31 6#25->26 13#30->23 10#36->29 
    Step 2: 8#0->6 1#1->7 5#2->8 2#4->3 7#5->12 11#9->10 15#11->17 4#14->13 14#18->21 13#23->19 6#26->25 12#27->34 
    Step 3: 2#3->2 5#8->9 11#10->4 7#12->11 4#13->18 13#19->15 14#21->28 3#22->23 6#25->24 10#29->36 9#31->32 12#34->27 
    Step 4: 11#4->3 8#6->13 1#7->14 5#9->8 13#15->16 4#18->21 3#23->19 12#27->26 14#28->29 9#32->25 10#36->37 
    Step 5: 2#2->1 5#8->7 7#11->10 8#13->18 13#16->9 3#19->15 4#21->28 6#24->23 14#29->30 10#37->36 
    Step 6: 2#1->0 11#3->2 5#7->6 7#10->4 3#15->16 8#18->21 6#23->19 9#25->24 4#28->35 14#30->31 10#36->29 
    Step 7: 11#2->1 7#4->3 5#6->13 13#9->10 1#14->7 6#19->15 8#21->28 9#24->23 10#29->22 14#31->30 4#35->36 
    Step 8: 1#7->14 13#10->4 5#13->18 6#15->8 3#16->9 15#17->11 9#23->19 12#26->27 8#28->29 14#30->31 4#36->35 
    Step 9: 11#1->2 6#8->7 3#9->10 15#11->17 1#14->13 5#18->21 8#29->30 14#31->32 4#35->36 
    Step 10: 7#3->9 6#7->1 1#13->6 15#17->11 5#21->28 10#22->29 8#30->31 14#32->25 4#36->37 
]
Multirobot solution analysis: (
    total makespan           = 11
    total distance           = 57
    total trajectory         = 115
    average parallelism      = 10.455
    average distance         = 3.800
    average trajectory       = 7.667
    parallelism distribution  = [ 0 0 0 0 0 0 0 0 3 2 4 2 ]
    distance distribution     = [ 2 3 0 0 3 0 3 0 3 ]
    trajectory distribution   = [ 0 0 0 2 0 1 3 5 0 4 ]
)
Phase statistics (current phase = 'root_phase') [
        Phase (name = 'root_phase') [
            Total SAT solver calls         = 11
            Satisfiable SAT solver calls   = 1
            Unsatisfiable SAT solver calls = 10
            Indeterminate SAT solver calls = 0
            Move executions                = 230
            Produced CNF variables         = 41305
            Produced CNF clauses           = 228668
            Search steps                   = 0
            Wall clock TIME (seconds)      = 108.114
            CPU/machine TIME (seconds)     = 108.230
        ]
]
----------------------------------------------------------------